Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "import sys\r\nimport random\r\nfrom math import gcd, lcm, sqrt, isqrt, perm, comb, factorial, log2, ceil, floor\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache, reduce, cmp_to_key\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush\r\nfrom copy import deepcopy\r\nfrom bisect import bisect_left, bisect_right\r\nfrom string import ascii_lowercase, ascii_uppercase\r\ninf = float('inf')\r\ninput = lambda: sys.stdin.readline().strip()\r\nI = lambda: input()\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLI = lambda: list(input().split())\r\nLII = lambda: list(map(int, input().split()))\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLGMI = lambda: list(map(lambda x: int(x) - 1, input().split()))\r\nMOD = 10 ** 9 + 7\r\nRANDOM = random.randint(1217, 2000)\r\n\r\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\ndef solve():\r\n n = II()\r\n fa = LGMI()\r\n g = [[] for _ in range(n)]\r\n for i, p in enumerate(fa):\r\n if p == -1:\r\n continue\r\n g[p].append(i)\r\n q = II()\r\n qs = [[] for _ in range(n)]\r\n qs2 = [[] for _ in range(n)]\r\n res = [0] * q\r\n for i in range(q):\r\n u, d = MII()\r\n qs[u - 1].append((d, i))\r\n\r\n path = []\r\n @bootstrap\r\n def dfs(u, depth):\r\n cnt_u = Counter()\r\n cnt_u[depth] += 1\r\n path.append(u)\r\n for d, i in qs[u]:\r\n if d > depth:\r\n continue\r\n qs2[path[-d - 1]].append((d, i))\r\n for v in g[u]:\r\n cnt_v = yield dfs(v, depth + 1)\r\n if len(cnt_v) > len(cnt_u):\r\n cnt_u, cnt_v = cnt_v, cnt_u\r\n for dep, cnt in cnt_v.items():\r\n cnt_u[dep] += cnt\r\n cnt_v.clear()\r\n\r\n for d, i in qs2[u]:\r\n res[i] = cnt_u[depth + d] - 1\r\n path.pop()\r\n yield cnt_u\r\n\r\n for i in range(n):\r\n if fa[i] == -1:\r\n dfs(i, 0)\r\n print(*res)\r\n\r\nsolve()\r\n", "import sys\r\nimport random\r\n\r\ninput = sys.stdin.readline\r\nrd = random.randint(10 ** 9, 2 * 10 ** 9)\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\ng = [[] for _ in range(n)]\r\nfor i in range(n):\r\n if p[i] == 0:\r\n continue\r\n g[p[i] - 1].append(i)\r\nq = int(input())\r\nqueries = [[] for _ in range(n)]\r\nqueries2 = [[] for _ in range(n)]\r\nans = [0] * q\r\nfor i in range(q):\r\n x, d = map(int, input().split())\r\n queries[x - 1].append((d, i))\r\nfrom collections import defaultdict\r\n\r\npath = []\r\n\r\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n@bootstrap\r\ndef dfs(son, depth):\r\n ds = defaultdict(int)\r\n ds[depth] += 1\r\n path.append(son)\r\n for d, i in queries[son]:\r\n if d > depth:\r\n continue\r\n queries2[path[-d - 1]].append((d, i))\r\n for x in g[son]:\r\n dx = yield dfs(x, depth + 1)\r\n if len(dx) > len(ds):\r\n ds, dx = dx, ds\r\n for k, v in dx.items():\r\n ds[k] += v\r\n dx.clear()\r\n\r\n for d, i in queries2[son]:\r\n ans[i] = ds[d + depth] - 1\r\n path.pop()\r\n yield ds\r\n\r\n\r\nfor i in range(n):\r\n if p[i] == 0:\r\n dfs(i, 0)\r\nprint(*ans)\r\n", "import bisect\r\nimport heapq\r\nimport sys\r\nfrom types import GeneratorType\r\nfrom functools import cmp_to_key\r\nfrom collections import defaultdict, Counter, deque\r\nimport math\r\nfrom functools import lru_cache\r\nfrom heapq import nlargest\r\nfrom functools import reduce\r\nimport random\r\nfrom itertools import combinations\r\nfrom itertools import accumulate\r\nfrom operator import xor, add\r\nfrom operator import mul\r\nfrom typing import List\r\n\r\ninf = float(\"inf\")\r\nPLATFORM = \"CF\"\r\nif PLATFORM == \"LUOGU\":\r\n import numpy as np\r\n sys.setrecursionlimit(1000000)\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n\r\nclass DFS:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def gen_dfs_order_recursion(dct):\r\n # 模板：生成深搜序即 dfs 序以及对应子树编号区间\r\n def dfs(x):\r\n nonlocal order\r\n start[x] = order\r\n order += 1\r\n for y in dct[x]:\r\n if start[y] == -1:\r\n dfs(y)\r\n end[x] = order - 1\r\n return\r\n\r\n n = len(dct)\r\n order = 0\r\n start = [-1] * n\r\n end = [-1]*n\r\n dfs(0)\r\n return start, end\r\n\r\n @staticmethod\r\n def gen_dfs_order_iteration(dct):\r\n # 模板：生成深搜序即 dfs 序以及对应子树编号区间\r\n n = len(dct)\r\n order = 0\r\n start = [-1] * n\r\n end = [-1]*n\r\n parent = [-1]*n\r\n stack = [[0, 1, -1, 0]]\r\n depth = [0]*n\r\n while stack:\r\n i, state, fa, d = stack.pop()\r\n if state:\r\n start[i] = order\r\n end[i] = order\r\n depth[i] = d\r\n order += 1\r\n stack.append([i, 0, fa, d])\r\n for j in dct[i]:\r\n if j != fa:\r\n parent[j] = i\r\n stack.append([j, 1, i, d+1])\r\n else:\r\n if parent[i] != -1:\r\n end[parent[i]] = end[i]\r\n\r\n return start, end, depth\r\n\r\n\r\nclass TreeAncestor:\r\n\r\n def __init__(self, edges: List[List[int]]):\r\n # 默认以 0 为根节点\r\n n = len(edges)\r\n self.parent = [-1] * n\r\n self.depth = [-1] * n\r\n stack = deque([0])\r\n self.depth[0] = 0\r\n while stack:\r\n i = stack.popleft()\r\n for j in edges[i]:\r\n if self.depth[j] == -1:\r\n self.depth[j] = self.depth[i] + 1\r\n self.parent[j] = i\r\n stack.append(j)\r\n\r\n # 根据节点规模设置层数\r\n self.cols = max(2, math.ceil(math.log2(n)))\r\n self.dp = [[-1] * self.cols for _ in range(n)]\r\n for i in range(n):\r\n self.dp[i][0] = self.parent[i]\r\n # 动态规划设置祖先初始化, dp[node][j] 表示 node 往前推第 2^j 个祖先\r\n for j in range(1, self.cols):\r\n for i in range(n):\r\n father = self.dp[i][j-1]\r\n if father != -1:\r\n self.dp[i][j] = self.dp[father][j-1]\r\n return\r\n\r\n def get_kth_ancestor(self, node: int, k: int) -> int:\r\n # 查询节点的第 k 个祖先\r\n for i in range(self.cols - 1, -1, -1):\r\n if k & (1 << i):\r\n node = self.dp[node][i]\r\n if node == -1:\r\n break\r\n return node\r\n\r\n def get_lca(self, x: int, y: int) -> int:\r\n # 计算任意两点的最近公共祖先 LCA\r\n if self.depth[x] < self.depth[y]:\r\n x, y = y, x\r\n while self.depth[x] > self.depth[y]:\r\n d = self.depth[x]-self.depth[y]\r\n x = self.dp[x][int(math.log2(d))]\r\n if x == y:\r\n return x\r\n for k in range(int(math.log2(self.depth[x])), -1, -1):\r\n if self.dp[x][k] != self.dp[y][k]:\r\n x = self.dp[x][k]\r\n y = self.dp[y][k]\r\n return self.dp[x][0]\r\n\r\n def get_dist(self, u: int, v: int) -> int:\r\n # 计算任意点的最短路距离\r\n lca = self.get_lca(u, v)\r\n depth_u = self.depth[u]\r\n depth_v = self.depth[v]\r\n depth_lca = self.depth[lca]\r\n return depth_u + depth_v - 2 * depth_lca\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n = ac.read_int()\r\n parent = ac.read_list_ints()\r\n\r\n edge = [[] for _ in range(n+1)]\r\n for i in range(n):\r\n edge[parent[i]].append(i+1)\r\n edge[i+1].append(parent[i])\r\n del parent\r\n\r\n tree = TreeAncestor(edge)\r\n start, end, _ = DFS().gen_dfs_order_iteration(edge)\r\n\r\n dct = [[] for _ in range(n+1)]\r\n for i in range(n+1):\r\n dct[tree.depth[i]].append(start[i])\r\n for i in range(n+1):\r\n dct[i].sort()\r\n\r\n ans = []\r\n for _ in range(ac.read_int()):\r\n v, p = ac.read_ints()\r\n if tree.depth[v] - 1 < p:\r\n ans.append(0)\r\n continue\r\n u = tree.get_kth_ancestor(v, p)\r\n low, high = start[u], end[u]\r\n cur = bisect.bisect_right(dct[tree.depth[v]], high)-bisect.bisect_left(dct[tree.depth[v]], low)\r\n ans.append(ac.max(cur-1, 0))\r\n ac.lst(ans)\r\n return\r\n\r\n\r\nSolution().main()\r\n" ]

[ "s,v1,v2,t1,t2=map(int,input().split())\r\nfirst=s*v1+2*t1\r\nsecond=s*v2+2*t2\r\nif first > second:\r\n print (\"Second\")\r\nif first < second:\r\n print(\"First\")\r\nif first ==second:\r\n print(\"Friendship\")\r\n \r\n ", "s, v1, v2, t1, t2 = [int(x) for x in input().split()]\r\nif(s*v1+2*t1)<(s*v2+2*t2):print(\"First\")\r\nelif(s*v1+2*t1)>(s*v2+2*t2):print(\"Second\")\r\nelse:print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nfirst = (2*t1) + (s*v1)\r\nsecond = (2*t2) + (s*v2)\r\n\r\nif first == second:\r\n print(\"Friendship\")\r\nelif first > second:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "s,v1,v2,t1,t2=list(map(int,input().split()))\r\nfirst=v1*s+2*t1 \r\nsecond=v2*s+2*t2\r\nif first<second:\r\n print('First')\r\nelif first>second:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v_1, v_2, t_1, t_2 = map(int, input().split())\r\nif (result_1 := s * v_1 + 2 * t_1) != (result_2 := s * v_2 + 2 * t_2):\r\n if result_1 > result_2:\r\n print('Second')\r\n else:\r\n print('First')\r\nelse:\r\n print('Friendship')", "a,b,c,d,e=map(int,input().split())\r\nsum1=sum2=0\r\nsum1=(2*d)+(b*a)\r\nsum2=(c*a)+(2*e)\r\nif(sum1<sum2):\r\n print(\"First\")\r\nelif sum1==sum2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")\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\ts,v1,v2,t1,t2 = read_ints()\r\n\tif v1*s+2*t1 < v2*s+2*t2:\r\n\t\tprint(\"First\")\r\n\telif v1*s+2*t1 > v2*s+2*t2:\r\n\t\tprint(\"Second\")\r\n\telse:\r\n\t\tprint(\"Friendship\")\r\n\r\nsolve()\r\n", "a,b,c,d,e=map(int,input().split())\r\ns1=(a*b)+(2*d)\r\ns2=(a*c)+(2*e)\r\nif s1<s2:\r\n print(\"First\")\r\nelif s1>s2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2 = map(int,input().split())\r\nT1 = s * v1 + 2 * t1\r\nT2 = s * v2 + 2 * t2\r\nif T1 == T2:\r\n print('Friendship')\r\nelif T1>T2:\r\n print('Second')\r\nelse:\r\n print('First')\r\n", "s, v1, v2, k1, k2=map(int, input().split())\r\nfirst=(s*v1)+(k1*2)\r\nsecond=(s*v2)+(k2*2)\r\nif first==second:\r\n print('Friendship')\r\nelse:\r\n if first>second:\r\n print('Second')\r\n else:\r\n print('First')", "import time\r\n\r\ndef calculateWinner(lenS, first_tps, sec_tps, first_ping, sec_ping):\r\n winner = \"\"\r\n\r\n first_ttime = lenS * first_tps + 2 * (first_ping)\r\n sec_ttime = lenS * sec_tps + 2 * (sec_ping)\r\n\r\n if first_ttime < sec_ttime:\r\n winner = \"First\"\r\n elif first_ttime > sec_ttime:\r\n winner = \"Second\"\r\n else:\r\n winner = \"Friendship\"\r\n\r\n return winner\r\n\r\ndef solve():\r\n lenS, first_tps, sec_tps, first_ping, sec_ping = [int(x) for x in input().split()]\r\n\r\n print(calculateWinner(lenS, first_tps, sec_tps, first_ping, sec_ping))\r\n # print(\"%fs\" % (time.time() - start_time))\r\n\r\n\r\nsolve()\r\n", "s,v1,v2,t1,t2 = map(int,input().split())\nx,y = v1*s + 2*t1, v2*s + 2*t2\nif x<y:\n print(\"First\")\nelif x>y:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n", "s,v1,v2,t1,t2 = list(map(int,input().split()))\r\nres1 = 2*t1 + s*v1\r\nres2 = 2*t2 + s*v2\r\nif res1 == res2:\r\n\tprint('Friendship')\r\nelse:\r\n\tprint('First' if res1<res2 else 'Second')", "T = [int(x) for x in input().split()]\r\nx = T[0]*T[1] + 2*T[3]\r\ny = T[0]*T[2] + 2*T[4]\r\nif x < y:\r\n print(\"First\")\r\nelif x > y:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "(k,m,n,o,x)=map(int,input().split())\r\n\r\ncount1=k*m+2*o\r\ncount2=k*n+2*x\r\nif count2>count1:\r\n print(\"First\")\r\nif count1>count2:\r\n print(\"Second\")\r\nif count1==count2:\r\n print(\"Friendship\")\r\n \r\n", "s, v1, v2, t1, t2 = map(int,input().split())\r\nc1 = v1 * s + t1 * 2\r\nc2 = v2 * s + t2 * 2\r\nif c1 < c2:\r\n print('First')\r\nif c1 > c2:\r\n print('Second')\r\nif c1 == c2:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\nsvt1 = v1 * s + 2 * t1\r\nsvt2 = v2 * s + 2 * t2\r\nif svt1 < svt2:\r\n print(\"First\")\r\nelif svt1 > svt2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s, v1, v2, p1, p2 = map(int, input().split())\nt1 = v1 * s + 2 * p1\nt2 = v2 * s + 2 * p2\nprint(\"First\" if t1 < t2 else \"Second\" if t2 < t1 else \"Friendship\")\n", "def solution(s, v1, v2, t1, t2):\r\n if s * v1 + 2 * t1 < s * v2 + 2 * t2:\r\n return \"First\"\r\n elif s * v1 + 2 * t1 > s * v2 + 2 * t2:\r\n return \"Second\"\r\n else:\r\n return \"Friendship\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n s, v1, v2, t1, t2 = map(int, input().split())\r\n print(solution(s, v1, v2, t1, t2))\r\n", "def keyRaces(ls):\r\n s1 = (ls[1] * ls[0]) + (ls[3] * 2)\r\n s2 = (ls[2] * ls[0]) + (ls[4] * 2)\r\n if(s1 < s2):\r\n return \"First\"\r\n elif(s2 < s1):\r\n return \"Second\"\r\n else:\r\n return \"Friendship\"\r\n\r\n\r\nls = [int(i) for i in input().split()]\r\nprint(keyRaces(ls))", "from math import gcd, sqrt\r\ndef readList():\r\n return [int(i) for i in input().split()]\r\n\r\ndef solve():\r\n s, v1, v2, t1, t2 = readList()\r\n a = v1 * s + 2 * t1\r\n b = v2 * s + 2 * t2\r\n if a < b:\r\n print('First')\r\n elif a > b:\r\n print('Second')\r\n else:\r\n print('Friendship')\r\n\r\n\r\nt = 1\r\nwhile t:\r\n t -= 1\r\n solve()", "a, b, c, d, e = map(int,input().split())\r\n\r\nwynik_pierwsego = d + (b * a) + d\r\nwynik_drugiego = e + (c * a) + e\r\n\r\nif wynik_pierwsego < wynik_drugiego:\r\n print(\"First\")\r\nelif wynik_pierwsego > wynik_drugiego:\r\n print(\"Second\")\r\nelif wynik_drugiego == wynik_pierwsego:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nk1=s*v1+2*t1\r\nk2=s*v2+2*t2\r\nif k1>k2:print('Second')\r\nif k1<k2:print('First')\r\nif k1==k2: print('Friendship')\r\n", "def getWiner(args):\r\n first = int(args[0]) * int(args[1]) + int(args[3]) * 2\r\n second = int(args[0]) * int(args[2]) + int(args[4]) * 2\r\n return 'First' if first < second else 'Second' if second < first else 'Friendship'\r\n\r\n\r\nprint(getWiner(input().split(' ')))\r\n", "# dedicated to Rupa .....\r\nfrom math import pow\r\ns,v1,v2, t1,t2= map(int, input().split())\r\np1=(s*v1)+(2*t1)\r\np2=(s*v2)+(2*t2)\r\nif p1<p2:\r\n print(\"First\")\r\nif p1>p2:\r\n print(\"Second\")\r\nif p1==p2:\r\n print(\"Friendship\")\r\n ", "s,v1,v2,t1,t2 = list(map(int,input().split()))\r\na1 = (v1*s) + (2*t1)\r\na2 = (v2*s) + (2*t2)\r\nif a1 > a2:\r\n\tprint('Second')\r\nelif a1 < a2:\r\n\tprint('First')\r\nelif a1 == a2:\r\n\tprint('Friendship')", "s, v1, v2, t1, t2 = (int(x) for x in input().split())\nx1, x2 = 2 * t1 + s * v1, 2 * t2 + s * v2\nif x1 < x2:\n print('First')\nelif x1 == x2:\n print('Friendship')\nelse:\n print('Second')", "'''\nKey Races - Codeforces\nhttps://codeforces.com/problemset/problem/835/A\n'''\ns, v1, v2, t1, t2 = [int(x) for x in input().split(' ')]\nfinal_time_1 = v1*s + t1*2\nfinal_time_2 = v2*s + t2*2\nif final_time_1 < final_time_2:\n print('First')\nelif final_time_1 > final_time_2:\n print('Second')\nelse:\n print('Friendship')\n\n", "s,v1,v2,ping1,ping2=map(int,input().split()) \r\n\r\nif ping1*2+v1*s<ping2*2+v2*s:\r\n print('First')\r\nelse:\r\n if ping1*2+v1*s>ping2*2+v2*s:\r\n print('Second')\r\n else:\r\n print('Friendship')\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#input = 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\ns,v1,v2,t1,t2 = ilele()\r\na = s*v1 + 2*t1\r\nb = s*v2 + 2*t2\r\nif a>b:\r\n print(\"Second\")\r\nelif a < b:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "a, b, c, d, e = map(int,input().split())\r\n\r\nwynik_pierwszego = d + (b * a) + d\r\nwynik_drugiego = e + (c * a) + e\r\n\r\nif wynik_pierwszego < wynik_drugiego:\r\n print(\"First\")\r\nelif wynik_pierwszego > wynik_drugiego:\r\n print(\"Second\")\r\nelif wynik_drugiego == wynik_pierwszego:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\n\r\na = s*v1 + t1*2\r\nb = s*v2 + t2*2\r\nif a > b:\r\n print(\"Second\")\r\nelif a < b:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s,v,u,t,o=map(int,input().split())\r\na=s*v+2*t\r\nb=s*u+2*o\r\nif(a>b):\r\n print('Second')\r\nelif(a==b):\r\n print('Friendship')\r\nelse:\r\n print('First')\r\n\r\n# print('Second' if a>b else 'Friendship' if a==b else 'First')", "s,v1,v2,t1,t2=[int(i) for i in input().split()]\r\nx1=(s*v1)+(2*t1)\r\nx2=(s*v2)+(2*t2)\r\nif x1==x2:\r\n print(\"Friendship\")\r\nelif x1>x2:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "s=input().rstrip().split(' ')\r\nA=int(s[1])*int(s[0]) + 2*int(s[3])\r\nB=int(s[2])*int(s[0]) + 2*int(s[4])\r\nif A==B:\r\n print(\"Friendship\")\r\nelif A>B:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "from sys import stdin\r\ndef read():\r\n return stdin.readline().strip()\r\n\r\n\r\ns,v1,v2,t1,t2=map(int,read().split())\r\nfirst=s*v1+2*t1\r\nsecond=s*v2+2*t2\r\nif(first<second):\r\n print(\"First\")\r\nelif(second<first):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "import sys\r\nfrom math import ceil, floor, sqrt, gcd, fabs\r\n\r\n# Use stdin.readline instead of input() or raw_input()\r\n# to read input quickly\r\ndef main():\r\n while True:\r\n try:\r\n s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\n a = 2*t1 + s*v1\r\n b = 2*t2 + s*v2\r\n\r\n if a < b:\r\n print(\"First\")\r\n elif a > b:\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")\r\n\r\n except EOFError:\r\n break\r\n\r\n\r\n# Run the program\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nif ((s*v1)+(2*t1)<(s*v2)+(2*t2)):\r\n print ('First')\r\nelif ((s*v1)+(2*t1)>(s*v2)+(2*t2)):\r\n print ('Second')\r\nelse:\r\n print('Friendship')", "s,a,b,c,d = map(int,input().split())\r\ne = s*a+2*c\r\nf = s*b+2*d\r\nif e<f:\r\n print('First')\r\nelif e==f:\r\n print('Friendship')\r\nelse:\r\n print('Second')", "a=list(map(int, input().split()))\r\n# 5 1 2 1 2\r\n\r\nx=(a[0]*a[1])+(2*a[3])\r\ny=(a[0]*a[2])+(2*a[4])\r\n\r\nif x<y:\r\n print(\"First\")\r\nelif x>y:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\ns1 = v1 * s + 2 * t1\r\ns2 = v2 * s + 2 * t2\r\nif s1 == s2:\r\n print('Friendship')\r\nelse:\r\n if s1 > s2:\r\n print('Second')\r\n else:\r\n print('First')\r\n ", "s=list(map(int,input().split()))\nsum1=2*s[3]+s[1]*s[0]\nsum2=2*s[4]+s[2]*s[0]\nif sum1<sum2:\n print(\"First\")\nelif sum1>sum2:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n\t\t \t\t \t\t \t\t \t \t \t \t", "s,v1,v2,t1,t2=map(int,input().split())\r\nif t1*2+s*v1>t2*2+s*v2:\r\n print('Second')\r\nelse:\r\n if t1*2+s*v1==t2*2+s*v2:\r\n print('Friendship')\r\n else:\r\n print('First')\r\n", "(s, v1, v2, t1, t2) = [int(r) for r in input().split()]\r\nfst = s * v1 + 2 * t1\r\nsnd = s * v2 + 2 * t2\r\nif fst < snd:\r\n print(\"First\")\r\nelif fst > snd:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,v1,v2,t1,t2=map(int,input().split())\ntt1=v1*s+t1*2\ntt2=v2*s+t2*2\nif tt1==tt2:\n print(\"Friendship\")\nelif tt1>tt2:\n print(\"Second\")\nelse:\n print(\"First\")", "s, v1, v2, t1, t2 = map(int,input().split())\r\ntime1 = s*v1+2*t1\r\ntime2 = s*v2+2*t2\r\nif time1>time2:\r\n print('Second')\r\nelif time1<time2:\r\n print('First')\r\nelse:\r\n print('Friendship')", "(s,v1,v2,t1,t2)=map(int,input().split())\nx1=v1*s+t1*2\nx2=v2*s+t2*2\nif(x1<x2):\n print(\"First\")\nelif(x1>x2):\n print(\"Second\")\nelse:\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\na=s*v1+2*t1\nb=s*v2+2*t2\nif a<b:\n print('First')\nelif a>b:\n print('Second')\nelse:\n print('Friendship')\n\n \t \t \t \t \t \t\t\t \t\t\t\t", "s,q,w,e,r=map(int,input().split())\r\na=q*s+2*e\r\nb=w*s+2*r\r\nif a!=b:print([\"First\",\"Second\"][a>b])\r\nelse:print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nq1 = 2*t1 + s*v1\r\nq2 = 2*t2 + s*v2\r\nif q1 == q2:\r\n print(\"Friendship\")\r\nelif(q1 > q2):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "p=list(map(int,input().split()))\r\na=p[0]*p[1]+2*p[3]\r\nb=p[0]*p[2]+2*p[4]\r\nif a>b:\r\n\tprint(\"Second\")\r\nelif a<b:\r\n\tprint(\"First\")\r\nelif a==b:\r\n\tprint(\"Friendship\")\t", "s, v1, v2, t1, t2 = map(int, input().split())\r\nresult1 = s * v1 + (t1 * 2)\r\nresult2 = s * v2 + (t2 * 2)\r\nif result1 == result2:\r\n print(\"Friendship\")\r\nif result1 < result2:\r\n print(\"First\")\r\nif result2 < result1:\r\n print(\"Second\")", "s, a, b, c, d = map(int, input().split())\r\n\r\nk1 = a * s + c * 2\r\nk2 = b * s + d * 2\r\n\r\nif k1 < k2:\r\n print('First')\r\nelif k1 > k2:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "vstup = [int(_) for _ in input().split(' ')]\r\n\r\nif vstup[0]*vstup[1]+2*vstup[3]<vstup[0]*vstup[2]+2*vstup[4]:\r\n print('First')\r\nelif vstup[0]*vstup[1]+2*vstup[3]==vstup[0]*vstup[2]+2*vstup[4]:\r\n print('Friendship')\r\nelse:\r\n print('Second')\r\n \r\n\r\n \r\n \r\n \r\n", "def solution():\r\n n, v1, v2, t1, t2 = map(int, input().split())\r\n p1 = (v1 * n) + (t1 * 2)\r\n p2 = (v2 * n) + (t2 * 2)\r\n\r\n if p1 < p2:\r\n print('First')\r\n elif p1 > p2:\r\n print('Second')\r\n else:\r\n print('Friendship')\r\n\r\n\r\nsolution()", "s, v1, v2, t1, t2 = input().split()\r\nif int(s)*int(v1)+2*int(t1)>int(s)*int(v2)+2*int(t2):\r\n print('Second')\r\nelif int(s)*int(v1)+2*int(t1)<int(s)*int(v2)+2*int(t2):\r\n print('First')\r\nelse: print('Friendship')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns, v1, v2, t1, t2 = map(int, input().split())\r\nif s * v1 + 2 * t1 < s * v2 + 2 * t2:\r\n ans = \"First\"\r\nelif s * v1 + 2 * t1 > s * v2 + 2 * t2:\r\n ans = \"Second\"\r\nelse:\r\n ans = \"Friendship\"\r\nprint(ans)", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\n\r\na = s * v1 + 2 * t1\r\nb = s * v2 + 2 * t2\r\n\r\nif a < b:\r\n print('First')\r\nelif a > b:\r\n print('Second')\r\nelif a == b:\r\n print('Friendship')\r\n\r\n\r\n\r\n\r\n\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\ntime_1 = s*v1 + 2*t1\r\ntime_2 = s*v2 + 2*t2\r\n\r\nif time_1 < time_2:\r\n print(\"First\")\r\nelse:\r\n if time_2 < time_1:\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")\r\n", "s, v1, v2, t1, t2 = list(map(int, input().split()))\na = 2*t1 + s*v1 \nb = 2*t2 + s*v2\nif a > b:\n print(\"Second\")\nelif a < b:\n print(\"First\")\nelse:\n print(\"Friendship\")\n\n", "s,v1,v2,t1,t2=list(map(int,input().split()))\r\nif ((s*v1)+2*t1)<((s*v2)+2*t2):\r\n print('First')\r\nelif ((s*v1)+2*t1)>((s*v2)+2*t2):\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=map(int,input().split())\r\nx1=(s*v1)+(2*t1)\r\nx2=(s*v2)+(2*t2)\r\nif x1<x2:\r\n print(\"First\")\r\nelif x1==x2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nv1,v2=v1*s,v2*s\r\nt1,t2=t1*2,t2*2\r\ns1,s2=v1+t1,v2+t2\r\nif s1<s2:print(\"First\")\r\nelif s1>s2:print(\"Second\")\r\nelse: print(\"Friendship\")", "def keyRaces(s, v1, v2, t1, t2):\r\n first = (s * v1) + (2 * t1)\r\n second = (s * v2) + (2 * t2)\r\n if first < second:\r\n return \"First\"\r\n elif first > second:\r\n return \"Second\"\r\n else:\r\n return \"Friendship\"\r\ns = [int(n) for n in input().split()]\r\nprint(keyRaces(s[0], s[1], s[2], s[3], s[4]))", "s, v1, v2, t1, t2 = map(int,input().split())\r\n\r\nfirstParticipant = t1 * 2 + s * v1\r\nsecondParticipant = t2 * 2 + s * v2\r\n\r\nif firstParticipant < secondParticipant:\r\n print('First')\r\nelse:\r\n if firstParticipant == secondParticipant:\r\n print('Friendship')\r\n else:\r\n print('Second')", "# JAI SHREE RAM\r\n\r\nimport math; from collections import *\r\nimport sys; from functools import reduce\r\n\r\n# sys.setrecursionlimit(10**6)\r\ndef get_ints(): return map(int, input().strip().split())\r\ndef get_list(): return list(get_ints())\r\ndef get_string(): return list(input().strip().split())\r\ndef printxsp(*args): return print(*args, end=\"\")\r\ndef printsp(*args): return print(*args, end=\" \")\r\n\r\nUGLYMOD = int(1e9)+7; SEXYMOD = 998244353; MAXN = int(1e5)\r\n\r\n# sys.stdin=open(\"input.txt\",\"r\");sys.stdout=open(\"output.txt\",\"w\")\r\n\r\n# for _testcases_ in range(int(input())):\r\nn, v1, v2, p1, p2 = get_ints()\r\ne1 = p1 + n*v1 + p1\r\ne2 = p2 + n*v2 + p2\r\nif e1 == e2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"First\" if e1 < e2 else \"Second\")\r\n\r\n\r\n'''\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\nTHE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )\r\nLink may be copy-pasted here if it's taken from other source.\r\nDO NOT PLAGIARISE.\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\n'''", "# testCaseNum = int(input())\n# for testCase in range(testCaseNum):\n# n = map(int ,input().split())\n# print(min(n-1 ,abs(a - b)+x))\ns ,v1 ,v2 ,t1 ,t2 = map(int ,input().split())\nFirst = s*v1 + 2*t1\nSecond = s*v2 + 2*t2\nif First > Second:\n print(\"Second\")\nelif First < Second:\n print(\"First\")\nelse:\n print(\"Friendship\")\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nv1 = s * v1 + 2 * t1\r\nv2 = s * v2 + 2 * t2\r\nif v1 < v2:\r\n print('First')\r\nelif v1 > v2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=input().split()\r\ns=int(s)\r\nv1=int(v1)\r\nv2=int(v2)\r\nt1=int(t1)\r\nt2=int(t2)\r\nfirst=(s*v1)+(2*t1)\r\nsecond=(s*v2)+(2*t2)\r\nif first>second:\r\n print (\"Second\")\r\nelif second>first:\r\n print (\"First\")\r\nelse:\r\n print (\"Friendship\")", "# cf 835 A 700\ns, v1, v2, t1, t2 = map(int, input().split())\n\np1 = t1 + (s * v1) + t1\np2 = t2 + (s * v2) + t2\n\nif p1 < p2:\n print(\"First\")\nelif p1 > p2:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n", "a,b,c,d,e=map(int,input().split());print(\"First\" if (b*a)+(2*d)<(c*a)+(2*e) else \"Second\" if (b*a)+(2*d)>(c*a)+(2*e) else \"Friendship\")", "timer1=0\ntimer2=0\ns, v1, v2, t1, t2=map(int,input().split())\ntimer1+=(s*v1)+(t1*2)\ntimer2+=(s*v2)+(t2*2)\nif(timer1<timer2):\n print(\"First\")\nif(timer2<timer1):\n print(\"Second\")\nif(timer1==timer2):\n print(\"Friendship\")", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\nx = (s*v1)+(2*t1)\r\ny = (s*v2)+(2*t2)\r\nif x<y:\r\n print(\"First\")\r\nelif y<x:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "k=list(map(int,input().split()))\r\nif (k[0]*k[1]+2*k[3]>k[0]*k[2]+2*k[4]):\r\n print('Second')\r\nelif (k[0]*k[1]+2*k[3]<k[0]*k[2]+2*k[4]):\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "l=list(map(int,input().split()))\r\ns,v1,v2,t1,t2=l\r\nif (2*t1+v1*s)==(2*t2+v2*s):\r\n\tprint('Friendship')\r\nelif (2*t1+v1*s)<(2*t2+v2*s):\r\n\tprint('First')\r\nelse:\r\n\tprint('Second')\r\n# print((2*t1+v1*s))\r\n# print((2*t2+v2*s))", "import sys\r\n\r\ndef main():\r\n s, v1, v2, t1, t2 = map(int, sys.stdin.read().strip().split())\r\n r1 = v1*s + t1*2\r\n r2 = v2*s + t2*2\r\n return 'Friendship' if r1 == r2 else ('First', 'Second')[r1 > r2]\r\n \r\nprint(main())", "total_characters, first_player_rate, second_player_rate, first_player_ping, second_player_ping = [int(x) for x in input().split()]\r\n\r\nfirst_player_total = (first_player_rate * total_characters) + (2 * first_player_ping)\r\nsecond_player_total = (second_player_rate * total_characters) + (2 * second_player_ping)\r\n\r\nif first_player_total == second_player_total:\r\n print(\"Friendship\")\r\nif first_player_total > second_player_total:\r\n print(\"Second\")\r\nif second_player_total > first_player_total:\r\n print(\"First\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\na = s * v1 + 2 * t1\r\nb = s * v2 + 2 * t2\r\n\r\nif a == b:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"First\" if a < b else \"Second\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\na1 = 2*t1 + s*v1\na2 = 2*t2 + s*v2\nif a1 < a2:\n print(\"First\")\nelif a1 > a2:\n print(\"Second\")\nelse:\n print(\"Friendship\")", "\r\ns,v,u,t,o=[int(i) for i in input().split()]\r\nif s*v+2*t>s*u+2*o:\r\n\tprint('Second')\r\nelif s*v+2*t==s*u+2*o:\r\n\tprint('Friendship')\r\nelse:\r\n\tprint('First')", "s, v1, v2, t1, t2=[int(i) for i in input().split() ]\r\nif (v1*s+t1*2) < (v2*s+t2*2):\r\n print('First')\r\nelif (v1*s+t1*2) > (v2*s+t2*2):\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2 = map(int, input().split())\r\nansp1=2*t1+v1*s\r\nansp2=2*t2+v2*s\r\n\r\nif ansp1 < ansp2:\r\n print(\"First\")\r\n\r\nelif ansp2 < ansp1:\r\n print(\"Second\")\r\n\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = [int(elt) for elt in input().split(\" \")]\n\np1 = s*v1 + t1*2\np2 = s*v2 + t2*2\nif(p1 < p2):\n print(\"First\")\nelif (p1 > p2):\n print(\"Second\")\nelse:\n print(\"Friendship\")\n\t \t\t\t \t\t\t \t \t\t\t\t \t \t\t\t", "a = list(map(int, input().split()))\r\nx = a[0] * a[1] + a[3] * 2\r\ny = a[0] * a[2] + a[4] * 2\r\nif(x > y):\r\n print(\"Second\")\r\nelif(y >x):\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=list(map(int,input().split(\" \")))\r\nif 2*t1+(v1*s) < 2*t2+(v2*s):\r\n print(\"First\")\r\nelif 2*t1+(v1*s) > 2*t2+(v2*s):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,va,vb,ta,tb=map(int,input().split())\naa=ta*2+va*s\nbb=tb*2+vb*s\nprint(\"Friendship\" if aa==bb else \"First\" if aa<bb else \"Second\")\n\t \t\t\t\t\t \t\t\t\t\t \t \t \t \t \t\t\t", "S, V1, V2, T1, T2 = map(int, input().split())\r\nprint(\"First\" if S * V1 + 2* T1 < S * V2 + 2 * T2 else (\"Second\" if S * V1 + 2 * T1 != S * V2 + 2 * T2 else \"Friendship\"))\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nm=s*v1+t1*2\r\nn=s*v2+t2*2\r\nif m<n:\r\n\tprint(\"First\")\r\nelif m==n:\r\n\tprint(\"Friendship\")\r\nelse:\r\n\tprint(\"Second\")\t", "# The place between your comfort zone and your dream is where life takes place. Helen Keller\r\n# by : Blue Edge - Create some chaos\r\n\r\ns,v1,v2,t1,t2=map(int,input().split())\r\nr1=t1+v1*s+t1\r\nr2=t2+v2*s+t2\r\nif r1<r2:\r\n print(\"First\")\r\nelif r2<r1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\na = t1 * 2 + s * v1\r\nb = t2 * 2 + s * v2\r\nif a > b:\r\n print(\"Second\")\r\nelif b > a:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "def signum(x):\r\n if x == 0:\r\n return 0\r\n if x > 0:\r\n return 1\r\n return -1\r\n\r\nanswers = {\r\n 1: 'First',\r\n 0: 'Friendship',\r\n -1: 'Second'\r\n}\r\ns, v1, v2, t1, t2 = map(int, input().split())\r\ntime_first = 2 * t1 + v1 * s\r\ntime_second = 2 * t2 + v2 * s\r\nk = signum(time_second - time_first)\r\nprint(answers[k])\r\n", "s, v1, v2, t1, t2 = [int(x) for x in input().split()]\r\n\r\nt1, t2 = 2*t1+s*v1, 2*t2+s*v2\r\n\r\nif t1 < t2:\r\n print('First')\r\nelif t2 < t1:\r\n print('Second')\r\nelse:\r\n print('Friendship') ", "s, v1, v2, t1, t2 = map(int, input().split())\na1 = s*v1 + 2*t1\na2 = s*v2 + 2*t2\nif a1 > a2:\n\tprint(\"Second\")\nif a1 == a2:\n\tprint(\"Friendship\")\nif a1 < a2:\n\tprint(\"First\")", "def f(s,u,v,r,t):\r\n if ((s*u) +(2*r))<((s*v)+(2*t)):\r\n return (\"First\")\r\n if ((s*u) +(2*r))==((s*v)+(2*t)):\r\n return (\"Friendship\")\r\n else:\r\n return (\"Second\")\r\ns,u,v,r,t =map(int,input().split())\r\nprint(f(s,u,v,r,t))", "s, v1, v2, t1, t2 = [int(x) for x in input().split(' ')]\nif 2 * t1 + s * v1 > 2 * t2 + s * v2:\n print('Second')\nelif 2 * t1 + s * v1 < 2 * t2 + s * v2:\n print('First')\nelse:\n print('Friendship')\n", "if __name__ == \"__main__\":\n s, v1, v2, t1, t2 = tuple(map(int, input().split()))\n f = v1 * s + t1 * 2\n snd = v2 * s + t2 * 2\n\n if f < snd:\n print(\"First\")\n elif f > snd:\n print(\"Second\")\n else:\n print(\"Friendship\")", "char_len, v1, v2, t1, t2 = map(int, input().split())\nfirst = t1*2 + v1*char_len\nsecond = t2*2 + v2*char_len\nif first < second:\n print(\"First\")\nelif second < first:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nr1 = (s * v1) + t1 * 2\r\nr2 = (s * v2) + t2 * 2\r\nif r1 < r2:\r\n print(\"First\")\r\nelif r1 > r2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nif t1 + v1 * s + t1 > t2 + v2 * s + t2:\r\n print(\"Second\")\r\nelif t1 + v1 * s + t1 < t2 + v2 * s + t2:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nif (s*v1)+(t1*2)>(s*v2)+(t2*2):\r\n print(\"Second\")\r\nelse:\r\n if(s*v1)+(t1*2)<(s*v2)+(t2*2):\r\n print(\"First\")\r\n else:\r\n print(\"Friendship\")\r\n\r\n##http://codeforces.com/contest/835/problem/A ссылка на задачу\r\n", "s,a,b,c,d=map(int,input().split())\r\nt1=s*a+2*c\r\nt2=s*b+2*d\r\nif t1<t2:\r\n print(\"First\")\r\nelif t1>t2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "p = input().split()\r\ns, v1, v2, t1, t2 = int(p[0]), int(p[1]), int(p[2]), int(p[3]), int(p[4])\r\nfrs = s*v1 + t1*2\r\nscn = s*v2 + t2*2\r\nif frs < scn:\r\n print('First')\r\nelif frs > scn:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\nres1 = s * v1 + 2 * t1\nres2 = s * v2 + 2 * t2\nif res1 < res2:\n print(\"First\")\nelif res1 > res2:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n\n\n", "chars, speed_a, speed_b, ping_a, ping_b = map(int, input().split(\" \"))\nfirst = chars * speed_a + ping_a * 2\nsecond = chars * speed_b + ping_b * 2\nif first < second:\n print(\"First\")\nelif first > second:\n print(\"Second\")\nelif first == second:\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nk=((2*t1)+(s*v1))\r\ni=((2*t2)+(s*v2))\r\nif k<i:\r\n print(\"First\")\r\nelif k>i:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s, v1, v2, t1, t2 = [int(s) for s in input().split()]\r\n\r\nif s*v1 + 2*t1 < s*v2 + 2*t2:\r\n print('First')\r\nelif s*v1 + 2*t1 > s*v2 + 2*t2:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\n\r\na=t1+s*v1+t1\r\nb=t2+s*v2+t2\r\n\r\nif a<b:\r\n print('First')\r\nelif b<a:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "arr = [int(_) for _ in input().split()]\n\nv1 = arr[0] * arr[1] + 2 * arr[3]\nv2 = arr[0] * arr[2] + 2 * arr[4]\n\nif v1 == v2:\n print('Friendship')\n\nelif v1 > v2:\n print('Second')\n\nelse:\n print('First')\n", "try:\r\n x=list(map(int,input().split(\" \")))\r\n p=x[1]*x[0]+x[3]*2\r\n q=x[2]*x[0]+x[4]*2\r\n if p<q:\r\n print(\"First\")\r\n elif p>q:\r\n print(\"Second\")\r\n elif p==q:\r\n print(\"Friendship\")\r\nexcept:\r\n pass", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\ns,v1,v2,t1,t2 = map(int, input().split())\r\nv1*=s; v2*=s\r\nt1<<=1; t2<<=1;\r\nv1+=t1; v2+=t2\r\nif v1==v2: print(\"Friendship\")\r\nelse: print([\"First\",\"Second\"][v1>v2])", "s,v1,v2,t1,t2=map(int,input().split())\r\nf=s*v1+2*t1\r\nsc=s*v2+2*t2\r\nif f<sc:\r\n print(\"First\")\r\nelif sc==f:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")\r\n", "first = list(map(int, input().split()))\r\nif first[0] * first[1] + (2 * first[3]) < first[0] * first[2] + (2 * first[4]):\r\n print(\"First\")\r\nelif first[0] * first[1] + (2 * first[3]) > first[0] * first[2] + (2 * first[4]):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\na1 = v1 * s + 2 * t1\r\na2 = v2 * s + 2 * t2\r\n\r\nif a1 < a2:\r\n print(\"First\")\r\nelif a1 > a2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "\r\ns,v1,v2,t1,t2 = map(int,input().split())\r\n\r\ntime_one=s*v1 + 2*t1\r\ntime_two=s*v2 + 2*t2\r\n\r\nif(time_one>time_two):\r\n\tprint(\"Second\")\r\nelif(time_two>time_one):\r\n\tprint(\"First\")\r\nelse:\r\n\tprint(\"Friendship\")", "s, a, b, c, d = list(map(int, input().split()))\r\nx = ((a * s) + (c * 2))\r\ny = ((b * s) + (d * 2))\r\nif (x < y):\r\n print(\"First\")\r\nelif (x > y):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\ntime1 = t1*2 + s*v1\r\ntime2 = t2*2 + s*v2\r\nif time1 == time2:\r\n print('Friendship')\r\nelse:\r\n if time1 < time2:\r\n print('First')\r\n else:\r\n print('Second')", "s,n,m,a,b=map(int,input().split())\r\nif s*n+2*a<s*m+2*b:\r\n print('First')\r\nelif s*n+2*a>s*m+2*b:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s,v1,v2,t1,t2 = map(int, input().split())\r\n\r\nt1 = (s * v1) + 2 * t1\r\nt2 = (s * v2) + 2 * t2\r\n\r\nif(t1 < t2):\r\n print(\"First\")\r\nelif(t2 < t1):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nq1 = 2 * t1 + s * v1\r\nq2 = 2 * t2 + s * v2\r\nif q1 < q2:\r\n print('First')\r\nelif q1 > q2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\ntime1, time2 = 2*t1 + v1 * s, 2*t2 + v2 * s\r\nprint('First' if time1 < time2 else 'Second' if time1 > time2 else 'Friendship')", "s,v1,v2,t1,t2=map(int,input().split())\r\na=s*v1+2*t1\r\nb=s*v2+2*t2\r\nif(a==b):\r\n print('Friendship')\r\nelif(a<b):\r\n print('First')\r\nelse:\r\n print('Second')\r\n \r\n", "num = input()\na = []\n\n\ndef get_the_data(count, num, arr):\n for i in range(0, len(num)):\n if num[i] == ' ':\n arr.append(int(num[count:i]))\n count = i+1\n elif i == len(num)-1:\n arr.append(int(num[count:len(num)]))\n return arr\n\n\narr = get_the_data(0, num, a)\n\nnumber_of_words = arr[0]\ntime1 = arr[1]\ntime2 = arr[2]\ndelay1 = arr[3]\ndelay2 = arr[4]\n\nfirst = delay1*2 + time1*number_of_words\nsecond = delay2*2 + time2*number_of_words\n\nif first < second :\n print('First')\nelif second < first:\n print('Second')\nelse:\n print('Friendship')\n\n \n\n\n\n", "s,v1,v2,t1,t2=list(map(int,input().split()))\r\n\r\nf1=(s*v1)+(2*t1)\r\nf2=(s*v2)+(2*t2)\r\nif f1<f2:\r\n print(\"First\")\r\nelif f1>f2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=[int(i) for i in input().split()]\r\nt1=s*v1+2*t1\r\nt2=s*v2+2*t2\r\nif t1<t2:\r\n print(\"First\")\r\nelif t1>t2:\r\n print(\"Second\")\r\nelse :\r\n print(\"Friendship\")\r\n", "s,v1,v2,t1,t2 = map(int,input().split())\r\nprint('First' if float(2*t1)+s*v1 < float(2*t2)+s*v2 else\r\n 'Second' if float(2*t1)+s*v1 > float(2*t2)+s*v2 else\r\n 'Friendship')", "s,v1,v2,t1,t2 = map(int,input().split())\r\nif s*v1+t1*2<s*v2+t2*2:\r\n print('First')\r\nelif s*v1+t1*2>s*v2+t2*2:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s,v1,v2,t1,t2=[int(i) for i in input().split()]\r\na=(v1*s)+(2*t1)\r\nb=(v2*s)+(2*t2)\r\nif a<b:\r\n print('First')\r\nelif b<a:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "svt = list(map(int, input().split()))\r\nfirst = svt[3] * 2 + (svt[0] * svt[1])\r\nsecond = svt[4] * 2 + (svt[0] * svt[2])\r\nif first < second:\r\n\tprint('First')\r\nelif second < first:\r\n\tprint('Second')\r\nelse:\r\n\tprint('Friendship')", "\r\ns, v1, v2, t1, t2 = map(int, input().split())\r\ntime_participant_1 = t1 * 2 + v1 * s\r\ntime_participant_2 = t2 * 2 + v2 * s\r\nif time_participant_1 < time_participant_2:\r\n print(\"First\")\r\nelif time_participant_2 < time_participant_1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "[s, v1, v2, t1, t2] = [int(i) for i in input().split()]\r\nval1 = (s*v1)+(2*t1)\r\nval2 = (s*v2)+(2*t2)\r\nif val1<val2:\r\n print(\"First\")\r\nelif val1>val2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\n\r\nres1 = t1 * 2 + s * v1\r\nres2 = t2 * 2 + s * v2\r\n\r\nif res1 > res2:\r\n print(\"Second\")\r\nelif res1 < res2:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n", "a = list(map(int,input().split()))\r\nb = a[0]\r\nc = a[1]*b+a[3]*2\r\nd = a[2]*b+a[4]*2\r\nif c<d:\r\n print(\"First\")\r\nelif c>d:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\np1 = s * v1 + 2 * t1\r\np2 = s * v2 + 2 * t2\r\nif p1 < p2:\r\n print(\"First\")\r\nelif p2 < p1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n\r\n\r\n", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\n\r\nif ((t1 * 2) + (v1 * s) < (t2 * 2) + (v2 * s)):\r\n print(\"First\")\r\nelif ((t1 * 2) + (v1 * s) > (t2 * 2) + (v2 * s)):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\np1 = s * v1 + t1 * 2\r\np2 = s * v2 + t2 * 2\r\n\r\nif p1 < p2:\r\n print(\"First\")\r\nelif p2 < p1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nr1=(v1*s)+(t1*2)\r\nr2=(v2*s)+(t2*2)\r\nif r1!=r2:\r\n if r1<r2:\r\n print('First')\r\n else:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "l,v1,v2,t1,t2 = list(map(int,input().split()))\r\nv1 = v1*l + 2*t1\r\nv2 = v2*l + 2*t2\r\n\r\nif v1>v2:\r\n print(\"Second\")\r\nelif v1<v2:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "a,b,c,d,e =map(int,input().split())\r\np = (b*a) +d*2\r\nq = (c*a) +e*2\r\nif p<q:\r\n print(\"First\")\r\nelif p>q :\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "n = list(map(int, input().split()))\r\nif (n[0] * n[1] + (2 * n[3])) > (n[0] * n[2] + (2 * n[4])):\r\n print(\"Second\")\r\nelif (n[0] * n[1] + (2 * n[3])) < (n[0] * n[2] + (2 * n[4])):\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map (int, input ().split ()) \r\n\r\nfirst = t1 + s * v1 + t1\r\nsecond = t2 + s * v2 + t2\r\n\r\nif first < second:\r\n print (\"First\")\r\nelse:\r\n if first > second:\r\n print (\"Second\")\r\n else:\r\n print (\"Friendship\")", "s,v1,v2,t1,t2 = [int(i) for i in input().split()]\r\nr1 = s*v1 + 2*t1\r\nr2 = s*v2 + 2*t2\r\n\r\nif r1 == r2:\r\n print(\"Friendship\")\r\nelif r1 < r2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "inside = input()\r\nslovo, speed1, speed2, ping1, ping2 = list(map(int, inside.split()))\r\nresult1 = ping1 * 2 + slovo * speed1\r\nresult2 = ping2 * 2 + slovo * speed2\r\nif result1 == result2:\r\n print('Friendship')\r\nelse:\r\n if result1 > result2:\r\n print('Second')\r\n else:\r\n print('First')", "s, v1, v2, t1, t2 = list(map(int,input().split()))\r\nif s*v1 + 2*t1<s*v2 + 2*t2:\r\n print(\"First\")\r\nif s*v1 + 2*t1>s*v2 + 2*t2:\r\n print(\"Second\")\r\nif s*v1 + 2*t1==s*v2 + 2*t2:\r\n print(\"Friendship\")\r\n\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nres1=s*v1+2*t1\r\nres2=s*v2+2*t2\r\nif res1<res2:\r\n print('First')\r\nelif res1==res2:\r\n print('Friendship')\r\nelse:\r\n print('Second')\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\na1=2*t1+v1*s\r\na2=2*t2+v2*s\r\nif a1<a2:\r\n print('First')\r\nelif a1>a2:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n\r\n\r\n\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=input().split()\r\ns=int(a[0])\r\nv1=int(a[1])\r\nv2=int(a[2])\r\nt1=int(a[3])\r\nt2=int(a[4])\r\nif s*v1+2*t1<s*v2+2*t2:\r\n print(\"First\")\r\nelif s*v1+2*t1>s*v2+2*t2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v,u,t,o=map(int,input().split())\na=s*v+2*t\nb=s*u+2*o\nif(a>b):\n print('Second')\nelif(a==b):\n print('Friendship')\nelse:\n print('First')\n\n\n \t \t \t \t \t\t \t\t \t\t \t\t \t\t\t \t", "s, v1, v2, t1, t2=map(int,input().split())\r\nrez1=s*v1+2*t1\r\nrez2=s*v2+2*t2\r\nif rez1==rez2:\r\n print('Friendship')\r\nelif rez1<rez2:\r\n print('First')\r\nelse:\r\n print('Second')", "s,v,w,t,i = map(int,input().split())\r\nif (s * v) + 2*t < (s*w) + 2*i:\r\n print(\"First\")\r\nelse:\r\n if (s * v) + 2*t > (s*w) + 2*i:\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")\r\n", "a,b,c,d,e = map(int,input().split())\r\nz = (a*b)+(2*d)\r\nx = (a*c)+ (2*e)\r\nif x>z:print(\"First\")\r\nelif z>x:print(\"Second\")\r\nelse:print(\"Friendship\")\r\n", "n,v1,v2,t1,t2=input().split()\r\nn=int(n)\r\nv1=int(v1)\r\nv2=int(v2)\r\nt1=int(t1)\r\nt2=int(t2)\r\nt1=t1*2\r\nt2=t2*2 \r\nv1=v1*n+t1\r\nv2=v2*n+t2\r\nif v1<v2:\r\n print(\"First\")\r\nelif v1>v2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "k=input().split()\r\nfor i in range(len(k)):\r\n a=int(k[0])\r\n b=int(k[1])\r\n c=int(k[2])\r\n d=int(k[3])\r\n e=int(k[4])\r\nx1=e+c*a+e\r\nx2=d+b*a+d\r\nif x1 > x2:\r\n print(\"First\")\r\nelif x1<x2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "a=list(map(int,input().split()))\r\ns1=(a[0]*a[1])+(2*a[3])\r\ns2=(a[0]*a[2])+(2*a[4])\r\nif s1<s2:\r\n\tprint(\"First\")\r\nelif s2<s1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\na=v1*s+t1*2\r\nb=v2*s+t2*2\r\nif a==b:\r\n print('Friendship')\r\nelse:\r\n if a<b:\r\n print('First')\r\n else:\r\n print ('Second')\r\n", "s,v1,v2,t1,t2 = map(int,input().split())\r\nif v1*s+t1*2 > v2*s+t2*2:\r\n print(\"Second\")\r\nelif v1*s+t1*2 < v2*s+t2*2:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s1,v1,v2,t1,t2 = map(int,input().split())\r\na=s1*v1+t1*2\r\nb=s1*v2+t2*2\r\nif a==b:print(\"Friendship\")\r\nif a<b:print(\"First\")\r\nif a>b:print(\"Second\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\np1 = s*v1+2*t1\r\np2 = s*v2+2*t2\r\nif p1 < p2 :\r\n print('First')\r\nelif p2 < p1 :\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n\r\n\r\n", "a, b, c, d, e = map(int, input().split())\r\nif a * b + 2* d < a * c + 2 * e:\r\n print(\"First\")\r\nelse:\r\n if a * b + 2 * d != a * c + 2 * e:\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2 = [int(x) for x in input().split()]\r\nx = s*v1 + 2*t1\r\ny = s*v2 + 2*t2\r\nif x<y:\r\n print(\"First\")\r\nelif x>y:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nprint(\"First\"if s*v1+2*t1<s*v2+2*t2 else\"Second\"if s*v1+2*t1>s*v2+2*t2 else\"Friendship\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\ntimeP1 = s * v1 + 2*t1\r\ntimeP2 = s * v2 + 2*t2\r\n\r\nif timeP1 < timeP2:\r\n print(\"First\")\r\nelif timeP1 == timeP2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")", "a = list(map(int, input().split()))\r\nb = 2 * a[3] + a[1] * a[0]\r\nc = 2 * a[4] + a[2] * a[0]\r\nif b < c:\r\n\tprint(\"First\")\r\nelif b == c:\r\n\tprint(\"Friendship\")\r\nelse:\r\n\tprint(\"Second\")\r\n", "a=list(map(int,input().split()))\r\ncalc1=a[0]*a[1]+a[3]*2\r\ncalc2=a[0]*a[2]+a[4]*2\r\nif calc2==calc1:\r\n print(\"Friendship\")\r\nelif calc2>calc1:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s,v1,v2,t1,t2 = map(int,input().split())\r\nif (t1 + (v1 * s) + t1)<(t2 + (v2 * s) + t2):print(\"First\")\r\nelif (t1 + (v1 * s) + t1)>(t2 + (v2 * s) + t2):print(\"Second\")\r\nelse: print(\"Friendship\")", "n = input().split()\ns, v1, v2, t1, t2 = int(n[0]), int(n[1]), int(n[2]), int(n[3]), int(n[4])\nif s * v1 + 2 * t1 < s * v2 + 2 * t2:\n print('First')\nif s * v1 + 2 * t1 > s * v2 + 2 * t2:\n print('Second')\nif s * v1 + 2 * t1 == s * v2 + 2 * t2:\n print('Friendship')\n\n \t\t \t\t \t\t\t \t \t \t\t\t \t\t \t", "s,v1,v2,t1,t2=map(int,input().split())\r\nn1=v1*s+2*t1\r\nn2=v2*s+2*t2\r\nif (n1<n2):\r\n print(\"First\")\r\nelif (n1>n2):\r\n print(\"Second\")\r\nelif (n1==n2):\r\n print(\"Friendship\")", "#n=int(input())\r\n#n,m=map(int,input().split())\r\n#arr=list(map(int,input().split()))\r\n#for i in range(m):\r\ns,v1,v2,t1,t2=map(int,input().split())\r\nif s*v1+2*t1<s*v2+2*t2:\r\n print(\"First\")\r\nelif s*v1+2*t1==s*v2+2*t2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")\r\n", "#!/bin/python3\r\n\r\ninp= input().split()\r\na=int(inp[0])\r\nb=int(inp[1])\r\nc=int(inp[2])\r\nd=int(inp[3])\r\ne=int(inp[4])\r\n\r\nf= (a*b) + (2*d)\r\ng= (a*c) + (2*e)\r\nif f<g:\r\n print(\"First\")\r\nelif g<f:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, a, b, c, d = map(int,input().split())\r\n\r\nif (s*a + 2*c < s*b + 2*d): \r\n print(\"First\")\r\nelif (s*a + 2*c > s*b + 2*d):\r\n print(\"Second\")\r\nelse: \r\n print(\"Friendship\")", "#include <bits/stdc++.h>\r\n#define STD /*\r\nfrom sys import (\r\nstdin, stdout, exit as sys_ret)\r\n\"\"\"****************************\r\n\r\n Interactive Tasks:\r\n\r\n / Python: / \"\"\"\r\nf_input, f_print, f_flush = (\r\n stdin.readline,\r\n stdout.write,\r\n stdout.flush)\r\n\r\n\"\"\" / C++ /\r\n #import <cstdio>\r\n fflush(stdout);\r\n or\r\n #import <iostream>\r\n cout << endl;\r\n\r\n —————————————————————————\r\n Don't raise your voice,\r\n improve your argument.\r\n —————————————————————————\r\n\r\n cat /dev/ass > /dev/head\r\n Ctrl+C\r\n cat /knowledge > /dev/head\r\n\r\n © Jakov Gellert\r\n frvr.ru\r\n\r\n****************************\"\"\"\r\n# */ using namespace std; int\r\n\r\ntext, speed1, speed2, ping1, ping2 = map(int, f_input().split())\r\nfirst, second = ping1 * 2 + speed1 * text, ping2 * 2 + speed2 * text\r\nif first < second:\r\n f_print(\"First\")\r\nelif first > second:\r\n f_print(\"Second\")\r\nelse:\r\n f_print(\"Friendship\")", "def max1(a):\r\n\tp = a[0]\r\n\tfor x in a:\r\n\t\tif x > p:\r\n\t\t\tp = x\r\n\treturn p\r\n\r\n\t\t\r\ndef\tpreobr(x):\r\n\tif x % 2 == 1:\r\n\t\treturn x + 1\r\n\telse:\r\n\t\treturn x - 1\r\n\r\n\r\ndef prlist(a):\r\n\tfor x in a:\r\n\t\tprint(x, end = \" \")\r\n\t\t\r\n\r\ndef dlin(n):\r\n\tk = 0\r\n\twhile n > 0:\r\n\t\tn -= k\r\n\t\tk += 1\r\n\treturn k - 1\r\n\t\r\n\t\r\n\t\r\n\t\t\t\t\r\n#row, col = list(map(int, input().split()))\r\n#a = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nt1 = a[0] * a[1] + a[3] * 2\r\nt2 = a[0] * a[2] + a[4] * 2\r\nif t1 < t2:\r\n\tprint(\"First\")\r\nelif t1 > t2:\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"Friendship\")\r\n", "s,v1,v2,t1,t2 = map(int,input().split())\r\nk1 = 2*t1+s*v1\r\nk2 = 2*t2+s*v2\r\nif k1<k2:\r\n\tprint(\"First\")\r\nelif k2<k1:\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"Friendship\")", "s,v1,v2,t1,t2=[int(i) for i in input().split()]\r\np1=(2*t1)+(s*v1)\r\np2=(2*t2)+(s*v2)\r\nif p1>p2:\r\n print('Second')\r\nelif p1<p2:\r\n print('First')\r\nelse:\r\n print('Friendship')\r\n", "info = [int(x) for x in input().split()]\r\nfirst = info[1]*info[0] + 2*info[3]\r\nsecond = info[2]*info[0] + 2*info[4]\r\n# Too easy to explain.\r\nif first < second:\r\n print(\"First\")\r\nelif second < first:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s, v1, v2, p1, p2 = map(int, input().split())\r\nprint(\r\n \"First\" if s * v1 + 2 * p1 < s * v2 + 2 * p2 else \"Friendship\" if s * v1 + 2 * p1 == s * v2 + 2 * p2 else \"Second\")", "info = input()\r\ninfo = info.split()\r\ns = int(info[0])\r\nv1 = int(info[1])\r\nv2 = int(info[2])\r\nt1 = int(info[3])\r\nt2 = int(info[4])\r\n\r\ntime1 = (s*v1)+(2*t1)\r\ntime2 = (s*v2)+(2*t2)\r\n\r\nif time1 > time2:\r\n print(\"Second\")\r\nelif time1 < time2:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n", "a, za, zb, sa, sb = map(int,input().split())\r\nx = a * za + sa * 2\r\nc = a * zb + sb * 2\r\nif x == c:\r\n print('Friendship')\r\nelif x < c:\r\n print('First')\r\nelse:\r\n print('Second')", "s,v1,v2,t1,t2=list(map(int,input().split()))\r\na=(s*v1)+(t1*2)\r\nb=(s*v2)+(t2*2)\r\nif a<b:\r\n print('First')\r\nelif b<a:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s,v1,v2,t1,t2=map(int,input().split())\nif s*v1+2*t1<s*v2+2*t2:print('First')\nelif s*v1+2*t1>s*v2+2*t2:print('Second')\nelse:print('Friendship')\n \t \t \t\t\t \t \t \t \t \t", "# import math\r\n#\r\n# n = int(input())\r\n#\r\n# if n % 2 == 0:\r\n# n = n / 2\r\n# print(int(n))\r\n# else:\r\n# print(math.ceil(n/2) * (-1))\r\n\r\n# n = int(input())\r\n#\r\n# k = 0\r\n# k10 = 0\r\n# k60 = 0\r\n#\r\n# if n >= 60:\r\n# k60 = n // 60\r\n# n = n % 60\r\n# if 440 < ((n // 10) + 1) * 125:\r\n# k60 += 1\r\n# else:\r\n# k10 = n // 10\r\n# if n >= 10:\r\n# k10 = n // 10\r\n# n = n % 10\r\n# if 125 < (n + 1) * 15:\r\n# k10 += 1\r\n# else:\r\n# k = n\r\n#\r\n# print(k, k10, k60)\r\n\r\n\r\n# a = int(input())\r\n# b = int(input())\r\n# c = int(input())\r\n#\r\n# if a > b:\r\n# if a > c:\r\n# print(a)\r\n# else:\r\n# print(c)\r\n# else:\r\n# if b > c:\r\n# print(b)\r\n# else:\r\n# print(c)\r\n\r\n# a, b = map(int, input().split())\r\n# c, d = map(int, input().split())\r\n# e, f = map(int, input().split())\r\n# q, w = map(int, input().split())\r\n#\r\n# sum1 = a + c + e + q\r\n# sum2 = d + b + f + w\r\n#\r\n# if sum1 > sum2:\r\n# print('1')\r\n# elif sum1 < sum2:\r\n# print('2')\r\n# else:\r\n# print('DRAW')\r\n\r\n# a = int(input())\r\n#\r\n# if a % 2 == 0:\r\n# print(int(a/2))\r\n# elif a == 1:\r\n# print(0)\r\n# else:\r\n# print(a)\r\n\r\n# w = int(input())\r\n#\r\n# if w % 2 == 0 and w != 2:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n\r\n# a, b, c = map(int, input().split())\r\n#\r\n# print(max(a, b, c) - min(a, b, c))\r\n\r\n# a = input().upper()\r\n# b = input().upper()\r\n#\r\n# if a < b:\r\n# print(-1)\r\n# elif a > b:\r\n# print(1)\r\n# else:\r\n# print(0)\r\n\r\ns, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nif (s * v1) + t1 * 2 < (s * v2) + t2 * 2:\r\n print('First')\r\nelif (s * v1) + t1 * 2 > (s * v2) + t2 * 2:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n\r\n", "def key_races_winner(s, v1, v2, t1, t2):\r\n first_time = s*v1+t1*2\r\n second_time = s*v2+t2*2\r\n if first_time < second_time:\r\n return \"First\"\r\n elif first_time == second_time:\r\n return \"Friendship\"\r\n else:\r\n return \"Second\"\r\n\r\n\r\ns, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\nprint(key_races_winner(s, v1, v2, t1, t2))\r\n\r\n\r\n'''\r\ns = int(input())\r\nv1 = int(input())\r\nv2 = int(input())\r\nt1 = int(input())\r\nt2 = int(input())\r\n'''\r\n", "s,v1,v2,t1,t2 = list(map(int, input().split()))\r\n\r\nf = v1*s + 2*t1\r\ns = v2*s + 2*t2\r\n\r\nif f < s:\r\n print('First')\r\nelif s < f:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,a,b,c,d = map(int, input().split())\r\n\r\n\r\nx = (s*a + c*2)\r\ny = (s*b + d*2)\r\n\r\n\r\nif x==y:\r\n print(\"Friendship\")\r\nelif x>y:\r\n print(\"Second\")\r\nelif y>x:\r\n print(\"First\")", "def solve(n, v1, v2, t1, t2):\r\n e1 = n*v1 + 2*t1\r\n e2 = n*v2 + 2*t2\r\n if e1 < e2:\r\n return \"First\"\r\n elif e1 == e2:\r\n return \"Friendship\"\r\n else:\r\n return \"Second\"\r\n\r\ndef main():\r\n n, v1, v2, t1, t2 = list(map(int, input().split()))\r\n print(solve(n, v1, v2, t1, t2))\r\n\r\nif __name__ == '__main__':\r\n main()", "def test():\r\n s,v1,v2,t1,t2=[int(i) for i in input().split()]\r\n s1=s*v1+2*t1\r\n s2=s*v2+2*t2\r\n if s1<s2 :\r\n print(\"First\")\r\n elif s1>s2:\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")\r\n return 0\r\nt=1\r\nfor i in range(t):\r\n test()", "s,v1,v2,t1,t2=map(int,input().split())\r\nb1=v1*s+2*t1\r\nb2=v2*s+2*t2\r\nif b1<b2:\r\n print(\"First\")\r\nelif b2<b1:\r\n print('Second')\r\nelse:\r\n print(\"Friendship\")\r\n", "def solve():\r\n s,v1,v2,t1,t2 = [int(x) for x in input().split(\" \")]\r\n t1 = t1*2+s*v1\r\n t2 = t2*2+s*v2\r\n if t1>t2:\r\n return \"Second\"\r\n elif t1<t2:\r\n return \"First\"\r\n else:\r\n return \"Friendship\"\r\n \r\nans = solve()\r\nprint(ans)\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\ntime_1 = s * v1 + 2 * t1\r\ntime_2 = s * v2 + 2 * t2\r\n\r\nif time_1 < time_2:\r\n print('First')\r\nelif time_1 > time_2:\r\n print('Second')\r\nelse:\r\n print('Friendship') ", "s, v1, v2, t1, t2 = map(int, input().split())\r\none = s * v1 + t1 + t1\r\ntwo = s * v2 + t2 + t2\r\nif one < two:\r\n print('First')\r\nelif one > two:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nx = s * v1 + t1 * 2\r\ny = s * v2 + t2 * 2\r\nif x < y:\r\n print(\"First\")\r\nelif y < x:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\nf = v1*s+t1*2\r\ns = v2*s+t2*2\r\nif f > s:\r\n print(\"Second\")\r\nelif f < s:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "\r\n\r\ns, v1, v2, t1, t2 = map(int, input().split())\r\nif 1 <= s <= 1000 and 1 <= v1 <= 1000 and 1 <= v2 <= 1000 and 1 <= t1 <= 1000 and 1 <= t2 <= 1000:\r\n a = (s * v1 + t1 * 2)\r\n b = (s * v2 + t2 * 2)\r\n if a < b:\r\n print('First')\r\n elif a == b:\r\n print('Friendship')\r\n else:\r\n print('Second')\r\n\r\n", "s, v1, v2, t1, t2 = input().split(' ')\r\nfirst = int(s)*int(v1)+ 2*int(t1)\r\nsecond = int(s)*int(v2) + 2*int(t2)\r\n\r\nif first < second:\r\n print('First')\r\nelif first > second:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "from time import sleep as sle\r\nfrom math import *\r\nfrom random import randint as ri\r\n \r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef pr(x):\r\n\tprint()\r\n\tfor s in x:\r\n\t\tprint(s)\r\n\r\ndef solve():\r\n\ts,v1,v2,t1,t2 = map(int,input().split())\r\n\tp1 = 2*t1+s*v1\r\n\tp2 = 2*t2+s*v2\r\n\tif p1 < p2:\r\n\t\tprint(\"First\")\r\n\telif p1 == p2:\r\n\t\tprint(\"Friendship\")\r\n\telse:\r\n\t\tprint(\"Second\")\r\n\r\nsolve()", "s, v1, v2, t1, t2 = [int(elem) for elem in input().split()]\r\nif t1+s*v1+t1 < t2+s*v2+t2:\r\n print('First')\r\nelif t1+s*v1+t1 > t2+s*v2+t2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "n, v1, v2, t1, t2 = map(int, input().split())\r\ncount1 = n*v1+2*t1\r\ncount2 = n*v2+2*t2\r\nif count1 == count2:\r\n print(\"Friendship\")\r\nelif count1 < count2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nif t1 * 2 + v1 * s < t2 * 2 + v2 * s:\r\n print(\"First\")\r\nelse:\r\n if 1 * 2 + v1 * s > t2 * 2 + v2 * s:\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")", "n = [int(x) for x in input().split()]\nfirst = n[0] * n[1] + 2 * n[3]\nsecond = n[0] * n[2] + 2 * n[4]\nif first < second:\n print(\"First\")\nelif first > second:\n print(\"Second\")\nelse:\n print(\"Friendship\")", "L,v1,v2,t1,t2=map(int,input().split())\r\nT1=(2*t1)+(L*v1)\r\nT2=(2*t2)+(L*v2)\r\nif T1==T2:\r\n print(\"Friendship\")\r\nelif T1<T2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\ntemp1 = 2*t1 + v1*s\r\ntemp2 = 2*t2 + v2*s\r\nif temp1 < temp2:\r\n print('First')\r\nelif temp1 > temp2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "from sys import stdin\ns, v1, v2, t1, t2 = [int(i) for i in stdin.readline().split(' ')]\n\nwork1 = t1+(s*v1)+t1\nwork2 = t2+(s*v2)+t2\n\nif work1 < work2:\n print(\"First\")\nelif work1 > work2:\n print(\"Second\")\nelse:\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\na=2*(t1)+s*v1\r\nb=2*(t2)+s*v2\r\nif a>b:\r\n\tprint(\"Second\")\r\nelif b>a:\r\n\tprint(\"First\")\r\nelse:\r\n\tprint(\"Friendship\")", "a,b,c,d,e=map(int,input().split())\r\nb=b*a+2*d\r\nc=c*a+2*e\r\nif b>c:\r\n print(\"Second\")\r\nelif b<c:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\ntf = t1 * 2 + s * v1\r\nts = t2 * 2 + s * v2\r\nif tf < ts:\r\n print('First')\r\nif tf > ts:\r\n print('Second')\r\nif tf == ts:\r\n print('Friendship')", "s,a,b,c,d=map(int,input().split())\ne,f=s*a+2*c,s*b+2*d\nprint('First'if e<f else'Second'if f<e else'Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\nx = t1 * 2 + v1 * s\r\ny = t2 * 2 + v2 * s\r\nprint(['First', 'Second', 'Friendship'][(x >= y) + (x == y)])\r\n", "x = [int(i) for i in input().split()]\r\ns, v1, v2, t1, t2 = x[0], x[1], x[2], x[3], x[4]\r\ntime1, time2 = s * v1 + t1 * 2, s * v2 + t2 * 2\r\nif time1 < time2:\r\n print('First')\r\nelif time1 == time2:\r\n print('Friendship')\r\nelse:\r\n print('Second')\r\n", "s,v1,v2,p1,p2=map(int,input().split())\nf=p1*2+v1*s\ns=p2*2+v2*s\nif f<s:\n print(\"First\")\nelif(s<f):\n print(\"Second\")\nelse:\n print(\"Friendship\")", "k = str(input()).split()\r\n\r\nchar = int(k[0])\r\ntime1 = char*int(k[1]) + int(k[3])*2\r\ntime2 = char*int(k[2]) + int(k[4])*2\r\n\r\nif time1 == time2:\r\n print(\"Friendship\")\r\nif time2 > time1:\r\n print(\"First\")\r\nif time1 > time2:\r\n print(\"Second\")", "s,v1,v2,t1,t2 = [int(i) for i in input().split()]\r\nvalue1 = 2*t1+v1*s\r\nvalue2 = 2*t2+v2*s\r\nif value1==value2:\r\n print(\"Friendship\")\r\nelif value1<value2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "s, v1, v2, t1, t2 = map(int,input().split())\r\nif s*v1+2*t1 > s*v2 + 2*t2:\r\n\tprint(\"Second\")\r\nelif(s*v1+2*t1<s*v2+2*t2):\r\n\tprint(\"First\")\r\nelse:\r\n\tprint(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split(' '))\r\nT1 = s * v1 + 2 * t1\r\nT2 = s * v2 + 2 * t2\r\nif T1 < T2:\r\n print('First')\r\nelif T1 == T2:\r\n print('Friendship')\r\nelse:\r\n print('Second')", "s,v1,v2,t1,t2=map(int,input().split())\r\nr1=t1*2+v1*s\r\nr2=t2*2+v2*s\r\nif r1<r2:print('First')\r\nelif r2<r1:print('Second')\r\nelse:\r\n print('Friendship')", "n = input().split()\r\na = int(n[0])\r\nb = int(n[1])\r\nc = int(n[2])\r\nd = int(n[3])\r\ne = int(n[4])\r\n\r\nhasil1 = b*a+d*2\r\nhasil2 = c*a+e*2\r\n\r\nif hasil1 < hasil2:\r\n print(\"First\")\r\nelif hasil1 == hasil2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nres1, res2 = t1*2+s*v1, t2*2+s*v2\r\nprint(\"First\" if res1 < res2 else \"Second\" if res2 < res1 else \"Friendship\")", "n,v1,v2,t1,t2 = [int(x) for x in input().split()]\r\na,b = [(n*v1)+(2*t1),(n*v2)+(2*t2)]\r\nprint(\"First\" if a<b else (\"Second\" if b<a else \"Friendship\"))", "s, v1, v2, t1, t2 = [int(x) for x in input().split()]\r\na = 2 * t1 + v1 * s\r\nb = 2 * t2 + v2 * s\r\nif a < b:\r\n print('First')\r\nelif a > b:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\nq1 = 2 * t1 + s * v1\nq2 = 2 * t2 + s * v2\nif q1 < q2:\n print('First')\nelif q1 > q2:\n print('Second')\nelse:\n print('Friendship')\n \n \t\t \t\t \t \t \t \t\t\t \t \t \t \t", "s, v_1, v_2, t_1, t_2 = map(int,input().split())\r\ntvin_1 = (s*v_1)+(t_1*2)\r\ntvin_2 = (s*v_2)+(t_2*2)\r\nif tvin_1 != tvin_2:\r\n if tvin_1 < tvin_2:\r\n print('First')\r\n else:\r\n print('Second')\r\nif tvin_1 == tvin_2:\r\n print('Friendship')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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, v1, v2, t1, t2 = map(int,input().split())\r\na = s*v1 + 2*t1\r\nb = s*v2 + 2*t2\r\nprint('Second' if a > b else 'Friendship' if a == b else 'First')\r\n\r\n\r\n'''''''''1 5 3 2\r\ns=5/v1=1/v2=2/t1=1/t2=2/\r\na = 5+2\r\nb = 10+4\r\nb>a\r\n\r\n11221\r\n1[0]-5[1]-3[2]-2[3]\r\n1+1+2+\r\n11x4i\r\nxxiixxiixx\r\n\r\na = int(input())\r\nfor i in range(a):\r\n b = int(input())\r\n c = list(map(int, input().split()))\r\n if b*max(c)-sum(c) == 0:\r\n print(max(c))\r\n else:print(b*max(c)-sum(c)-b)'''''''''", "s, v1, v2, t1, t2 = map(int, input().split())\r\nFirst, Second = 2*t1+s*v1, 2*t2+s*v2\r\nprint(['First','Second','Friendship'][[First<Second, Second<First, Second==First].index(True)])", "s,v1,v2,t1,t2=map(int,input().split())\r\nif (v1*s+2*t1) < (v2*s+2*t2):\r\n print(\"First\")\r\nelif (v1*s+2*t1) > (v2*s+2*t2):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nz1=s*v1+2*t1\r\nz2=s*v2+2*t2\r\nif z1>z2:\r\n print(\"Second\")\r\nelif z2>z1:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "##print('Введите длину текста, скорость набора текста для первого и второго участников, а также пинг первого и второго участников')\r\ns,v1,v2,t1,t2 = map(int,input().split())\r\n\r\np1 = 2*t1 + s*v1\r\np2 = 2*t2 + s*v2\r\n\r\nif p1<p2:\r\n print('First')\r\nelif p2<p1:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "a = list(map(int,input().split()))\r\np1 = a[0]*a[1]+a[3]*2\r\np2 = a[0]*a[2]+a[4]*2\r\nif p1<p2:\r\n print('First')\r\nif p1>p2:\r\n print('Second')\r\nif p1==p2:\r\n print('Friendship')", "a=input().split()\r\nif int(a[3])*2+int(a[0])*int(a[1])<int(a[4])*2+int(a[0])*int(a[2]):\r\n print('First')\r\nelif int(a[3])*2+int(a[0])*int(a[1])>int(a[4])*2+int(a[0])*int(a[2]):\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\nc1 = (s * v1) + t1 * 2\r\nc2 = (s * v2) + t2 * 2\r\nif c1 < c2:\r\n print('First')\r\nelif c2 < c1:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "a,v1,v2,t1,t2 = map(int,input().split())\r\nf,s = a*v1+2*t1,a*v2+2*t2\r\nprint('First' if f<s else 'Second' if s<f else 'Friendship')", "'''\r\n\tCodeForces 835A\r\n\tKey races\r\n\r\n\tTags: Ad-hoc, Math\r\n'''\r\ndef tripleCond(L, R, s1 = '', s2 = '', s3 = ''):\r\n\tif L < R:\r\n\t\treturn s1\r\n\tif L > R:\r\n\t\treturn s2\r\n\treturn s3\r\n\r\ns, v1, v2, t1, t2 = tuple(map(int, input().split()))\r\nans = tripleCond(s * v1 + t1 * 2, s * v2 + t2 * 2, 'First', 'Second', 'Friendship')\r\n\r\nprint(ans)", "s, v1, v2, t1, t2 = map(int, input().split())\r\np1 = t1 + s * v1 + t1\r\np2 = t2 + s * v2 + t2\r\nif p1 == p2:\r\n print('Friendship')\r\nelse:\r\n if p1 < p2:\r\n print('First')\r\n else:\r\n print('Second')", "s,v1,v2,t1,t2 = map(int, input().split())\r\n\r\ntime1 = 2*t1+v1*s\r\ntime2 = 2*t2+v2*s\r\nif time1 > time2:\r\n print (\"Second\")\r\nelif time1 < time2:\r\n print (\"First\")\r\nelse:\r\n print (\"Friendship\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nt1 = (s * v1) + t1 * 2\r\nt2 = (s * v2) + t2 * 2\r\n\r\nif t1 < t2:\r\n print('First')\r\nelif t1 > t2:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "t, sk_1, sk_2, pin_1,pin_2 = map(int,input().split())\r\nf_1 = sk_1 * t + pin_1 * 2 \r\nf_2 = sk_2 * t + pin_2 * 2 \r\nif f_1 > f_2:\r\n print(\"Second\")\r\nelif f_1 < f_2:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,p1,p2 = map(int,input().split(\" \"))\r\nif ((s*v1)+(2*p1)) == ((s*v2)+(2*p2)):\r\n print(\"Friendship\")\r\nelif ((s*v1)+(2*p1)) > ((s*v2)+(2*p2)):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nt1=t1+t1+v1*s\r\nt2=t2+t2+v2*s\r\nif t1>t2:\r\n print(\"Second\")\r\nelif t1<t2:\r\n print(\"First\")\r\nelse :\r\n print(\"Friendship\")", "n = [int(i) for i in input().split()]\r\nn1 = (n[0]*n[1])+(n[3]*2)\r\nn2 = (n[0]*n[2])+(n[4]*2)\r\nif n1 < n2:\r\n print('First')\r\nelif n2 < n1:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2 = map(int, input().split())\r\n\r\nfrst = (2*t1)+(s*v1)\r\nscnd = (2*t2)+(s*v2)\r\n\r\nif frst<scnd:\r\n\tprint(\"First\")\r\nelif frst>scnd:\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"Friendship\")", "s=list(map(int,input().split()))\r\na=s[0]*s[1]+2*s[3]\r\nb=s[0]*s[2]+2*s[4]\r\nif a<b:\r\n\tprint(\"First\")\r\nelif a==b:\r\n\tprint(\"Friendship\")\r\nelse:\r\n\tprint(\"Second\")", "if(__name__=='__main__'):\r\n s,v1,v2,t1,t2=map(int,input().split())\r\n time1=(s*v1)+2*t1\r\n time2=(s*v2)+2*t2\r\n if(time1<time2):\r\n print(\"First\")\r\n elif(time1>time2):\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")\r\n", "if __name__ == '__main__':\r\n\ts,v1,v2,t1,t2 = tuple(map(int,input().strip(\" \").split(\" \")))\r\n\tfirst = t1+s*v1+t1\r\n\tsecond = t2+s*v2+t2\r\n\t# print(first,second)\r\n\tif first<second:\r\n\t\tprint(\"First\")\r\n\telif second<first:\r\n\t\tprint(\"Second\")\r\n\telse:\r\n\t\tprint(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nq1=2*t1+s*v1\r\nq2=2*t2+s*v2\r\nif(q1>q2):\r\n print(\"Second\")\r\nelif(q2>q1):\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "n = [int(i) for i in input().split()]\r\n\r\n\r\nif (n[1]*n[0]+2*n[3]) < (n[2]*n[0]+2*n[4]):\r\n\tprint(\"First\")\r\nelif (n[1]*n[0]+2*n[3]) > (n[2]*n[0]+2*n[4]):\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"Friendship\")", "q, w, e, r, t = map(int, input().split()) \r\nprint(\"First\" if (((q * w) + r + r) < (q * e) + t + t) else \"Second\" if (\r\n ((q * w) + r + r) > (q * e) + t + t) else \"Friendship\")\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nfir=s*v1+t1*2\r\nsec=s*v2+t2*2\r\nif fir<sec:print(\"First\")\r\nelif fir>sec:print(\"Second\")\r\nelse:print(\"Friendship\")", "#!/usr/bin/env python3\ns, v1, v2, t1, t2 = [int(i) for i in input().split(\" \")]\nif s*v1+2*t1 < s*v2+2*t2:\n print(\"First\")\nelif s*v1+2*t1 > s*v2+2*t2:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\n\r\ntime1 = 0\r\ntime2 = 0\r\n\r\ntime1 += t1\r\ntime2 += t2\r\n\r\ntime1 += s * v1\r\ntime2 += s * v2\r\n\r\ntime1 += t1\r\ntime2 += t2\r\n\r\nif time1 < time2:\r\n print(\"First\")\r\nelif time2 < time1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,a,b,t1,t2=map(int,input().split())\r\ns1=s*a+2*t1\r\ns2=s*b+2*t2\r\nif(s1>s2):\r\n print(\"Second\")\r\nelif(s2>s1):\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "l1=[int(i) for i in input().split()]\r\ns=l1[0]\r\nv1=l1[1]\r\nv2=l1[2]\r\nt1=l1[-2]\r\nt2=l1[-1]\r\ntt1=(s*v1)+(2*t1)\r\ntt2=(s*v2)+(2*t2)\r\nif tt1>tt2:\r\n print(\"Second\")\r\nelif tt1==tt2:\r\n print(\"Friendship\")\r\nelse :\r\n print(\"First\")", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\ndef test_case(casen):\r\n s, v1, v2, t1, t2 = map(int, input().split())\r\n first = v1 * s + 2*t1\r\n second = v2 * s + 2*t2\r\n if first == second:\r\n return \"Friendship\"\r\n if first < second:\r\n return \"First\"\r\n return \"Second\"\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s,v1,v2,t1,t2=input().split()\r\ns,v1,v2,t1,t2=int(s),int(v1),int(v2),int(t1),int(t2)\r\ntt1=(2*t1)+(v1*s)\r\ntt2=(2*t2)+(v2*s)\r\nif tt1<tt2:\r\n print(\"First\")\r\nelif tt1>tt2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "a = input().split()\r\ns = int(a[0])\r\nv1 = int(a[1])\r\nv2 = int(a[2])\r\nt1 = int(a[3])\r\nt2 = int(a[4])\r\nx1 = 2 * t1 + s * v1\r\nx2 = 2 * t2 + s * v2\r\nif x1 < x2:\r\n print(\"First\")\r\nif x1 > x2:\r\n print(\"Second\")\r\nif x1 == x2:\r\n print(\"Friendship\")\r\n", "\ns,v1,v2,t1,t2=map(int, input().split())\n\nif t1+s*v1+t1>t2+s*v2+t2:\n print('Second')\nif t1+s*v1+t1<t2+s*v2+t2:\n print('First')\nif t1+s*v1+t1==t2+s*v2+t2:\n print('Friendship')\n\n\n\n\n #map(int, input().split())", "#from collections import defaultdict\r\n#from colections import Counter\r\ndef solution():\r\n s,v1,v2,t1,t2 = map(int,input().split())\r\n #print(2*t1+s*v1 , 2*t2+s*v2)\r\n if 2*t1+s*v1 > 2*t2+s*v2:\r\n print('Second')\r\n elif 2*t1+s*v1 < 2*t2+s*v2:\r\n print('First')\r\n else:\r\n print('Friendship')\r\nif __name__=='__main__':\r\n solution()", "s,a,b,c,d=map(int,input().split())\r\ne=s*a+2*c\r\nf=s*b+2*d\r\nprint('First'if e<f else'Second'if f<e else'Friendship')", "num = [*map(int,input().split())]\r\nword= ['Second', 'First']\r\nprint('Friendship' if num[0]*num[1]+num[3]*2 == num[0]*num[2]+num[4]*2 else word[int(num[0]*num[1]+num[3]*2 < num[0]*num[2]+num[4]*2)])", "a,b,c,d,e=map(int,input().split())\r\nx=2*d+a*b\r\ny=2*e+a*c\r\nif(x<y):\r\n\tprint(\"First\")\r\nelif(x>y):\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"Friendship\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nc1 = s * v1\r\nc2 = s * v2\r\nr1 = c1 + t1 * 2\r\nr2 = c2 + t2 * 2\r\nif r1 < r2:\r\n print('First')\r\nelse:\r\n if r1 == r2:\r\n print('Friendship')\r\n else:\r\n print('Second')", "s,a,b,c,d=map(int,input().split())\r\ne,f=s*a+2*c,s*b+2*d\r\nprint('First'if e<f else'Second'if f<e else'Friendship')", "s,a,b,c,d=map(int,input().split())\r\nprint('Friendship' if a*s+c*2==b*s+d*2 else ['First','Second'][a*s+c*2>b*s+d*2])", "n,v1,v2,t1,t2=[int(w) for w in input().split()]\r\na=n*v1+2*t1\r\nb=n*v2+2*t2\r\nif a<b:\r\n print('First')\r\nelif a>b:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=input().split()\r\ns=int(s)\r\nv1=int(v1)\r\nv2=int(v2)\r\nt1=int(t1)\r\nt2=int(t2)\r\n\r\nfirst=2*t1+s*v1\r\nsecond=2*t2+s*v2\r\n\r\nif first<second:\r\n print(\"First\")\r\nelif second<first:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,v1,v2,t1,t2=map(int,input().split(' '))\r\nk1=s*v1+t1*2\r\nk2=s*v2+t2*2\r\nif k1<k2:\r\n\tprint('First')\r\nelif k1>k2:\r\n\tprint('Second')\r\nelse:\r\n\tprint('Friendship')", "s,v1,v2,t1,t2=map(int,input().split())\nx=2*t1+s*v1\ny=2*t2+s*v2\nif x>y:\n\tprint(\"Second\")\nelif x<y:\n\tprint(\"First\")\nelse:\n\tprint(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nres1=s*v1+t1+t1\r\nres2=s*v2+t2+t2\r\nif res1<res2:\r\n print('First')\r\nelif res1==res2:\r\n print('Friendship')\r\nelif res2<res1:\r\n print('Second')", "s,v1,v2,t1,t2=map(int,input().split())\r\nv1=(s*v1)+(t1*2)\r\nv2=(s*v2)+(t2*2)\r\nprint(\"First\" if v1<v2 else( \"Second\" if v1>v2 else \"Friendship\"))\r\n", "a, b, c, d, e = map(int, input().split())\r\nx1 = a * b + d * 2\r\nx2 = a * c + e * 2\r\nif x1 == x2:\r\n print('Friendship')\r\nelif x1 < x2:\r\n print('First')\r\nelse:\r\n print('Second')", "s,v1,v2,t1,t2=map(int,input().split())\nvr1=0\nvr2=0\nvr1=s*v1\nvr2=s*v2\nvr1=vr1+(2*t1)\nvr2=vr2+(2*t2)\nif vr1<vr2:\n print('First')\nelif vr2<vr1:\n print('Second')\nelif vr1==vr2:\n print('Friendship')\n \n\n\t \t \t \t \t\t \t\t \t \t \t", "s,v1,v2,t1,t2 = input().split()\r\n \r\ns = int(s)\r\n \r\nv1 = int(v1)\r\n \r\nv2 = int(v2)\r\n \r\nt1 = int(t1)\r\n \r\nt2 = int(t2)\r\n \r\npl1 = (2*t1)+(s*v1)\r\n \r\npl2 = (2*t2)+(s*v2)\r\n \r\nif pl1==pl2:\r\n print('Friendship')\r\nelif pl1<pl2:\r\n print('First')\r\nelif pl1>pl2:\r\n print('Second')", "s, v1, v2, t1, t2 = (input().split())\r\n\r\ns = int(s)\r\nv1 = int(v1)\r\nv2 = int(v2)\r\nt1 = int(t1)\r\nt2 = int(t2)\r\nif s * v1 + t1 + t1 < s * v2 + t2 + t2:\r\n print(\"First\")\r\nelif s * v1 + t1 + t1 > s * v2 + t2 + t2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\n\r\na = v1 * s + 2 * t1\r\n\r\nb = v2 * s + 2 * t2\r\n\r\nif b > a:\r\n print('First')\r\nelif b < a:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\na1 = s * v1\r\na2 = s * v2\r\nb1 = t1 * 2\r\nb2 = t2 * 2\r\nc1 = a1 + b1\r\nc2 = a2 + b2\r\nif c1 < c2:\r\n print('First')\r\nelse:\r\n if c1 == c2:\r\n print('Friendship')\r\n else:\r\n print('Second')", "s,v1,v2,t1,t2=map(int,input().split())\r\n\r\nx = s*v1+2*t1\r\ny = s*v2+2*t2\r\n\r\nif(x<y):\r\n print(\"First\")\r\nelif(y<x):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nif (s*v1)+(2*t1) < (s*v2)+(2*t2):\r\n print(\"First\")\r\nelif (s*v1)+(2*t1) == (s*v2)+(2*t2):\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")", "s,v1,v2,t1,t2 = map(int, input().split())\r\na = t1*2 + v1*s\r\nb = t2*2 + v2*s\r\nif a > b:\r\n print('Second')\r\nelif a < b:\r\n print('First')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=map(int, input().split())\r\na=(2*t1)+(v1*s)\r\nb=(2*t2)+(v2*s)\r\nif a<b:\r\n print(\"First\")\r\nelif a>b:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "temp = [int(x) for x in input().split()]\r\ns = temp[0]\r\nv1 = temp[1]\r\nv2 = temp[2]\r\nt1 = temp[3]\r\nt2 = temp[4]\r\nx = t1 + s*v1 + t1\r\ny = t2 + s*v2 + t2\r\nif x<y:\r\n print('First')\r\nelif x>y:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "# coding: utf - 8\r\n'''\r\nЗадача на тип данных и перевод одного типа данных в другой,\r\nа так же на сравнение, математические операции и работа со строками,\r\nусловыные операторы\r\n'''\r\n\r\nsymbol_in_text, speed_1, speed_2, ping_1, ping_2 = input().split()\r\n\r\nsymbol_in_text = int (symbol_in_text)\r\nspeed_1 = int (speed_1)\r\nspeed_2 = int (speed_2)\r\nping_1 = int (ping_1)\r\nping_2 = int (ping_2)\r\n\r\ntime_1 = symbol_in_text * speed_1 + ping_1 * 2\r\ntime_2 = symbol_in_text * speed_2 + ping_2 * 2\r\n\r\nif time_1 < time_2:\r\n print ('First')\r\n \r\nelif time_1 > time_2:\r\n print ('Second')\r\n\r\nelse:\r\n print ('Friendship')", "s, v1, v2, t1, t2 = map(int,input().split())\r\nif 1<=s<=1000 and 1<=v1<=1000 and 1<=v2<=1000 and 1<=t1<=1000 and 1<=t2<=1000 :\r\n if (2*t1 + (s*v1)) < (2*t2 + (s*v2)) :\r\n print(\"First\")\r\n elif (2*t1 + (s*v1)) > (2*t2 + (s*v2)) :\r\n print(\"Second\")\r\n else :\r\n print(\"Friendship\")\r\n", "# A. Key races\r\ns,v1,v2,t1,t2=map(int,(input().split()))\r\nif v1*s+2*t1<v2*s+2*t2:\r\n print(\"First\")\r\nelif v1*s+2*t1>v2*s+2*t2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "l = input().split()\r\n\r\ns = int(l[0])\r\nv1 = int(l[1])\r\nv2 = int(l[2])\r\nt1 = int(l[3])\r\nt2 = int(l[4])\r\n\r\ntime1 = s*v1+2*t1 \r\ntime2 = s*v2+2*t2\r\n\r\nif time1<time2:\r\n\tprint(\"First\")\r\nelif time1>time2:\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"Friendship\")", "x=input()\r\nx=x.split()\r\nfor i in range(len(x)): x[i]=int(x[i])\r\na=x[1]*x[0]+2*x[3]\r\nb=x[2]*x[0]+2*x[4]\r\nif a<b: print(\"First\")\r\nelif a>b: print(\"Second\")\r\nelse: print(\"Friendship\")\r\n", "s,v1,v2,t1,t2 = map(int,input().split())\r\ntim1 = s*(v1) + 2*t1\r\ntim2 = s*v2 + 2*t2\r\nif tim1>tim2:\r\n print(\"Second\")\r\nelif tim1<tim2:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n ", "a,b,c,d,e = map(int, input().split())\r\nr=a*(c-b)+2*(e -d)\r\nprint('First' if r>0 else 'Second' if r<0 else 'Friendship')\r\n", "\r\nx = [int(x) for x in input().split()]\r\n\r\nfirst = x[0] * x[1] + 2 * x[3]\r\nsecond = x[0] * x[2] + 2 * x[4]\r\n\r\nif first > second:\r\n print('Second')\r\nelif first < second:\r\n print('First')\r\nelif first == second:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\nf = v1 * s + t1 * 2\r\ns = v2 * s + t2 * 2\r\nif f == s:\r\n print(\"Friendship\")\r\nelif f < s:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s, v1, v2, t1, t2=map(int,input().split())\r\nsum1=t1+v1*s+t1\r\nsum2=t2+v2*s+t2\r\n\r\nif sum1<sum2:\r\n print('First')\r\nelif sum2<sum1:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "l=list(map(int,input().split()))\r\nt1=l[0]*l[1]+2*l[3]\r\nt2=l[0]*l[2]+2*l[4]\r\nif t1>t2:\r\n print(\"Second\")\r\nelif t1<t2:\r\n print('First')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\nf = t1 * 2 + v1 * s\r\ns = t2 * 2 + v2 * s\r\nif f < s:\r\n print(\"First\")\r\nelif s < f:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "n, v1, v2, t1, t2 = map(int, input().split())\r\nif n*v1+2*t1>n*v2+2*t2: print('Second')\r\nelif n*v1+2*t1<n*v2+2*t2: print('First')\r\nelse: print('Friendship')\r\n", "import math\r\ns,v1,v2,t1,t2=input().split()\r\nif (int(s)*(int (v1))+2*(int (t1)))==(int(s)*(int (v2))+2*(int (t2))):\r\n print(\"Friendship\")\r\nelif (int(s)*(int (v1))+2*(int (t1)))<(int(s)*(int (v2))+2*(int (t2))): \r\n print(\"First\")\r\nelse :\r\n print(\"Second\") \r\n", "s, v1, v2, t1, t2 = map(int, input().split(' '))\r\ntime1 = 2*t1+v1*s\r\ntime2 = 2*t2+v2*s\r\nif time1<time2:\r\n print('First')\r\nelif time1>time2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\nans1 = 2 * t1 + s * v1\r\nans2 = 2 * t2 + s * v2\r\nif ans1 < ans2:\r\n print('First')\r\nelif ans1 > ans2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=map(int,input().split(\" \"))\r\nfirst=s*v1+2*t1\r\nsecond=s*v2+2*t2\r\nif(second<first):\r\n print(\"Second\")\r\nif (first<second):\r\n print(\"First\") \r\nif(first==second):\r\n print(\"Friendship\") ", "s, v1, v2, t1, t2 = map(int, input().split())\r\nx1 = s*v1 + 2*t1\r\nx2 = s*v2 + 2*t2\r\nif x1 < x2:\r\n print(\"First\")\r\nelif x2 < x1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "a,b,c,d,e=map(int,input().split())\r\nq=b*a+2*d\r\nw=c*a+2*e\r\nif q<w:\r\n print(\"First\")\r\nelif q>w:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "a=list(map(int, input().split()))\r\na1=(a[0]*a[1])+(2*a[3])\r\na2=(a[0]*a[2])+(2*a[4])\r\nif a1==a2:\r\n print('Friendship')\r\nelif a1<a2:\r\n print('First')\r\nelse:\r\n print('Second')", "a,b,c,d,e=map(int,input().split())\r\nz=a*b+d*2>a*c+e*2\r\nprint('Second' if z else 'Friendship' if a*b+d*2==a*c+e*2 else 'First')", "s, v1, v2, t1, t2 = map(int, input().split())\r\nif (v1 * s) + (t1*2) < (v2 * s) + (t2*2):\r\n print('First')\r\nelif (v1 * s) + (t1*2) > (v2 * s) + (t2*2):\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nx1 = s * v1 + 2 * t1\r\nx2 = s * v2 + 2 * t2\r\n\r\nif x1 < x2:\r\n print('First')\r\nelse:\r\n if x1 > x2:\r\n print('Second')\r\n else:\r\n print('Friendship')\r\n \r\n", "a, b, c, d, e = map(int,input().split())\r\nayam = (a*b)+(2*d)\r\nayem = (a*c)+(2*e)\r\nif ayam==ayem:\r\n print(\"Friendship\")\r\nelif ayam<ayem:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nf1, f2 = v1 * s + t1 * 2, v2 * s + t2 * 2\r\nif f1 < f2:\r\n print('First')\r\nelif f1 > f2:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "a,b,c,d,e=map(int,input().split())\r\nf=b*a+d*2\r\ng=c*a+e*2\r\nif f==g:\r\n print('Friendship')\r\nelse:\r\n if f>g:\r\n print('Second')\r\n else:\r\n print('First')\r\n", "a, b, c ,d, e = map(int, input().split())\r\nFirst = (a*b) + (2*d)\r\nSecond = (a*c) + (2*e)\r\nif First > Second:\r\n print(\"Second\")\r\nelif First < Second :\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "n=list (map(int,input().split()))\r\na=n[0]*n[1]+2*n[3]\r\nb=n[0]*n[2]+2*n[4]\r\nif a<b:\r\n\tprint(\"First\")\r\nif b<a:\r\n\tprint(\"Second\")\r\nif b==a:\r\n\tprint(\"Friendship\")", "s,v1,v2,t1,t2 = map(int,input().split())\r\nfirst = t1*2 + v1*s\r\nsecond = t2*2 + v2*s\r\nif(first<second):\r\n\tprint(\"First\")\r\nelif(second<first):\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"Friendship\")\r\n", "a= list(map(int,input().split()))\r\nimport math\r\nb=[]\r\nif a[0]*a[1]+2*a[3]< a[0]*a[2]+2*a[4]:print(\"First\")\r\nif a[0]*a[1]+2*a[3]> a[0]*a[2]+2*a[4]:print(\"Second\")\r\nif a[0]*a[1]+2*a[3]== a[0]*a[2]+2*a[4]:print(\"Friendship\")\r\n", "def key_races(s, v1, v2, t1, t2):\n first = (s * v1) + (t1 * 2)\n second = (s * v2) + (t2 * 2)\n if first > second:\n return \"Second\"\n elif first < second:\n return \"First\"\n else:\n return \"Friendship\" \n\n\nif __name__ == \"__main__\":\n li = [int(i) for i in input().strip().split()]\n s = li[0]\n v1 = li[1]\n v2 = li[2]\n t1 = li[3]\n t2 = li[4]\n print(key_races(s, v1, v2, t1, t2)) \n \t \t\t\t \t \t \t\t \t\t\t \t", "s, v1, v2, t1, t2 = map(int, input().split())\n\nfirst = s*(v1) + 2*t1\nsecond = s*(v2) + 2*t2\n\nif first > second: print('Second')\nelif second > first: print('First')\nelse: print('Friendship')", "s,v1,v2,t1,t2 = map(int,input().split())\r\nif(2*t1+v1*s>2*t2+v2*s):\r\n print(\"Second\")\r\nelif(2*t1+v1*s==2*t2+v2*s):\r\n print(\"Friendship\")\r\nelse:\r\n print(\"First\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nallTime1 = (s*v1) + 2*t1\r\nallTime2 = (s*v2) + 2*t2\r\n\r\nif allTime1 < allTime2:\r\n print('First')\r\nelse:\r\n if allTime1 > allTime2:\r\n print('Second')\r\n else:\r\n print('Friendship')", "s,v1,v2,t1,t2 = map(int, input().split())\r\nf = t1*2 + s*v1\r\nse = s*v2 + t2*2\r\nif f == se:\r\n print(\"Friendship\")\r\nelse:\r\n m = min(f, se)\r\n if m == f:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n \r\n", "def solve(test):\r\n s, v1, v2, t1, t2 = map(int, input().split())\r\n ans = 0\r\n if 2 * t1 + s * v1 < 2 * t2 + s * v2:\r\n ans = 1\r\n elif 2 * t1 + s * v1 > 2 * t2 + s * v2:\r\n ans = 2\r\n print('First' if ans == 1 else ('Second' if ans == 2 else 'Friendship'))\r\nt = 1\r\n#t = int(input())\r\nfor _ in range(t):\r\n solve(_ + 1)", "a=input()\r\nb=[int(x) for x in a.split()]\r\np1=0+(b[1]*b[0])+(b[3]*2)\r\np2=0+(b[2]*b[0])+(b[4]*2)\r\nif p1>p2:\r\n print(\"Second\")\r\nelif p2>p1:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n \r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\ntime_1 = (t1 * 2) + (s*v1)\r\ntime_2 = (t2 * 2) + (s*v2)\r\nif time_1 > time_2:\r\n print(\"Second\")\r\nelif time_2 > time_1:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "n = input().split()\r\n\r\ns = int(n[0])\r\nv1 = int(n[1])\r\nv2 = int(n[2])\r\nt1 = int(n[3])\r\nt2 = int(n[4])\r\n\r\nif(s*v1 + 2*t1) < (s*v2 + 2*t2):\r\n print('First')\r\nelif (s*v1 + 2*t1) > (s*v2 + 2*t2):\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nif (v1*s + t1 *2) < (v2 * s + t2 * 2):print('First' )\r\nelif (v1*s + t1 *2) > (v2 * s + t2 * 2): print(\"Second\")\r\nelse:print('Friendship')", "s,v1,v2,t1,t2=map(int,input().split())\r\nn1=s*v1+t1*2\r\nn2=s*v2+t2*2\r\nif n1<n2:\r\n print('First')\r\nelif n1>n2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=map(int,input().split());p1=s*v1+2*t1;p2=s*v2+2*t2\r\nif p1==p2:print('Friendship')\r\nelif min(p1,p2)==p1:print('First')\r\nelse:print('Second')", "s,v1,v2,t1,t2=map(int,input().split())\nx=s*v1+2*t1\ny=s*v2+2*t2\nif x<y:\n print(\"First\")\nelif y==x:\n print(\"Friendship\")\nelse:\n print(\"Second\")", "l = [int(i) for i in input().split()]\r\na = 2*l[3]+l[1]*l[0]\r\nb = 2*l[4]+l[2]*l[0]\r\nif a > b :\r\n print(\"Second\")\r\nelif a < b :\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n ", "s,v1,v2,t1,t2=map(int,input().split())\n\n# p1,p2 represents the time it takes to recieve info on success \np1 = s*v1+2*t1\np2 = s*v2+2*t2\n\nif p1==p2: print(\"Friendship\")\nelif p1<p2: print(\"First\")\nelse: print(\"Second\")", "s, v1, v2, t1, t2=list(map(int, input().split()))\r\nn1=t1+s*v1+t1\r\nn2=t2+s*v2+t2\r\nif n1<n2: print(\"First\")\r\nelif n1>n2: print(\"Second\")\r\nelse: print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\ntime1 = v1*s + 2*t1\r\ntime2 = v2*s + 2*t2\r\n\r\nif time1 < time2:\r\n print(\"First\")\r\nelif time1 == time2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")", "# oskwariusz\r\n# A835. Key races\r\n\r\nprint([\"Friendship\", \"Second\", \"First\"][(lambda x: -1 if x < 0 else 1 if x > 0 else 0)((lambda s, v1, v2, t1, t2: (2 * t1 + s * v1) - (2 * t2 + s * v2))(*[int(x) for x in input().split()]))])\r\n", "a=input().split()\na=list(map(int,a))\n\na1=a[0]*a[1]+2*a[3]\na2=a[0]*a[2]+2*a[4]\n\nif a1==a2:\n print(\"Friendship\")\nelif a1<a2:\n print(\"First\")\nelse:\n print(\"Second\")\n", "s,v1,v2,t1,t2 = map(int, input().split())\r\n\r\np1 = s*v1+2*t1\r\np2 = s*v2+2*t2\r\n\r\nif(p1<p2):\r\n print(\"First\")\r\nelif(p2<p1):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "def time(s,v,t):\r\n\ttimes=(2*t)+(s*v)\r\n\treturn times\r\ndata=input().split()\r\ns=int(data[0])\r\nv1=int(data[1])\r\nv2=int(data[2])\r\nt1=int(data[3])\r\nt2=int(data[4])\r\ntime1=time(s,v1,t1)\r\ntime2=time(s,v2,t2)\r\nif time1<time2:\r\n\tprint(\"First\")\r\nelif time1>time2:\r\n\tprint(\"Second\")\r\nelif time1==time2:\r\n\tprint(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nk1=s*v1+2*t1\r\nk2=s*v2+2*t2\r\nif k1==k2:\r\n\tprint('Friendship')\r\nelse:\r\n\tprint('First' if k1<k2 else 'Second' )", "s = [int(x) for x in input().split()]\r\na,b = s[0]*s[1]+s[3]*2,s[0]*s[2]+s[4]*2\r\nprint(\"Friendship\" if a == b else \"First\" if a < b else \"Second\")", "s,v1,v2,t1,t2 = map(int, input().split())\r\n\r\nw1 = s*v1 + 2*t1\r\nw2 = s*v2 + 2*t2\r\n\r\nif w1 < w2:\r\n print ('First')\r\nelif w2 < w1:\r\n print ('Second')\r\nelse:\r\n print('Friendship')", "s,u,v,t,c=map(int,input().split())\r\nif (s*u +2*t) < (s*v +2*c):\r\n\tprint('First')\r\nelif (s*u +2*t) > (s*v +2*c):\r\n\tprint('Second')\r\nelse:\r\n\tprint('Friendship')", "s, v1, v2, t1, t2 = list(map(int, input().split(\" \")))\r\n\r\np1 = 2 * t1 + s * v1\r\np2 = 2 * t2 + s * v2\r\n\r\nif p1 < p2:\r\n print(\"First\")\r\nelif p1 == p2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")\r\n", "[s, v1, v2, t1, t2] = list(map(int, input().split(\" \")))\nx1 = t1*2 + v1*s\nx2 = t2*2 + v2*s\nprint(\"Friendship\" if x1 == x2 else (\"First\" if x1 < x2 else \"Second\"))\n", "s,v1,v2,t1,t2 = map (int, input().split())\r\nif 2*t1+s*v1 == 2*t2+s*v2:\r\n print('Friendship')\r\nelif 2*t1+s*v1 < 2*t2+s*v2:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "inp = [int(p) for p in input().split()]\r\nfirst = inp[1]*inp[0] + inp[3]*2\r\nsecond = inp[2]*inp[0] + inp[4]*2\r\nif first < second:\r\n print ('First')\r\nelif first > second:\r\n print ('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=map(int,input().split(\" \"))\r\nfirst=(s*v1+2*t1)\r\nsecond=(s*v2+2*t2)\r\nif(first<second):\r\n print(\"First\")\r\nelif(second<first):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "a,b,c,d,e=map(int,input().split())\r\nf=d+(b*a)+d\r\ng=e+(c*a)+e\r\nif f<g:\r\n print('First')\r\nelif g<f:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s = list(map(int,input().split()))\r\na = s[0]*s[1] + 2*s[3]\r\nb = s[0]*s[2] + 2*s[4]\r\nif(a<b):\r\n print(\"First\")\r\nelif(b<a):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nif (((2*t1)+(s*v1))>((2*t2)+(s*v2))):\r\n print(\"Second\")\r\nelif (((2*t2)+(s*v2))>((2*t1)+(s*v1))):\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,v1,v2,t1,t2 = map(int,input().split())\r\ntime1 = t1 + (v1 * s) + t1\r\ntime2 = t2 + (v2 * s) + t2\r\nif time1<time2:print(\"First\")\r\nelif time1>time2:print(\"Second\")\r\nelse: print(\"Friendship\")", "s,v1,v2,t1,t2=input().split(\" \")\r\ns=int(s)\r\nv1=int(v1)\r\nv2=int(v2)\r\nt1=int(t1)\r\nt2=int(t2)\r\nr1=(s*v1)+(2*t1)\r\nr2=(s*v2)+(2*t2)\r\nif(r1<r2):\r\n print(\"First\")\r\nelif(r1>r2):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n\r\n", "a,b,c,d,e = map(int,input().split())\r\nif a*b + 2*d < a*c + 2*e:\r\n\r\n\tprint(\"First\")\r\nelif a*b + 2*d > a*c + 2*e:\r\n\t# print(a*b + 2*d,a*c + 2*e)\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"Friendship\")", "s , v1 ,v2 , t1 , t2 = map(int,input().strip().split())\r\nl = (v1 - v2)*s + (t1 - t2)*2\r\nif l > 0:\r\n ans = \"Second\"\r\nelif l < 0:\r\n ans = \"First\"\r\nelse:\r\n ans = \"Friendship\"\r\nprint(ans)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/835/A\r\n\r\ns, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nprint(\"First\" if s * v1 + 2* t1 < s * v2 + 2 * t2 else (\"Second\" if s * v1 + 2 * t1 != s * v2 + 2 * t2 else \"Friendship\"))", "s,v1,v2,t1,t2=map(int,input().split())\r\np1=2*t1+s*v1\r\np2=2*t2+s*v2\r\nif p1==p2:\r\n print(\"Friendship\")\r\nelif p1<p2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "from sys import stdin\r\n_input = stdin.readline\r\n_int = int\r\ndef solution():\r\n s,v,v_2,t, t_2 = [_int(i) for i in _input().split()]\r\n spead_1 = s*v + 2*t\r\n spead_2 = s*v_2 + 2*t_2\r\n if spead_1 == spead_2:\r\n print(\"Friendship\")\r\n elif spead_1 < spead_2:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\nsolution()", "\r\na,b,c,d,e=map(int,input().split())\r\nf=a*b+2*d\r\ng=a*c+2*e\r\nif f<g:print('First')\r\nelif f>g:print('Second')\r\nelse:print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\ntime1 = s * v1 + (t1 * 2)\ntime2 = s * v2 + (t2 * 2)\nif time1 < time2:\n print(\"First\")\nelif time1 > time2:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n\n", "s, v1, v2, t1, t2 = map(int,input().split(\" \"))\r\nb1 = t1 + v1 * s + t1\r\nb2 = t2 + v2 * s + t2\r\nif b1 == b2:\r\n print(\"Friendship\")\r\nelif b1 > b2:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "t1=1\r\nfor _ in range(t1):\r\n s,v,v1,t,t1=map(int,input().split())\r\n p=(t*2)+(v*s);l=(t1*2)+(v1*s)\r\n if p<l:\r\n print('First')\r\n elif p>l:\r\n print('Second')\r\n else:\r\n print('Friendship')\r\n", "string, f_s, s_s, f_d, s_d = map(int, input().split())\n\nfirst = 2* f_d + string * f_s\nsecond = 2* s_d + string * s_s\n\nif first < second:\n print('First')\nelif second < first:\n print('Second')\nelse:\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\nprint('First' if s*v1 + 2*t1 < s*v2 + 2*t2 else 'Second' if s*v1 + 2*t1 > s*v2 + 2*t2 else 'Friendship')\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nif v1*s+t1*2<v2*s+t2*2:\r\n print('First')\r\nelse:\r\n if v1*s+t1*2==v2*s+t2*2:\r\n print('Friendship')\r\n else:\r\n print('Second')", "s,v1,v2,p1,p2=map(int,input().split()[:5])\r\nf=v1*s+(2*p1)\r\ns=v2*s+(2*p2)\r\nif f<s:\r\n print(\"First\")\r\nelif s<f:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "z=list(map(int,input().split()))\r\n\r\nfirst=(z[0]*z[1])+(2*z[3])\r\nsecond=(z[0]*z[2])+(z[4]*2)\r\n\r\nif first==second :\r\n print(\"Friendship\")\r\nelif first>second :\r\n print(\"Second\")\r\nelse :\r\n print(\"First\")", "s,v1,v2,t1,t2 = map(int,input().split())\r\nif t1 * 2 + v1 * s < t2 * 2 + v2 * s:\r\n print('First')\r\nelif t1 * 2 + v1 * s > t2 * 2 + v2 * s:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s, v1, v2, t1, t2 = list(map(int, input().split()))\r\n\r\nfirstTime = 2*t1+s*v1\r\nsecondTime = 2*t2+s*v2\r\n\r\nif firstTime < secondTime:\r\n print(\"First\")\r\nelif firstTime > secondTime:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nif t1 * 2 + (s * v1) < t2 * 2 + (s * v2):\r\n print(\"First\")\r\nelif t1 * 2 + (s * v1) == t2 * 2 + (s * v2):\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")\r\n\r\n", "s,v1,v2,t1,t2=map(int,input(\"\").split())\nd=s*v1+t1*2\nz=s*v2+t2*2\nif d<z:\n print(\"First\")\nelif d>z:\n print(\"Second\")\nelse:\n print(\"Friendship\")", "b=[]\r\nfor a in input().split():\r\n b.append(int(a))\r\nt1=b[0]*b[1]+2*b[3]\r\nt2=b[0]*b[2]+2*b[4]\r\nif t1<t2:\r\n print('First')\r\nelif t1==t2:\r\n print('Friendship')\r\nelse:\r\n print('Second')", "s,v1,v2,t1,t2=map(int,input().split())\r\nfirst=v1*s+2*t1\r\nsecond=v2*s+2*t2\r\nif(first<second):\r\n print(\"First\")\r\nelif(second<first):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,x,y,a,b=[int(x) for x in input().split()]\r\nk=2*a+s*x\r\nl=2*b+s*y\r\nif k<l:\r\n print(\"First\")\r\nelif l<k:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v_1, v_2, t_1, t_2 = input().split()\r\ns = int(s)\r\nv_1 = int(v_1)\r\nv_2 = int(v_2)\r\nt_1 = int(t_1)\r\nt_2 = int(t_2)\r\nx_1 = t_1 * 2 + s * v_1\r\nx_2 = t_2 * 2 + s * v_2\r\nif x_1 > x_2:\r\n print('Second')\r\nelif x_1 < x_2:\r\n print('First')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nfinish_1 = v1 * s + 2 * t1\r\nfinish_2 = v2 * s + 2 * t2\r\n\r\nif finish_1 < finish_2:\r\n print('First')\r\nelif finish_1 > finish_2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=map(int,input().split())\r\na1=v1*s+t1*2\r\na2=v2*s+t2*2\r\nif a1<a2:\r\n print('First')\r\nif a1>a2:\r\n print('Second')\r\nif a1==a2:\r\n print('Friendship')", "s,v1,v2,t1,t2=map(int,input().split())\nfirst=2*t1+v1*s\nsecond=2*t2+v2*s\nif first==second:\n print(\"Friendship\")\nelif first<second:\n print(\"First\")\nelse:\n print(\"Second\")\n", "s, v1, v2, t1, t2 = [int(x) for x in input().split()]\r\nif (s*v1+2*t1) < (s*v2+2*t2):\r\n print(\"First\")\r\nelif (s*v1+2*t1) > (s*v2+2*t2):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n ", "s, v1, v2, t1, t2 = list(map(int, input().split()))\r\na = 2*t1 + v1*s\r\nb = 2*t2 + v2*s\r\nprint(\"Friendship\" if a == b else \"First\" if a < b else \"Second\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nT1=s*v1+2*t1\r\nT2=s*v2+2*t2\r\nif T1<T2:\r\n print('First')\r\nelif T1>T2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\nw1 = (2 * t1) + (s * v1)\r\nw2 = (2 * t2) + (s * v2)\r\nif w1 > w2:\r\n print('Second')\r\nelif w2 > w1:\r\n print('First')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=map(int,input().split())\r\nm=s*v1+2*t1\r\nn=s*v2+2*t2\r\nif m<n:\r\n\tprint(\"First\")\r\nelif m==n:\r\n\tprint(\"Friendship\")\r\nelse:\r\n\tprint(\"Second\")", "\r\nn1 = input()\r\narr = n1.split()\r\nword = int(arr[0])\r\ns1 = int(arr[1])\r\ns2 = int(arr[2])\r\nping1 = int(arr[3])\r\nping2 = int(arr[4])\r\n\r\nt1 = s1 * word + 2 * ping1\r\nt2 = s2 * word + 2 * ping2 \r\n\r\nif t1 == t2:\r\n print(\"Friendship\")\r\nelif t1 < t2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "def solve():\r\n s,v1,v2,t1,t2 = list(map(int,input().split()))\r\n a = s * v1 + 2 * t1\r\n b = s * v2 + 2 * t2\r\n if a < b:\r\n return 'First'\r\n elif a > b:\r\n return 'Second'\r\n return 'Friendship'\r\nprint(solve())", "a,b,c,d,e =map(int,input().split())\r\nif ((a*b)+(d*2))<((a*c)+(e*2)):\r\n print(\"First\")\r\nelif((a*b)+(d*2))>((a*c)+(e*2)):\r\n print(\"Second\")\r\nelif((a*b)+(d*2))==((a*c)+(e*2)):\r\n print(\"Friendship\")\r\n", "a,b,c,d,e = map(int,input().split())\r\n\r\nx = 2*d + b*a\r\nz = 2*e + c*a\r\n\r\nif x<z:\r\n print(\"First\")\r\nelif x>z:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2 = list(map(int, input().split()))\r\na = s*v1 + 2*t1\r\nb = s*v2 + 2*t2\r\nif a < b:\r\n print(\"First\")\r\nelif a > b:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = [int(x) for x in input().split(' ')]\r\n\r\ntime_A = 2*t1 + s*v1 \r\ntime_B = 2*t2 + s*v2\r\n# print(time_A,time_B)\r\n\r\nif( time_A == time_B):\r\n print(\"Friendship\")\r\nelif(time_A < time_B):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s, v1, v2, t1, t2 = [int(x) for x in input().split()]\r\ntot1 = s*v1+2*t1\r\ntot2 = s*v2+2*t2\r\nif tot1 < tot2:\r\n print(\"First\")\r\nelif tot1 == tot2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")\r\n", "s, v1, v2, t1, t2 = map(int,input().split())\r\na = 2*t1 + s*v1;\r\nb = 2*t2 + s*v2;\r\nif a<b:\r\n print(\"First\")\r\nelif a>b:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "x=input(\"\")\r\n\r\ny=x.split()\r\n\r\ns=int(y[0])\r\nv1=int(y[1])\r\nv2=int(y[2])\r\nt1=int(y[3])\r\nt2=int(y[4])\r\n\r\ntime1= (s*v1)+(2*t1)\r\ntime2= (s*v2)+(2*t2)\r\n\r\nif time1<time2:\r\n print(\"First\")\r\nelif time2<time1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n \r\n\r\n \r\n", "a,b,c,d,e=map(int,input().split())\r\nprimu=a*b+2*d\r\ndoilea=a*c+2*e\r\nif primu<doilea :\r\n print(\"First\")\r\nelif primu>doilea :\r\n print(\"Second\")\r\nelif primu==doilea :\r\n print(\"Friendship\")", "s,v1,v2,t1,t2 = map(int,input().split(' '))\r\na1 = t1 + (s*v1) + t1\r\na2 = t2 + (s*v2) + t2\r\nif a1 == a2:\r\n print(\"Friendship\")\r\nelif a1 < a2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nq, w = s * v1 + 2 * t1, s * v2 + 2 * t2\r\nif q < w:\r\n print('First')\r\nelif q > w:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\na=(v1*s+t1*2)\r\nb=(v2*s+t2*2)\r\nif a==b:\r\n print(\"Friendship\")\r\nelif a>b:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "\na = input().split()\n\ns = int(a[0])\nv1 = int(a[1])\nv2 = int(a[2])\nt1 = int(a[3])\nt2 = int(a[4])\n\ndo = t1 + v1*s + t1\npe = t2 + v2*s + t2\n\n# print(do)\n# print(pe)\nif do < pe:\n print(\"First\")\nelif do > pe:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n\n\n \t\t \t\t\t \t\t \t \t\t \t\t\t \t \t", "l=list(map(int,input().split()))\r\nf=l[0]*l[1]+2*l[3];\r\ns=l[0]*l[2]+2*l[4];\r\nif(f>s):\r\n print(\"Second\")\r\nelif(s>f):\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n\r\n", "s,v1,v2,p1,p2 = map(int,input().split())\r\nfirstTime = s*v1 + 2*p1\r\nsecondTime = s*v2 + 2*p2\r\n\r\nif firstTime < secondTime:\r\n print(\"First\")\r\nelif firstTime > secondTime:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "a,v1,v2,t1,t2=map(int,input().split())\r\nc=v2*a+t2*2\r\nd=v1*a+t1*2\r\nif c<d:\r\n print('Second')\r\nelif d<c:\r\n print('First')\r\nelse:\r\n print('Friendship')", "import sys\n\n\ndef total_time(s, v, t):\n return s*v + 2*t\n\n\ns, v1, v2, t1, t2 = map(int, sys.stdin.readline().split())\nx1 = total_time(s, v1, t1)\nx2 = total_time(s, v2, t2)\nif x1 == x2:\n print('Friendship')\nelif x1 < x2:\n print('First')\nelse:\n print('Second')\n\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nfirst=(v1*s)+(2*t1)\r\nsecond=(v2*s)+(2*t2)\r\nif first < second:\r\n print(\"First\")\r\nelif second < first:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2 =map(int,input().split())\r\nx = (v1*s) +t1*2\r\ny = (v2*s) +t2*2\r\nif x<y:\r\n print(\"First\")\r\nelif y<x:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "# cook your dish here\r\ns,v1,v2,t1,t2=input().split()\r\ntime_1=int(t1)+int(s)*int(v1)+int(t1)\r\ntime_2=int(t2)++int(s)*int(v2)+int(t2)\r\nif(time_1<time_2):\r\n print(\"First\")\r\nelif(time_2<time_1):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n ", "s,a,b,c,d=map(int,input().split())\r\ne=2*(c-d)+s*(a-b)\r\nprint([['Friendship','First'][e<0],'Second'][e>0])", "def process(s, v1, v2, t1, t2):\r\n if v1*s+2*t1 < v2*s+2*t2:\r\n return 'First'\r\n elif v1*s+2*t1 > v2*s+2*t2:\r\n return 'Second'\r\n else:\r\n return 'Friendship'\r\ns, v1, v2, t1, t2 = [int(x) for x in input().split()]\r\nprint(process(s, v1, v2, t1, t2))", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nx1 = 2 * t1 + s * v1\r\nx2 = 2 * t2 + s * v2\r\n\r\nif x1 < x2:\r\n print(\"First\")\r\nelif x2 < x1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,x,y,a,b=map(int,input().split())\r\nxx=2*a+s*x\r\nyy=2*b+s*y\r\nif(xx<yy):\r\n print(\"First\")\r\nelif(xx>yy):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "from math import *\r\n#t = int(input())\r\n#while t:\r\n #n = int(input())\r\narr = list(map(int,input().split()))\r\nfirst,second = 2*arr[-2]+arr[0]*arr[1],2*arr[-1]+arr[0]*arr[2]\r\nif first<second:\r\n print('First')\r\nelif second<first:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n # t-=1", "\ndef fun(s, v1, v2, t1, t2):\n cost1 = v1*s + 2*t1\n cost2 = v2*s + 2*t2\n\n if cost1 < cost2:\n return \"First\"\n if cost1 == cost2:\n return \"Friendship\"\n return \"Second\"\n\n\nif __name__ == '__main__':\n input_s = input()\n params = [int(i) for i in input_s.split(\" \")]\n print(fun(*params))\n\n\t\t \t\t \t \t\t \t \t\t\t\t\t\t \t \t \t", "s, v1, v2, t1, t2 = (int(x) for x in input().split())\nfirst = 2 * t1 + s * v1\nsec = 2 * t2 + s * v2\nif first == sec:\n print('Friendship')\nelif first > sec:\n print('Second')\nelse:\n print('First')\n", "a,b,c,d,e=map(int,input().split())\nb*=a\nc*=a\nc+=e\nc+=e\nb+=d\nb+=d\nif b<c:\n print('First')\nelif c<b:\n print('Second')\nelif c==b:\n print('Friendship')\n\t\t \t\t\t\t \t\t \t \t\t\t \t \t \t", "li = [int(i) for i in input().split()]\r\ns = li[0]\r\nv1 = li[1]\r\nv2 = li[2]\r\nt1 = li[3]\r\nt2 = li[4]\r\nans1 = 2*t1+(v1*s)\r\nans2 = 2*t2+(v2*s)\r\nif(ans1 < ans2):\r\n print(\"First\")\r\nelif(ans1 == ans2):\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")", "#import sys\r\n#sys.stdin=open(\"input.in\",\"r\")\r\n#sys.stdout=open(\"test.out\",\"w\")\r\na,b,c,m,n=map(int,input().split())\r\nif a*b+m*2<a*c+n*2:\r\n print(\"First\")\r\nelif a*b+m*2>a*c+n*2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "if __name__ == '__main__':\r\n\ts, v1, v2, t1, t2 = map(int, input().split())\r\n\r\n\tprint('First' if (s * v1 + 2 * t1) < (s * v2 + 2 * t2) else 'Second' if (s * v1 + 2 * t1) > (s * v2 + 2 * t2) else \r\n\t\t 'Friendship', end = '')", "s, v1, v2, t1, t2 = map(int, input().split())\r\nb1 = s * v1 + 2 * t1\r\nb2 = s * v2 + 2 * t2\r\nif b1 > b2:\r\n print(\"Second\")\r\nelif b2 > b1:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "import itertools\r\nimport math\r\nimport sys\r\nimport heapq\r\nfrom collections import Counter\r\nfrom collections import deque\r\nfrom fractions import gcd\r\nfrom functools import reduce\r\nsys.setrecursionlimit(4100000)\r\nINF = 1 << 60\r\n\r\n#ここから書き始める\r\ns, v1, v2, t1, t2 = map(int, input().split())\r\nans1 = s * v1 + t1 * 2\r\nans2 = s * v2 + t2 * 2\r\nif ans1 < ans2:\r\n print(\"First\")\r\nelif ans1 == ans2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")", "n,v1,v2,d1,d2=map(int,input().split())\r\nif ((n*v1)+(2*d1))<((n*v2)+(2*d2)):print(\"First\")\r\nelif ((n*v1)+(2*d1))>((n*v2)+(2*d2)):print(\"Second\")\r\nelse:print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int,input().split())\r\na = s*v1+2*t1\r\nb = s*v2+2*t2\r\nif a>b:\r\n print(\"Second\")\r\nelif b>a:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n", "n,a,b,c,d=[int(x) for x in input().split()]\r\nres1=a*n+2*c \r\nres2=b*n+2*d \r\nif res1<res2:\r\n print('First')\r\nelif res1==res2:\r\n print('Friendship')\r\nelse:\r\n print('Second')", "s, v1, v2, t1, t2 = map(int, input().split())\n\nif (t1 + v1*s + t1) == (t2 + v2*s + t2):\n print('Friendship')\nelif (t1 + v1*s + t1) < (t2 + v2*s + t2):\n print('First')\nelse:\n print('Second')\n", "s,v1,v2,t1,t2 = map(int,input().split())\r\nprint([['Friendship','First'][s*v1+2*t1 != s*v2+2*t2],'Second'][s*v1+2*t1 > s*v2+2*t2])", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ns,v1,v2,t1,t2=invr()\r\nw1=2*t1+v1*s\r\nw2=2*t2+v2*s\r\nif w1<w2:\r\n print(\"First\")\r\nelif w1>w2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "from sys import stdin\r\n\r\ndef main():\r\n summ = 0\r\n s, v1, v2, t1, t2 = [int(x) for x in stdin.readline().strip().split()]\r\n p1=\"First\"\r\n p2=\"Second\"\r\n empy=\"Friendship\"\r\n resp1=((s*v1)+(2*t1))\r\n resp2=((s*v2)+(2*t2))\r\n if (resp1>resp2):\r\n print(p2)\r\n elif (resp1<resp2):\r\n print(p1)\r\n elif (resp1==resp2):\r\n print(empy)\r\n\r\nmain()", "a,b,c,d,g = map(int,input().split())\r\ns = a*b + 2*d\r\nt = a*c + 2*g\r\nif s > t :\r\n print('Second')\r\nelif s == t:\r\n print('Friendship')\r\nelse:\r\n print('First')", "s, v1, v2, t1, t2 = map(int, input().split())\r\nl = s * v1 + t1 * 2\r\nr = s * v2 + 2 * t2\r\n\r\nif l == r:\r\n print(\"Friendship\")\r\nelif l < r:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")# 1698062158.4649162", "# author: violist\n# created: 23.07.2021 12:55:08\n\nimport sys\ninput = sys.stdin.readline\n\ns, v1, v2, t1, t2 = map(int, input().split())\nfirst = t1 + (s * v1) + t1\nsecond = t2 + (s * v2) + t2\nif (first < second):\n print(\"First\")\nelif (first > second):\n print(\"Second\")\nelif (first == second):\n print(\"Friendship\")\n", "a = [int(i) for i in input().split()]\r\nx1 = a[0] * a[1] + 2 * a[3]\r\nx2 = a[0] * a[2] + 2 * a[4]\r\nif x1 < x2:\r\n print('First')\r\nelif x1 == x2:\r\n print('Friendship')\r\nelse:\r\n print('Second')", "s,v1,v2,t1,t2 = map(int,input().split())\r\na = (s*v1) + (t1*2)\r\nb = (s*v2) + (t2*2)\r\nprint(\"First\" if a < b else \"Friendship\" if a == b else \"Second\")", "r1 = 0\r\nr2 = 0\r\ns, v1, v2, t1, t2 = map(int, input().split())\r\nfor i in range(s):\r\n r1 += v1\r\nr1 += t1 * 2\r\nfor i in range(s):\r\n r2 += v2\r\nr2 += t2 * 2\r\nif r1 < r2:\r\n print(\"First\")\r\nif r2 < r1:\r\n print(\"Second\")\r\nif r1 == r2:\r\n print(\"Friendship\")\r\n\r\n\r\n", "s,v,b,t,r=map(int,input().split())\r\nd=s*v+t*2;c=s*b+r*2\r\nprint('Friendship'if d==c else ['First','Second'][c<d])", "values = str(input(\"\"))\r\nvaluesSplit = str.split(values)\r\n\r\nwords = int(valuesSplit[0])\r\np1WPS = int(valuesSplit[1])\r\np2WPS = int(valuesSplit[2])\r\np1Ping = int(valuesSplit[3])\r\np2Ping = int(valuesSplit[4])\r\n\r\n\r\np1Time = p1WPS * words + p1Ping * 2\r\np2Time = p2WPS * words + p2Ping * 2\r\n\r\nif p1Time > p2Time:\r\n print(\"Second\")\r\nelif p1Time < p2Time:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n", "inputs = [int(x) for x in input().strip().split()]\n\nfirst_participant_final = inputs[0]*inputs[1] + 2*inputs[3]\nsecond_participant_final = inputs[0]*inputs[2] + 2*inputs[4]\n\nif first_participant_final < second_participant_final:\n print(\"First\")\nelif second_participant_final < first_participant_final:\n print(\"Second\")\nelse:\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nms = 2 * t1 + s * v1 - 2 * t2 - s * v2\r\nprint(['Friendship', 'First', 'Second'][(1 if ms < 0 else 2) if ms else 0])", "def countTime(s,v1,t1) :\n return ((s * v1) + (2 * t1))\n\ns , v1 , v2 , t1 , t2 = map(int , input().split(\" \"))\n\nfirstPLayer = countTime(s , v1 ,t1)\nsecondPlayer = countTime(s , v2 ,t2)\n\n# print(firstPLayer)\n# print(secondPlayer)\n\nif firstPLayer < secondPlayer :\n print(\"First\")\nelif firstPLayer > secondPlayer :\n print(\"Second\")\nelse :\n print(\"Friendship\")\n", "s,a,b,c,z=map(int,input().split())\r\ne=2*(c-z)+s*(a-b)\r\nprint([['Friendship','First'][e<0],'Second'][e>0])", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\n\r\ntime1 = s*v1+t1*2\r\ntime2 = s*v2+t2*2\r\n\r\nif time1>time2:\r\n print(\"Second\")\r\nelif time2>time1:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2 = map(int,input().split())\r\nx = v1*s + 2*t1\r\ny = v2*s + 2*t2\r\nif x<y: print('First')\r\nelif x==y: print('Friendship')\r\nelse: print('Second')", "s,v1,v2,t1,t2=map(int,list(input().split()))\r\nif (v1*s)+(t1*2)<(v2*s)+(t2*2):\r\n print(\"First\")\r\nelse:\r\n if (v1*s)+(t1*2)>(v2*s)+(t2*2):\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nc1=0\r\nc2=0\r\nc1+=2*t1+s*v1\r\nc2+=2*t2+s*v2\r\nif(c1<c2):\r\n print('First')\r\nelif(c1>c2):\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nif (s*v1+t1*2)<(s*v2+t2*2):\r\n print(\"First\")\r\nelif (s*v1+t1*2)==(s*v2+t2*2):\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")", "s,v1,v2,t1,t2=map(int,input().split())\r\ntt1=t1+s*v1+t1\r\ntt2=t2+s*v2+t2\r\nif tt1<tt2:\r\n print(\"First\")\r\nelif tt1==tt2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")", "s, v1, v2, t1, t2 = map(int, input().split())\n\nx = 2 * t1 + s * v1\ny = 2 * t2 + s * v2\nif x < y:\n print(\"First\")\nelif x > y:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n", "s,v1,v2,t1,t2 = list(map(int,input().split()))\r\nif s*v1+2*t1 < s*v2+2*t2:\r\n print('First')\r\nelif s*v1+2*t1 > s*v2+2*t2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nif (v1*s + 2*t1) < (v2*s + 2*t2):\r\n print('First')\r\nelif v1*s + 2*t1 == v2*s + 2*t2:\r\n print('Friendship')\r\nelse:\r\n print('Second')", "#Codeforce 835A\r\ns,v1,v2,t1,t2 = (int(v) for v in input().split())\r\nif v1*s+2*t1 < v2*s+2*t2:\r\n print(\"First\")\r\nelif v1*s+2*t1 > v2*s+2*t2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nfirst = v1*s + 2*t1\r\nsecond = v2*s + 2*t2\r\n\r\nif first > second:\r\n print('Second')\r\nelif first < second:\r\n print('First')\r\nelse:\r\n print('Friendship')", "\"\"\"\r\nhttps://codeforces.com/problemset/problem/835/A\r\n\"\"\"\r\n\r\ns = input().split(\" \")\r\ns = [int(x) for x in s]\r\n\r\n\r\nif s[0]*s[1]+2*s[3] < s[0]*s[2]+2*s[4]:\r\n print(\"First\")\r\nelif s[0]*s[1]+2*s[3] > s[0]*s[2]+2*s[4]:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nvr1=0\r\nvr2=0\r\nvr1=s*v1\r\nvr2=s*v2\r\nvr1=vr1+(2*t1)\r\nvr2=vr2+(2*t2)\r\nif vr1<vr2:\r\n print('First')\r\nelif vr2<vr1:\r\n print('Second')\r\nelif vr1==vr2:\r\n print('Friendship')\r\n \r\n", "s,v1,v2,t1,t2=map(int,input().split())\na=(s*v1)+(2*t1)\nb=(s*v2)+(2*t2)\nif a<b:\n\tprint(\"First\")\nelif a>b:\n\tprint(\"Second\")\nelif a==b:\n\tprint(\"Friendship\")", "s, v1, v2, t1, t2 = list(map(int, input().split()))\n\na = t1 + v1*s + t1\nb = t2 + v2*s + t2\n\nif a==b:\n\tprint(\"Friendship\")\nelse:\n\tprint('First' if a<b else 'Second')", "s,v1,v2,t1,t2=map(int,input().split())\r\nif 2*t1+v1*s<2*t2+v2*s:\r\n\tprint(\"First\")\r\nelif 2*t1+v1*s>2*t2+v2*s:\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"Friendship\")", "s,v1,v2,t1,t2 = map(int, input().split())\r\nv1 *= s\r\nv2 *= s\r\nt1 *= 2\r\nt2 *= 2\r\nv1 += t1\r\nv2 += t2\r\nif v1<v2:\r\n print(\"First\")\r\nelif v2<v1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\np1 = (s * v1) + (t1 * 2)\r\np2 = (s * v2) + (t2 * 2)\r\nif p1 < p2:\r\n print(\"First\")\r\nelif p1 > p2:\r\n print(\"Second\")\r\nelif p1 == p2:\r\n print(\"Friendship\")\r\n", "s , v1 , v2 ,t1 , t2 = [int(x) for x in input().split(' ')]\r\na = s*v1 + 2*t1\r\nb = s*v2 + 2*t2\r\nif a<b : #time taken by first participant is less\r\n print('First')\r\nelif a==b :\r\n print('Friendship')\r\nelse:\r\n print('Second')", "s,v1,v2,t1,t2=[int(i) for i in input().split()]\r\ng=s*v1+2*t1\r\nh=s*v2+2*t2\r\nif g<h:\r\n print(\"First\")\r\nelif g>h:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "n,v1,v2,t1,t2=map(int,input().split())\r\nx=(2*t1)+(v1*n);y=(2*t2)+(v2*n)\r\nif x<y:\r\n print(\"First\")\r\nelif y<x:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n\r\n", "s,v1,v2,t1,t2 = map(int,input().split())\r\np1 = 2*t1+(v1*s)\r\np2 = 2*t2+(v2*s)\r\nif p1 == p2:\r\n print('Friendship')\r\nif p1 > p2:\r\n print(\"Second\")\r\nif p2 > p1:\r\n print('First')", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\ts, v1, v2, t1, t2 = map(int, input().split())\r\n\t\tfirst = s*v1 + 2*t1\t\t\r\n\t\tsecond = s*v2 + 2*t2\t\t\r\n\r\n\t\tif first < second:\r\n\t\t\tprint(\"First\")\r\n\t\telif second < first:\r\n\t\t\tprint(\"Second\")\r\n\t\telse:\r\n\t\t\tprint(\"Friendship\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "# LUOGU_RID: 101672137\ns, v1, v2, t1, t2 = map(int, input().split())\r\nx = 2 * t1 + s * v1\r\ny = 2 * t2 + s * v2\r\nprint('First' if x < y else 'Second' if x > y else 'Friendship')", "s, v1, v2, t1, t2 = [int(x) for x in input().split()]\r\n\r\nans1 = s*v1+2*t1\r\nans2 = s*v2+2*t2\r\n\r\nif ans1<ans2:\r\n print('First')\r\nelif ans1>ans2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, a, b, x, y = map(int, input().split())\r\nif s * a + 2 * x < s * b + 2 * y:\r\n print(\"First\")\r\nelif s * a + 2 * x > s * b + 2 * y:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "from typing import Callable\r\n\r\n\r\ndef key_races(inp: str):\r\n s, v1, v2, t1, t2 = map(int, inp.split())\r\n p1 = s * v1 + 2 * t1\r\n p2 = s * v2 + 2 * t2\r\n if p1 < p2:\r\n return \"First\"\r\n if p2 < p1:\r\n return \"Second\"\r\n else:\r\n return \"Friendship\"\r\n\r\n\r\ndef test(func: Callable, inp: str, result: str):\r\n returned = func(inp)\r\n if not returned == result:\r\n print(f\"Input:{inp}, Expected:{result}, Returned:{returned}\")\r\n else:\r\n print(\"pass\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Write your solution here\r\n # test(key_races,\r\n # \"5 1 2 1 2\",\r\n # \"First\")\r\n # test(key_races,\r\n # \"3 3 1 1 1\",\r\n # \"Second\")\r\n # test(key_races,\r\n # \"4 5 3 1 5\",\r\n # \"Friendship\")\r\n\r\n print(key_races(input()))", "a=[int(i) for i in input().split()]\r\nif a[0]*a[1]+2*a[3]<a[0]*a[2]+2*a[4]:\r\n print('First')\r\nelif a[0]*a[1]+2*a[3]>a[0]*a[2]+2*a[4]:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\ntt1 = s * v1 + t1 * 2\r\ntt2 = s * v2 + t2 * 2\r\nif tt1 < tt2:\r\n print('First')\r\nelse:\r\n if tt1 == tt2:\r\n print('Friendship')\r\n else:\r\n print('Second')\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nfirst=(t1*2)+(s*v1)\r\nsecond=(t2*2)+(s*v2)\r\n\r\nif second>first:\r\n print(\"First\")\r\nelif first>second:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = (int(i) for i in input().split())\ndiff = (2 * t1 + s * v1) - (2 * t2 + s * v2)\nres = \"First\" if diff < 0 else \"Second\" if diff > 0 else \"Friendship\"\nprint(res)\n", "s , v1 , v2 , t1 , t2 = map(int , input().split())\r\nx = 2 * t1 + s * v1\r\ny = 2 * t2 + s * v2\r\nif(x < y ):\r\n print('First')\r\nelif(x > y):\r\n print('Second')\r\nelse:\r\n print('Friendship')", "l=list(map(int,input().split()))\r\ns=l[0]\r\nv1=l[1]\r\nv2=l[2]\r\nt1=l[3]\r\nt2=l[4]\r\nsf=s*v1+(2*t1)\r\nss=s*v2+(2*t2)\r\nif sf<ss:\r\n print(\"First\")\r\nelif ss<sf:\r\n print(\"Second\")\r\nelif sf==ss:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2 = map(int,input().split())\n\nfirst = s * v1 + 2 * t1\nsecond = s * v2 + 2 * t2\n\nif first < second :\n print('First')\nelif first > second :\n print('Second')\nelse :\n print('Friendship')", "s,v1,v2,t1,t2 = list(map(int,input().split()))\r\nl1 = (t1<<1) + s*v1\r\nl2 = (t2<<1) + s*v2\r\nif l1==l2:\r\n print('Friendship')\r\nelif l1<l2:\r\n print('First')\r\nelse:\r\n print('Second')\r\n\r\n", "s, v1, v2, t1, t2 = list(map(int, input().split()))\r\na = s*v1+2*t1\r\nb = s*v2+2*t2\r\nif a < b:\r\n print(\"First\")\r\nelif a > b:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-13 23:34:12\nLastEditTime: 2021-11-13 23:36:41\nDescription: Key races\nFilePath: CF835A.py\n'''\n\n\ndef func():\n s, v1, v2, t1, t2 = map(int, input().strip().split())\n first = s * v1 + 2 * t1\n second = s * v2 + 2 * t2\n if first > second:\n print(\"Second\")\n elif first < second:\n print(\"First\")\n else:\n print(\"Friendship\")\n\n\nif __name__ == '__main__':\n func()\n", "def str_list(s, char):\r\n output_list = []\r\n collector = \"\"\r\n for i in range(len(s)):\r\n if s[i] == char:\r\n if collector:\r\n output_list.append(int(collector))\r\n collector = \"\"\r\n else:\r\n collector += s[i]\r\n output_list.append(int(collector))\r\n return output_list\r\n\r\n\r\ndef str_list_with_str(s, char):\r\n output_list = []\r\n collector = \"\"\r\n for i in range(len(s)):\r\n if s[i] == char:\r\n if collector:\r\n output_list.append(collector)\r\n collector = \"\"\r\n else:\r\n collector += s[i]\r\n output_list.append(collector)\r\n return output_list\r\n\r\ndef list_str(l, char):\r\n output_str = \"\"\r\n for i in range(len(l) - 1):\r\n output_str += str(l[i]) + char\r\n output_str += str(l[len(l) - 1])\r\n return output_str\r\n\r\n\r\ndef main_function():\r\n s, v_1, v_2, t_1, t_2 = str_list(input(), \" \")\r\n if 2 * t_1 + s * v_1 < 2 * t_2 + s * v_2:\r\n return \"First\"\r\n elif 2 * t_1 + s * v_1 > 2 * t_2 + s * v_2:\r\n return \"Second\"\r\n else:\r\n return \"Friendship\"\r\n\r\n\r\nprint(main_function())\r\n\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nT1=2*t1+s*v1\r\nT2=2*t2+s*v2\r\nif T1>T2:\r\n print(\"Second\")\r\nelif T1<T2:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "n, u1, u2, t1, t2 = map(int, input().split(' '))\r\nprom_time1 = n * u1\r\nprom_time2 = n * u2\r\nitog_time1 = t1 + prom_time1 + t1\r\nitog_time2 = t2 + prom_time2 + t2\r\nif itog_time1 == itog_time2:\r\n print(\"Friendship\")\r\nelif itog_time1 > itog_time2:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "s,v1,v2,t1,t2 = map(int,input().split())\r\n\r\n\r\nif (s*v1+2*t1)==(s*v2+2*t2):\r\n print(\"Friendship\")\r\n exit()\r\n \r\nif (s*v1+2*t1)<(s*v2+2*t2):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n\r\n", "def calculate_total_time(s, v, t):\r\n return s*v + 2*t\r\ndef match_result(s, v1, v2, t1, t2):\r\n total_time1 = calculate_total_time(s, v1, t1)\r\n total_time2 = calculate_total_time(s, v2, t2)\r\n return \"First\" if (total_time1<total_time2) else \"Second\" if (total_time1!=total_time2) else \"Friendship\"\r\nstring_length, velocity1, velocity2, ping1, ping2 = map(int, input().split())\r\nprint(match_result(string_length, velocity1, velocity2, ping1, ping2))\r\n", "a, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\np1 = v1 * a + t1 + t1\r\np2 = v2 * a + t2 + t2\r\nif p1 < p2:\r\n print(\"First\")\r\nelif p2 < p1:\r\n print(\"Second\")\r\nelif p1 == p2:\r\n print(\"Friendship\")\r\n", "x=list(input().split())\r\np1=(int(x[3])*2)+((int(x[0]))*(int(x[1])))\r\np2=(int(x[4])*2)+((int(x[0]))*(int(x[2])))\r\nif p1<p2:\r\n print('First')\r\nelif p1>p2:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s,v1,v2,t1,t2 = list(map(int,input().split()))\r\n\r\nfirst = v1*s+2*t1\r\nsecond = v2*s+2*t2\r\nif first < second:\r\n print(\"First\")\r\nelif second < first:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "a = list(map(int, input().split()))\r\n\r\nif a[0] * a[1] + 2 * a[3] > a[0] * a[2] + 2 * a[4]:\r\n print(\"Second\")\r\nelif a[0] * a[1] + 2 * a[3] < a[0] * a[2] + 2 * a[4]:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nif 1<=s<=1000 and 1<=v1<=1000 and 1<=v2<=1000 and 1<=t1<=1000 and 1<=t2<=1000:\r\n if s*v1+2*t1<s*v2+2*t2:\r\n print(\"First\")\r\n else:\r\n if s*v1+2*t1>s*v2+2*t2:\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")", "n1 = input().split()\r\nlist1 = []\r\nfor i in n1:\r\n list1.append(int(i))\r\n \r\ns = list1[0]\r\nv1 = list1[1]\r\nv2 = list1[2]\r\nt1 = list1[3]\r\nt2 = list1[4]\r\nif v1*s + 2* t1> v2*s + 2* t2:\r\n print(\"Second\")\r\nelif v1*s + 2* t1< v2*s + 2* t2:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n ", "s,v1,v2,t1,t2=map(int,input().split())\r\nif (2*t1+s*v1)<(2*t2+s*v2):\r\n\tprint(\"First\")\r\nelif (2*t1+s*v1)>(2*t2+s*v2):\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"Friendship\")", "q,w,e,r,t=map(int,input().split())\r\nw*=q\r\ne*=q\r\ne+=t\r\ne+=t\r\nw+=r\r\nw+=r\r\nif w<e:\r\n print('First')\r\nelif e<w:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "x = input()\r\nx = x.split()\r\ns = int(x[0])\r\nv = int(x[1])\r\nu = int(x[2])\r\nt = int(x[3])\r\nr = int(x[4])\r\ny = (v*s)+(2*t)\r\nz = (u*s)+(2*r)\r\nif y<z:\r\n print('First')\r\nelif y==z:\r\n print('Friendship')\r\nelse:\r\n print('Second')\r\n", "t,x1,y1,x2,y2 = list(map(int,input().split()))\r\nt1 = x1*t+2*x2\r\nt2 = y1*t+2*y2\r\nprint(\"First\" if t1 < t2 else (\"Second\" if t2 < t1 else \"Friendship\"))", "string = input()\r\nlst = string.split()\r\nconver_to_int = map(int,lst)\r\nint_list = list(conver_to_int)\r\n#print(int_list)\r\ns, v1, v2, t1, t2 = int_list[0], int_list[1], int_list[2], int_list[3], int_list[4]\r\ntime_for_fst = t1 + v1*s + t1\r\ntime_for_sec = t2 + v2*s + t2\r\nif time_for_fst < time_for_sec:\r\n print(\"First\")\r\nelif time_for_sec < time_for_fst:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "q,a,b,c,d=map(int,input().split())\r\ns1=(q*a)+c*2\r\ns2=(q*b)+d*2\r\nif s1<s2:\r\n print(\"First\")\r\nelif s2<s1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "length, v1, v2, t1, t2 = map(int, input().split())\r\na = length*v1 + 2*t1\r\nb = length*v2 + 2*t2\r\nif a < b:\r\n print('First')\r\nelif a > b:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "x=input().split()\r\ns=int(x[0])\r\nv1=int(x[1])\r\nv2=int(x[2])\r\nt1=int(x[3])\r\nt2=int(x[4])\r\ns1=(s*v1)+(2*t1)\r\ns2=(s*v2)+(2*t2)\r\nif s1<s2:\r\n print('First')\r\nelif s1>s2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=map(int,input().split())\r\nr1=(s*v1)+t1*2;\r\nr2=(s*v2)+t2*2;\r\nif r1<r2:\r\n print(\"First\")\r\nelif r1>r2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\n\r\np1 = t1 + v1*s + t1\r\np2 = t2 + v2*s + t2\r\n\r\nif p1 < p2:\r\n print(\"First\")\r\nelif p1 > p2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "a,b,c,d,e = map(int,input().split())\r\nz = (a*b)+(2*d)\r\nx = (a*c)+ (2*e)\r\nif x>z:\r\n print(\"First\")\r\nelif z>x:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "a = input().split(' ')\r\ns,v1,v2,t1,t2 = int(a[0]),int(a[1]),int(a[2]),int(a[3]),int(a[4])\r\nx1 = s*v1+2*t1\r\nx2 = s*v2+2*t2\r\nif x1 < x2:\r\n print('First')\r\nelif x1 > x2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "a,b,c,d,e=map(int,input().split())\r\nx=(a*b)+(2*d)\r\ny=(a*c)+(2*e)\r\nif x>y:\r\n\tprint(\"Second\")\r\nelif x<y:\r\n\tprint(\"First\")\r\nelse:\r\n\tprint(\"Friendship\")", "s,v1,v2,t1,t2 = [int(x) for x in input().split()]\r\n\r\nd1 = 2*t1+v1*s\r\nd2 = 2*t2+v2*s\r\n\r\nif d1 < d2:\r\n print(\"First\")\r\nelif d1 > d2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "inp=input\nli=list\niinp=lambda : int(inp())\nent=lambda : map(int,inp().split())\nlient=lambda : [int(i) for i in inp().split()]\nli0= lambda x: [0 for i in range(x)]\nstent=lambda : [i for i in inp()]\n\ns,v1,v2,t1,t2=ent()\nprimero=s*v1+t1*2\nsegundo=s*v2+t2*2\nif primero<segundo: print(\"First\")\nelif segundo<primero:print(\"Second\")\nelse: print(\"Friendship\")", "s, v1, v2, t1, t2=map(int,input().split())\r\na=v1*s+2*t1\r\nb=v2*s+2*t2\r\nif a<b:\r\n\tprint(\"First\")\r\nelif a==b:\r\n\tprint(\"Friendship\")\r\nelse:\r\n\tprint(\"Second\")", "a,v1,v2,t1,t2=list(map(int,input().strip().split()))\r\nc=a*v1+2*t1\r\np=a*v2+2*t2\r\nif c<p:\r\n print(\"First\")\r\nelif p<c:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "# https://codeforces.com/problemset/problem/835/A\r\ninp_ = input()\r\ns, v1, v2, t1, t2 = map(int, inp_.split(\" \"))\r\nfirst = 2*t1 + s*v1\r\nsecond = 2*t2 + s*v2\r\nif first > second:\r\n print(\"Second\")\r\nelif second > first:\r\n print(\"First\")\r\nelif second == first:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nf = t1 * 2 + s * v1\r\nsec = t2 * 2 + s * v2\r\nif f < sec:\r\n print('First')\r\nelif sec < f:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s = [int(i) for i in input().split()]\n\na = s[0] * s[1] + (2 * s[3])\nb = s[0] * s[2] + (2 * s[4])\n\nif a < b:\n\tprint(\"First\")\nelif b < a:\n\tprint(\"Second\")\nelse:\n\tprint(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nif t1*2+v1*s < t2*2+v2*s:\r\n\tprint(\"First\")\r\nelif t1*2+v1*s > t2*2+v2*s:\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\ntime1 = 2 * t1 + s * v1\ntime2 = 2 * t2 + s * v2\nif time1 > time2:\n print('Second')\nelif time1 < time2:\n print('First')\nelse:\n print('Friendship')\n", "s, v1, v2, t1, t2 = [int(i) for i in input().split(' ')]\r\nif v1*s+t1*2 < v2*s+t2*2:\r\n print(\"First\")\r\nelif v1*s+t1*2 > v2*s+t2*2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\") ", "n = list(map(int, input().split()))\r\nif n[1]*n[0] + n[3]*2 < n[2]*n[0] + n[4]*2:\r\n print(\"First\")\r\nelif n[1]*n[0] + n[3]*2 > n[2]*n[0] + n[4]*2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "p, x, y, a, b = [int(i) for i in input().split()]\r\nx1 = p*x + a*2\r\ny1 = p*y + b*2\r\nif x1<y1:\r\n print(\"First\")\r\nelif x1>y1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n \r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nif s*v1 + 2*t1 < s*v2 + 2*t2:\r\n print('First')\r\nelif s*v1 + 2*t1 > s*v2 + 2*t2:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s,v1,v2,t1,t2 = map(int,input().split())\r\nfirst = t1 * 2 + v1 * s\r\nsecond = t2 * 2 + v2 * s\r\nif first < second:\r\n print('First')\r\nelif first > second:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2=map(int,input().split())\r\n#(s*v)+(t*2)\r\nfirst=(s*v1)+(t1*2)\r\nsecond=(s*v2)+(t2*2)\r\nif first<second:\r\n\tprint(\"First\")\r\nelif first>second:\r\n\tprint(\"Second\")\r\nelif first==second:\r\n\tprint(\"Friendship\")\r\n\r\n\r\n", "x=list(map(int,input().split()))\ntimeone=(x[1]*x[0])+2*x[3]\ntimetwo=(x[2]*x[0])+2*x[4]\nif timeone>timetwo:\n print(\"Second\")\nelif timetwo>timeone:\n print(\"First\")\nelif timeone==timetwo:\n print(\"Friendship\")\n \n", "s,v1,v2,t1,t2=map(int,input().split())\r\na=t1*2+s*v1\r\nb=t2*2+s*v2\r\nif a<b:\r\n print(\"First\")\r\nelif b<a:\r\n print(\"Second\")\r\nelif a==b:\r\n print(\"Friendship\")\r\n", "s, v1, v2, t1, t2 = list(map(int, input().split()))\r\n\r\nif t1*2 + s * v1 == t2*2 + s * v2:\r\n print(\"Friendship\")\r\nelif t1*2 + s * v1 < t2*2 + s * v2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a=input()\r\nb=[]\r\n\r\nb=a.split(\" \")\r\nz=len(b)\r\nwhile(z>0):\r\n if(int(b[z-1])>1000):\r\n b=[]\r\n a=input()\r\n b=a.split()\r\n z=z-1\r\nc=int(b[0])*int(b[1])+2*int(b[3])\r\nd=int(b[0])*int(b[2])+2*int(b[4])\r\nif(c>d):\r\n print(\"Second\")\r\nelif(c<d):\r\n print(\"First\")\r\nelif(c==d):\r\n print(\"Friendship\")\r\n", "a, b, c, d, e = map(int, input().split())\r\np = a * b + 2 * d\r\nk = a * c + 2 * e\r\nif p >= k:\r\n if p > k:\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"First\")", "n,v1,v2,t1,t2=map(int,input().split())\r\nr=(n*v1)+(t1*2)\r\nq=(n*v2)+(t2*2)\r\nif r<q:\r\n\tprint(\"First\")\r\nelif r==q:\r\n\tprint(\"Friendship\")\r\nelse:\r\n\tprint(\"Second\")", "s, v1, v2, t1, t2 = map(int, input().split())\n\np1 = s * v1 + 2 * t1\np2 = s * v2 + 2 * t2\n\nif p1 < p2:\n\tprint('First')\nelif p1 > p2:\n\tprint('Second')\nelse:\n\tprint('Friendship')", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nr1 = 2 * t1 + s * v1\r\nr2 = 2 * t2 + s * v2\r\n\r\nif r1 == r2:\r\n print(\"Friendship\")\r\nelif r1 < r2:\r\n print(\"First\")\r\nelif r1 > r2:\r\n print(\"Second\")", "p1 = 'First'\np2 = 'Second'\ndr = 'Friendship'\n\nif __name__ == \"__main__\":\n s, v1, v2, t1, t2 = [int(x) for x in input().split(\" \")]\n p1_t = s * v1 + 2*t1\n p2_t = s * v2 + 2*t2\n if(p1_t < p2_t):\n print(p1)\n elif(p2_t < p1_t):\n print(p2)\n else:\n print(dr)\n", "l = list(map(int, input().split()))\r\n\r\nt1 = 2 * l[3] + l[0] * l[1]\r\n\r\nt2 = 2 * l[4] + l[0] * l[2]\r\n\r\nif t1 == t2:\r\n print('Friendship')\r\nelif t1 < t2:\r\n print('First')\r\nelse:\r\n print('Second')", "a, b, c, d, e = map(int, input().split())\r\np1 = a * b + d * 2\r\np2 = a * c + e * 2\r\nif p1 != p2:\r\n if p1 < p2:\r\n print('First')\r\n else:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = numbers = [int(i) for i in input().split()]\r\nfirst = (s*v1)+(t1*2)\r\nsecond = (s*v2)+(t2*2)\r\nif first < second:\r\n print('First')\r\nelif first > second:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s,v1,v2,t1,t2 = map(int, input().split())\nx = s*v1+t1*2\ny = s*v2+t2*2\nif x > y:\n print(\"Second\")\nelif x < y:\n print(\"First\")\nelse:\n print(\"Friendship\")\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nif v1*s + t1*2 == v2*s + t2*2:\r\n print('Friendship')\r\nelif v1*s + t1*2 < v2*s + t2*2:\r\n print('First')\r\nelse:\r\n print('Second')", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nprint(\"Friendship\" if s * v1 + t1 * 2 == s * v2 + t2 * 2 else \"First\" if s * v1 + t1 * 2 < s * v2 + t2 * 2 else \"Second\")\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\ntime1 = t1 + v1*s + t1\r\ntime2 = t2 + v2*s + t2\r\nif time1 < time2:\r\n print(\"First\")\r\nelif time1 > time2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,v1,v2,t1,t2=map(int,input().split())\r\nif (t1+(s*v1)+t1)>(t2+(s*v2)+t2):\r\n print('Second')\r\nelif (t1+(s*v1)+t1)<(t2+(s*v2)+t2):\r\n print('First')\r\nelse:\r\n print('Friendship')\r\n", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\na=list(map(int,input().split()))\r\nb=a[0]*a[1]+2*a[3]\r\nc=a[0]*a[2]+2*a[4]\r\nif c>b:\r\n\tprint('First')\r\nelif b>c:\r\n\tprint('Second')\r\nelse:\r\n\tprint('Friendship')\t\t", "s,v1,v2,p1,p2=map(int,input().split())\r\nf=p1*2+v1*s\r\ns=p2*2+v2*s\r\nif f<s:\r\n print(\"First\")\r\nelif(s<f):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "n = input()\r\n\r\n\r\ns,v1,v2,t1,t2 = n.split()\r\n\r\nam1 = 0\r\nam2 = 0\r\n\r\nam1 = (int(t1)*2) + (int(v1)*int(s))\r\nam2 = (int(t2)*2) + (int(v2)*int(s))\r\n\r\nif am1 == am2 :\r\n print (\"Friendship\")\r\nelif am1 > am2 :\r\n print (\"Second\")\r\nelse:\r\n print (\"First\")\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\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, v1, v2, t1, t2 = list(map(int, input().split()))\r\n\r\nx1 = v1*s+t1*2\r\nx2 = v2*s+t2*2\r\n\r\nif x1<x2:\r\n print(\"First\")\r\n\r\nelif x1>x2:\r\n print(\"Second\")\r\n\r\nelse:\r\n print(\"Friendship\")\r\n", "def main():\r\n [s, v1, v2, t1, t2] = list(map(int, input().split()))\r\n if s * v1 + 2 * t1 > s * v2 + 2 * t2:\r\n print('Second')\r\n elif s * v1 + 2 * t1 < s * v2 + 2 * t2:\r\n print('First')\r\n else:\r\n print('Friendship')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def ii(): return int(input())\r\ndef fi(): return float(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\n\r\nimport math\r\n\r\ns,v1,v2,t1,t2=mi()\r\nd=s*(v1-v2)+2*(t1-t2)\r\nif d<0:\r\n ans=\"First\"\r\nelif d>0:\r\n ans=\"Second\"\r\nelse:\r\n ans=\"Friendship\"\r\nprint(ans)", "s,v1,v2,t1,t2= [int (i) for i in input().split(\" \") ]\r\nif (s*v1)+(2*t1)<(s*v2)+(2*t2):\r\n print(\"First\")\r\nelif (s*v1)+(2*t1)>(s*v2)+(2*t2):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2=map(int,input().split())\r\nn1=s*v1+t1*2\r\nn2=s*v2+t2*2\r\nif n1!=n2:\r\n if n1<n2:\r\n print('First')\r\n else:\r\n print('Second')\r\nelse:\r\n print('Friendship')\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\ns,v1,v2,t1,t2 = map(int, input().split())\r\nfirsttime = t1*2+(s*v1)\r\nsecondtime = t2*2+(s*v2)\r\nif firsttime<secondtime:\r\n print(\"First\")\r\nelif secondtime<firsttime:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\n\r\nr1=t1+s*v1+t1\r\nr2=t2+s*v2+t2\r\n\r\n#print(r1,r2)\r\n\r\nif r1<r2:\r\n print('First')\r\nelif r1>r2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2=map(int, input().split())\r\nT1=s*v1+2*t1\r\nT2=s*v2+2*t2\r\nif T1>T2:\r\n print('Second')\r\nelse:\r\n if T1<T2:\r\n print('First')\r\n else:\r\n print('Friendship')\r\n\r\n\r\n\r\n\r\n", "s,v_1, v_2, t_1, t_2 = list(map(int, input().split()))\r\nfirst = s*v_1 + 2*t_1\r\nsecond = s*v_2 + 2*t_2\r\nif first < second:\r\n\tprint('First')\r\nelif second < first:\r\n\tprint('Second')\r\nelse:\r\n\tprint('Friendship')", "s, v1, v2, t1, t2 = list(map(int, input().split()))\r\nfirst = t1\r\nsecond = t2\r\nfor i in range(s):\r\n first+=v1\r\n second +=v2\r\nfirst += t1\r\nsecond += t2\r\nif first < second:\r\n print(\"First\")\r\nelif first > second:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "(s, v1, v2, t1, t2) = map(int, input().split(' '))\n\nfirst_participant_total_time = s * v1 + 2 * t1\nsecond_participant_total_time = s * v2 + 2 * t2\n\nif first_participant_total_time < second_participant_total_time:\n print('First')\nelif first_participant_total_time == second_participant_total_time:\n print('Friendship')\nelse:\n print('Second')", "# ===================================\n# (c) MidAndFeed aka ASilentVoice\n# ===================================\n# import math \n# import collections\n# import string\n# ===================================\ns, v1, v2, t1, t2 = [int(x) for x in input().split()]\nfirst = s*v1 + 2*t1\nsecond = s*v2 + 2*t2\nans = \"First\" if first < second else \"Second\"\nans = \"Friendship\" if first == second else ans\nprint(ans)", "s,v1,v2,t1,t2 = input().split()\r\ns = int(s)\r\nv1 = int(v1)\r\nv2 = int(v2)\r\nt1 = int(t1)\r\nt2 = int(t2)\r\np1 = v1*s + t1*2\r\np2 = v2*s + t2*2\r\nif p1 < p2:\r\n print('First')\r\nelif p2 < p1:\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "inp = (input()).split()\r\ns = int(inp[0])\r\nv1 = int(inp[1])\r\nv2 = int(inp[2])\r\nt1 = int(inp[3])\r\nt2 = int(inp[4])\r\ntotal_one=2*t1+s*v1\r\ntotal_two=2*t2+s*v2\r\nif total_one==total_two:\r\n print(\"Friendship\")\r\nelif total_one>total_two:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "a,b,c,d,e = map(int, input().split())\r\nk=a*(c-b)+2*(e -d)\r\nprint('First' if k > 0 else 'Second' if k < 0 else 'Friendship')\r\n", "x = [int(i) for i in input().split()]\r\ns = x[0]\r\nv1 = x[1]\r\nv2 = x[2]\r\nt1 = x[3]\r\nt2 = x[4]\r\n\r\nsatu = 2 * t1 + v1 * s\r\ndua = 2 * t2 + v2 * s\r\n\r\nif satu < dua:\r\n print(\"First\")\r\nelif dua < satu:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,p1,p2,t1,t2=map(int,input().split())\r\na=(s*p1)+(2*t1)\r\nb=(s*p2)+(2*t2)\r\nif(a<b):\r\n print('First')\r\nelif(b<a):\r\n print('Second')\r\nelse:\r\n print('Friendship')\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nf1 = 2 * t1 + (s * v1)\r\nf2 = 2 * t2 + (s * v2) \r\nif f1 < f2:\r\n print(\"First\")\r\nelif f1 > f2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s , v1 , v2 , t1 , t2 = map( int , input().split(' ') )\r\nlist_1 = [s , v1 , v2 , t1 , t2 ]\r\ncount = 0\r\nfor i in range( 5 ) :\r\n if ( ( list_1 [ i ] <= 1000 ) and ( list_1 [ i ] >= 1 ) ) :\r\n count = count + 1\r\n\r\nif count == 5 :\r\n time_1 = ( s * v1 ) + ( 2 * t1 )\r\n time_2 = ( s * v2 ) + ( 2 * t2 )\r\n if time_1 < time_2 :\r\n print (\"First\")\r\n elif time_2 < time_1 :\r\n print (\"Second\")\r\n else :\r\n print (\"Friendship\")\r\n", "s,v1,v2,t1,t2=list(map(int,input().split()))\nc1=(s*v1)+(2*t1)\nc2=(s*v2)+(2*t2)\nif(c1<c2):\n print(\"First\")\nelif c1==c2:\n print(\"Friendship\")\nelse:\n print(\"Second\")\n\n ", "s, v1, v2, t1, t2 = map(int, input().split())\r\na = v1*s+2*t1\r\nb = v2*s+2*t2\r\nif a<b:\r\n print('First')\r\nelif a>b:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "t,s1,s2,p1,p2=map(int,input().split())\r\ntime1=t*s1+p1*2\r\ntime2=t*s2+p2*2\r\nif time1<time2:\r\n print('First')\r\nelse:\r\n if time1!=time2:\r\n print('Second')\r\n else:\r\n print('Friendship')\r\n#https://codeforces.com/problemset/problem/835/A", "s,v1,v2,t1,t2 = map(int,input().split())\r\nplayer1 = (s*v1)+(t1*2)\r\nplayer2 = (s*v2)+(t2*2)\r\nif player1<player2:\r\n print('First')\r\nelif player2<player1:\r\n print('Second')\r\nelse:\r\n print(\"Friendship\")", "l=list(map(int,input().split()))\r\nf=l[3]*2+l[0]*l[1]\r\ns=l[4]*2+l[0]*l[2]\r\nif f<s:\r\n print('First')\r\nelif f>s:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2 = list(map(int,input().split()))\r\na = 2*t1+s*v1\r\nb = 2*t2+s*v2\r\nif a < b:\r\n print(\"First\")\r\nelif a > b:\r\n print(\"Second\")\r\nelif a == b:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\nif 2*t1+v1*s > 2*t2+v2*s:\n print(\"Second\")\nelif 2*t1+v1*s < 2*t2+v2*s:\n print(\"First\")\nelse:\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nif (2*t1+s*v1)<(2*t2+s*v2):\r\n print(\"First\")\r\nelif (2*t1+s*v1)>(2*t2+s*v2):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nif (s*v1)+(t1*2)>(s*v2)+(t2*2):\r\n print(\"Second\")\r\nelse:\r\n if(s*v1)+(t1*2)<(s*v2)+(t2*2):\r\n print(\"First\")\r\n else:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int,input().split())\r\nx1=2*t1+s*v1\r\n# print(x1)\r\n\r\nx2=2*t2+s*v2\r\n# print(x2)\r\nif x1<x2:\r\n print(\"First\")\r\nelif x2<x1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,v1,v2,t1,t2=[int(x) for x in input().split()]\r\nan1=s*v1+2*t1\r\nan2=s*v2+2*t2\r\nif(an1<an2):\r\n print(\"First\")\r\nelif(an2<an1):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "# I LOVE AAKRITI GOSWAMI\r\ns , v1 , v2, t1, t2 = input().split(\" \")\r\ns = int(s)\r\nv1 = int(v1)\r\nv2 = int(v2)\r\nt1 = int(t1)\r\nt2 = int(t2)\r\na = (s*v1) + (2*t1)\r\nb = (s*v2) + (2*t2)\r\nif(a < b):\r\n print(\"First\")\r\nelif(b < a):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "def answer():\r\n a = input().split()\r\n a = [int(x) for x in a]\r\n s = a[0]\r\n v1,v2 = a[1],a[2]\r\n t1,t2 = a[3],a[4]\r\n time1= (s*v1)+2*t1\r\n time2 = (s*v2)+2*t2\r\n if time1<time2:\r\n print(\"First\")\r\n elif time1==time2:\r\n print(\"Friendship\")\r\n else:\r\n print(\"Second\")\r\nanswer()", "s , v1 , v2 , t1 , t2 = map(int,input().split())\r\n\r\nr1 = s * v1 + 2 * t1\r\nr2 = s * v2 + 2 * t2\r\n\r\n\r\n#print(r1)\r\n#print(r2)\r\n\r\nif r1 == r2 :\r\n print('Friendship')\r\n\r\nelif r1 < r2 :\r\n print('First')\r\n\r\nelse:\r\n print('Second')\r\n\r\n\r\n", "n,v1,v2,t1,t2=map(int,input().split())\r\nT1=t1*2+n*v1\r\nT2=t2*2+n*v2\r\nif T2<T1:\r\n print(\"Second\")\r\nelif T2>T1:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\r\nif t1 + s*v1 + t1 > t2 + s*v2 + t2:\r\n print(\"Second\")\r\nelif t1 + s*v1 + t1 < t2 + s*v2 + t2:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s, v1, v2, t1, t2 = map(int, input().rstrip().split())\r\nprint(['First', 'Second', 'Friendship'][0 if v1*s+t1*2<v2*s+t2*2 else 1 if v2*s+t2*2<v1*s+t1*2 else 2])", "s,a,b,c,d=map(int,input().split())\ne=2*(c-d)+s*(a-b)\nprint([['Friendship','First'][e<0],'Second'][e>0])\n \t \t\t \t\t \t\t \t\t \t \t \t\t\t\t", "a,b,c,d,e=map(int,input().split())\r\nx=(2*e)+(a*c)\r\ny=(2*d)+(a*b)\r\nif x<y:\r\n print(\"Second\")\r\nif x>y:\r\n print(\"First\")\r\nif x==y:\r\n print(\"Friendship\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu May 30 17:28:46 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nl = list(map(int, input().split()))\r\n\r\na = l[0]*l[1]+2*l[3]\r\nb = l[0]*l[2]+2*l[4]\r\n\r\nif a < b:\r\n print('First')\r\nelif a == b:\r\n print('Friendship')\r\nelse:\r\n print('Second')", "s,v1,v2,t1,t2=map(int,input().split())\r\na=v1*s+2*t1\r\nb=v2*s+2*t2\r\nif a<b:\r\n\tprint(\"First\")\r\nelif b<a:\r\n\tprint(\"Second\")\r\nelif b==a:\r\n\tprint(\"Friendship\")", "n, v1, v2, t1, t2 = list(map(int, input().split()))\r\n\r\na1 = t1 + v1 * n + t1\r\na2 = t2 + v2 * n + t2\r\nif a1 < a2:\r\n print('First')\r\nelif a2 < a1:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "n, a, x, b, y=map(int, input().split())\r\nt1 = a*n+2*b\r\nt2 = x*n+2*y\r\nif t1<t2:\r\n\tprint (\"First\\n\")\r\nelif t1>t2:\r\n\tprint (\"Second\\n\")\r\nelse:\r\n\tprint (\"Friendship\\n\")", "s,v1,v2,t1,t2=map(int,input().split())\r\np1=0\r\np2=0\r\np1=2*t1+v1*s\r\np2=2*t2+v2*s\r\nif(p1==p2):\r\n print(\"Friendship\")\r\nelif(p1<p2):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "nums = [int(x) for x in input().split()]\nfirst = nums[3] * 2 + nums[1] * nums[0]\nsecond = nums[4] * 2 + nums[2] * nums[0]\n\nif first < second:\n print(\"First\")\nelif second < first:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\nx = 2 * t1 + v1 * s\r\ny = 2 * t2 + v2 * s\r\nif x == y:\r\n print('Friendship')\r\nelif x < y:\r\n print('First')\r\nelse:\r\n print('Second')", "s, v1, v2, t1, t2 = map(int, input().split(\" \"))\r\n\r\ntimeP1 = s*v1 + t1*2\r\n\r\ntimeP2 = s*v2 + t2*2\r\n\r\nprint(\"First\") if timeP1 < timeP2 else print(\"Second\") if timeP2<timeP1 else print(\"Friendship\")", "n,v1,v2,t1,t2=map(int,input().split())\r\nfirst=(2*t1)+(n*v1)\r\nsecond=(2*t2)+(n*v2) \r\nif first>second:\r\n print('Second')\r\nelif second>first:\r\n print('First')\r\nelse:\r\n print('Friendship')", "s, v1, v2, t1, t2 = [int(i) for i in input().split()]\r\nu1 = 2 * t1 + s * v1\r\nu2 = 2 * t2 + s * v2\r\nif u1 < u2:\r\n print('First')\r\nelse:\r\n if u2 < u1:\r\n print('Second')\r\n else:\r\n print('Friendship')\r\n", "s, v1, v2, t1, t2= map(int, input().split())\r\na= t1*2 + v1*s\r\nb= t2*2 + v2*s\r\n\r\nif a<b:\r\n print('First')\r\nelif a>b:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "nums = [int(x) for x in input().split()]\n\np1 = nums[0]*nums[1]+2*nums[3]\np2 = nums[0]*nums[2]+2*nums[4]\n\nif p1 < p2:\n print(\"First\")\nelif p1 > p2:\n print(\"Second\")\nelse:\n print(\"Friendship\")", "A, B, C, D, E = map(int, input().split())\r\nif (D + A*B + D > E + A*C + E) :\r\n print(\"Second\")\r\nelif (D + A*B + D < E + A*C + E) :\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "n,v1,v2,t1,t2 = map(int, input().split())\r\nT1 = 2*t1 + n*v1\r\nT2 = 2*t2 + n*v2\r\nif T2<T1:\r\n print(\"Second\")\r\nelif T1==T2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"First\")", "s,v1,v2,t1,t2=[int(x) for x in input().split()]\r\nt1=v1*s+2*t1\r\nt2=v2*s+2*t2\r\nif t1<t2:print('First')\r\nelif t1>t2:print('Second')\r\nelse:print('Friendship')\r\n", "s,v1,v2,t1,t2= map(int, input (). split ())\r\nans1 = (s*v1)+(t1*2)\r\nans2 = (s*v2)+(t2*2)\r\nif ans1<ans2:\r\n print(\"First\")\r\nelif ans2<ans1:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "\r\nimport math\r\n\r\ndef solve():\r\n s,n1,n2,t1,t2=list(map(int,input().split()))\r\n r1=s*n1+2*t1\r\n r2=s*n2+2*t2\r\n\r\n if r1<r2:\r\n return \"First\"\r\n if r1>r2:\r\n return \"Second\"\r\n\r\n return \"Friendship\"\r\n\r\n\r\nprint(solve())", "s,v1,v2,t1,t2 = map(int,input().rstrip().split())\r\nif v1*s + 2*t1 < v2*s +2*t2:\r\n print(\"First\")\r\nelif v1*s + 2*t1 > v2*s +2*t2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nprint(\"First\" if s*v1+2*t1<s*v2+2*t2 else \"Second\" if s*v1+2*t1>s*v2+2*t2 else \"Friendship\")\r\n", "s,a,b,x,y=map(int,input().split())\r\np=s*a+2*x\r\nq=s*b+2*y\r\nif p<q:\r\n print(\"First\")\r\nelif p>q:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "\r\ns,v1,v2,t1,t2=map(int,input().strip().split())\r\n\r\n\r\nt_first = v1*s + 2*t1\r\nt_second = v2*s + 2*t2\r\n\r\nif t_first>t_second:\r\n print(\"Second\")\r\nelif t_second>t_first:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s, v1, v2, t1, t2 = map(int, input().split())\nr1 = (v1 * s) + (t1 * 2)\nr2 = (v2 * s) + (t2 * 2)\nprint(\"First\" if r1 < r2 else \"Second\" if r1 > r2 else \"Friendship\")\n", "s, a, b, c , d = map(int, input().split())\r\n\r\nif (s*a) + 2*c > (s*b) + 2*d:\r\n print(\"Second\")\r\nelif (s*a) + 2*c == (s*b) + 2*d:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"First\")", "# put your python code here\r\ns, v1, v2, t1, t2 = map(int,input().split())\r\nif s*v1+t1*2 < s*v2+t2*2:\r\n print('First')\r\nelif s*v1+t1*2 > s*v2+t2*2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "s,v1,v2,t1,t2 = map(int,input().split())\n\nif s * v1 + 2 * t1 < s * v2 + 2 * t2:\n print(\"First\")\nif s * v1 + 2 * t1 > s * v2 + 2 * t2:\n print(\"Second\")\nif s * v1 + 2 * t1 == s * v2 + 2 * t2:\n print(\"Friendship\")", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nl,t1,t2,p1,p2=map(int,input().strip().split()[:5])\nk1=(l*t1)+(2*p1)\nk2=(l*t2)+(2*p2)\nif k1<k2:\n\tprint('First')\nelif k2<k1:\n\tprint('Second')\nelse:\n\tprint('Friendship')", "a=[int(i) for i in input().split(\" \")]\r\ns=a[0]\r\nv1=a[1]\r\nv2=a[2]\r\np1=a[3]\r\np2=a[4]\r\nt1=2*p1+v1*s\r\nt2=2*p2+v2*s\r\nif(t1<t2):\r\n print(\"First\")\r\nelif (t2<t1):\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,v1,v2,t1,t2=map(int,input().split(' '))\r\nvalue1=(v1*s)+t1+t1\r\nvalue2=(v2*s)+t2+t2\r\nif value1<value2:\r\n print('First')\r\nelif value1>value2:\r\n print('Second')\r\nelse:\r\n print('Friendship')", "#!/usr/bin/env python3\ns, v1, v2, t1, t2 = map(int, input().split())\nif s*v1+2*t1 < s*v2+2*t2:\n print(\"First\")\nelif s*v1+2*t1 > s*v2+2*t2:\n print(\"Second\")\nelse:\n print(\"Friendship\")\n", "#python 3.7.1\r\na,b,c,d,e=map(int,input().split())\r\n\r\nif (a*c+2*e)<(a*b+2*d):\r\n print(\"Second\")\r\n \r\nelif (a*c+2*e)>(a*b+2*d):\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\np1=t1*2+v1*s\r\np2=t2*2+v2*s\r\nif p1<p2:\r\n print(\"First\")\r\nelse:\r\n if p1>p2:\r\n print(\"Second\")\r\n else:\r\n print(\"Friendship\")", "a,b,c,d,e=map(int,input().split())\r\ny1=a*b+2*d\r\ny2=a*c+2*e\r\nif y1<y2:\r\n print('First')\r\nif y1>y2:\r\n print('Second')\r\nif y1==y2:\r\n print('Friendship')\r\n", "a = list(map(int, input().split()))\r\nf = a[0]*a[1]+2*a[3]\r\ns = a[0]*a[2]+2*a[4]\r\nprint('Friendship' if f==s else 'First' if f<s else 'Second')", "settings = input().split()\r\ns = int(settings[0])\r\nv1 = int(settings[1])\r\nv2 = int(settings[2])\r\nt1 = int(settings[3])\r\nt2 = int(settings[4])\r\na = s * v1 + 2 * t1\r\nb = s * v2 + 2 * t2\r\nif a < b:\r\n print(\"First\")\r\nif b < a:\r\n print(\"Second\")\r\nif a == b:\r\n print(\"Friendship\")", "inp = list(map(int,input().split(' ')))\r\n\r\nfirst = 2*inp[-2] + inp[0] * inp[1]\r\nsecond = 2*inp[-1] + inp[0] * inp[2]\r\n\r\nif first == second:\r\n print('Friendship')\r\nelif first<second:\r\n print('First')\r\nelse:\r\n print('Second')", "\r\n\r\ns, v1, v2, t1, t2 = map(int, input().split(\" \"))\r\n\r\nfirst = s*v1+2*t1\r\nsecond = s*v2+2*t2\r\nif first == second:\r\n print(\"Friendship\")\r\nelif first > second:\r\n print(\"Second\")\r\nelif second > first:\r\n print(\"First\")\r\n", "# put your python code here\r\ns,u1,u2,t1,t2 = map(int,input().split())\r\nq1 = s*u1+2*t1\r\nq2 = s*u2+2*t2\r\nif q1 > q2:\r\n print('Second')\r\nelif q1 < q2:\r\n print('First')\r\nelse:\r\n print('Friendship')", "l = list(input().split())\r\ns = int(l[0])\r\nv1 = int(l[1])\r\nv2 = int(l[2])\r\nt1 = int(l[3])\r\nt2 = int(l[4])\r\nif ((2 * t1) + (s * v1)) > ((2 * t2) + (s * v2)):\r\n print(\"Second\")\r\nelif ((2 * t1) + (s * v1)) < ((2 * t2) + (s * v2)):\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")", "a = list(map(int, input().split()))\n\nx= a[0]*a[1]+2*a[3]\ny = a[0]*a[2]+2*a[4]\n\nif x < y:\n\tprint(\"First\")\nelif x > y:\n\tprint(\"Second\")\nelse:\n\tprint(\"Friendship\")", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n s,v1,v2,t1,t2 = map(int,wtf[0].split())\r\n V1 = s*v1+2*t1\r\n V2 = s*v2+2*t2\r\n if V1 < V2:\r\n print('First')\r\n if V1 > V2:\r\n print('Second')\r\n if V1 == V2:\r\n print('Friendship')\r\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\nsuma1 = t1 + s*v1 + t1\r\nsuma2 = t2 + s*v2 + t2\r\nif suma1 == suma2:\r\n print(\"Friendship\")\r\nelif suma1 < suma2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b,c,d,e=[int(x) for x in input().split()]\nx=a*b+2*d\ny=a*c+2*e\nif(x<y):\n print('First')\nelif(y<x):\n print('Second')\nelse:\n print('Friendship')\n", "s, v1, v2, t1, t2 = map(int, input().split())\r\n\r\none = v1 * s + 2 * t1\r\ntwo = v2 * s + 2 * t2\r\n\r\nif one == two:\r\n print(\"Friendship\")\r\nelif one < two:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\") ", "t, v1, v2, t1, t2 = [int(x) for x in input().split()]\r\n\r\nta = 2 * t1 + v1 * t\r\ntb = 2 * t2 + v2 * t\r\n\r\nif ta < tb:\r\n print(\"First\")\r\nelif ta == tb:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")", "ins = input().split(\" \")\r\nn = int(ins[0])\r\nv1 = int(ins[1])\r\nv2 = int(ins[2])\r\nt1 = int(ins[3])\r\nt2 = int(ins[4])\r\na = (n * v1) + (2 * t1)\r\nb = (n * v2) + (2 * t2)\r\nif a < b:\r\n print(\"First\")\r\nelif a > b:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "#835 in codeforces\r\ns,v1,v2,t1,t2 = map(int,input().split())\r\ntime_for_first = s*v1 + 2*t1\r\ntime_for_second = s*v2 + 2*t2\r\nif time_for_first<time_for_second:\r\n\tprint(\"First\")\r\nelif time_for_second==time_for_first:\r\n\tprint(\"Friendship\")\r\nelse:\r\n\tprint(\"Second\")", "s, v1, v2, t1, t2=[int(i) for i in input().split()]\r\nv1=(v1*s)+(2*t1)\r\nv2=(v2*s)+(2*t2)\r\nif v1==v2:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"First\" if v1<v2 else \"Second\")", "a = list(map(int, input().split(' ')))\r\nc = (a[0] * a[1] + 2*a[3]) - (a[0]*a[2] + 2*a[4])\r\nif(c < 0):\r\n print('First')\r\nelif (c > 0):\r\n print('Second')\r\nelse:\r\n print('Friendship')", "test_data = [int(element) for element in input().split()]\r\ntime_1 = test_data[0] * test_data[1] + test_data[3] + test_data[3]\r\ntime_2 = test_data[0] * test_data[2] + test_data[4] + test_data[4]\r\nif time_1 < time_2:\r\n print(\"First\")\r\nelif time_1 > time_2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\na=s*v1+t1*2\r\nb=s*v2+t2*2\r\nif a==b:print(\"Friendship\")\r\nif a<b:print(\"First\")\r\nif a>b:print(\"Second\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nn=(s*v1)+(t1*2)\r\nl=(s*v2)+(t2*2)\r\nif n<l:\r\n print(\"First\")\r\nelif n>l:\r\n print(\"Second\")\r\nelse:\r\n print(\"Friendship\")\r\n", "s,a,b,t1,t2=map(int,input().split())\r\nT1=s*a+2*t1\r\nT2=s*b+2*t2\r\nif T1>T2:\r\n\tprint(\"Second\")\r\nelif T2>T1:\r\n\tprint(\"First\")\r\nelse:\r\n\tprint(\"Friendship\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nif s*v1 + 2*t1 == s*v2 + 2*t2:\r\n print(\"Friendship\")\r\nelif s*v1 + 2*t1 < s*v2 + 2*t2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "s,v1,v2,t1,t2=map(int,input().split())\r\nf=t1*2+s*v1\r\ns=t2*2+s*v2\r\nif f==s:\r\n print(\"Friendship\")\r\nelif f<s:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "s,v1,v2,t1,t2 = map(int,input().split())\r\na = v1*s+2*t1\r\nb = v2*s+2*t2\r\nif a<b:\r\n print(\"First\")\r\nelif a==b:\r\n print(\"Friendship\")\r\nelse:\r\n print(\"Second\")" ]

[ "n=int(input())#numero de montones\r\na=[int(x) for x in input().split(' ')]#cantidad por monton\r\nm=int(input())#gusanos sabrosos\r\nq=[int(x) for x in input().split(' ')]#etiquetas de los gusanos sabrosos\r\nmonton={}\r\ncontador=1\r\nfor i in range(n):\r\n for j in range(a[i]):\r\n monton[contador]=i+1\r\n contador+=1\r\nfor x in q:\r\n print(monton[x])", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nfor i in range(1,n):\r\n a[i] += a[i-1]\r\nc = []\r\ncnt = 0\r\nfor i in range(1,a[-1]+1):\r\n if(a[cnt] >= i):\r\n c += [cnt]\r\n else:\r\n c += [cnt + 1]\r\n cnt += 1\r\nfor i in range(m):\r\n print(c[b[i]-1]+1)", "from collections import defaultdict\n\ninput()\n\na = list(map(int, input().split()))\n\ninput()\n\nq = list(map(int, input().split()))\n\npos = defaultdict()\npos.setdefault(0)\n\ncf = [a[0]]\ncf.extend([0] * len(a))\n\n\nfor worm in range(cf[0]):\n pos[worm + 1] = 1\n\np = 1\nfor pile in a[1:]:\n worms_size = pile\n cf[p] = cf[p - 1] + pile\n\n for worm in range(cf[p - 1], cf[p]):\n pos[worm + 1] = p + 1\n\n p += 1\n\nfor juicy in q:\n print(pos[juicy])\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nlookup = []\r\ngroup_no = 0\r\nfor x in a:\r\n group_no += 1\r\n for i in range(x):\r\n lookup.append(group_no)\r\n\r\nm = int(input())\r\nb = [int(x) for x in input().split()]\r\nfor x in b:\r\n print(lookup[x - 1])", "n = int(input())\r\nheaps = list(map(int, input().split()))\r\nvalue = 0\r\nup = int(input())\r\nrequests = list(map(int, input().split()))\r\nanswer = [-1]\r\nvalue = 0\r\nfor i in heaps:\r\n value += 1\r\n for j in range(i):\r\n answer.append(value)\r\nfor i in requests:\r\n print(answer[i])\r\n", "def find_worm_piles(n, piles, m, worms):\r\n prefix_sum = [0] * (n + 1)\r\n\r\n # 计算前缀和\r\n for i in range(1, n + 1):\r\n prefix_sum[i] = prefix_sum[i - 1] + piles[i - 1]\r\n\r\n result = []\r\n for j in range(m):\r\n worm_label = worms[j]\r\n\r\n # 二分查找虫子所在的堆\r\n left, right = 1, n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if worm_label <= prefix_sum[mid]:\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n\r\n result.append(left)\r\n\r\n return result\r\n\r\n\r\n# 读取输入\r\nn = int(input())\r\npiles = list(map(int, input().split()))\r\nm = int(input())\r\nworms = list(map(int, input().split()))\r\n\r\n# 调用函数并输出结果\r\nanswers = find_worm_piles(n, piles, m, worms)\r\nfor answer in answers:\r\n print(answer)\r\n", "def binarySearch(num,start,end):\r\n middle = (end + start)//2\r\n if worms[middle][0]<=num<=worms[middle][1]:\r\n return middle\r\n if num < worms[middle][0] :\r\n return binarySearch(num,start,middle)\r\n if num > worms[middle][1]:\r\n return binarySearch(num,middle,end)\r\n\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nq = list(map(int,input().split()))\r\nworms = []\r\nstart = 1\r\nfor i in range(n):\r\n end = start + a[i] -1\r\n worms.append([start,end])\r\n\r\n start = end+1\r\n\r\nfor j in q:\r\n print(binarySearch(j,0,n)+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nlabels = int(input())\r\nlabel = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n store = arr[i]\r\n arr[i] += s\r\n s += store\r\nfor l in label:\r\n low, high = 0, n - 1\r\n ans = -1\r\n while low <= high:\r\n mid = (low + high) // 2\r\n if l <= arr[mid]:\r\n ans = mid\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n print(ans + 1)", "from bisect import *\n\nn = int(input())\na = list(map(int,input().split()))\nm = int(input())\nms = list(map(int,input().split()))\n\ncmltve = []\ntemp = 0\n\nfor i in a:\n temp += i\n cmltve.append(temp)\n\nfor i in ms:\n x = bisect_left(cmltve,i) + 1\n print(x)\n\n\t \t \t\t\t \t \t\t\t \t \t\t\t \t", "def bs(arr,x):\r\n lo=0\r\n hi=len(arr)-1\r\n while lo<hi:\r\n mid=(lo+hi)//2\r\n if x>arr[mid]:\r\n lo=mid+1\r\n else:\r\n hi=mid\r\n return lo\r\n\r\nn=int(input())\r\narr=[int(i) for i in input().split()]\r\nfor i in range(n-1):\r\n arr[i+1]+=arr[i]\r\nm=int(input())\r\nq=[int(i) for i in input().split()]\r\nfor i in q:\r\n print(1+bs(arr,i))", "n = int(input())\r\na = list(map(int, input().split()))\r\n_ = input()\r\nq = input().split()\r\nans = []\r\nfor i in range(n):\r\n ans.extend([i+1]*a[i])\r\nfor x in q:\r\n print(ans[int(x)-1])\r\n", "a, n = int(input()), list(map(int, input().split()))\r\nb, m = int(input()), list(map(int, input().split()))\r\nanswer = []\r\nvalue = 1\r\nk = 0\r\nfor i in n:\r\n for j in range(i):\r\n answer.append(value)\r\n value += 1\r\nfor i in m:\r\n print(answer[i - 1])\r\n", "a = int(input())\ns = [0]\nfor i in input().split():\n s.append(s[-1]+int(i))\ninput()\nfor i in input().split():\n i = int(i)\n b = a // 2 + 1\n c = 0\n d = a\n while True:\n if i > s[b]:\n c = b\n b = (c + d)//2 + 1\n elif i <s[b]:\n if i > s[b-1]:\n break\n else:\n d = b\n b = (c+d)//2\n else:\n break\n print(b)\n\n\n\n", "pile=int(input())\r\npiles=list(map(int,input().split()))\r\nworm=int(input())\r\nworms=list(map(int,input().split()))\r\nworms_copy=worms[:]\r\nworms.sort()\r\nanswers={}\r\ndigit=0\r\npre=0\r\nfor i in worms:\r\n tem=i\r\n i-=pre\r\n while i > 0:\r\n i-=piles[digit]\r\n if i>0:\r\n digit+=1\r\n if digit>0:\r\n pre=tem-i-piles[digit]\r\n answers[tem]=digit+1\r\nfor keys in worms_copy:\r\n print(answers[keys])", "arr = []\r\nn = int(input())\r\nr = 1\r\nfor k in input().split():\r\n arr += [r] * int(k)\r\n r += 1\r\nm = int(input())\r\nfor j in input().split():\r\n print(arr[int(j) - 1])", "N=int(input().strip())\r\na=list(map(int,input().strip().split()))\r\nm=int(input().strip())\r\nq=list(map(int,input().strip().split()))\r\np=[a[0]]\r\nfor i in range(1,N):\r\n p.append(p[-1]+a[i])\r\nfor i in range(m):\r\n l,r=-1,N+1\r\n while r-l>1:\r\n mid = (l+r)//2\r\n if p[mid]<q[i]:\r\n l=mid\r\n else:\r\n r=mid\r\n print(r+1)", "n = int(input())\r\npile = []\r\npile = input().split()[:n]\r\nfor j in range(n):\r\n pile[j] = int(pile[j])\r\nm = int(input())\r\ntest = []\r\ntest = input().split()[:m]\r\nfor j in range(m):\r\n test[j] = int(test[j])\r\n\r\nmilestone = []\r\nout = []\r\nk = 0\r\nfor i in pile:\r\n k += i\r\n milestone.append(k)\r\nmilestone.sort()\r\n\r\nl = 0\r\nr = n - 1\r\n\r\nfor i in test:\r\n while l != r:\r\n if i <= milestone[(l+r)//2]:\r\n r = (l+r)//2\r\n else: l = (l+r)//2 + 1\r\n out.append(l+1)\r\n l = 0\r\n r = n - 1\r\n \r\n\r\nfor i in out:\r\n print(i)\r\n \r\n\r\n\r\n", "def binary_search(a, target):\r\n low, high = 0, len(a) - 1\r\n\r\n while low <= high:\r\n mid = (low + high) // 2\r\n\r\n if a[mid] == target:\r\n return mid\r\n elif a[mid] < target:\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\n\r\n return low\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\n\r\n# Calculate cumulative sum\r\ncumulative_sum = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n cumulative_sum[i] = cumulative_sum[i - 1] + a[i - 1]\r\n\r\n# Process queries\r\nfor i in q:\r\n index = binary_search(cumulative_sum, i)\r\n print(index)\r\n", "def leastgreater(low, high, key, a):\r\n ans = -1\r\n\r\n while (low <= high):\r\n mid = low + ((high - low + 1) // 2)\r\n midVal = a[mid]\r\n\r\n if (midVal < key):\r\n low = mid + 1\r\n\r\n elif (midVal > key):\r\n # if mid is greater than key, all elements\r\n # in range [mid + 1, high] are >= key\r\n # we note down the last found index, then\r\n # we search in left side of mid\r\n # so we now search in [low, mid - 1]\r\n ans = mid\r\n high = mid - 1\r\n\r\n elif (midVal == key):\r\n\r\n # if mid is equal to key, all elements in\r\n # range [low, mid] are <= key\r\n # so we now search in [mid + 1, high]\r\n low = mid + 1\r\n\r\n return ans\r\n\r\ndef contains(low, high, key, a):\r\n ans = False\r\n while (low <= high):\r\n mid = low + ((high - low) // 2)\r\n midVal = a[mid]\r\n\r\n if (midVal < key):\r\n low = mid + 1\r\n\r\n elif (midVal > key):\r\n high = mid - 1\r\n\r\n elif (midVal == key):\r\n\r\n ans = True\r\n break\r\n\r\n return [mid,ans]\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nnew = []\r\ncurr = 0\r\nfor i in a:\r\n curr += i\r\n new.append(curr)\r\nfor k in b:\r\n f,s = contains(0,n-1,k,new)\r\n if s:\r\n print(f+1)\r\n else:\r\n print(leastgreater(0,n-1,k,new)+1)\r\n", "from bisect import bisect_left\r\nfrom itertools import accumulate\r\n\r\n\r\nn = int(input())\r\nA = list(map(int,input().strip().split()))\r\nm = int(input())\r\nQ = list(map(int,input().strip().split()))\r\n\r\ncum_a = list(accumulate(A))\r\n\r\nfor q in Q:\r\n i = bisect_left(cum_a,q)\r\n print(i + 1 )", "n = int(input())\n\na = list(map(int, input().split()))\n\nm = int(input())\n\nb = list(map(int, input().split()))\n\nd = list()\n\nh = 0\nfor i in range(len(a)):\n h += a[i]\n d.append(h)\n\nd = d\n\n#print(d)\n\n\nfor i in range(len(b)):\n\n l = -1\n r = n - 1\n while r - l > 1:\n z = (r + l) // 2\n \n\n if b[i] > d[z]:\n l = z\n else:\n r = z\n\n print(r + 1)\n\n\n\n\n\n\n\n\n\n\n\n\n\n ", "def binary(li,l,r,k):\r\n t=-1\r\n while l<=r:\r\n mid=l+(r-l)//2\r\n if li[mid]>=k:\r\n t=mid\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n return t\r\na=int(input())\r\nj=0\r\na1=[j:=(j+(int(i))) for i in input().split()]\r\nb=int(input())\r\nb1=map(int,input().split())\r\nfor i in b1:\r\n print(binary(a1,0,a-1,i)+1)", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nc = [0]*n\r\n\r\nfor i in range(n):\r\n if not i:\r\n c[0] = a[0]\r\n else:\r\n c[i] = c[i - 1] + a[i]\r\n\r\nfor i in range(m):\r\n left = -1\r\n right = n - 1\r\n while left + 1 != right:\r\n m = (left + right) // 2\r\n if b[i] <= c[m]:\r\n right = m\r\n else:\r\n left = m\r\n print(left + 2)\r\n", "def conversor(lista):\r\n return list(map(int, lista))\r\ndef solucion(num_W,label_j_W):\r\n lista_2 = []\r\n for i in range(len(num_W)):\r\n j = 0\r\n while j < num_W[i]:\r\n lista_2.append(i+1)\r\n j += 1\r\n for i in range(len(label_j_W)):\r\n print(lista_2[label_j_W[i]-1])\r\n \r\ndef main():\r\n '''Funcion principal'''\r\n input()\r\n num_W = conversor(input().split())\r\n input()\r\n label_j_W = conversor(input().split())\r\n solucion(num_W,label_j_W)\r\nmain()", "# t = int(input())\nt = 1\n\ndef find_key(key: int, cdf: list, start: int, end: int):\n mid = (start+end)//2\n if cdf[mid] >= key:\n if mid==0:\n return mid\n else:\n if cdf[mid-1] < key:\n return mid\n else:\n return find_key(key, cdf, start, mid)\n \n else:\n return find_key(key, cdf, mid+1, end)\n\n\n\ndef cp():\n n = int(input())\n lst = list(map(int,input().split()))\n q = int(input())\n q_list = list(map(int,input().split()))\n for i in range(n):\n if i!=0:\n lst[i] += lst[i-1]\n \n for q_val in q_list:\n x = find_key(q_val, lst, 0, n-1)\n print(x+1)\n\n\n\n\n\nfor i in range(t):\n cp()\n", "import sys\r\nnumpiles = int(sys.stdin.readline())\r\nsumlist=[]\r\nworms = [int(x) for x in sys.stdin.readline().split()]\r\njuicy = int(sys.stdin.readline())\r\nlabel = [int(x) for x in sys.stdin.readline().split()]\r\nag = 0\r\nfor x in worms:\r\n ag+=x\r\n sumlist.append(ag)\r\nfor l in range(0,len(label)):\r\n L = 0\r\n R = len(sumlist)-1\r\n ans = 0\r\n while L<=R:\r\n mid =L+(R-L)//2\r\n midval = sumlist[mid]\r\n search = label[l]\r\n if midval>search:\r\n ans = mid\r\n R = mid-1\r\n elif midval == search:\r\n ans=mid\r\n break\r\n else:\r\n L=mid+1\r\n print(ans+1)\r\n", "import bisect\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nt=int(input())\r\narr2=list(map(int,input().split()))\r\n\r\nfor i in range(1,n):\r\n arr[i]+=arr[i-1]\r\nfor i in arr2: \r\n res=bisect.bisect_left(arr,int(i))\r\n print(res+1) ", "def bina(ls,i,j,key):\r\n while i<=j:\r\n mid=(i+j)//2\r\n if ls[mid]==key:\r\n return mid+1\r\n elif ls[mid]<key:\r\n i=mid+1\r\n elif ls[mid]>key:\r\n j=mid-1\r\n return i+1\r\nq=int(input())\r\nls=list(map(int,input().split()))\r\nq=int(input())\r\narr=list(map(int,input().split()))\r\nfor i in range(1,len(ls)):\r\n ls[i]+=ls[i-1]\r\nfor i in arr:\r\n print(bina(ls,0,len(ls)-1,i))", "import bisect\r\nleft = lambda l,a : bisect.bisect_left(l,a) #returns index of value>=a\r\nright = lambda l,a : bisect.bisect_right(l,a) #returns index of value >a\r\nimport sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn = int(input())\r\nl = []\r\ns = 0\r\nfor x in getints():\r\n s += x\r\n l.append(s)\r\nm = int(input())\r\nfor x in getints():\r\n print(left(l,x)+1)", "import sys\r\nfrom bisect import bisect_left\r\n\r\na = int(sys.stdin.readline())\r\nl = list(map(int, sys.stdin.readline().split()))\r\nb = int(sys.stdin.readline())\r\nq = list(map(int, sys.stdin.readline().split()))\r\n\r\n# Calculate the prefix sums of l\r\nw = [0] * a\r\nw[0] = l[0]\r\nfor i in range(1, a):\r\n w[i] = l[i] + w[i - 1]\r\n\r\n# Perform binary search for each element in q\r\nfor x in q:\r\n index = bisect_left(w, x)\r\n if index == a:\r\n print(a)\r\n else:\r\n print(index + 1)\r\n", "def main():\r\n n=int(input())\r\n worm=[]\r\n worms=[int(x) for x in input().split()]\r\n p=0\r\n for w in worms:\r\n worm.append(w+p)\r\n p=worm[-1]\r\n m=int(input())\r\n xs=[int(x) for x in input().split()]\r\n for x in xs:\r\n l=-1\r\n r=n\r\n while(r-l>1):\r\n m=(r+l)//2\r\n if (worm[m]<x): l=m\r\n else: r=m\r\n print(r+1)\r\nmain()", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb\r\n\r\n# 在线做法\r\n_ = input()\r\nL = list(map(int, input().split()))\r\ncount = int(input())\r\njuicy = list(map(int, input().split()))\r\npre = [L[0]]\r\nfor i in range(1, len(L)):\r\n pre.append(pre[-1] + L[i])\r\n# print(pre)\r\nfor i in range(len(juicy)):\r\n left = 0\r\n right = len(pre) - 1\r\n while left < right:\r\n middle = (left + right) // 2\r\n if pre[middle] >= juicy[i]:\r\n right = middle\r\n else:\r\n left = middle + 1\r\n print(left + 1)", "\"\"\"\r\n author: Adham0 \r\n created: 06.08.2023 14:53:03\r\n ### I was here ###\r\n \r\n █████ ██████ ██ ██ █████ ███ ███\r\n ██ ██ ██ ██ ██ ██ ██ ██ ████ ████\r\n ███████ ██ ██ ███████ ███████ ██ ████ ██\r\n ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n ██ ██ ██████ ██ ██ ██ ██ ██ ██\r\n\"\"\"\r\n\r\nimport bisect, itertools\r\n\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\narr = list(itertools.accumulate(arr))\r\n\r\nq = int(input())\r\nq_arr = [int(i) for i in input().split()]\r\nfor i in q_arr:\r\n ind = bisect.bisect_left(arr, i) + 1\r\n print(ind)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\n\r\nprefix_sum = [a[0]]\r\nfor i in range(1, n):\r\n prefix_sum.append(prefix_sum[-1] + a[i])\r\n\r\nfor i in range(m):\r\n label = q[i]\r\n left, right = 0, n - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if label <= prefix_sum[mid]:\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n print(left + 1)", "n=int(input())\r\nls=list(map(int,input().split()))\r\nm=int(input())\r\nlabels=list(map(int,input().split()))\r\nfor i in range(1,len(ls)):\r\n ls[i]+=ls[i-1]\r\nfor i in range(len(labels)):\r\n low=0\r\n high=len(ls)-1\r\n while(low<=high):\r\n mid=low+(high-low)//2\r\n if labels[i]>ls[mid]:\r\n low=mid+1\r\n else:\r\n high=mid-1\r\n print(low+1)", "# Lee la entrada\r\nn = int(input())\r\npiles = list(map(int, input().split()))\r\nm = int(input())\r\nqueries = list(map(int, input().split()))\r\n\r\n# Construye una lista acumulativa para los montones de gusanos\r\n# La posición i en la lista acumulativa contiene la suma de los tamaños de los montones de gusanos\r\n# desde el primer montón hasta el i-ésimo montón.\r\nacc = [piles[0]]\r\nfor i in range(1, n):\r\n acc.append(acc[i-1] + piles[i])\r\n\r\n# Resuelve las consultas\r\nfor q in queries:\r\n # Usa la búsqueda binaria para encontrar el montón de gusanos que contiene la consulta\r\n lo = 0\r\n hi = n - 1\r\n while lo < hi:\r\n mid = (lo + hi) // 2\r\n if acc[mid] < q:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n\r\n # Imprime el índice del montón de gusanos que contiene la consulta\r\n print(lo + 1)", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nm = int(input())\r\nreq = list(map(int, input().split()))\r\n# print(mas, req, sep='\\n')\r\n\r\nhip = [0, mas[0]]\r\nfor i in range(1, n):\r\n hip.append(hip[i] + mas[i])\r\n# print(hip)\r\nfor i in range(m):\r\n l, r = 0, n\r\n while r - l > 1:\r\n # print(l, r)\r\n mid = (l + r) // 2\r\n if req[i] > hip[mid]:\r\n l = mid\r\n else:\r\n r = mid\r\n # ans = l + 1\r\n print(r)", "import sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n wormPileInfos:list[int] = []\r\n juicyWormLabels:list[int] = []\r\n input()\r\n wormPileInfos = inputArray()\r\n input()\r\n juicyWormLabels = inputArray()\r\n\r\n\r\n accSum:list[int] = [0]\r\n for wormPileInfo in wormPileInfos :\r\n accSum.append(accSum[-1]+wormPileInfo)\r\n\r\n pileNumbers:list[int] = []\r\n for juicyWormLabel in juicyWormLabels :\r\n pileNumbers.append(bisect.bisect_left(accSum, juicyWormLabel))\r\n\r\n\r\n print(\"\\n\".join(map(str, pileNumbers)))\r\n\r\ndef inputArray() -> list[int] :\r\n return list(map(int, input().split()))\r\n\r\nmain()", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\ns = []\r\nfor i in range(n):\r\n for j in range(a[i]):\r\n s.append(i + 1)\r\nfor i in q:\r\n print(s[i-1])\r\n", "n_piles = int(input())\r\npiles = [int(x) for x in input().split(\" \")]\r\nm_juicy_w = int(input())\r\nl_juicy_w = [int(x) for x in input().split(\" \")]\r\nj_pos = []\r\nsorted_piles = [piles[0]]\r\n\r\nfor i in range(1, n_piles):\r\n sorted_piles.append(piles[i] + sorted_piles[i-1])\r\n\r\n\r\n\r\nfor i in range(m_juicy_w):\r\n found = False\r\n l = 0\r\n r = n_piles\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if l_juicy_w[i] < sorted_piles[mid]:\r\n r = mid - 1\r\n if l_juicy_w[i] > sorted_piles[mid]:\r\n l = mid + 1\r\n if l_juicy_w[i] == sorted_piles[mid]:\r\n print(mid + 1)\r\n found = True\r\n break\r\n if not found:\r\n print(l + 1)", "from itertools import accumulate\r\nfrom bisect import bisect_left\r\nimport sys\r\ninput = sys.stdin.readline\r\nn=int(input())\r\nworms=list(map(int,input().split()))\r\nm=int(input())\r\njuicy_worms=list(map(int,input().split()))\r\nqzh=list(accumulate(worms))\r\nfor k in juicy_worms:\r\n print(bisect_left(qzh,k)+1)\r\n", "def find_pile(query, piles):\r\n left, right = 0, len(piles) - 1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n start, end = piles[mid]\r\n \r\n if start <= query <= end:\r\n return mid + 1\r\n elif query < start:\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n\r\n return -1\r\n\r\ndef main():\r\n\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n q = list(map(int, input().split()))\r\n\r\n piles = {}\r\n piles[0] = (1, a[0])\r\n\r\n for i in range(1, n):\r\n piles[i] = (piles[i-1][1] + 1, piles[i-1][1] + a[i])\r\n\r\n for query in q:\r\n pile = find_pile(query, piles)\r\n print(pile)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\nlo=1\r\nans=[]\r\nfor i in a:\r\n for j in range(i):\r\n ans.append(lo)\r\n lo += 1 \r\nfor j in q:\r\n print(ans[j - 1])", "def bin_left(x, a):\r\n left = -1\r\n right = len(a)\r\n while right - left > 1:\r\n middle = (right + left)//2\r\n if a[middle] < x:\r\n left = middle\r\n else:\r\n right = middle\r\n return right\r\n\r\n\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nfor i in range(n-1):\r\n a[i+1] += a[i]\r\nfor i in range(len(b)):\r\n print(bin_left(b[i],a)+1)", "def solucion(num_W, label_j_W):\r\n lista_2 = [i+1 for i, num in enumerate(num_W) for j in range(num)]\r\n for label in label_j_W:\r\n print(lista_2[label-1])\r\n \r\ndef main():\r\n '''Funcion principal'''\r\n input()\r\n num_W = [int(x) for x in input().split()]\r\n input()\r\n label_j_W = [int(x) for x in input().split()]\r\n solucion(num_W, label_j_W)\r\n \r\nmain()", "from math import *\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\nh=sorted(q.copy())\r\nr={}\r\nc=0\r\nj=0\r\nt=0\r\nfor i in range(n):\r\n c+=a[i]\r\n j+=1\r\n while t<m:\r\n if h[t]<=c:\r\n r[h[t]]=j\r\n else:\r\n break\r\n t+=1\r\nfor i in range(m):\r\n print(r[q[i]])", "def Binary_Search(ls,key):\r\n low,high=0,len(ls)-1\r\n while low<=high:\r\n mid=(low+high)//2 \r\n if ls[mid]==key:return mid \r\n elif key>ls[mid]: low=mid+1\r\n else:high=mid-1\r\n return low\r\nn,x=int(input()),list(map(int,input().split()))\r\nfor i in range(1,n):\r\n x[i]+=x[i-1]\r\nno=int(input())\r\nnums=list(map(int,input().split()))\r\nfor i in nums:\r\n print(Binary_Search(x,i)+1)", "import math\nimport bisect\nn=int(input())\na=list(map(int,input().split()))\nfor i in range(1,n):\n a[i]+=a[i-1]\nq=int(input())\nb=list(map(int,input().split()))\nfor i in b:\n print(bisect.bisect_left(a,i)+1)\n\n\t\t \t \t \t\t\t\t\t\t\t\t \t \t\t \t\t", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\nres=[]\r\nres.append(1)\r\ns=0\r\nfor i in range(n-1):\r\n\ts+=a[i]\r\n\tres.append(s+1)\r\nfor i in range(m):\r\n\tcurr=q[i]\r\n\tl=0\r\n\tr=n\r\n\twhile (r-l)>1:\r\n\t\tmid=l+(r-l)//2\r\n\t\tif res[mid]<=curr:\r\n\t\t\tl=mid\r\n\t\telse:\r\n\t\t\tr=mid\r\n\tprint(l+1)", "from sys import stdin,stdout\nfrom bisect import bisect_left,bisect\n# from sys import setrecursionlimit\n# from collections import defaultdict\n# from math import gcd,ceil,sqrt\n# setrecursionlimit(int(1e5))\ninput,print = stdin.readline,stdout.write\n# t = 1\nn = int(input())\na = list(map(int,input().split()))\nm = int(input())\nq = list(map(int,input().split()))\nfor i in range(1,n):\n\ta[i]+=a[i-1]\nfor i in q:\n\tprint(str(bisect_left(a,i)+1)+\"\\n\")\n\n \t \t \t\t\t\t \t \t \t \t \t \t", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nx=int(input())\r\nthat=[int(i) for i in input().split()]\r\n\r\nimport bisect\r\n\r\n\r\npre=[0]*(n)\r\npre[0]=arr[0]\r\nfor i in range(1,n):\r\n pre[i]=pre[i-1]+arr[i]\r\nfor i in that:\r\n print(bisect.bisect_left(pre,i)+1)", "n = int(input())\na = [int(i) for i in input().split()]\nm = int(input())\npref = [a[0]] * n\nfor i in range(1, n):\n pref[i] = pref[i - 1] + a[i]\nq = [int(i) for i in input().split()]\nfor i in range(m):\n r = n\n l = 0\n while r - l > 1:\n mid = (r + l) // 2\n if q[i] > pref[mid]:\n l = mid\n else:\n r = mid\n if q[i] <= pref[r - 1]:\n r -= 1\n print(r + 1)\n# Thu Oct 19 2023 19:55:00 GMT+0300 (Moscow Standard Time)\n", "def Solve(worms, jWorms):\r\n\r\n counts = [0] * len(worms)\r\n sum = 0\r\n\r\n for i in range(len(worms)):\r\n sum += worms[i]\r\n counts[i] = sum\r\n\r\n ind = 0\r\n wormSum = [0] * (sum + 1)\r\n\r\n for i in range(1, sum + 1):\r\n if i > counts[ind]:\r\n ind += 1\r\n wormSum[i] = ind + 1\r\n\r\n m = len(jWorms)\r\n\r\n for i in range(m):\r\n print(wormSum[jWorms[i]])\r\n \r\n\r\nif __name__ == '__main__':\r\n\r\n total_worms = int(input())\r\n\r\n worm_li = list(map(int,input().split()))\r\n\r\n j = int(input())\r\n\r\n j_worm = list(map(int, input().split()))\r\n\r\n Solve(worm_li, j_worm)", "T=[] ; input() ; p=1\r\nfor i in input().split():\r\n T+=[p]*int(i) ; p+=1\r\ninput()\r\nfor i in input().split():\r\n print(T[int(i)-1])", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nq = list(map(int, input().split()))\n\nps = [0] * (n+1)\nps[0] = a[0]\n\nfor i in range(1, n):\n\tps[i] = ps[i-1] + a[i]\n\nfor q_i in q:\n\tlow = 0\n\thigh = n\n\twhile low < high:\n\t\tmid = (low + high) // 2\n\t\tif ps[mid] < q_i:\n\t\t\tlow = mid + 1\n\t\telse:\n\t\t\thigh = mid\n\tprint(low+1)\n\n", "# cook your dish here\r\nn = int(input())\r\npiles = list(map(int, input().split()))\r\n\r\ncumulativeSum = [0] * n\r\ntotalWorms = 0\r\n\r\nfor i in range(n):\r\n totalWorms += piles[i]\r\n cumulativeSum[i] = totalWorms\r\n\r\nm = int(input())\r\njuicyWorms = list(map(int, input().split()))\r\n\r\nfor label in juicyWorms:\r\n leftIndex = 0\r\n rightIndex = n - 1\r\n\r\n while leftIndex <= rightIndex:\r\n middleIndex = (leftIndex + rightIndex) // 2\r\n\r\n if label <= cumulativeSum[middleIndex] and (middleIndex == 0 or label > cumulativeSum[middleIndex - 1]):\r\n print(middleIndex + 1)\r\n break\r\n elif label > cumulativeSum[middleIndex]:\r\n leftIndex = middleIndex + 1\r\n else:\r\n rightIndex = middleIndex - 1\r\n", "n = int(input())\nbuckets = list(map(int, input().split()))\nj = int(input())\nids = list(map(int, input().split()))\n\nrecords = [0] * (10**6 +1)\n\np = 1\nfor b in range(n):\n for i in range(p, buckets[b]+p):\n records[i] = b + 1\n if i == buckets[b]+p-1:\n p = i + 1\n\nfor i in range(j):\n print(records[ids[i]])\n\n \t \t\t\t \t\t \t \t\t \t \t\t\t \t\t\t\t \t", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\na = list(map(int,sys.stdin.readline().split()))\r\nq = int(sys.stdin.readline())\r\nb = list(map(int,sys.stdin.readline().split()))\r\nwrap =[]\r\nfor i in range(len(a)):\r\n for j in range(a[i]):\r\n wrap.append(i+1)\r\nfor i in b:\r\n print(wrap[i-1])", "\r\npiles=int(input())\r\nworms = list(map(int,input().split()))\r\ninput()\r\ntargets = list(map(int,input().split()))\r\n\r\nfor i in range(1,piles):\r\n worms[i]=worms[i]+worms[i-1]\r\n\r\ndef binary(target):\r\n # print(target,\" ##\")\r\n i=-1\r\n j=piles-1\r\n while i+1<j:\r\n mid = (i+j)//2\r\n if worms[mid]>=target:\r\n j=mid\r\n else:\r\n i=mid \r\n return j+1\r\n\r\nfor target in targets:\r\n value = binary(target)\r\n print(value)\r\n# print(worms)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\ns = list()\r\nz = 0\r\ndef search(s, o):\r\n l = 0\r\n r = len(s)\r\n while l != r:\r\n m = (l+r) // 2\r\n if s[m] < o:\r\n l = m + 1\r\n else:\r\n r = m\r\n return r + 1\r\n\r\nfor i in a:\r\n z += i\r\n s.append(z)\r\nfor q in b:\r\n print(search(s, q))\r\n", "\r\nn = int(input())\r\nq = input().split()\r\nq = [ int(x) for x in q]\r\nm = int(input())\r\nb = input().split()\r\na = [ int(x) for x in b]\r\n\r\nzoznam_rychly = a.copy()\r\n\r\nzoznam_rychly.sort()\r\nslovnik ={}\r\nranged =0\r\ncount =0\r\n\r\nfor a in range(m):\r\n pic=False\r\n while pic ==False:\r\n\r\n\r\n if zoznam_rychly[a]>=ranged and (ranged + q[count])>=zoznam_rychly[a]:\r\n slovnik[str(zoznam_rychly[a])]= count+ 1\r\n pic=True\r\n\r\n else :\r\n ranged =ranged + q[count]\r\n count =count+1\r\n\r\n\r\nfor i in b:\r\n print(str(slovnik[i]))", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\n\r\ncum_sum = [0] + a[:]\r\nfor i in range(1, n + 1):\r\n cum_sum[i] += cum_sum[i - 1]\r\n\r\nfor worm in q:\r\n l, r = 1, n\r\n while l < r:\r\n mid = (l + r) // 2\r\n if cum_sum[mid] < worm:\r\n l = mid + 1\r\n else:\r\n r = mid\r\n print(l)", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nq = list(map(int, input().split()))\n\nworms = [0] * (sum(a) + 1)\npile_start = 1\nfor i in range(n):\n pile_end = pile_start + a[i]\n for j in range(pile_start, pile_end):\n worms[j] = i + 1\n pile_start = pile_end\n\nfor worm in q:\n print(worms[worm])\n \t\t \t\t\t\t \t \t\t \t \t \t \t\t\t\t\t", "def Bin_search(ls,low,high,key):\n while low <= high:\n mid = (low+high)//2\n if key >= ls[mid][0] and key<= ls[mid][-1] :\n return mid\n elif key>ls[mid][-1]:\n low = mid+1\n elif key<ls[mid][0]:\n high = mid-1\n return -1\nn = int(input())\npiles = list(map(int,input().split())) \nJuice = int(input())\nlabels = list(map(int,input().split()))\nactual_piles = [[i for i in range(1,piles[0]+1)]]\nfor i in range(1,len(piles)):\n actual_piles += [[actual_piles[i-1][-1]+1,actual_piles[i-1][-1]+piles[i]]]\nactual_piles[-1].append(actual_piles[-1][-1]+1)\nfor i in range(0,len(labels)):\n print(Bin_search(actual_piles,0,len(actual_piles)-1,labels[i])+1)\n", "def binary_search(arr, target):\r\n left, right = 0, len(arr)\r\n while left < right:\r\n mid = left + (right - left) // 2\r\n if arr[mid] < target:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n return left\r\n\r\n\r\nn = int(input())\r\na = [*map(int, input().split())]\r\nm = int(input())\r\nq = [*map(int, input().split())]\r\n\r\nprefix_sum = [0] \r\nfor i in range(n):\r\n prefix_sum.append(prefix_sum[-1] + a[i])\r\n\r\nfor i in range(m):\r\n index = binary_search(prefix_sum, q[i])\r\n print(index)", "n = int(input())\r\nnlist = list(map(int, input().split()[:n]))\r\n\r\nnlist_prefix_sum = [0] * (n+1) # Initialize prefix sum array\r\nfor i in range(1, n+1):\r\n nlist_prefix_sum[i] = nlist_prefix_sum[i-1] + nlist[i-1]\r\n\r\nm = int(input())\r\nmlist = list(map(int, input().split()[:m]))\r\n\r\nfor tar in mlist:\r\n low = 0\r\n high = n\r\n while low < high:\r\n mid = (low + high) // 2\r\n if nlist_prefix_sum[mid] >= tar:\r\n high = mid\r\n else:\r\n low = mid + 1\r\n print(low)\r\n", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nb = list(map(int, input().split()))\r\nc = [0] * n\r\nfor i in range(n):\r\n if i == 0:\r\n c[i] = a[0]\r\n else:\r\n c[i] = c[i - 1] + a[i]\r\nfor i in range(m):\r\n q = b[i]\r\n left = 0\r\n right = n\r\n while left + 1 != right:\r\n m = (left + right) // 2\r\n if c[m] >= q:\r\n right = m\r\n else:\r\n left = m\r\n if q >= a[0] + 1:\r\n print(left + 2)\r\n else:\r\n print(1)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nlookup = []\r\ngroup_no = 0\r\nfor i in a:\r\n group_no += 1\r\n for j in range(i):\r\n lookup.append(group_no)\r\n\r\nm = int(input())\r\nb = [int(i) for i in input().split()]\r\nfor i in b:\r\n print(lookup[i - 1])", "n = int(input())\r\na = []\r\nq = [] \r\nb = []\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nq = list(map(int,input().split()))\r\n \r\nfor i in range(n):\r\n b +=[i+1]*a[i]\r\n \r\nfor i in q:\r\n print(b[i-1])", "no_of_piles = int(input())\r\npiles = list(map(int, input().split(\" \")))\r\nno_of_worms = int(input())\r\nworms = list(map(int, input().split(\" \")))\r\n\r\ndef fillNewPileArr():\r\n for i in range(1, len(piles)):\r\n piles[i] += piles[i-1]\r\n\r\ndef binPile(worm):\r\n low = 0\r\n hi = no_of_piles - 1\r\n mid = 0\r\n index = -2\r\n while low <= hi:\r\n mid = (low+hi)//2\r\n if worm <= piles[mid]:\r\n index = mid\r\n hi = mid - 1\r\n continue\r\n else:\r\n low = mid + 1\r\n return index+1\r\n\r\nfillNewPileArr()\r\nfor i in worms:\r\n print(binPile(i))", "from sys import stdin\r\nfrom sys import stdout\r\n\r\n\r\nn = int(stdin.readline())\r\narr1 = list(map(int, stdin.readline().split()))\r\nm = int(stdin.readline())\r\narr2 = list(map(int, stdin.readline().split()))\r\n\r\nfor i in range(m):\r\n arr2[i] = [arr2[i], i, 1]\r\n\r\narr2.sort(key=lambda element: element[0])\r\n\r\ni, curSum = 0, arr1[0]\r\nfor x in arr2:\r\n while x[0] > curSum:\r\n i += 1\r\n curSum += arr1[i]\r\n x[2] += i\r\n\r\narr2.sort(key=lambda element: element[1])\r\n\r\nfor x in arr2:\r\n stdout.write(str(x[2]) + \"\\n\")\r\n", "from itertools import accumulate\r\nfrom bisect import bisect_left\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\n\r\nprefix_sums = [0] + list(accumulate(a))\r\nprefix_sums.sort()\r\n\r\nfor worm in q:\r\n print(bisect_left(prefix_sums, worm))", "n = int(input())\r\na = map(int, input().split())\r\nwormtails = [0]\r\nnumber = 1\r\nfor group in a:\r\n wormtails += [number] * group\r\n number += 1\r\nm = int(input())\r\nq = map(int, input().split())\r\nfor x in q:\r\n print(wormtails[x])\r\n", "import bisect\nn = int(input())\nl1 = list(map(int,input().split()))\nm = int(input())\nl2 = list(map(int,input().split()))\n\nfor i in range(1,n,1):\n l1[i] = l1[i] + l1[i-1]\n\nfor j in range(m):\n x = l2[j]\n ans = bisect.bisect_left(l1,x)\n print(ans+1)", "def binary(lists, tar):\r\n i = 0\r\n j = len(find) - 1\r\n\r\n while i <= j:\r\n mid = (i + j) // 2\r\n if lists[mid] == tar:\r\n return mid + 1\r\n elif lists[mid] < tar:\r\n i = mid + 1\r\n else:\r\n j = mid - 1\r\n\r\n if lists[i] > tar:\r\n return i + 1\r\n else:\r\n return j + 1\r\n\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\na = int(input())\r\nw = list(map(int, input().split()))\r\n\r\nfind = [0] * (n + 1)\r\nfor i in range(n):\r\n find[i+1] = find[i] + l[i]\r\n\r\nfind = find[1:]\r\nfor k in w:\r\n print(binary(find, k))", "from bisect import bisect_left,bisect_right\r\nfrom itertools import accumulate\r\nn = int(input())\r\npiles = list(map(int,input().split()))\r\npiles = list(accumulate(piles))\r\nm = int(input())\r\nlabels = list(map(int,input().split()))\r\nfor l in labels:\r\n print(bisect_left(piles,l)+1)\r\n\r\n\r\n", "import sys\r\nimport bisect as bs\r\n\r\ninput = sys.stdin.readline\r\ninp_int = lambda: int(input().strip(\"\\r\\n\"))\r\ninp_map = lambda f: map(f, input().strip(\"\\r\\n\").split())\r\ninp_list = lambda f: list(map(f, input().strip(\"\\r\\n\").split())) if f else list(input().strip(\"\\r\\n\"))\r\n\r\ndef bsearch(a, v):\r\n l = 0\r\n r = len(a) - 1\r\n res = -1\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if a[mid] == v:\r\n return mid\r\n elif a[mid] > v:\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return l\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = inp_list(int)\r\n pref = [a[0]] * n\r\n for i in range(1, n):\r\n pref[i] = pref[i - 1] + a[i]\r\n\r\n qn = inp_int()\r\n qrs = inp_list(int)\r\n for q in qrs:\r\n ind = bsearch(pref, q)\r\n print(ind + 1 if ind < n else ind)\r\n\r\nsolve()\r\n", "import math\r\n\r\n#num of piles\r\npiles = input()\r\n#number of worms in each pile\r\nnumWorms = input()\r\nnumWorms = numWorms.split();\r\nnumWorms = list(map(int,numWorms));\r\nnewNumWorms = [0] * int(piles);\r\n#num of juicy worms\r\njuicyW = input();\r\n#worm labels\r\nlabelW = input();\r\nlabelW = labelW.split();\r\nlabelW = list(map(int,labelW));\r\ndef binarySearch(label):\r\n left = 0;\r\n right = int(piles) - 1;\r\n while left <= right:\r\n middle = math.floor((left+right)/2);\r\n if newNumWorms[middle] < label:\r\n left = middle+1;\r\n elif newNumWorms[middle] > label:\r\n right = middle-1;\r\n else:\r\n return middle + 1;\r\n return left + 1;\r\n\r\nfor i in range(int(piles)):\r\n if(i==0):\r\n newNumWorms[i] = numWorms[i]\r\n else:\r\n newNumWorms[i] = numWorms[i]+newNumWorms[i-1];\r\n\r\nfor j in range(int(juicyW)):\r\n print(binarySearch(labelW[j]));\r\n\r\n\r\n\r\n", "n = int(input())\r\narray = list(map(int,input().split()))\r\nm = int(input())\r\narray2 = list(map(int,input().split()))\r\n# pref = [0 for _ in range(n)]\r\nans = [-1 for _ in range(1000001)]\r\nvalue = 1\r\nj = 0\r\nl = 0\r\nfor i in array:\r\n for o in range(j,i+j):\r\n ans[o] = l+1\r\n j+=i\r\n l+=1\r\n# print(ans)\r\n\r\nfor i in array2:\r\n print(ans[i-1])", "# LUOGU_RID: 101571467\n(n,), a, (m,), b = [[*map(int, s.split())] for s in open(0)]\r\nt = []\r\nc = 1\r\nfor x in a:\r\n t += [c] * x\r\n c += 1\r\nfor x in b:\r\n print(t[x - 1])", "def f():\r\n n = int(input())\r\n s = list(map(int, input().split()))\r\n m = int(input())\r\n q = list(map(int, input().split()))\r\n li = []\r\n for i in range(1, n+1):\r\n b = []\r\n b = [i for _ in range(s[i-1])]\r\n li.extend(b)\r\n for i in range(m):\r\n print(li[q[i] - 1])\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline().rstrip()\r\nf()\r\n", "def bin_search(i,arr,high,low):\r\n while high >=low:\r\n mid=low+(high-low)//2\r\n if arr[mid]==i:\r\n return mid\r\n elif arr[mid]<i and arr[mid+1]>i:\r\n return mid+1\r\n elif arr[mid]>i and arr[mid-1]<i:\r\n return mid\r\n elif arr[mid]>i:\r\n high=mid-1\r\n elif arr[mid]<i:\r\n low=mid+1\r\n return -1\r\n \r\ndef main():\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n for i in range(1,n):\r\n arr[i]=arr[i]+arr[i-1]\r\n m=int(input())\r\n j_w=list(map(int,input().split()))\r\n for j in j_w:\r\n if j<=arr[0]:\r\n print(1)\r\n continue\r\n print(bin_search(j,arr,n,0)+1)\r\n\r\n\r\nmain()\r\n ", "n = int(input())\r\npiles = input().split()\r\npiles = [int(i) for i in piles]\r\ntemp = 0\r\nfor i in range(n):\r\n temp += piles[i]\r\n piles[i] = temp\r\nm = int(input())\r\nworms = input().split()\r\nworms = [int(i) for i in worms]\r\nfor worm in worms:\r\n low = 0\r\n high = n-1\r\n mid = 0\r\n while low < high:\r\n mid = (low + high) // 2\r\n if piles[mid] >= worm:\r\n high = mid\r\n else:\r\n low = mid + 1\r\n print(high+1)", "import math\nimport sys\nfrom collections import defaultdict\nimport heapq\n#input = sys.stdin.readline\nUSE_FILE = False \n\ndef search(k, v):\n p = 0\n a, n = len(v), len(v)\n while a >= 1:\n while p + a < n and k > v[p+a][1]:\n p += a\n a //= 2\n if k > v[p+a][1]:\n p += 1\n return p+1\n\ndef sum_digits(nr):\n return sum([int(i) for i in str(nr)])\n\ndef clean_heap(heap, count):\n while heap and count[heap[0]] <= 0:\n heapq.heappop(heap)\n\ndef main():\n while True:\n try:\n n = int(input())\n worms = [int(i) for i in input().split()]\n worms_intervals = [(1, worms[0])]\n for i in range(1, n):\n start = worms_intervals[i-1][1] + 1 \n end = start + worms[i] - 1\n worms_intervals.append((start, end))\n m = int(input())\n qs = [int(i) for i in input().split()]\n for q in qs:\n pile = search(q, worms_intervals)\n print(pile)\n except EOFError:\n break\n\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n main()\n", "n=int(input())\nx=list(map(int,input().split()))\nm=int(input())\ny=list(map(int,input().split()))\nl=[0]\na=1\nfor i in x:\n j=i\n while(j>0):\n l.append(a)\n j-=1\n a+=1\nfor i in y:\n print(l[i])\n\t \t \t \t\t \t\t\t \t \t\t \t \t", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nq = list(map(int, input().split()))\npr = [a[0]]\nfor i in range(1, n):\n pr.append(pr[i - 1] + a[i])\nfor i in range(m):\n l = -1\n r = n - 1\n while r - l > 1:\n m = (l + r) // 2\n if pr[m] >= q[i]:\n r = m\n else:\n l = m\n print(r + 1)\n ", "def find_pile_number(n, piles, m, juicy_worms):\r\n prefix_sums = [0] * n\r\n prefix_sums[0] = piles[0]\r\n\r\n for i in range(1, n):\r\n prefix_sums[i] = prefix_sums[i - 1] + piles[i]\r\n \r\n result = 0\r\n res = []\r\n #print(prefix_sums)\r\n for juicy_worm in juicy_worms:\r\n result = binary_search(prefix_sums, juicy_worm) + 1\r\n res.append(result)\r\n\r\n return res\r\n\r\ndef binary_search(arr, target):\r\n left = 0\r\n right = len(arr) - 1\r\n\r\n while left < right:\r\n mid = left + (right - left) // 2\r\n\r\n if arr[mid] >= target:\r\n right = mid\r\n else:\r\n left = mid + 1\r\n\r\n return left\r\n\r\n# Read the number of piles\r\nn = int(input())\r\n\r\n# Read the number of worms in each pile\r\npiles = list(map(int, input().split()))\r\n\r\n# Read the number of juicy worms\r\nm = int(input())\r\n\r\n# Read the labels of the juicy worms\r\njuicy_worms = list(map(int, input().split()))\r\n\r\n# Find the pile number for each juicy worm\r\npile_numbers = find_pile_number(n, piles, m, juicy_worms)\r\n\r\n# Print the result\r\nfor pile_number in pile_numbers:\r\n print(pile_number)", "import bisect\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nl = []\r\ns = 0\r\nfor i in a:\r\n l.append(s+i)\r\n s += i\r\n\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\n\r\nfor i in q:\r\n ans = bisect.bisect_left(l, i)\r\n print(ans + 1)", "import bisect\r\n\r\n\r\nn = int(input())\r\nsum = 0\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\nfor i in range(n):\r\n sum += a[i]\r\n a[i] = sum\r\n\r\n# for each element in q, print the index of value which is qi <= value\r\nfor i in range(m):\r\n print(bisect.bisect_left(a, q[i]) + 1)\r\n \r\n\r\n", "n = int(input()) \r\na = list(map(int, input().split())) \r\nm = int(input()) \r\nq = list(map(int, input().split())) \r\n\r\n\r\nprefix_sum = [0] \r\nfor i in range(n):\r\n prefix_sum.append(prefix_sum[i] + a[i])\r\n\r\n\r\ndef find_pile(label):\r\n \r\n left, right = 0, n\r\n while left < right:\r\n mid = (left + right) // 2\r\n if prefix_sum[mid] < label:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n return left\r\n\r\n\r\nfor label in q:\r\n pile_number = find_pile(label)\r\n print(pile_number)\r\n", "N = int(input())\nmp = {}\nstart = 1\nA = list(map(int, input().split()))\nfor x in range(N):\n a = A[x]\n for i in range(start, start + a):\n mp[i] = x + 1\n start += a\n\n# print(mp)\ninput()\nQ = list(map(int, input().split()))\nfor i in Q:\n print(mp[i])\n\n \t \t\t \t \t \t \t\t \t \t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = int(input())\r\nw = list(map(int,input().split()))\r\n\r\nfor i in range(1,n):\r\n l[i]=l[i-1]+l[i]\r\n\r\na = {}\r\n\r\ndef worm(x):\r\n if x in a:\r\n return a[x]\r\n if x<=l[0]:\r\n return 1\r\n \r\n low = 0\r\n high = n-1\r\n mid = 0\r\n\r\n while low<=high:\r\n mid = (low+high)//2\r\n\r\n if x>l[mid-1] and x <= l[mid]:\r\n a[x] = mid+1\r\n return mid+1\r\n if x>l[mid]:\r\n low = mid+1\r\n else: \r\n high = mid - 1\r\n\r\nfor i in w:\r\n print(worm(i))", "import sys\r\n\r\ninput_file = sys.stdin.read(-1).replace(\"\\r\\n\", \"\\r\")\r\ninput_file = input_file.split()\r\n\r\nnum_piles = int(input_file[0])\r\npiles = []\r\ndel input_file[0]\r\nfor i in range(num_piles):\r\n piles.append(int(input_file[i])) # number of worms in pile\r\ndel input_file[0:num_piles]\r\n\r\nnum_worms = int(input_file[0])\r\ndel input_file[0]\r\n\r\npile_indexes = []\r\nstart = 0\r\nend = 0\r\nfor pile_index in range(num_piles):\r\n pile_size = piles[pile_index]\r\n start = end + 1\r\n end += pile_size\r\n worm_range = (start, end)\r\n for i in range(start, end + 1):\r\n pile_indexes.append(pile_index + 1)\r\n\r\nfor i in range(num_worms):\r\n worm = int(input_file[i]) # label of best worms (to find)\r\n print(pile_indexes[worm - 1])\r\n", "def lessthan(arr,key):\r\n low=0\r\n high=len(arr)-1\r\n while low+1<high:\r\n mid=(low+high)//2\r\n if arr[mid]>=key:\r\n high=mid\r\n else:\r\n low=mid\r\n return high \r\n \r\n \r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nm=int(input())\r\nval=list(map(int,input().split()))\r\npfsum=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n pfsum[i]=pfsum[i-1]+arr[i-1]\r\nfor i in val:\r\n print(lessthan(pfsum,i))\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(1, n+1):\r\n b = []\r\n b = [i for _ in range(a[i-1])]\r\n l.extend(b)\r\n#print(l)\r\nfor i in range(m):\r\n print(l[q[i] - 1])\r\n\r\n", "L=[]\r\nn=int(input())\r\nL1=list(map(int,input().split()))\r\nfor i in range(n):\r\n L+=[i+1]*L1[i]\r\nm=int(input())\r\nL2=list(map(int,input().split()))\r\nfor i in range(m):\r\n print(L[L2[i]-1])", "_ = int(input())\r\npiles = map(int, input().split())\r\n_ = input()\r\nlocations = map(int, input().split())\r\n\r\nprefix = []\r\ncur = 0\r\nfor pile in piles:\r\n cur += pile\r\n prefix.append(cur)\r\n\r\n# we find the smallest element greater than or equal to the given number\r\n\r\ndef find(location):\r\n lo = 0\r\n hi = len(prefix) - 1\r\n\r\n while lo < hi:\r\n mid = (hi + lo) // 2\r\n if prefix[mid] == location:\r\n return mid\r\n elif prefix[mid] < location:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n\r\n return lo\r\n\r\n\r\n\r\nfor location in locations:\r\n print(find(location) + 1)\r\n", "from bisect import bisect_left\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\nq = list(map(int, input().split()))\r\n\r\nsm = 0\r\nnum_list = []\r\n\r\nfor i in range(n):\r\n sm += a[i]\r\n num_list.append(sm)\r\n\r\nfor i in q:\r\n print(bisect_left(num_list, i) + 1)\r\n\r\n\r\n", "n=int(input())\r\na=[int(x) for x in map(int, input().split())]\r\nm=int(input())\r\nb=[int(x) for x in map(int, input().split())]\r\nk=0\r\nc=[0]\r\nfor i in a:\r\n c.append(i+k)\r\n k=k+i\r\nc.append(k+1)\r\nfor i in b:\r\n l=0\r\n r=n+1\r\n z=1\r\n while z==1:\r\n mid=(l+r)//2\r\n if c[mid]<i:\r\n l=mid\r\n elif c[mid]>i:\r\n r=mid\r\n else:\r\n print(mid)\r\n break\r\n if c[mid]<i<c[mid+1]:\r\n print(mid+1)\r\n break\r\n\r\n", "# https://codeforces.com/problemset/problem/474/B\n\nimport bisect\n\ninput()\n\nvalues = []\n\nfor value in input().split(\" \"):\n if values:\n values.append(values[-1] + int(value))\n else:\n values.append(int(value))\n\ninput()\n\nfor label in input().split(\" \"):\n int_label = int(label)\n pile = bisect.bisect_left(values, int_label)\n print(pile + 1)\n\n\n", "N = int(input())\r\nworm = [0]\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nfor i in range(N):\r\n\tworm.append(a[i]+worm[-1])\r\n\t\r\nimport bisect\r\nfor i in range(m):\r\n\tx = b[i]\r\n\tprint(bisect.bisect_left(worm,x))", "from bisect import bisect_left\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\npre = [0]\r\nfor i in a:\r\n pre.append(pre[-1] + i)\r\nfor i in q:\r\n print(bisect_left(pre, i))\r\n", "# Initially I thought of calculating the partial sum for each pile,\n# but then I saw it can be done differently and I thought that it would\n# be more challenging and interesting to do the current implementation\n\ndef main():\n worm_piles = int(input())\n worms_in_piles = list(map(int, input().split()))\n if worm_piles != len(worms_in_piles):\n raise ValueError(\"Number of piles is different than declared!\")\n\n juicy_worms = int(input())\n juicy_worms_labels = list(map(int, input().split()))\n if juicy_worms != len(juicy_worms_labels):\n raise ValueError(\"Number of juicy worm labels is different than\"\n \"the number of juicy worms!\")\n\n # Create a list where each element represents each worm and the\n # content of the element is the pile to which it belongs\n worms = list()\n for pile, worms_in_pile in enumerate(worms_in_piles):\n for _ in range(worms_in_pile):\n worms.append(pile + 1)\n\n for juicy_worm_label in juicy_worms_labels:\n print(worms[juicy_worm_label-1])\n\n\nif __name__ == \"__main__\":\n main()\n", "#print(L[int(j)-1])\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\np = list(map(int,input().split()))\r\nb = []\r\nfor i in range(1, n + 1):\r\n b += [i] *a[i - 1]\r\nanswers = []\r\nfor i in p:\r\n answers.append(b[i - 1])\r\nprint(*answers, sep = '\\n')", "n = int(input())\nll = list(map(int, input().split()))\nmm = int(input())\ng = list(map(int, input().split()));\n\nhi = []\nfor i in range(n):\n hi += [i+1] * ll[i]\nfor i in range(mm):\n print(hi[g[i]-1])", "n = int(input())\r\npiles = [int(i) for i in input().split()]\r\nfor b in range(1, n):\r\n piles[b] += piles[b-1]\r\nm = int(input())\r\nworms = input().split()\r\n\r\ndef search(worm_number):\r\n lo = 0\r\n hi = n\r\n while lo < hi:\r\n mid = (lo+hi)//2\r\n if int(piles[mid]) < worm_number:\r\n lo = mid+1\r\n else:\r\n hi = mid\r\n\r\n return lo\r\n\r\nfor worm in worms:\r\n print(1+search(int(worm)))", "from bisect import bisect_left\r\nfrom itertools import accumulate\r\n\r\nn= int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq=list(map(int,input().split()))\r\n\r\nsums = list(accumulate(a))\r\nans = []\r\n\r\nfor num in q:\r\n ans.append(bisect_left(sums, num)+1)\r\n\r\nprint('\\n'.join(map(str,ans)))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nq = int(input())\r\nqs = list(map(int, input().split()))\r\n\r\n\r\nindex = 0\r\nstraight = [0] * 10 ** 6\r\nfor i in range(n):\r\n for j in range(a[i]):\r\n straight[index + j] = i + 1\r\n index += a[i]\r\n\r\nfor i in qs:\r\n print(straight[i - 1])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\nc = [0] * n\r\nc[0] = a[0]\r\nfor i in range(1, n):\r\n c[i] = c[i - 1] + a[i]\r\n\r\nfor i in range(m):\r\n le = 0\r\n r = n\r\n while le + 1 != r:\r\n mid = (le + r) // 2\r\n if c[mid] >= q[i]:\r\n r = mid\r\n else:\r\n le = mid\r\n if q[i] >= a[0] + 1:\r\n print(r + 1)\r\n else:\r\n print(1)\r\n", "from bisect import bisect_left\r\n\r\nn = int(input())\r\n*a, = map(int, input().split())\r\nm = int(input())\r\n*q, = map(int, input().split())\r\npartial_sum = 0\r\nfor i, num in enumerate(a):\r\n partial_sum += a[i]\r\n a[i] = partial_sum\r\n\r\n# binary search\r\nfor label in q:\r\n i = bisect_left(a, label)\r\n print(i + 1)", "class solve:\r\n def __init__(self):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n m=int(input())\r\n m=list(map(int,input().split()))\r\n data={}\r\n i,j=1,0\r\n s=sum(a)\r\n p=a[0]\r\n while i<=s:\r\n while i<=p:\r\n data[i]=j+1\r\n i+=1\r\n j+=1\r\n if j<n:\r\n p+=a[j]\r\n for i in m:\r\n print(data[i])\r\n\r\nobj=solve()", "import sys\r\n\r\n\r\nfoobarfoobar = 1\r\n\r\nif foobarfoobar == 0:\r\n i = open(\"input.txt\", \"r\")\r\n o = open(\"output.txt\", \"w\")\r\nelse:\r\n i = sys.stdin\r\n o = sys.stdout\r\n\r\nn = int(i.readline())\r\na = list(map(int, i.readline().split()))\r\nb = []\r\nfor j in range(n):\r\n b.append(a[j])\r\n if j > 0:\r\n b[j] += b[j-1]\r\n\r\nm = int(i.readline())\r\nq = list(map(int, i.readline().split()))\r\nfor j in range(m):\r\n d = q[j]\r\n first, last, end = 0, n, 0\r\n while last-first > 1:\r\n k = (first+last)//2\r\n if b[k] < d:\r\n first = k\r\n else:\r\n last = k\r\n if d <= b[first]:\r\n foo = 0\r\n elif b[first] < d <= b[last]:\r\n foo = last\r\n o.write(str(foo+1) + \"\\n\")", "from itertools import accumulate\r\nfrom bisect import bisect\r\nn=int(input())\r\nworms=list(map(int,input().split()))\r\nm=int(input())\r\njuicy_worms=list(map(int,input().split()))\r\nqzh=list(accumulate(worms))\r\nli=[0]*n*2+[0]\r\nfor i in range(n):\r\n li[i*2+1]=qzh[i]\r\n li[2*i+2]=qzh[i]+1\r\nli[0]=1;li.pop()\r\nfor k in juicy_worms:\r\n z,y=divmod(bisect(li,k),2)\r\n print(z+1 if y else z)\r\n", "n=int(input())\r\na=list(map(int,input().split())) \r\nm=int(input()) \r\nq=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n b+=[i+1]*a[i]\r\nfor i in q:\r\n print(b[i-1])", "from bisect import *\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nm = input()\r\nlst = list(map(int,input().split()))\r\n\r\nfor i in range(n - 1):\r\n arr[i + 1] += arr[i]\r\nfor i in lst:\r\n print(bisect_left(arr, i) + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nc=[]\r\nans=[0]*m\r\nfor i in range(m):\r\n c.append([b[i],i])\r\nc.sort()\r\ncount=0\r\nj=0\r\nfor i in range(m):\r\n while count<c[i][0]:\r\n count+=a[j]\r\n j+=1\r\n ans[c[i][1]]=j\r\nfor i in ans:\r\n print(i)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nm = int(input())\r\nq = [int(x) for x in input().split()]\r\n\r\nindex = []\r\n\r\nfor i in range(n):\r\n for j in range(arr[i]):\r\n index.append(i)\r\n\r\nfor i in range(m):\r\n print(index[q[i]-1]+1)", "n=int(input())\nli=list(map(int,input().split()))\nm=int(input())\nq=list(map(int,input().split()))\nnew=[li[0]]\nfor i in range(1,n):\n new.append(new[-1]+li[i])\n# print(new)\nfor i in q:\n l=0\n r=n-1\n while l<=r:\n mid=(l+r)//2\n if i==new[mid]:\n l=mid\n break \n if i<new[mid]:\n r=mid-1\n else:\n l=mid+1\n print(l+1)\n\n ", "n = int(input())\na = list(map(int, input().strip().split()))\nm = int(input())\nq = list(map(int, input().strip().split()))\n\nfor i in range(1, len(a)):\n a[i] += a[i - 1]\n\nfor mole in q:\n l = 0\n r = len(a) - 1\n while l < r:\n mid = (l + r) // 2\n if mole > a[mid]:\n l = mid + 1\n else:\n r = mid\n print(r + 1)\n", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb\r\n\r\n# 离线做法\r\n_ = input()\r\nL = list(map(int, input().split()))\r\ncount = int(input())\r\njuicy = list(map(int, input().split()))\r\npre = [L[0]]\r\nfor i in range(1, len(L)):\r\n pre.append(pre[-1] + L[i])\r\n# print(pre)\r\njuicy_new = [[value, i] for i, value in enumerate(juicy)]\r\njuicy_new.sort(key=lambda x: x[0])\r\nj = 0\r\nans = []\r\nfor i in range(len(juicy_new)):\r\n while pre[j] < juicy_new[i][0]:\r\n j += 1\r\n ans.append([j + 1, i])\r\nans.sort(key=lambda x: juicy_new[x[1]][1])\r\nfor i in range(len(ans)):\r\n print(ans[i][0])", "import math,sys,collections,bisect,heapq\n\n\ndef natural(n):\n\treturn n*(n+1)//2\n\ndef binarysearch(l,r,arr,k):\n\tif l<=r:\n\t\tmid = (l+r)//2\n\t\tif arr[mid]<=k:\n\t\t\treturn binarysearch(mid+1,r,arr,k)\n\t\treturn binarysearch(l,mid-1,arr,k)\n\treturn r\ndef binarysearch2(l,r,k,st):\n\tif l<=r:\n\t\tmid = (l+r)//2\n\t\tif mid-st+1==k:\n\t\t\treturn mid\n\t\telif mid-st+1<k:\n\t\t\treturn binarysearch2(mid+1,r,k,st)\n\t\treturn binarysearch2(l,mid-1,k,st)\n\treturn -1\ndef ispossible(n):\n\n\th = 1\n\tnum = 2\n\tpre = 2\n\twhile num<=n:\n\t\tpre = num\n\t\th+=1\n\t\tnum+=(h*2)+h-1\n\treturn n-pre\n\ndef cal(n):\n\ttmp = 0\n\twhile n:\n\t\ttmp+=n%10\n\t\tn//=10\n\treturn tmp\ndef solve():\n\tn = int(input())\n\tarr1 = list(map(int,input().split()))\n\tm = int(input())\n\tarr2 = list(map(int,input().split()))\n\tprefix = [arr1[0]]\n\tfor i in range(1,n):\n\t\tprefix.append(prefix[-1]+arr1[i])\n\tfor i in arr2:\n\t\tind = binarysearch(0,n-1,prefix,i)\n\t\tif ind == n:\n\t\t\tprint(-1)\n\t\telse:\n\t\t\tif prefix[ind] == i:\n\t\t\t\tprint(ind+1)\n\t\t\telse:\n\t\t\t\tif ind+1<n:\n\t\t\t\t\tprint(ind+2)\n\t\t\t\telse:\n\t\t\t\t\tprint(-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\n# number of test cases\n\n\n#t = int(input())\nt = 1\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "def find_pile(prefix_sum_list, worm_label):\r\n left, right = 0, len(prefix_sum_list)-1\r\n while left < right:\r\n mid = (left + right) // 2\r\n if worm_label <= prefix_sum_list[mid]:\r\n right = mid\r\n else:\r\n left = mid + 1\r\n return left + 1 # AS `left` is index, so `position` will be `index+1`\r\n\r\ndef main():\r\n no_of_piles = int(input())\r\n piles_list = list(map(int, input().split()))\r\n no_of_juicy_worms = int(input())\r\n juicy_worms_labels = list(map(int, input().split()))\r\n\r\n # Calculate the prefix sum list\r\n prefix_sum_list = [0] * no_of_piles\r\n prefix_sum_list[0] = piles_list[0]\r\n for i in range(1, no_of_piles):\r\n prefix_sum_list[i] = prefix_sum_list[i - 1] + piles_list[i]\r\n\r\n for worm_label in juicy_worms_labels:\r\n in_which_pile = find_pile(prefix_sum_list, worm_label)\r\n print(in_which_pile)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def solve():\r\n n = int(input())\r\n piles = list(map(int, input().split()))\r\n m = int(input())\r\n jw = list(map(int, input().split()))\r\n\r\n\r\n index = [0] * (sum(piles) + 1)\r\n cl = 1\r\n for i in range(n):\r\n for j in range(piles[i]):\r\n index[cl] = i + 1\r\n cl += 1\r\n\r\n\r\n for wl in jw:\r\n print(index[wl])\r\n\r\n\r\n\r\nsolve()\r\n", "# Username: maheshraju2020\r\n\r\nimport heapq\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom itertools import combinations, permutations\r\nfrom math import ceil, gcd, sqrt\r\nfrom sys import setrecursionlimit, stdin, stdout\r\n\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\nn = ii1()\r\narr = iia()\r\nm = ii1()\r\nq = iia()\r\n\r\nfor i in range(1, len(arr)):\r\n arr[i]+=arr[i-1]\r\n\r\nfor i in q:\r\n print(bisect_left(arr, i) +1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\n\r\nlst = [0]\r\n\r\nsm = 0\r\n\r\nfor el in a:\r\n sm += el\r\n lst.append(sm)\r\n\r\n#print(lst)\r\n\r\nfor el in q:\r\n l = 0\r\n r = n + 1\r\n\r\n while r - l > 1:\r\n m = (l + r) // 2\r\n\r\n if lst[m] < el:\r\n l = m\r\n else:\r\n r = m\r\n\r\n print(r)", "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 upper_bound(arr, low, high, key):\r\n ans = 0\r\n while low <= high:\r\n mid = (low + high)//2\r\n if arr[mid] >= key:\r\n ans = mid\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n return ans\r\n\r\nn = int(input().strip())\r\narr = get_list()\r\nm = int(input().strip())\r\nq = get_list()\r\n\r\nfor i in range(1,n):\r\n arr[i] += arr[i-1]\r\n\r\n# print(arr)\r\nfor i in q:\r\n print(upper_bound(arr, 0, n-1, i)+1)\r\n\r\n\r\n ", "def encontrarworms(n, pilas, m, worms):\n cont = [0] \n totalworms = 0 \n for pila in pilas:\n totalworms += pila\n cont.append(totalworms)\n\n def f1(worm):\n left, right = 0, n - 1\n\n while left <= right:\n mid = (left + right) // 2\n if cont[mid] < worm <= cont[mid + 1]:\n return mid + 1\n elif worm > cont[mid + 1]:\n left = mid + 1\n else:\n right = mid - 1\n\n result = []\n for worm in worms:\n pila = f1(worm)\n result.append(pila)\n\n return result\n\n\n#main\nn = int(input())\npila1 = list(map(int, input().split()))\nm = int(input())\nworms = list(map(int, input().split()))\n\npila2 = encontrarworms(n, pila1, m, worms)\n\nfor pilaresultado in pila2:\n print(pilaresultado)\n \t\t \t\t \t\t\t \t\t\t\t\t \t \t \t\t \t \t", "from itertools import accumulate\n\n_ = input()\npiles = [int(x) for x in input().split(' ')]\n_ = input()\nto_find_worms = [int(x) for x in input().split(' ')]\n\n\nacc_piles = list(accumulate(piles))\n\n\n\nfor i in to_find_worms:\n def condition(value):\n return acc_piles[value] >= i\n \n n = len(piles)\n left, right = 0, n\n while left < right:\n mid = left + (right - left) // 2\n if condition(mid):\n right = mid\n else:\n left = mid + 1\n \n print(left + 1)\n \t\t \t\t \t \t \t\t \t\t \t \t\t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\ns=[0]*n\r\ns[0]=a[0]\r\nfor i in range(1,n):\r\n s[i]=s[i-1]+a[i]\r\nfor i in range(m):\r\n l,r=-1,n\r\n while r-l>1:\r\n j=(l+r)//2\r\n if s[j]<q[i]:\r\n l=j\r\n else:\r\n r=j\r\n print(r+1)", "# https://codeforces.com/problemset/problem/474/B\r\n\r\n\r\nfrom typing import List, Dict\r\n\r\n\r\ndef main() -> None:\r\n n: int = int(input())\r\n as_: List[int] = list(map(int, input().split()))\r\n m: int = int(input())\r\n qs: List[int] = list(map(int, input().split()))\r\n\r\n LOOKUP: Dict[int, int] = {}\r\n\r\n counter: int = 1\r\n for p, a in enumerate(as_, 1):\r\n for _ in range(a):\r\n LOOKUP[counter] = p\r\n counter += 1\r\n\r\n for q in qs:\r\n print(LOOKUP[q])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#! /usr/bin/python\n\n# https://codeforces.com/problemset/problem/474/B\n\nimport functools as ft\nimport sys\n\n# FIXME still too slow, time limit 1s\n\n\ndef intline(l):\n return list(map(int, l.strip().split()))\n\n\ndef first(piles, labels):\n starts = ft.reduce(lambda acc, p: acc + [acc[-1] + p], piles[:-1], [1])\n ends = ft.reduce(lambda acc, p: acc + [acc[-1] + p], piles[1:], [piles[0]])\n intervals = list(zip(starts, ends))\n print(intervals)\n print(labels)\n\n for l in labels:\n # BINARY SEARCH\n s, e = 0, len(intervals)\n # print(f\"search: {l}\")\n while s <= e:\n # print(f\"start.end: {(s, e)}\")\n m = (s + e) // 2\n is_, ie_ = intervals[m]\n # print(m, (is_, ie_))\n if is_ <= l <= ie_:\n break\n if is_ < l:\n s = m + 1\n elif is_ > l:\n e = m - 1\n print(m + 1)\n # print(\"----\")\n\n\ndef second(piles, labels):\n i, d = 1, {}\n for k, p in enumerate(piles, start=1):\n for j in range(i, p + i):\n d[j] = k\n i = j + 1\n for l in labels:\n print(d[l])\n\n\nif __name__ == \"__main__\":\n next(sys.stdin)\n piles = intline(next(sys.stdin))\n next(sys.stdin)\n labels = intline(next(sys.stdin))\n # first(piles, labels)\n second(piles, labels)\n", "def BS(k):\r\n l,r=0,2*n-1\r\n while l<r:\r\n m=(l+r)//2\r\n if li[m]>=k:r=m\r\n else:l=m+1\r\n return mp[li[r]]\r\n\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nmp={1:1,a[0]:1}\r\nsm=a[0]\r\nli = [1,a[0]]\r\nfor i in range(1,n):\r\n mp[sm+1]=i+1;li.append(sm+1)\r\n sm+=a[i];li.append(sm)\r\n mp[sm]=i+1\r\n\r\n\r\nm=int(input())\r\nx = [int(x) for x in input().split()]\r\nfor i in x:\r\n print(BS(i))", "def bin_src(lst, num):\r\n lower = 0\r\n upper = len(lst) - 1\r\n while lower <= upper:\r\n mid = (lower + upper) // 2\r\n if lst[mid] == num:\r\n return mid + 1\r\n if lst[mid] < num :\r\n lower = mid + 1\r\n else:\r\n upper = mid - 1\r\n if lst[lower] > num:\r\n return lower + 1\r\n else:\r\n return upper + 1\r\n \r\na = int(input())\r\nb = list(map(int, input().split()))\r\nc = int(input())\r\nd = list(map(int, input().split()))\r\nans = [0] * a\r\nans[0] = b[0]\r\nfor i in range(1, a):\r\n ans[i] = b[i] + ans[i-1]\r\nfor i in d:\r\n print(bin_src(ans, i))", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nm = []\r\nfor i in range(1, n+1):\r\n m+=([i]*l[i-1])\r\n\r\nv = int(input())\r\nb = list(map(int, input().split()))\r\nfor i in b:\r\n print(m[i-1])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\na1=[]\r\nlast=0\r\nfor i in range(len(a)):\r\n a1.append([last+1,last+a[i]])\r\n last=last+a[i]\r\nfor i in q:\r\n j=0\r\n k=len(a1)-1\r\n while j<=k:\r\n mid=(j+k)//2\r\n if i>=a1[mid][0] and i<=a1[mid][1]:\r\n print(mid+1)\r\n break\r\n else:\r\n if a1[mid][0]>i:\r\n k=mid-1\r\n else:j=mid+1", "def bs(mat,l,r,x):\r\n while(l <= r):\r\n mid = (l+r)//2\r\n if(mat[mid] == x):\r\n return mid\r\n elif(mat[mid] < x):\r\n l = mid +1\r\n else:\r\n r = mid - 1\r\n return mid\r\n\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\nm = int(input())\r\nquery = [int(i) for i in input().split()]\r\nmat = []\r\nmat.append(1)\r\nmat.append(arr[0])\r\nj = 1\r\nfor i in range(1,len(arr)):\r\n mat.append(mat[j]+1)\r\n mat.append(mat[j]+arr[i])\r\n j += 2\r\nfor i in query:\r\n print(bs(mat,0,len(mat)-1,i)//2 +1)", "# правый бинпоиск\r\ndef bin_search_right(array: list, target):\r\n l = -1\r\n r = len(array)\r\n while l+1<r:\r\n mid = (l+r)//2\r\n if array[mid]<=target:\r\n l = mid\r\n else:\r\n r = mid\r\n return r\r\n\r\n# левый бинпоиск\r\ndef bin_search_left(array: list, target):\r\n l = -1\r\n r = len(array)\r\n while l+1<r:\r\n mid = (l+r)//2\r\n if array[mid]<target:\r\n l = mid\r\n else:\r\n r = mid\r\n return r\r\n \r\nn = int(input())\r\nx = [int(x) for x in input().split()]\r\nfor i in range(1,n):\r\n x[i] += x[i-1]\r\nm = int(input())\r\nq = [int(x) for x in input().split()]\r\n\r\nfor i in range(m):\r\n target = q[i]\r\n print(bin_search_left(x,target)+1)\r\n", "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport math\n\n\ndef bs(arr, n, l, h):\n if h >= l:\n m = (h + l) // 2\n\n if arr[m] == n:\n return m\n elif n < arr[m]:\n return bs(arr, n, l, m-1)\n else:\n return bs(arr, n, m + 1, h)\n else:\n return l\n\n\nif __name__ == '__main__':\n n = int(input().strip())\n p = [int(x) for x in input().strip().split(\" \")]\n m = int(input().strip())\n w = [int(x) for x in input().strip().split(\" \")]\n i = 1\n while i < len(p):\n p[i] += p[i - 1]\n i += 1\n for q in w:\n print(1 + bs(p, q, 0, len(p)))\n\n\t\t \t \t\t\t\t\t \t\t \t \t \t \t", "# 5\r\n# 2 7 3 4 9\r\n# 3\r\n# 1 25 11\r\n\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nq = [int(x) for x in input().split()]\r\n\r\nindexes = []\r\nnumbers = 1\r\nfor i in a:\r\n indexes.extend([numbers] * i)\r\n numbers += 1\r\nfor i in q:\r\n print(indexes[i - 1])\r\n", "import bisect\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\np = 0\r\nc = [0] * n\r\nfor i, v in enumerate(a):\r\n p += v\r\n c[i] = p\r\nfor v in q:\r\n v -= 1\r\n print(bisect.bisect_right(c, v) + 1)\r\n\r\n", "n = int(input())\r\npiles = list(map(int, input().split()))\r\nm = int(input())\r\nworm_index = list(map(int, input().split()))\r\n\r\nmapping = []\r\nindex = 1\r\nfor i in piles:\r\n for x in range(i):\r\n mapping.append(index)\r\n index += 1\r\n\r\nfor i in worm_index:\r\n print(mapping[i-1])\r\n", "import bisect\r\n\r\n\r\ndef solve():\r\n x = int(input())\r\n l = [int(i) for i in input().split()]\r\n for i in range(1, x):\r\n l[i] += l[i-1]\r\n k = int(input())\r\n q = [int(i) for i in input().split()]\r\n for e in q:\r\n print(bisect.bisect_left(l, e)+1)\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 lower_bound(l, r, x, a):\r\n if r - l == 1:\r\n return l + (a[l] < x)\r\n m = (r + l) // 2\r\n if a[m] < x:\r\n return lower_bound(m, r, x, a)\r\n return lower_bound(l, m, x, a)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nps = [0]\r\nfor i in range(n):\r\n ps.append(ps[-1] + a[i])\r\ninput()\r\nfor x in list(map(int, input().split())):\r\n print(lower_bound(0, n + 2, x, ps))\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nq = [int(x) for x in input().split()]\r\nintervals = []\r\nlst = 0\r\nfor i in range(n):\r\n intervals.append((lst+1, lst+a[i]))\r\n lst += a[i]\r\nq = list(enumerate(q))\r\nq = sorted(q, key=lambda x: x[1])\r\nres = [0]*m\r\ni = 0\r\nfor [q_index, q_val] in q:\r\n while q_val>intervals[i][1]:\r\n i += 1\r\n res[q_index] = i+1\r\nfor r in res:\r\n print(r)", "n = int(input())\na = [int(i) for i in input().split()]\nlookup = []\ngroup_no = 0\nfor i in a:\n group_no += 1\n for j in range(i):\n lookup.append(group_no)\n\nm = int(input())\nb = [int(i) for i in input().split()]\nfor i in b:\n print(lookup[i - 1])\n \t \t \t\t\t \t \t\t\t\t\t \t\t\t", "import bisect\n\nn = int(input())\npile_sizes = list(map(int, input().split()))\nm = int(input())\njuicy_worms = list(map(int, input().split()))\n\n# Compute cumulative sums\ncumulative_sums = [0]\nfor size in pile_sizes:\n cumulative_sums.append(cumulative_sums[-1] + size)\n\n# Find the pile for each juicy worm\nfor worm in juicy_worms:\n pile = bisect.bisect_left(cumulative_sums, worm)\n print(pile)\n\n\t\t \t\t\t\t \t \t\t\t\t\t \t \t\t \t \t\t\t", "def binary(s,start,end,key):\r\n ans=0\r\n while(start<end):\r\n mid=(start+end)//2\r\n if s[mid]<key:\r\n start=mid\r\n elif s[mid]==key:\r\n ans=mid\r\n break\r\n else:\r\n end=mid\r\n if start==end-1:\r\n if key<=s[start]:\r\n ans=start\r\n else:\r\n ans=end\r\n break\r\n return ans\r\n \r\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=[]\r\nk=0\r\nfor i in range(n):\r\n k=k+a[i]\r\n s.append(k)\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nfor i in range(m):\r\n inx=binary(s,0,n-1,b[i])\r\n print(inx+1)", "l = []\r\nint(input())\r\nr = 1\r\nfor _ in input().split():\r\n l += [r] * int(_)\r\n r += 1\r\nint(input())\r\nfor j in input().split():\r\n print(l[int(j) - 1])\r\n", "orginal_garbage = int(input())\r\nl = list(map(int, input().split()))\r\ngarbage = int(input())\r\nl2 = list(map(int, input().split()))\r\n\r\nl3 = [0] * orginal_garbage\r\nprefix_sum = 0\r\n\r\nfor i in range(orginal_garbage):\r\n prefix_sum += l[i]\r\n l3[i] = prefix_sum\r\n\r\ndef check(l3, var):\r\n left = 0\r\n right = orginal_garbage - 1\r\n index = -1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n\r\n if l3[mid] >= var:\r\n index = mid\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n\r\n if index == -1:\r\n return orginal_garbage + 1\r\n else:\r\n return index + 1\r\n\r\nfor i in l2:\r\n print(check(l3, i))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\npre=a[0]\r\nfor i in range(1,n):\r\n a[i]+=pre\r\n pre=a[i]\r\nk=int(input())\r\nb=list(map(int,input().split()))\r\nfor i in b:\r\n l,r=0,n-1\r\n m=(l+r)//2\r\n while l<m<r:\r\n if a[m]<i:\r\n l=m\r\n else:\r\n r=m\r\n m=(l+r)//2\r\n if a[l]>=i:print(l+1)\r\n elif a[m]>=i:print(m+1)\r\n else:print(r+1)\r\n\r\n \r\n", "import sys\r\nfrom bisect import bisect_left as b\r\nn=int(sys.stdin.readline())\r\na=tuple(map(int,sys.stdin.readline().split()))\r\ns=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n s[i]=s[i-1]+a[i-1]\r\nm=int(sys.stdin.readline())\r\nq=tuple(map(int,sys.stdin.readline().split()))\r\nfor i in q:\r\n print(b(s,i))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\nimport bisect\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\nfor j in range(m):\r\n print(bisect.bisect_left(a,q[j])+1)", "X = int(input())\n\nL = input().split(\" \")\n\nD = {}\n\nLast = 0\ncum = 0\n\nfor idx,l in enumerate(L): \n l=int(l)\n for i in range(Last, l+1+cum):\n #print(i)\n D[i]=idx+1\n Last = l+1+cum\n cum += l\n\nR = input()\n\n\nY = input().split( \" \")\n\nfor p in Y:\n p=int(p)\n print(D[p])\n \t\t\t \t \t\t\t \t \t\t\t \t \t", "n = int(input())\r\npiles = list(map(int, input().split()))\r\n\r\ncumulative_sum = [0] * n\r\ncumulative_sum[0] = piles[0]\r\nfor i in range(1, n):\r\n cumulative_sum[i] = cumulative_sum[i - 1] + piles[i]\r\n\r\nm = int(input())\r\njuicy_worms = list(map(int, input().split()))\r\n\r\nfor worm in juicy_worms:\r\n left, right = 0, n - 1\r\n while left < right:\r\n mid = (left + right) // 2\r\n if cumulative_sum[mid] < worm:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n print(left + 1)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nb=list(map(int,input().split()))\r\nfor i in range(1,n-1):\r\n a[i]+=a[i-1]\r\nfor i in range(m):\r\n l=0\r\n r=n-1\r\n while r-l>1:\r\n m=(r+l-1)//2+1\r\n if a[m]>b[i]:\r\n r=m\r\n else:\r\n l=m\r\n if a[l]<b[i]:\r\n print(r+1)\r\n else:\r\n print(l+1)", "from sys import stdin ,stdout\ninput=stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n\tstdout.write(sep.join(map(str, args)) + end)\nn = int(input())\narr = list(map(int, input().split()))\nm = int(input())\nq = list(map(int, input().split()))\nfor i in range(1, n):\n\tarr[i] += arr[i-1]\nfor i in range(m):\n\tqu = q[i]\n\tl, r = 0, n-1\n\tans = 0\n\twhile l<=r:\n\t\tmid = l + (r-l)//2\n\t\tif arr[mid] >= qu:\n\t\t\tans = mid + 1\n\t\t\tr = mid - 1\n\t\telse: l = mid + 1\n\t\t\n\tprint(ans)\n\t\n\t\n\t\n\t\n\t\n\t\n\n\n\t\n", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\n\r\n#import os\r\n#import sys\r\nfrom math import *\r\n#import re\r\n#import random\r\n#sys.set_int_max_str_digits(int(1e9))\r\n\r\n\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n for _ in range(1):\r\n n = int(input())\r\n w = [int(x) for x in input().split()]\r\n sum = 0\r\n for i in range(n):\r\n sum+=w[i]\r\n w[i] = sum\r\n m = int(input())\r\n inp = [int(x) for x in input().split()]\r\n ans = 0\r\n for x in inp:\r\n l = -1; r = n\r\n while r - l > 1:\r\n mid = (l+r)//2\r\n if(w[mid] < x):\r\n l = mid\r\n else:\r\n r = mid\r\n print(r+1)\r\n \r\n\r\n# 2 9 12 16 25\r\n\r\n\r\nsolve()\r\n\r\n", "m=int(input())\r\nworms = [int(x) for x in input().split()[:m]]\r\nn=int(input())\r\nlabel=[int(x) for x in input().split()[:n]]\r\nl=[]\r\ng=0\r\nfor i in range(len(worms)):\r\n g+=worms[i]\r\n l.append(g)\r\nfor i in range(len(label)):\r\n low=0\r\n high=len(l)-1\r\n while(low<high):\r\n mid=(low+high)//2\r\n if(label[i]<=l[mid]):\r\n high=mid\r\n else:\r\n low=mid+1\r\n y=low+1\r\n print(y)", "a = int(input())\r\nx = list(map(int, input().split()))\r\nb = int(input())\r\ny = list(map(int, input().split()))\r\nz = [-1]\r\nc = 0\r\nfor i in x:\r\n c += 1\r\n for j in range(i):\r\n z.append(c)\r\nfor i in y:\r\n print(z[i])", "\r\ndef search(q, d: list, n:int) -> int:\r\n l_index = 0\r\n h_index = n\r\n\r\n while (l_index<h_index):\r\n m_index = (h_index + l_index)//2\r\n\r\n if(d[m_index][0]<=q and q<=d[m_index][1]):\r\n return m_index + 1\r\n elif(q<d[m_index][0]):\r\n h_index = m_index\r\n else:\r\n l_index = m_index + 1\r\n return 0\r\ndef solve() -> None:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n m = int(input())\r\n query = list(map(int, input().split()))\r\n d = []\r\n last = 0\r\n for num in a:\r\n d.append((1 + last, last + num))\r\n last = last + num\r\n for q in query:\r\n print(search(q, d, n))\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n\r\n", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nm = int(input())\r\nlab = [int(x) for x in input().split()]\r\nsomacum = [0]\r\n\r\nfor i in range(n):\r\n somacum.append(somacum[i] + nums[i])\r\n\r\nfor i in range(m):\r\n l = 0\r\n r = n\r\n out = 0\r\n\r\n while l <= r:\r\n mid = (l + r) // 2\r\n\r\n if somacum[mid] >= lab[i]:\r\n out = mid\r\n r = mid - 1\r\n\r\n else: l = mid + 1\r\n\r\n print(out)\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\nd={}\r\nfor i in range(1,a[0]+1):\r\n\td[i]=1\r\ns=a[0]\r\nfor i in range(1,n):\r\n\tfor j in range(s+1,s+a[i]+1):\r\n\t\td[j]=i+1\r\n\ts+=a[i]\r\nfor i in range(m):\r\n\tprint(d[q[i]])", "def read_input():\r\n input_int = lambda: list(map(int, input().split()))\r\n\r\n n = int(input())\r\n piles = input_int()\r\n m = int(input())\r\n search = input_int()\r\n\r\n return n, piles, m, search\r\n\r\ndef sums(piles):\r\n nums = [piles[0]]\r\n for i in range(len(piles) - 1):\r\n nums.append(nums[i] + piles[i + 1])\r\n return nums\r\n\r\n\r\ndef logic(n, piles, search):\r\n total = sums(piles)\r\n response = []\r\n\r\n for item in search:\r\n\r\n index_min = 0\r\n index_max = n - 1\r\n while index_min < index_max:\r\n index_mid = (index_min + index_max) // 2\r\n if total[index_mid] < item:\r\n index_min = index_mid + 1\r\n else:\r\n index_max = index_mid\r\n\r\n response.append(index_min + 1)\r\n \r\n return response\r\n \r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Input\r\n n, piles, m, search = read_input()\r\n\r\n # Output\r\n response = logic(n, piles, search)\r\n for out in response:\r\n print(out)", "x=int(input())\ny=list(map(int,input().split()))\nz=int(input())\nn=list(map(int,input().split()))\n\nend = 0\nfor i in range(x):\n end+=y[i]\n y[i]=end\ndef find(piles,target):\n left,right=0,len(piles)-1\n while left<right:\n mid=(left+right)//2\n if piles[mid]>=target:\n right=mid\n else:\n left=mid+1\n return left+1\nfor i in n :\n x=find(y,i)\n print(\n x\n )\n \t \t\t \t\t\t\t\t \t\t\t \t \t\t\t\t \t\t\t\t\t", "from bisect import *\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ninput()\r\nq=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n a[i]=a[i-1]+a[i]\r\nfor i in q:\r\n l=bisect_left(a, i)\r\n print(l+1)", "def find_worm(worms, juicy_worms):\n sum = [0]\n \n for worms_in_pile in worms:\n sum.append(sum[-1] + worms_in_pile)\n \n answers = []\n \n for juicy_worm in juicy_worms:\n left, right = 0, len(sum) - 1\n \n while left < right:\n mid = (left + right) // 2\n \n if sum[mid] < juicy_worm:\n left = mid + 1\n else:\n right = mid\n \n answers.append(left)\n \n return answers\n\nn = int(input())\nworms = list(map(int, input().split()))\nm = int(input())\njuicy_worms = list(map(int, input().split()))\nresult = find_worm(worms, juicy_worms)\nfor r in result:\n print(r)\n \t\t\t\t\t\t \t\t \t\t \t\t\t \t \t \t\t", "import sys\n\ndef solve():\n n = int(sys.stdin.readline())\n a = list(map(int,sys.stdin.readline().split()))\n m = int(sys.stdin.readline())\n query = list(map(int,sys.stdin.readline().split()))\n\n for i in range(1,n):\n a[i] += a[i-1]\n \n for q in query:\n i,j,found = 0, n-1, False\n\n while i <= j:\n mid = (i + j) // 2\n \n if q == a[mid]:\n print(mid+1)\n found = True\n break\n elif q > a[mid]:\n i = mid + 1\n else:\n j = mid - 1\n\n if not found:\n print(i+1)\n\n\nif __name__ == '__main__':\n solve()", "def findIntv(lst, start, end, x):\n if end - start <= 1:\n return start\n mid = (start + end) // 2\n m_val = lst[mid]\n if x < m_val:\n return findIntv(lst, start, mid, x)\n else:\n return findIntv(lst, mid, end, x)\n\n\nn = int(input())\npile_sizes_str = input()\n\nindices_list = [0]\nindices_sum = 0\npile_sizes = pile_sizes_str.split()\nfor i in range(n):\n indices_sum += int(pile_sizes[i])\n indices_list.append(indices_sum)\n\nm = int(input())\njuicy_worms_str = input()\n\nfor juicy_worm in juicy_worms_str.split():\n juicy_id = int(juicy_worm) - 1\n print(findIntv(indices_list, 0, len(indices_list), juicy_id) + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(input())\r\nq=list(map(int,input().split()))\r\nprefix=[0]*n\r\nprefix[0]=a[0]\r\nfor i in range(1,n):\r\n prefix[i]=prefix[i-1]+a[i]\r\nfor x in q:\r\n l=0\r\n r=n-1\r\n c=0\r\n m=(l+r)//2\r\n while (l!=r):\r\n # m=(l+r)//2\r\n if prefix[m]>x:\r\n r=m\r\n elif prefix[m]<x:\r\n l=m+1\r\n else:\r\n break\r\n \r\n m=(l+r)//2\r\n print(m+1)", "n=int(input())\r\narr=[0]+list(map(int,input().split()))\r\nm=int(input())\r\narr2=list(map(int,input().split()))\r\nfor i in range(1,n+1):\r\n arr[i]+=arr[i-1]\r\n#print(arr)\r\nfor i in arr2: \r\n minn=0\r\n maxx=n\r\n while True:\r\n mid=(maxx+minn+1)//2\r\n if maxx==mid:\r\n print(maxx)\r\n break\r\n if arr[mid]==i:\r\n print(mid)\r\n break\r\n if arr[mid]>i:\r\n maxx=mid\r\n continue\r\n else:\r\n minn=mid\r\n continue", "from sys import stdin\r\n\r\nn = stdin.readline().strip()\r\n\r\nwhile n != \"\":\r\n n = int(n)\r\n a = 0 \r\n lis1 = [int(i) for i in stdin.readline().strip().split()]\r\n lis=[]\r\n for i in lis1:\r\n a +=1\r\n lista = [a]*i\r\n lis += lista\r\n\r\n n2 = int(stdin.readline().strip())\r\n lis2 = [int(i) for i in stdin.readline().strip().split()]\r\n for i in lis2:\r\n print(lis[i-1])\r\n n = stdin.readline().strip()\r\n \r\n", "n = int(input())\nbuckets = list(map(int, input().split()))\nj = int(input())\nids = list(map(int, input().split()))\n\nprefix = [0] * n\nprefix[0] = buckets[0]\nfor i in range(1, n):\n prefix[i] = prefix[i-1] + buckets[i]\n\nans = 0\nfor i in range(j):\n q = ids[i]\n left = 0\n right = n-1\n while left <= right:\n mid = (left + right) // 2\n if prefix[mid] >= q:\n ans = mid\n right = mid - 1\n else:\n left = mid + 1\n\n print(ans + 1)\n\n \t\t\t\t \t \t \t\t\t\t\t\t \t \t\t", "n = int(input(\"\"))\r\na = list(map(int, input(\"\").split()))\r\nqi = int(input(\"\"))\r\nq = list(map(int, input(\"\").split()))\r\na_presum = {0: 0}\r\n\r\nfor i in range(0, n):\r\n a_presum[i+1] = a[i]+a_presum[i]\r\n\r\n\r\nfor j in range(qi):\r\n s = 0\r\n e = n\r\n ans = q[j]\r\n while s <= e:\r\n m = (s+e)//2\r\n if ans <= a_presum[m] and ans > a_presum[m-1]:\r\n ans = m\r\n print(ans)\r\n break\r\n elif ans <= a_presum[m]:\r\n e = m\r\n else:\r\n s = m+1\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nq = [int(x) for x in input().split()]\r\n \r\nindexes = []\r\nnumbers = 1\r\nfor i in a:\r\n indexes.extend([numbers] * i)\r\n numbers += 1\r\nfor i in q:\r\n print(indexes[i - 1])", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\nA = [[1,a[0]]]\r\nfor i in range(1, n):\r\n A.append([A[i-1][1] + 1, A[i-1][1] + a[i]])\r\nfor i in range(m):\r\n low = 0\r\n high = n-1\r\n while low <= high:\r\n mid = (low+high)//2\r\n if A[mid][0] <= q[i] <= A[mid][1]:\r\n print(mid+1)\r\n break\r\n elif A[mid][0] > q[i]:\r\n high = mid - 1\r\n elif A[mid][1] < q[i]:\r\n low = mid + 1", "a = [0] * (10**6)\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\n\r\nidx = 0\r\nfor i in range(n):\r\n for j in range(idx, idx + w[i]):\r\n a[j] = i + 1\r\n idx += w[i]\r\n\r\nint(input())\r\nq = list(map(int, input().split()))\r\nfor i in q:\r\n print(a[i - 1])\r\n", "f=int(input())\r\nl=list(map(int,input().split()))\r\na=int(input())\r\nll=list(map(int,input().split()))\r\nsl=[]\r\nr=1\r\nfor k in l:\r\n sl+=[r]*k \r\n r+=1\r\n#print(sl)\r\n\r\nfor h in ll:\r\n print(sl[h-1])\r\n", "import sys\r\nn1 = int(input())\r\nworms = list(map(int, input().split()))\r\n\r\nn2 = int(input())\r\njuicyworms = list(map(int, input().split()))\r\n\r\nsum = 0\r\n\r\nfor i in range(len(worms)):\r\n sum = sum + worms[i]\r\n worms[i] = sum \r\n\r\n\r\ndef find_index(arr, target):\r\n low = 0\r\n high = len(arr) - 1\r\n\r\n while low <= high:\r\n mid = (low + high) // 2\r\n if arr[mid] < target:\r\n low = mid + 1\r\n elif arr[mid] > target:\r\n high = mid - 1\r\n else:\r\n return mid\r\n\r\n if low < len(arr) and arr[low] > target:\r\n return low\r\n else:\r\n return None\r\n\r\ndef check(worms,juicyworms):\r\n indexCounter = []\r\n\r\n for i in juicyworms:\r\n indexCounter.append(find_index(worms,i) +1)\r\n\r\n for i in indexCounter:\r\n sys.stdout.write(str(i) + '\\n')\r\n\r\n\r\n\r\ncheck(worms,juicyworms)\r\n\r\n\r\n", "t=int(input())\r\nls=list(map(int,input().split()))\r\ns=int(input())\r\narr=list(map(int,input().split()))\r\ndef bs(ls,target):\r\n l=0\r\n h=len(ls)-1\r\n while l<=h:\r\n m=(l+h)//2\r\n if ls[m]>target:\r\n h=m-1\r\n elif ls[m]<target:\r\n l=m+1\r\n else:\r\n return (m+1)\r\n return (l+1)\r\nfor i in range(1,len(ls)):\r\n ls[i]+=ls[i-1]\r\nfor i in range(len(arr)):\r\n print(bs(ls,arr[i]))", "from bisect import bisect_left\r\n\r\n\r\nn = int(input())\r\npref = [0]\r\nfor i in input().split():\r\n pref.append(pref[-1] + int(i))\r\nq = int(input())\r\nfor x in input().split():\r\n print(bisect_left(pref, int(x)))", "n = int(input())\npile_a = [int(x) for x in input().split()]\nm = int(input())\npile_q = [int(x) for x in input().split()]\n\nworms = [0] * (sum(pile_a) + 1)\npile_start = 1\nfor i in range(n):\n pile_end = pile_start + pile_a[i]\n for j in range(pile_start, pile_end):\n worms[j] = i + 1\n pile_start = pile_end\n\nfor worm in pile_q:\n print(worms[worm])\n\t \t \t \t\t\t\t\t \t \t\t\t \t\t\t \t", "def conversor(lista):\r\n return list(map(int, lista))\r\ndef solucion(num_W,label_j_W):\r\n lista_2 = []\r\n lista_3 = []\r\n for i in range(len(num_W)):\r\n j = 0\r\n while j < num_W[i]:\r\n lista_2.append(i+1)\r\n j += 1\r\n for i in range(len(label_j_W)):\r\n lista_3.append(lista_2[label_j_W[i]-1])\r\n return lista_3\r\ndef main():\r\n '''Funcion principal'''\r\n input()\r\n num_W = conversor(input().split())\r\n input()\r\n label_j_W = conversor(input().split())\r\n lista_final = solucion(num_W,label_j_W)\r\n for i in range(len(lista_final)):\r\n print(lista_final[i])\r\nmain()", "n = int(input())\nls = list(map(int,input().split()))\nq = int(input())\nla = list(map(int,input().split()))\nfor i in range(1,len(ls)):\n\tls[i] = ls[i]+ls[i-1]\nfor i in range(len(la)):\n\tlow = 0\n\thigh = len(ls)\n\tflag= True\n\twhile low<=high:\n\t\tmid = (low+high)//2\n\t\tif ls[mid]<la[i]:\n\t\t\tlow = mid+1\n\t\telif mid == 0 and ls[mid]>=la[i] and 0<la[i]:\n\t\t\tprint(mid+1)\n\t\t\tflag=False\n\t\t\tbreak\n\t\telif mid!=0 and ls[mid]>=la[i] and ls[mid-1]<la[i]:\n\t\t\tprint(mid+1)\n\t\t\tflag=False\n\t\t\tbreak\n\t\telse:\n\t\t\thigh = mid-1\n", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=int(input())\r\ntemp=list(map(int,input().split()))\r\n\r\n\r\nnewtemp=[]\r\nfor i in range(m):\r\n newtemp.append([temp[i],i])\r\nans=[-1 for _ in range(m)]\r\nnewtemp.sort()\r\nfor i in range(1,n):\r\n l[i]=l[i]+l[i-1]\r\nptr=0\r\nfor i in range(m):\r\n sno,idx=newtemp[i]\r\n while ptr<n and l[ptr]<sno:ptr+=1\r\n ans[idx]=ptr\r\nfor ele in ans:\r\n print(ele+1)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nq = [int(x) for x in input().split()]\r\n\r\ns = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n s[i] = s[i - 1] + a[i - 1]\r\n \r\nfor x in q:\r\n left = 0\r\n right = n\r\n while right - left > 1:\r\n mid = (right + left) // 2\r\n if s[mid] < x:\r\n left = mid\r\n else:\r\n right = mid\r\n print(right)", "from bisect import *\r\nc=[]\r\ninput()\r\na=list(map(int,input().split()))\r\ninput()\r\nq=list(map(int,input().split()))\r\nfor i in range(1,len(a)):\r\n a[i]=a[i-1]+a[i]\r\nfor i in q:\r\n l=bisect_left(a, i)\r\n c.append(l+1)\r\nfor i in c:\r\n print(i)", "import bisect\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nq = list(map(int,input().split()))\r\nl = [a[0]]\r\nmasha = []\r\ns = 0\r\nfor i in range(1,n):\r\n l.append(l[-1]+a[i])\r\nfor i in range(m):\r\n s = bisect.bisect_left(l, q[i])\r\n masha.append(s+1)\r\nprint(*masha,sep='\\n')", "import bisect\r\n\r\nn=int(input()) #5\r\n\r\n#pnum=[int(_) for _ in input().split()]\r\npnum=list(map(int,input().split())) #2 7 3 4 9\r\n\r\n\r\n\r\n\r\n#pnum.sort()\r\n\r\nn1=int(input()) # 3\r\n\r\nl=list(map(int,input().split())) # 1 25 11\r\n\r\n\r\n\r\n# label1=range(1,pnum[0]+1)\r\n# label2=range(pnum[0]+1,pnum[1]+1)\r\n# label3=range(pnum[1]+1,pnum[2]+1)\r\n# label4=range(pnum[2]+1,pnum[3]+1)\r\n# label5=range(pnum[3]+1,pnum[4]+1)\r\n\r\n# 2 9 12 16 25 \r\n\r\n# 입력받은 배열값을 서로 비교하여 해당 값의 인덱스를 반환 \r\nsum1=0\r\ncount=[0]*n \r\n\r\nfor i,v in enumerate(pnum):\r\n sum1+=v \r\n count[i]=sum1\r\nfor v in l:\r\n v-=1 \r\n #print(b)\r\n print(bisect.bisect_right(count,v)+1)", "from sys import stdin\n\nn = int(stdin.readline())\narr = list(map(int, stdin.readline().strip().split()))\n\ncom = [0]*1000001\n\nl = 1\nr = 1\npile = 1\ns = 0\nfor i in range(n):\n\tr = arr[i] + s\n\t_r = r+1\n\tfor j in range(l, _r):\n\t\tcom[j] = pile\n\tpile += 1\n\ts = r\n\tl = r+1\n\nstdin.readline()\nmarr = list(map(int, stdin.readline().strip().split()))\nfor i in marr:\n\tprint(com[i])\n\n\t \t \t \t\t \t\t\t\t\t \t \t \t\t\t\t\t\t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nq = [int(x) for x in input().split()]\r\n\r\nintervals = []\r\nlst = 0\r\nfor i in range(n):\r\n intervals.append((lst+1, lst+a[i]))\r\n lst += a[i]\r\n\r\ndef query(x):\r\n l = 0\r\n r = n-1\r\n while l < r:\r\n mid = (l+r)//2\r\n if x < intervals[mid][0]:\r\n r = mid-1\r\n elif x > intervals[mid][1]:\r\n l = mid+1\r\n else:\r\n return mid\r\n return l\r\n\r\nfor i in range(m):\r\n print(query(q[i])+1)", "def findPile(n, piles, juicy_worms):\r\n cumulative_sum = [0] * (n + 1) # Initialize cumulative sum array\r\n cumulative_sum[1] = piles[0]\r\n\r\n # Calculate cumulative sum of worms in each pile\r\n for i in range(1, n):\r\n cumulative_sum[i + 1] = cumulative_sum[i] + piles[i]\r\n\r\n results = []\r\n for worm in juicy_worms:\r\n # Perform binary search to find the pile containing the worm\r\n low, high = 0, n - 1\r\n while low <= high:\r\n mid = (low + high) // 2\r\n if cumulative_sum[mid] < worm <= cumulative_sum[mid + 1]:\r\n results.append(mid + 1)\r\n break\r\n elif cumulative_sum[mid] >= worm:\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\n return results\r\n\r\n\r\n# Example usage\r\nn = int(input())\r\npiles = [int(x) for x in input().split()]\r\nm = int(input())\r\njuicy_worms = [int(x) for x in input().split()]\r\n\r\nanswers = findPile(n, piles, juicy_worms)\r\n\r\n# Print the correct pile for each juicy worm\r\nfor i in range(m):\r\n print(f\"{answers[i]}\")", "'''\r\n@author: SamirPaul1\r\n'''\r\nimport io\r\nimport os\r\nimport sys\r\nimport math\r\nimport heapq\r\nimport bisect\r\nimport random\r\nimport string\r\nimport decimal\r\nimport functools \r\nimport fractions\r\nimport itertools\r\nimport collections\r\nfrom sys import stdin, stdout \r\nfrom io import BytesIO, IOBase\r\nfrom math import gcd, floor, sqrt, log, factorial\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import deque, Counter, defaultdict, OrderedDict, namedtuple, UserDict, UserList, UserString\r\n\r\nMOD = 1000000007\r\nsys.setrecursionlimit(100000000)\r\nBUFSIZE = 8192\r\n\r\n\r\n# #---------------- I/O file handling ----------------------\r\n# sys.stdout = open('output.txt', 'w') # Write to output.txt\r\n# sys.stdin = open('input.txt', 'r') # Read from input.txt\r\n\r\n# #-------------------- Code From Here ---------------------\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\nupper = []\r\nlower = []\r\np = 0\r\ns = 0\r\nfor i in a:\r\n s += i \r\n upper.append(s)\r\n lower.append(p)\r\n p = s \r\n\r\ndef binarySearch(t):\r\n l = 0; r = n-1\r\n while l <= r:\r\n mid = l + (r - l) // 2\r\n if t > upper[mid]:\r\n l = mid + 1\r\n elif t <= lower[mid]:\r\n r = mid - 1\r\n else:\r\n return mid+1\r\nfor i in q:\r\n print(binarySearch(i))\r\n\r\n", "arr = []\r\ninput()\r\ncount=1\r\nfor i in input().split():\r\n arr+= [count] * int(i)\r\n count+= 1\r\ninput()\r\nfor j in input().split():\r\n print(arr[int(j) - 1])\r\n", "def solucion(num_W,label_j_W):\r\n lista_2 = []\r\n for i in range(len(num_W)):\r\n j = 0\r\n while j < int(num_W[i]):\r\n lista_2.append(i+1)\r\n j += 1\r\n for i in range(len(label_j_W)):\r\n print(lista_2[int(label_j_W[i])-1])\r\n \r\ndef main():\r\n '''Funcion principal'''\r\n input()\r\n num_W = input().split()\r\n input()\r\n label_j_W = input().split()\r\n solucion(num_W,label_j_W)\r\nmain()", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = int(input())\r\nb = list(map(int,input().split()))\r\nc = []\r\nfor i in range(n):\r\n for j in range(a[i]):\r\n c.append(i+1)\r\nfor i in b:\r\n print(c[i-1])", "def binary_search(l,s,e,x):\r\n while(True):\r\n mid = ((e+s)+1)//2\r\n if(l[mid] == x):\r\n return mid+1\r\n elif(e == s + 1):\r\n if(l[s] < x):\r\n return e+1\r\n else:\r\n return s+1\r\n elif(l[mid]>x):\r\n e = mid\r\n elif(l[mid]<x):\r\n s = mid\r\n \r\n \r\n\r\n\r\nn = int(input())\r\nl = list(map(int,input().split(\" \")))\r\nx = int(input())\r\np = list(map(int,input().split(\" \")))\r\n\r\nnewList = []\r\ns = 0\r\nfor i in l:\r\n s = s + i\r\n newList.append(s)\r\n\r\nfor i in p:\r\n start = 0\r\n end = len(newList)-1\r\n print(binary_search(newList,start,end,i))\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\n\r\nprefix = [0] * n\r\nprefix[0] = a[0]\r\nfor i in range(1, n):\r\n prefix[i] = prefix[i-1] + a[i]\r\n\r\nn2 = int(input())\r\nb = list(map(int, input().split()))\r\n\r\nfor i in b:\r\n l = -1\r\n r = len(a) - 1\r\n\r\n while r-l > 1:\r\n mid = (l+r) // 2\r\n\r\n if prefix[mid] >= i:\r\n r = mid\r\n else:\r\n l = mid\r\n\r\n print(r+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\n\r\n# Compute prefix sums\r\np = [0] * n\r\nfor i in range(n):\r\n p[i] = (p[i-1] if i > 0 else 0) + a[i]\r\n\r\n# Binary search for each query\r\nfor qi in q:\r\n # Find smallest i such that p[i] >= qi\r\n lo, hi = 0, n-1\r\n while lo < hi:\r\n mid = (lo + hi) // 2\r\n if p[mid] < qi:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n print(lo+1) # Convert to 1-based indexing\r\n", "import bisect\r\nx = int(input())\r\nl = list(map(int,input().split()))\r\ncumml = [l[0]] + [0]*(x-1)\r\nfor i in range(1,len(l)):\r\n cumml[i] = cumml[i-1] + l[i]\r\n\r\nt = int(input())\r\nsadl = list(map(int,input().split()))\r\nfor i in sadl:\r\n print(bisect.bisect_left(cumml,i)+1,end=\" \")\r\nprint()", "def main():\n n = int(input())\n \n Ais = list(map(int, input().split()))\n \n m = int(input())\n \n idxs = list(map(int, input().split()))\n \n acc = [0]*(len(Ais)+1)\n for i in range(1, len(Ais)+1):\n acc[i] = acc[i-1] + Ais[i-1]\n \n # Bin search\n for idx in idxs:\n l, h = 1, len(acc)\n \n while l < h:\n m = (l + h) // 2\n \n if idx <= acc[m]:\n h = m\n else:\n l = m + 1\n \n print(h)\n\nmain()\n", "n = int(input())\r\nt = 0\r\nnums = [t:=t+int(i) for i in input().split()]\r\nm = int(input())\r\njuicy = list(map(int, input().split()))\r\nans = []\r\nfor i in range(m):\r\n target = juicy[i]\r\n left = 0\r\n right = n-1\r\n while left < right:\r\n mid = (left + right) >> 1\r\n if nums[mid] < target:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n ans.append(str(left + 1))\r\nprint('\\n'.join(ans))\r\n", "def binSearch(n, a, q):\r\n sumit = [0] * (n + 1)\r\n sumit[1] = a[0]\r\n \r\n for i in range(1, n):\r\n sumit[i + 1] = sumit[i] + a[i]\r\n \r\n results = []\r\n for r in q:\r\n low, high = 0, n - 1\r\n while low <= high:\r\n mid = (high + low) // 2\r\n if sumit[mid] < r <= sumit[mid + 1]:\r\n results.append(mid+1)\r\n break\r\n elif sumit[mid] >= r:\r\n high= mid - 1\r\n else:\r\n low = mid + 1\r\n return results\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nm = int(input())\r\nq = [int(x) for x in input().split()]\r\n\r\nresult = binSearch(n, a, q)\r\nfor i in range(m):\r\n print(result[i])", "def find(num,s):\r\n left=0\r\n right=len(num)\r\n while right>=left:\r\n middle=(left+right)//2\r\n if num[middle]==s:\r\n return middle\r\n elif num[middle]>s:\r\n right=middle-1\r\n else:\r\n left=middle+1\r\n else:\r\n return left\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nnum=[0]\r\ni=0\r\nwhile i<n:\r\n num.append(num[i]+a[i])\r\n i+=1\r\nm=int(input())\r\nq=list(map(int,input().split())) \r\nfor i in range(m):\r\n print(find(num,q[i]))", "def solve(a,L):\n l,r=0,len(L)\n while r-l>1:\n m=(l+r)//2\n if L[m]<a:l=m\n else: r=m\n return r\n\nn=int(input())\nL=[0]+list(map(int,input().split()))\ninput()\nfor i in range(1,n+1):L[i]+=L[i-1]\nfor x in map(int,input().split()):print(solve(x,L))\n\n", "L=[]\ninput()\nr=1\nfor k in input().split():\n L+=[r]*int(k)\n r+=1\ninput()\nfor j in input().split():\n print(L[int(j)-1])\n\t\t\t \t \t \t\t\t\t\t \t\t \t \t \t", "n = int(input())\r\n\r\nch = list(map(int, input().split()))\r\n\r\nm = int(input())\r\n\r\ns = list(map(int, input().split()))\r\n\r\n\r\n\r\nvalue = 1\r\nanswer = []\r\nfor i in ch:\r\n for j in range(i):\r\n answer.append(value)\r\n value += 1 \r\n\r\nfor j in s:\r\n print(answer[j - 1])", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = int(input())\r\nq = list(map(int, input().split()))\r\nfor i in range(1, n):\r\n a[i] += a[i-1]\r\nfor x in q:\r\n l, r = -1, n\r\n while r-l > 1:\r\n mid = (r+l) // 2\r\n if a[mid] >= x:\r\n r = mid\r\n else:\r\n l = mid\r\n print(l+2)\r\n" ]

[ "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, w, h = map(int, input().split())\r\nd = [(w, h, 0)]\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a > w and b > h:\r\n d.append((a, b, i+1))\r\nd.sort()\r\nm = len(d)\r\nx = [(1, 0) for i in range(m)]\r\nif len(d) == 1:\r\n print(0)\r\n exit()\r\nfor i in range(1, m):\r\n for j in range(i+1, m):\r\n if d[j][0] > d[i][0] and d[j][1] > d[i][1]:\r\n if x[i][0] + 1 > x[j][0]:\r\n x[j] = (x[i][0] + 1, i)\r\na, b = -1, -1\r\nfor i in range(1, m):\r\n if x[i][0] > a:\r\n a = x[i][0]\r\n b = i\r\nq = [b]\r\nf = []\r\nwhile q:\r\n a = q.pop()\r\n if x[a][1] == a:\r\n break\r\n f.append(d[a][2])\r\n q.append(x[a][1])\r\nprint(len(f))\r\nif f:\r\n print(' '.join(map(str, f[::-1])))", "import sys\r\n\r\n\r\n\r\n\r\n\r\n\r\ninput = sys.stdin.readline\r\nn, width, height = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n w, h = map(int, input().split())\r\n if w > width and h > height:\r\n arr.append((w, h, i+1))\r\n\r\nF = [1]*len(arr)\r\nparent = [-1]*len(arr)\r\narr.sort(key=lambda x:x[0], reverse=True)\r\n\r\nfor i in range(len(arr)):\r\n for j in range(i):\r\n if arr[j][0] > arr[i][0] and arr[j][1] > arr[i][1] and F[j]+1 > F[i]:\r\n F[i] = F[j]+1\r\n parent[i] = j\r\nind = -1\r\nm = 0\r\nfor i in range(len(arr)):\r\n if F[i] > m:\r\n m = F[i]\r\n ind = i\r\n\r\nans = []\r\nprint(m)\r\nwhile ind != -1:\r\n ans.append(arr[ind][2])\r\n ind = parent[ind]\r\nif len(ans):\r\n print(*(ans))", "n,r,c=map(int,input().split())\r\nl=[[r,c,0]]\r\nn+=1\r\nfor i in range(1,n):\r\n a,b=map(int,input().split())\r\n l.append([a,b,i])\r\nl=sorted(l,key=lambda x:x[1])\r\nv=[0]*n\r\np=[-1]*n\r\nfor i in range(n-1,-1,-1):\r\n v[l[i][2]]=1\r\n for j in range(i+1,n):\r\n if l[j][0]>l[i][0] and l[j][1]>l[i][1] and v[l[j][2]]>=v[l[i][2]]:\r\n v[l[i][2]] = v[l[j][2]]+1\r\n p[l[i][2]]=l[j][2]\r\nprint(v[0]-1)\r\ni=p[0]\r\nwhile ~i:\r\n print(i,end=' ')\r\n i=p[i]\r\n\r\n# for i in range()", "################################################################################\r\nn,w,h=map(int,input().split())\r\nenvelope=[]\r\nfor i in range(n):\r\n wcup,hcup=map(int,input().split())\r\n if (wcup>w) and (hcup>h):\r\n envelope.append((wcup,hcup,i+1))\r\n\r\n# n=2\r\n# w=1\r\n# h=1\r\n# envelope=[(2,2,1),(2,2,2)]\r\n\r\n# n=3\r\n# w=3\r\n# h=3\r\n# envelope=[(5,4,1),(12,11,2),(9,8,3),(5,5,4)]\r\n################################################################################\r\nif len(envelope)==0:\r\n print(0)\r\n exit()\r\n\r\nn=len(envelope)\r\nenvelope.sort()\r\n\r\ndp=[[1,-1] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(0,i):\r\n if (envelope[i][0]>envelope[j][0]) and (envelope[i][1]>envelope[j][1]) and (dp[j][0]>=dp[i][0]):\r\n dp[i][0]=dp[j][0]+1\r\n dp[i][1]=j\r\n\r\np,index = max( (v,i) for i,v in enumerate(dp) )\r\nprint(p[0])\r\nout=str(envelope[index][2])\r\nwhile p[1]!=-1:\r\n out=str(envelope[p[1]][2])+' '+out\r\n p=dp[p[1]]\r\nprint(out)\r\n" ]

[ "def main():\n s = input()\n if s in (\"01\", \"10\"):\n print(0)\n return\n cnt = [0] * 58\n for j in map(ord, s):\n cnt[j] += 1\n n, s1 = sum(cnt), input()\n for le in range(n - 1, 0, -1):\n if len(str(le)) + le == n:\n break\n for s in s1, str(le):\n for j in map(ord, s):\n cnt[j] -= 1\n res = [''.join([s1] + [chr(i) * a for i, a in enumerate(cnt) if a])] if s1[0] > '0' else []\n for i in range(49, 58):\n if cnt[i]:\n cnt[i] -= 1\n l = [chr(i) * a for i, a in enumerate(cnt) if a]\n l.append(s1)\n res.append(''.join([chr(i)] + sorted(l)))\n break\n print(min(res))\n\n\nif __name__ == '__main__':\n main()\n\n \t \t \t\t\t \t\t\t \t\t \t\t \t \t" ]

[ "import math\ndef prime(x):\n for i in range(2, int(math.sqrt(x))+1):\n if x % i == 0:\n return 0\n return 1\n\n\ndef cal(n, k):\n if not prime(k):\n return 0\n elif k >= n:\n return k == n\n res = n // k\n for i in range(2, min(k, n // k +1)):\n res -= cal(n // k, i)\n return res\n\n\na, b, k = input().split()\na = int(a)\nb = int(b)\nk = int(k)\nprint(cal(b, k) - cal(a - 1, k))\n\t \t\t\t\t\t \t \t\t \t\t \t \t\t \t\t \t" ]

[ "import poplib\r\nimport string\r\nimport math\r\n\r\ndef main_function():\r\n a, b, m, r_0 = [int(i) for i in input().split(\" \")]\r\n current_index = 1\r\n hash_ = {r_0: 0}\r\n while True:\r\n r_0 = (a * r_0 + b) % m\r\n if r_0 in hash_:\r\n print(current_index - hash_[r_0])\r\n break\r\n else:\r\n hash_[r_0] = current_index\r\n current_index += 1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "a,b,m,r=map(int,input().split())\r\nl,s=[],set()\r\nwhile r not in s:\r\n s.add(r)\r\n l.append(r)\r\n r=(a*r + b)%m\r\nprint(len(l)-l.index(r)) \r\n", "a, b, m, r0 = [int(k) for k in input().split(' ') if k]\nvalueToPos = [-1 for _ in range(m + 1)]\nprev = r0\nfor i in range(m + 1):\n prev = (a * prev + b) % m\n if valueToPos[prev] != -1:\n print(i - valueToPos[prev])\n exit()\n valueToPos[prev] = i\nraise Exception\n", "a,b,m,r = map(int,input().split())\r\nseq = dict()\r\nres = (a*r + b)%m\r\nr = res\r\nwhile seq.get(res,0)<=1:\r\n seq[res] = seq.get(res,0)+1\r\n res = (a*r + b)%m\r\n r = res\r\ncnt = sum([seq[i]==2 for i in seq])\r\nprint(cnt)\r\n", "a,b,m,r0=map(int,input().split())\r\ndct={}\r\ni=0\r\nwhile(True):\r\n r0=(a*r0+b)%m\r\n i+=1\r\n if(r0 not in dct.keys()):\r\n dct[r0]=i\r\n else:\r\n print(i-dct[r0])\r\n break\r\n\r\n", "a, b, m, r=map(int,input().split())\r\nn=[-1]*10**5\r\ni = 0\r\nwhile True:\r\n i += 1\r\n r=(a*r+b)%m\r\n if n[r]==-1:\r\n n[r]=i\r\n else:\r\n print(i-n[r])\r\n break", "def main():\n a, b, m, r = map(int, input().split())\n d = {}\n for i in range(m + 1):\n if r in d:\n print(i - d[r])\n break\n d[r], r = i, (r * a + b) % m\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n a, b, m, r = map(int, input().split())\n l, s = [], set()\n while r not in s:\n s.add(r)\n l.append(r)\n r = (r * a + b) % m\n print(len(l) - l.index(r))\n\n\nif __name__ == '__main__':\n main()\n", "import sys,math,io,os,time,itertools,collections\r\nmod=10**9+7\r\nsys.setrecursionlimit(10000)\r\ni=sys.stdin.readline\r\np=sys.stdout.write\r\n#use sys.stdout.write() (remember to convert to str b4 and concatenate \"\\n\")\r\nglobal start,end\r\n\r\n#binary search\r\ndef isin(l,x):\r\n left=0\r\n right=len(l)-1\r\n if x<l[0]:\r\n return -1\r\n while left<=right:\r\n mid=left + (right -left)//2\r\n if l[mid]==x:\r\n return mid\r\n elif l[mid]<x:\r\n ans=mid\r\n left=mid+1\r\n else:\r\n right=mid-1\r\n return ans\r\n\r\n#is palindrome or not\r\ndef ispal(l):\r\n n=len(l)\r\n for i in range(n//2+1):\r\n if l[i]!=l[n-i-1]:\r\n return False\r\n return True\r\n\r\n#coordinate compression\r\ndef ccarray(l):\r\n d={l[k]:k for k in range(len(l))}\r\n m=sorted(d)\r\n return [d[m[k]] for k in range(len(l))]\r\n\r\n#checks if prime or not\r\ndef is_prime(n):\r\n if n<=3:\r\n return n>1\r\n if n%2==0 or n%3==0:\r\n return False\r\n k=5\r\n while k**2<=n:\r\n if n%k==0 or n%(k+2)==0:\r\n return False\r\n k+=6\r\n return True\r\n\r\n#sieve of eratosthenes\r\ndef sieve(n):\r\n prime=[True for k in range(n+1)]\r\n p=2\r\n while p*p<=n:\r\n if prime[p]==True:\r\n for k in range(p*p,n+1,p):\r\n prime[k]=False\r\n p+=1\r\n\r\ndef main():\r\n a,b,m,r=[int(k) for k in i().split()]\r\n d={}\r\n d[(a*r+b)%m]=1\r\n ans=0\r\n last=(a*r+b)%m\r\n for k in range(2,10**5+5):\r\n temp=(a*last+b)%m\r\n if temp in d:\r\n p(str(k-d[temp])+\"\\n\")\r\n break\r\n else:\r\n d[temp]=k\r\n last=temp\r\n\r\nt=1\r\n#t=int(i())\r\nstart=time.perf_counter()\r\nfor _ in range(t):\r\n main()\r\nend=time.perf_counter()\r\n#print(end-start)", "a,b,m,r=map(int,input().split())\r\nd={}\r\ni=1\r\nwhile 1:\r\n\tr=(a*r+b)%m;t=d.get(r,0)\r\n\tif t:i-=t;break\r\n\td[r]=i;i+=1\r\nprint()\r\nprint(i)\r\n", "a, b, m, r0 = map(int, input().split())\r\nnumbers = {} \r\ncounter = 0\r\nperiod = 0\r\nr = r0\r\nwhile True:\r\n r1 = (a*r + b)%m\r\n counter += 1\r\n if r1 in numbers:\r\n period = counter - numbers[r1]\r\n break\r\n else:\r\n numbers[r1] = counter\r\n r = r1\r\nprint(period)", "a, b, m, r = map(int, input().split())\r\nfor i in range(m):\r\n r = (a * r + b) % m\r\nx = (a * r + b) % m\r\ni = 1\r\nwhile x != r:\r\n x = (a * x + b) % m\r\n i += 1\r\nprint(i)", "import sys\n\na, b, m, x = tuple(map(int, input().split()))\nz=[0]*(m+1)\ncnt=1\nz[x]=cnt\nwhile True:\n cnt += 1\n x = (x*a+b)%m\n if z[x] > 0:\n print(str(cnt-z[x]))\n sys.exit(0)\n z[x] = cnt\n", "a, b, m, r = map(int, input().split())\r\n\r\nd = {}\r\ni = 1\r\nwhile True:\r\n r = (a * r + b) % m\r\n g = d.get(r, 0)\r\n if g:\r\n i -= g\r\n break\r\n\r\n d[r] = i\r\n i += 1\r\nprint(i)\r\n \r\n", "a, b, m, r = map(int, input().split())\r\ndc, t = dict(), 0\r\nwhile True:\r\n t += 1\r\n r = (a * r + b) % m\r\n if r in dc:\r\n print(t - dc[r])\r\n break\r\n else:\r\n dc[r] = t", "import re\nimport itertools\nfrom collections import Counter, deque\n\nclass Task:\n a, b, m, r = 0, 0, 0, 0\n answer = 0 \n\t\n def getData(self):\n self.a, self.b, self.m, self.r = [int(x) for x in input().split(' ')]\n #inFile = open('input.txt', 'r')\n #inFile.readline().rstrip()\n #self.childs = inFile.readline().rstrip()\n\n def solve(self):\n a, b, m, r = self.a, self.b, self.m, self.r\n occurrences = dict({r : 0})\n iterationCounter = 1\n while True:\n r = (a * r + b) % m\n if r in occurrences:\n self.answer = iterationCounter - occurrences[r]\n return\n occurrences[r] = iterationCounter\n iterationCounter += 1\n\n def printAnswer(self):\n print(self.answer)\n #outFile = open('output.txt', 'w')\n #outFile.write(self.answer)\n\ntask = Task()\ntask.getData()\ntask.solve()\ntask.printAnswer()\n", "a,b,m,r = map(int,input().split())\r\nmods = [0]*m\r\nwhile mods[r]<3:\r\n r = (a*r+b)%m\r\n mods[r] += 1\r\n# +1 for element == 3\r\nprint(mods.count(2) + 1)\r\n\r\n", "a , b , m , r = map(int,input().split())\r\ncache = {r : 0}\r\nindex = 1\r\nflag = True\r\nwhile flag :\r\n n = (a * r + b) % m\r\n if n in cache.keys() :\r\n print(index - cache[n])\r\n flag = False\r\n exit()\r\n else:\r\n cache[n] = index\r\n index += 1\r\n r = n", "a,b,m,r0=0,0,0,0\r\na,b,m,r0=map(int,input().split())\r\nri=r0\r\ni=0\r\nI={}\r\nwhile (ri) not in I:\r\n I[ri]=i\r\n ri=(a*ri+b)%m\r\n i+=1\r\nprint (i-I[ri]) " ]

[ "\r\nimport math \r\nimport sys\r\ndef search(arr,l,r,p1,p2):\r\n\r\n\r\n \r\n i1=-1\r\n i2=-1\r\n copy_l=l \r\n copy_r=r\r\n while l<=r:\r\n m=(l+r)//2 \r\n val=arr[m]\r\n if p1<=val and val<=p2:\r\n i1=m\r\n r=m-1 \r\n elif val>p2:\r\n \r\n r=m-1 \r\n else:\r\n l=m+1\r\n l=copy_l \r\n r=copy_r\r\n while l<=r:\r\n m=(l+r)//2 \r\n val=arr[m]\r\n if p1<=val and val<=p2:\r\n i2=m\r\n l=m+1 \r\n elif val>p2:\r\n \r\n r=m-1 \r\n else:\r\n \r\n l=m+1\r\n if i1==-1 or i2==-1:\r\n return 0 \r\n else:\r\n return i2-i1+1\r\ndef main(arr):\r\n\r\n n=len(arr) \r\n \r\n for i in range(len(arr)):\r\n arr[i].sort()\r\n ans=0\r\n for i in range(len(arr)):\r\n\r\n f_arr=arr[(i-1)%n]\r\n s_arr=arr[(i+1)%n]\r\n \r\n for j in range(len(arr[i])-1):\r\n p1=arr[i][j]\r\n p2=arr[i][j+1]\r\n val1=search(f_arr,0,len(f_arr)-1,p1,p2)\r\n val2=search(s_arr,0,len(s_arr)-1,p1,p2)\r\n\r\n if val1!=val2:\r\n ans+=1 \r\n return ans\r\n \r\n\r\n\r\n \r\n\r\n\r\nn=int(input())\r\narr=[] \r\nfor i in range(n):\r\n\r\n arr2=list(map(int,input().split()))\r\n arr2.pop(0)\r\n arr.append(arr2)\r\nprint(main(arr))\r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n ", "def sort_bridges(bridges):\r\n for i in range(len(bridges)):\r\n bridges[i].sort()\r\n\r\ndef find_greater(arr, value, start, end):\r\n mid = (start + end) // 2\r\n if start == end:\r\n return start\r\n if arr[mid] > value:\r\n return find_greater(arr, value, start, mid)\r\n else:\r\n return find_greater(arr, value, mid + 1, end)\r\n\r\ndef solve(n, bridges):\r\n sort_bridges(bridges)\r\n unstable_cells = 0\r\n for i in range(n):\r\n left = bridges[(i - 1) % n]\r\n right = bridges[(i + 1) % n]\r\n\r\n for j in range(len(bridges[i]) - 1):\r\n first_point = bridges[i][j]\r\n second_point = bridges[i][j + 1]\r\n\r\n left_index_1 = find_greater(left, first_point, 0, len(left) - 1)\r\n left_index_2 = find_greater(left, second_point, 0, len(left) - 1)\r\n\r\n right_index_1 = find_greater(right, first_point, 0, len(right) - 1)\r\n right_index_2 = find_greater(right, second_point, 0, len(right) - 1)\r\n\r\n left_count = 0\r\n right_count = 0\r\n if left[left_index_1] > first_point:\r\n if left[left_index_2] > second_point:\r\n left_count = left_index_2 - left_index_1\r\n else:\r\n left_count = left_index_2 - left_index_1 + 1\r\n \r\n if right[right_index_1] > first_point:\r\n if right[right_index_2] > second_point:\r\n right_count = right_index_2 - right_index_1\r\n else:\r\n right_count = right_index_2 - right_index_1 + 1\r\n \r\n if left_count != right_count:\r\n unstable_cells += 1\r\n \r\n print(unstable_cells)\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n bridges = []\r\n for i in range(n):\r\n bridge = []\r\n k, *l = map(int, input().split())\r\n bridges.append(l)\r\n \r\n solve(n, bridges)", "import collections\r\nimport heapq\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\nimport os\r\n\r\n\r\ndef values():\r\n return tuple(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef inplst():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef inp():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef inpstr():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef words():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef chars():\r\n return list(sys.stdin.readline().strip())\r\n\r\n\r\ndef solve():\r\n N = inp()\r\n sectors = []\r\n for i in range(N):\r\n sector_bridges = values()[1:]\r\n sectors.append(sorted(sector_bridges))\r\n\r\n ans = 0\r\n\r\n for i in range(N):\r\n pi, ni = 0, 0\r\n ps, ns = sectors[(i - 1 + N) % N], sectors[(i + 1) % N]\r\n s = sectors[i]\r\n for j in range(len(s) - 1):\r\n p, n = 0, 0\r\n while pi < len(ps) and ps[pi] < s[j + 1]:\r\n if s[j] <= ps[pi] <= s[j + 1]:\r\n p += 1\r\n pi += 1\r\n if pi < len(ps) and s[j] <= ps[pi] <= s[j + 1]:\r\n p += 1\r\n\r\n while ni < len(ns) and ns[ni] < s[j + 1]:\r\n if s[j] <= ns[ni] <= s[j + 1]:\r\n n += 1\r\n ni += 1\r\n if ni < len(ns) and s[j] <= ns[ni] <= s[j + 1]:\r\n n += 1\r\n\r\n if n != p:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n if os.path.exists('/home/ms/myp/problem-solving/input'):\r\n sys.stdin = open('/home/ms/myp/problem-solving/input', 'r')\r\n sys.setrecursionlimit(10000000)\r\n solve()\r\n" ]

[ "n,x=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nif sum(a) + n - 1 == x:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n,x=map(int,input().split(' '))\nval=[int(i) for i in input().split(' ') ]\ns=len(val)-1\nfor i in val:\n s+=i\nif s==x:\n print('YES')\nelse:\n print('NO')\n\n\n\t \t \t\t\t \t\t \t \t\t\t \t\t\t", "import sys\r\nimport math\r\n#import random\r\n#sys.setrecursionlimit(1000000)\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,x=invr()\r\nara=inara()\r\n\r\ntot=n-1\r\nfor num in ara:\r\n\ttot+=num\r\n\r\nif tot==x:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n,x=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nif x-sum(L)==n-1:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif sum(l)>x:\r\n print(\"NO\")\r\nelif sum(l)+n-1==x or (n==1 and (l[0]==x)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, x = map(int, input().split())\r\ns = sum(list(map(int, input().split())))\r\nif s + n - 1 == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\n\r\ncin = lambda : map(int, input().split())\r\nn, x = cin()\r\na = list(cin())\r\ns = sum(a)\r\nif s + n - 1 == x:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=l[i]\r\nif s+n-1==x:\r\n print('yes')\r\nelse : print('no')", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nd=0\r\nfor i in range(0,len(a)):\r\n d=d+a[i]\r\nd=d+(len(a)-1)\r\nif(d==m):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "y = input().split(\" \")\nn = int(y[0])\nx = int(y[1])\n\nenc = []\n\n\nt = input().split(\" \")\n\nfor k in t:\n enc.append(int(k))\n\nq = sum(enc) + n - 1\n\nif q != x:\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, x = map(int, input().split())\r\ntot = sum(list(map(int, input().split())))\r\nprint('YES' if tot + n - 1 == x else 'NO')", "INF = int(1e18)\r\n\r\n\r\ndef main():\r\n n, x = [int(y) for y in input().split()]\r\n a = [int(x) for x in input().split()]\r\n sum = 0\r\n for y in a:\r\n sum += y\r\n if x - sum == n - 1:\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\nmain()", "n, x = map(int, input().split())\nencoding = [int(x) for x in input().split()]\n\naux = n-1\nfor i in range(n):\n aux += encoding[i]\n\nif aux == x:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t \t \t\t \t \t \t \t\t\t\t \t", "n,x = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\n\r\nif x - sum(a) == n-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nn, x = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n\r\nif sum(arr) + n - 1 == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "class Solver:\r\n def run(self):\r\n n, x = map(int, input().split())\r\n a = map(int, input().split())\r\n print(\"YES\" if sum(a) + n - 1 == x else \"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n Solver().run()\r\n", "n, x = [int(x) for x in input().split()]\r\nif sum([int(x) for x in input().split()]) + n - 1 == x:\r\n print('YES')\r\nelse:\r\n print('NO')", "first_line = [int(x) for x in input().split()]\nn = first_line[0]\nx = first_line[1]\n\nencod = [int(x) for x in input().split()]\n\nsum_encod = sum(encod)\nif (sum_encod + len(encod) - 1) == x:\n print('YES')\nelse:\n print('NO')\n \t\t\t \t\t\t \t\t \t \t \t \t\t\t \t", "def zhauap():\r\n n, m = map(int, input().split())\r\n s = input().split(\" \"); suma = 0\r\n for i in s:\r\n suma += int(i)\r\n if suma + n == m + 1: print('YES')\r\n else: print('NO')\r\nzhauap()", "data1 = list(map(int,input().split()))\ndata2 = list(map(int,input().split()))\nif sum(data2)+data1[0]-1==data1[1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n,x = input().split()\r\nn = int(n)\r\nx = int(x)\r\nline = [int(i) for i in input().split()]\r\nif sum(line) + n - 1 == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, x=map(int, input().split())\r\na=[int(x) for x in input().split()]\r\nif sum(a)+n-1==x:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def main():\r\n \r\n n,x = map(int, input().split())\r\n \r\n a = [int(i) for i in input().split()]\r\n \r\n ones=sum(a)\r\n \r\n if ones + (n-1) == x:\r\n print('YES')\r\n \r\n else:\r\n print('NO')\r\n \r\n\r\n \r\nif __name__=='__main__':\r\n main()", "#Ana Clara Lacaze\n#193858\n\nn,x = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nsomatorioA = sum(a)\nif x == (somatorioA + n - 1):\n print('YES')\nelse:\n print('NO')\n \t \t \t\t \t \t \t \t\t \t", "n,t=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif (sum(l)+(n-1))==t:\r\n print('Yes')\r\nelse :\r\n print('NO')", "import math,sys,time,random\n\ndef opt(arr,i):\n if i>len(arr):\n return 0\n else:\n if i+2>len(arr)-1:\n return 0\n return \\\n min(abs(arr[i]-arr[i+1])+opt(arr,i+1),abs(arr[i]-arr[i+2])+opt(arr,i+2))\n\nn,x = map(int,input().split())\narr = list(map(int,input().split()))\nif sum(arr)==x and n!=1:\n print('NO')\n sys.exit()\nif sum(arr)>x:\n print('NO')\n sys.exit()\ns = 0\nfor i in range(n-1):\n s+=arr[i]+1\ns+=arr[-1]\nif s==x:\n print('YES')\n sys.exit()\nprint('NO')\n\n'''\n2 4\n1 3\n\n2 10\n1 3\n1000001110\n1110111011\n2 4\n1 3\n'''\n", "'''input\n2 10\n1 3\n'''\nn, x = map(int, input().split())\na = list(map(int, input().split()))\nif sum(a) + n - 1 == x:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n,x = [int(i) for i in input().split()]\r\nl = [int(i) for i in input().split()]\r\nif x - sum(l) == n-1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, x = map(int,input().split())\r\na = list(map(int, input().split()))\r\nif x-sum(a) == n-1: print('YES')\r\nelse: print('NO')\r\n", "n, e = input().split()\r\nn, e = int(n), int(e)\r\narr = list(map(int, input().split()))\r\n\r\nif sum(arr) + n - 1 == e:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n, x = input().split()\r\nn = int(n)\r\nx = int(x)\r\n\r\nsum = 0\r\nfor i in input().split():\r\n sum += int(i)\r\n\r\nif sum + n-1 != x:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n, x = map(int, input().split())\nprint(['NO', 'YES'][sum(map(int, input().split())) + n - 1 == x])", "n,x=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nif n-1+sum(a)==x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, x = map(int,input().split())\r\nnumber = list(map(int,input().split()))\r\n\r\nif sum(number)+n-1 ==x:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, x = map(int, input().split())\r\nunique_x = sum(list(map(int, input().split()))) + n - 1\r\nprint('YES' if unique_x == x else 'NO')", "amount_array, limit = [int(i) for i in input().split()]\r\ntotal = 0\r\nfor j in [int(i) for i in input().split()]:\r\n total += j\r\n\r\nif total + amount_array - 1 == limit:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,x=map(int, input().split())\nl=[int(x) for x in input().split()]\nnoOfzeroes=x-sum(l)\nif n==noOfzeroes+1:\n\tprint('YES')\nelse:\n\tprint('NO')", "# import sys\r\n# sys.stdin=open('F:\\\\C\\\\Script\\\\input.txt','r')\r\n# sys.stdout=open('F:\\\\C\\\\Script\\\\output.txt','w')\r\n# sys.stdout.flush()\r\n\r\nn,x = [int(i) for i in input().split()]\r\nl = [int(i) for i in input().split()]\r\n\r\ns = sum(l)\r\nif s+n - 1 == x:\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "import sys\r\nn,x=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nif sum(t)+len(t)-1==x:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\n\r\nn, x = map(int, input().split())\r\nt = sum(map(int, input().split()))\r\nprint('YES' if t + n - 1 == x else 'NO')\r\n", "n, x = map(int, input().split())\nl = input().split()\nl = list(map(int, l))\n\nif sum(l) + n - 1 == x:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t \t \t\t\t\t\t\t\t \t\t \t\t \t\t \t", "\r\nn, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nif sum(l) + n - 1 == x:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(\"YES\" if sum(arr) + len(arr)-1 == x else \"NO\")", "x = input()\r\nx_ = x.split()\r\nx__ = [int(d) for d in x_]\r\n\r\ny = input()\r\ny_ = y.split()\r\ny__ = [int(d) for d in y_]\r\n\r\nlen_of_crossword = x__[1]\r\n\r\nsum_of_strings_in_code = sum(y__)\r\nno_of_string = x__[0]\r\n\r\nq = len_of_crossword - sum_of_strings_in_code\r\n\r\nif q == no_of_string -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif a[1]-sum(b)==len(b)-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n, x = [int(i) for i in input().strip().split()]\na = [int(i) for i in input().strip().split()]\nif len(a) - 1 + sum(a) == x:\n print('YES')\nelse:\n print('NO')\n\n \t \t\t \t\t\t\t\t \t\t \t \t", "n, x = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nif sum(a) + n - 1 == x:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, x = input().split(\" \")\r\nn, x = int(n), int(x)\r\na = input().split(\" \")\r\ns = 0\r\nfor i in range(n):\r\n s = s + int(a[i]) + 1\r\nif s == x + 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "arr = input()\narr = arr.split()\nn = int(arr[0])\nx = int(arr[1])\nencripted = input()\nencripted = encripted.split()\nsum = 0\nfor i in range(n):\n sum += int(encripted[i])\n\nif sum + n - 1 == x:\n print('YES')\nelse:\n print('NO')\n\t \t \t \t\t\t \t \t \t\t \t \t \t\t \t", "n, x = [int(i) for i in input().split()]\na = [int (i) for i in input().split()]\n\nif n-1+sum(a) == x:\n print(\"YES\")\nelif sum(a) == 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", "n, x = map (int, input().split())\r\na = list (map (int, input().split()))\r\nprint ('YES' if sum (a) + (len(a)-1) == x else 'NO')", "n, x = map(int,input().split())\r\na = list(map(int,input().split()))\r\nif (sum(a)+ n - 1 == x):print(\"YES\")\r\nelse: print(\"NO\")", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))[:n]\r\ny=0\r\nfor i in range(n):\r\n y+=a[i]\r\nif y==x-(n-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,x = input().split()\r\nn = int(n)\r\nx = int(x)\r\na = list(map(int,input().split()))\r\nsu = sum(a)\r\nif su + n - 1 == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, x = map(int, input().split())\ncodigo = input().split()\n\ncodigo = list(map(int, codigo))\n\nif sum(codigo) + n - 1 < x or sum(codigo) + n - 1 > x :\n print(\"NO\")\nelse:\n print(\"YES\")\n\t \t\t \t \t\t\t \t\t \t \t \t\t \t", "n, m = [int(i) for i in input().split()]\nf = [int(i) for i in input().split()]\nif sum(f) + n - 1 == m:\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", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntol = 0\r\nfor i in range(n):\r\n tol += a[i]\r\nif tol + n - 1 == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,x=map(int,input().split())\r\nT=list(map(int,input().split()))\r\ns=0\r\nfor i in T:\r\n s=s+i\r\ns=s+(n-1)\r\nif s==x:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n, x = map(int, input().split())\r\nfor i in input().split():\r\n x-=int(i)\r\nif x+1==n: print('YES')\r\nelse: print('NO')\r\n", "n,x=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nprint('YES' if sum(l)+(n-1)==x else 'NO')", "n,m=map(int,input().split(' '))\r\na=list(map(int,input().split(' ')))\r\n\r\n\r\n\r\n\r\n\r\nif sum(a)+(n-1)==m:\r\n print('Yes')\r\nelse:\r\n print('NO')\r\n", "n, x = map(int, input().split())\r\na = [i for i in map(int, input().split())]\r\nprint('YES' if (sum(a)+n-1)==x else 'NO')\r\n", "from sys import stdin, stdout\r\nfrom collections import Counter\r\n\r\ndef main():\r\n n, x = map(int, stdin.readline().split())\r\n s = sum(map(int, stdin.readline().split()))\r\n if s + n - 1 == x:\r\n stdout.write('YES')\r\n else:\r\n stdout.write('NO')\r\n\r\nif __name__ == '__main__':\r\n main()", "n, x = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nprint('YNEOS'[not(sum(a) + n - 1 == x)::2])\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif sum(a)+n-1==k:\r\n print('YES')\r\nelse:\r\n print('NO')", "R=lambda:list(map(int,input().split()))\nn,x=R()\nprint(\"YES\"if sum(R())==x+1-n else\"NO\")\n", "n,x=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nif(sum(a)+n-1==x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,x = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nc = sum(a)+n-1\r\nif(c==x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "n,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\nt = sum(a)\r\nif x - t == n-1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n,x = map(int,input().split())\n\ndata = list(map(int,input().split()))\n\nsum = 0\n\nfor i in data:\n sum += i\n\nsum += n-1\n\nif sum == x:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t\t\t \t\t \t \t\t\t\t\t\t\t\t\t\t\t\t \t", "n, m =input().split()\nlista = input().split()\nsomatorio = int(n) - 1\nfor i in range(len(lista)):\n somatorio+=int(lista[i])\nif somatorio == int(m):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t \t \t \t \t \t\t \t\t", "n,t = (int(x) for x in input().split())\r\n\r\nns = [int(x) for x in input().split()]\r\n\r\n\r\ntt = sum(ns) + len(ns) - 1\r\n\r\nprint('YES' if tt == t else 'NO')", "n,s=map(int,input().split())\na=sum(map(int,input().split()))\nif a==s-n+1:print(\"Yes\")\nelse:print(\"No\")", "line = input()\narray = line.split()\nn = int(array[0])\nx = int(array[1])\n\nline = input()\narray = line.split()\nspaces = 0\nfor i in range(len(array)):\n spaces += int(array[i])\n if(i != (len(array)-1)):\n spaces += 1\n\nif(spaces == x):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t \t\t \t \t \t \t \t \t\t\t", "n=input().split()\r\nn[0]=int(n[0])\r\nn[1]=int(n[1])\r\nli=list(map(int,input().split()))\r\ns=sum(li)\r\nif((s+(n[0]-1))==n[1]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n,x=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\n\r\nif (sum(l)+(n-1)==x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "while True:\n try:\n \t\n \tdef read():\n \t\tn, x = map(int, input().split())\n \t\ta = list(map(int, input().split()))\n \t\tsolve(n, x, a)\n \t\n \tdef solve(n, x, a):\n \t\ts = 0\n \t\tfor i in range(n):\n \t\t\ts += a[i]\n \t\tif s + n -1 > x or s + n -1 < x:\n \t\t\tprint(\"NO\")\n \t\telse:\n \t\t\tprint(\"YES\")\n \t\t\t\t\t\n \tif __name__ == \"__main__\":\n \t\tread()\n \t\t\n except EOFError:\n break\n\t", "n, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nif sum(a)+n-1 == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "if __name__ == '__main__':\r\n n, l = [int(i) for i in input().strip().split(\" \")]\r\n arr = [int(i) for i in input().strip().split(\" \")]\r\n s = 0\r\n for i in arr:\r\n s += i\r\n if s + len(arr) - 1 == l:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "from functools import reduce\n\n\nn, x = map(int, input().split())\na = map(int, input().split())\ntotal_length = n - 1 + reduce(lambda x, y: x + y, a)\nprint('YES' if total_length == x else 'NO')\n\n\t\t \t \t\t \t\t \t \t\t\t\t\t \t \t \t\t", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nk=0\r\nfor i in range(len(a)-1):\r\n k+=a[i]+1\r\nk+=a[len(a)-1]\r\nif len(a)==0 or k==x:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,x=[int(i) for i in input().split()]\r\nlst=[int(i) for i in input().split()]\r\nsum1=sum(lst)+(n-1)\r\nif sum1==x:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, x = map(int, input().split())\r\nif (n-1+sum(map(int, input().split()))) != x:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif sum(a)+(n-1)==x:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\nsumm = len(b)-1\nfor i in range(a[0]):\n summ += b[i]\nif summ == a[1]:\n print(\"YES\")\nelse:\n print(\"NO\")", "inp = list(map(int, input().split()))\nn = inp[0]\nx = inp[1]\ninp = list(map(int, input().split()))\nsum=0\nfor i in inp:\n sum+=1+i\nif sum-1==x:\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", "f=lambda:map(int,input().split())\r\nn,k=f()\r\nprint(\"YES\"if sum(f())+n-1==k else\"NO\")", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(b)):\r\n c=c+b[i]\r\nc=c+len(b)-1\r\nif c==a[1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "import os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache #use @lru_cache(None)\r\nif os.path.exists('in.txt'): sys.stdin=open('in.txt','r')\r\nif os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')\r\n#\r\ndef input(): return sys.stdin.readline()\r\ndef mapi(arg=0): return map(int if arg==0 else str,input().split())\r\n#------------------------------------------------------------------\r\n\r\n\r\nn,x = mapi()\r\na = list(mapi())\r\nif sum(a)+n-1==x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,x = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nif x - s == n-1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\n\ndef f(n, x, arr):\n\n if x == (sum(arr) + n - 1):\n print('YES')\n else:\n print('NO')\n\n\n\nif __name__ == '__main__':\n \n n, x = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n\n # for i in range(n):\n # list(map(int, input().split()))\n\n f(n, x, arr)", "n, x = [int(c) for c in input().split()]\n\nencoding = [int(c) for c in input().split()]\n\nsoma = sum(encoding)\n\nif(x - soma == n-1):\n print(\"YES\")\nelse: \n print(\"NO\")\n \t\t \t \t\t\t\t \t \t \t \t \t\t", "if __name__ == '__main__':\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n\n if x == sum(a) + len(a) - 1:\n print('YES')\n else:\n print('NO')\n\n \t\t \t\t\t\t \t \t \t \t", "#!/usr/bin/env python3\n\nn,x = map(int,input().split())\nA = list(map(int,input().split()))\nprint('YES' if sum(A)+len(A)-1==x else 'NO')\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n s = s + a[i] + 1\r\n\r\nif s-1 == x:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import math\r\nimport collections\r\nimport bisect\r\n\r\ndef solve(n, x, a):\r\n if x - sum(a) == n - 1:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nn, x = [int(s) for s in input().split()]\r\na = [int(s) for s in input().split()]\r\nresult = solve(n, x, a)\r\nprint(result)\r\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nres = x - sum(a)\r\nprint('YES' if res == n - 1 else 'NO')", "n,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in a:\r\n ans += i\r\nif(x == ans + (n-1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "r=lambda:map(int,input().split())\r\nn,x=r()\r\nprint(['NO','YES'][sum(r())+n-1==x])", "n, t = map(int,input().split()) \r\nl = list(map(int,input().split()))\r\ns=sum(l)\r\nif (t==n-1+s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n, x = map(int, input().split(' '))\n a = list(map(int, input().split(' ')))\n \n sum = 0\n for i in range(n): sum += a[i]\n print(\"YES\" if sum == x - n + 1 else \"NO\")\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n \t \t \t \t \t\t \t \t \t\t", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n###########################\r\n\r\n// •︿• \\\\\r\n/\\\\ //\\\r\n /\\\\ //\\\r\n /\\\\//\\\r\n\r\n###########################\r\n'''\r\nimport sys\r\nimport math as mth\r\nfrom math import ceil as cl\r\nfrom math import log2 as l2\r\nfrom math import factorial as fct\r\nfrom collections import Counter as CNT\r\nfrom math import log\r\nfrom math import floor as fl\r\nmod = 10**9 + 7\r\ndef ii():\r\n return int(input())\r\ndef fi():\r\n return float(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return input().split()\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n############################################\r\ninput = lambda : sys.stdin.readline().strip()\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\nn,m = lii()\r\narr = lii()\r\nprint(\"YES\" if sum(arr)+n-1 == m else \"NO\")\r\n\r\n \r\n", "n, k = input().strip().split(' ')\r\nn, k = [int(n), int(k)]\r\np = list(map(int, input().strip().split(' ')))\r\nx=len(p) - 1\r\ns=0\r\nfor i in range(n):\r\n s=s+p[i]\r\nif x+s==k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "I = lambda: map(int, input().split())\r\n\r\nn, x = I()\r\n\r\nprint('YES' if sum(I()) == x-n+1 else 'NO')", "n, x = [int(x) for x in input().split()]\ncode = [int(x) for x in input().split()]\n\nif (x - sum(code) == len(code) - 1):\n print('YES')\nelse:\n print('NO')\n \t \t\t\t \t\t \t \t \t\t \t \t\t\t\t\t\t\t", "from math import inf,sqrt,floor,ceil\r\nfrom collections import Counter,defaultdict,deque\r\nfrom heapq import heappush as hpush,heappop as hpop,heapify as h\r\nfrom operator import itemgetter\r\nfrom itertools import product\r\nfrom bisect import bisect_left,bisect_right\r\n\r\nx,n=map(int,input().split( ))\r\ns=sum(list(map(int,input().split( ))))\r\nif s+x-1==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, x = map(int, input().split())\r\nprint('YES' if n - 1 + sum(map(int, input().split())) == x else 'NO')", "a,b=map(int,input().split())\r\nsum=0\r\nl=[int(i) for i in input().split()]\r\nfor i in range(len(l)):\r\n sum+=l[i]\r\nif sum+a-1==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, x = map(int, input().split())\r\nenc = map(int,input().split())\r\nideal = n-1\r\ntem = x - sum(enc)\r\n\r\nif tem == ideal:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n, x = [int(x) for x in input().split()]\n\nnumbers = [int(x) for x in input().split()]\n\nsum = 0\nfor i in range(1, n + 1):\n sum += numbers[i - 1]\n if i != n:\n sum += 1\n\nif sum == x:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n\t \t \t \t\t\t \t\t \t \t \t \t", "n = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nif(n[1] == sum(a)+(n[0]-1)):\n\tprint('YES')\nelse:\n\tprint('NO')", "n, x = [int(z) for z in input().split()]\r\na = [int(z) for z in input().split()]\r\ncnt = 0\r\nfor i in range(n):\r\n cnt += a[i]\r\nif cnt + n - 1 == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "_, x = map(int, input().split(' '))\nencoding = [int(i) for i in input().split(' ')]\n\nsum_of_ones = sum(encoding)\nif sum_of_ones + len(encoding) - 1 == x:\n print('YES')\nelse:\n print('NO')\n\t\t \t\t\t \t \t \t\t \t\t \t", "n, x = map(int, input().split())\r\nnList = list(map(int, input().split()))\r\n\r\nif x-sum(nList) == len(nList) - 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\n x = [int(i) for i in input().split()]\n nel = x[0]\n leng = x[1]\n arr = [int(i) for i in input().split()]\n sum = 0\n for i in range(len(arr)):\n sum += arr[i]\n sum = sum + len(arr) - 1\n if((sum == leng) and (len(arr) == nel)):\n print(\"YES\")\n else:\n print(\"NO\")\n\nmain()\n\t \t \t\t\t \t\t \t\t\t\t \t\t \t\t \t\t\t", "n, x = list(map(int, input().split()))\na = sum(list(map(int, input().split()))) + n -1\nprint('YES' if a == x else 'NO')\n\n\t \t\t \t\t\t\t\t\t \t \t \t \t \t \t\t", "\r\ndef read_int():\r\n return list(map(int, input().split()))\r\n\r\n\r\nlength = read_int()[-1]\r\nencoding = read_int()\r\n\r\nones = sum(encoding)\r\nzero = len(encoding) - 1\r\n\r\nif ones + zero == length:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,x=map(int,input().split())\r\na=[]\r\nfor y in input().split():\r\n a.append(int(y))\r\nl=sum(a)\r\no=n-1\r\nif l+o==x:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n \r\n \r\n", "# dekhe mone hosse total ke vag korlei hwe jabe\n# float nilam tailei to hy\n# 1+3+4 = 8 -------> 4\n# 10k + 10+ 10k --------> 15k \n\n\n#list sum is making a problem ig\n# a b c nei taile\n\n'''\n\n2 4 \n{a, b} (a+b) etogula one without 0s\n\n\nassa bujhlam tar mane\n\ntotal sum + n -1 == x er soman hoy tahole YES ase ar na hole nai\n'''\n\nn, x = map(int, input().split())\n\nl = list(map(int, input().strip().split()))[:n]\ntotal = sum(l)\n\nif (total + n -1 == x):\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", "n, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nif sum(l) + len(l) - 1 > x:\r\n\tprint('No')\r\nelif sum(l) + len(l) - 1 < x:\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes') ", "from collections import *\r\nfor u in range(1):\r\n n,m=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n s=sum(a)\r\n if(m-s==n-1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n,x=map(int,input().split())\r\na=[int(y) for y in input().split()]\r\nif n-1==x-sum(a):\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "n, x = [int(i) for i in input().split()]\r\na = [int(j) for j in input().split()]\r\ns = sum(a)\r\nif s + n - 1 == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# 884b\n\nn, x = map(int, input().split())\na = list(map(int, input().split()))\n\nmin_length = sum(a) + n - 1\n\nif min_length == x:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/8 08:41\r\n\r\n\"\"\"\r\n\r\nn, x = map(int, input().split())\r\nA = [int(x) for x in input().split()]\r\n\r\nif sum(A)+len(A)-1 == x:\r\n print('YES')\r\nelse:\r\n print('NO')", "def main():\r\n\t(n, x) = (int(y) for y in input().split())\r\n\tA = [int(x) for x in input().split()]\r\n\tsolver(n, x, A)\r\n\r\ndef solver(n, x, A):\r\n\tif sum(A) + n - 1 == x:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\nmain()", "n, x = [int(s) for s in input().split()]\r\na = [int(s) for s in input().split()]\r\n\r\nif sum(a) + n-1 == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n#t=int(input())\r\n\r\ndef solve():\r\n n,x=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n\r\n if sum(l)+n-1==x:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n return\r\n \r\n \r\n\r\nsolve()\r\n#print(solve())\r\n#for _ in range(t):\r\n# print(solve())", "s = input().split()\r\nn = int(s[0])\r\nkey = int(s[1])\r\ns = input().split()\r\nsumm = 0\r\nfor i in s :\r\n summ+=int(i)+1\r\nif summ-1==key :print(\"YES\")\r\nelse: print(\"NO\")\r\n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\n#n-1 zeros in between\r\nif k==sum(a)+n-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nif(sum(l)+(n-1)==k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "inp = input()\nn,x = inp.split()\nn = int(n)\nx = int(x)\ninp2 = input()\ninp2 = inp2.split()\ntot = 0\nfor i in range(n):\n inp2[i] = int(inp2[i])\n tot+=inp2[i]\n tot+=1\ntot-=1\nif tot==x:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "x=input().split()\r\ny=input().split()\r\n\r\na=int(x[0])\r\nb=int(x[1])\r\nc=0\r\nfor i in y:\r\n i=int(i)\r\n c=c+i\r\nif (b-c)==(a-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "line1 = input().split()\nn = int(line1[0])\nx = int(line1[1])\nline2 = input().split()\nlength = n-1\nfor i in range(n):\n length += int(line2[i])\n\nif x != length:\n print('NO')\nelse:\n print('YES')\n", "def main():\n n, x = map(int, input().split())\n a = list(map(int, input().split()))\n s = sum(a)\n print('YES' if s + (n - 1) == x else 'NO')\n\nmain()\n", "n,x=map(int,input().split())\r\nT=list(map(int,input().split()))\r\ns=0\r\nfor i in T:\r\n s=s+i\r\ns1=x-n+1\r\nif s==s1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,x = map(int,input().split())\na = list(map(int,input().split()))\nsum = n-1\nfor i in range(len(a)):\n sum += a[i]\nif sum == x:\n print('YES')\nelse:\n print('NO')\n\n", "n, x = input().split()\nmessage = list(map(int, input().split()))\nres = int(n) + sum(message) - 1\nif res == int(x):\n print('YES')\nelse:\n print('NO')\n\n \t\t\t \t\t\t\t \t\t\t\t \t \t\t\t", "func = lambda x: int(x)\r\n\r\nl1 = list(map(func, input().split()))\r\nl2 = list(map(func, input().split()))\r\n\r\nn = l1[0]\r\nx = l1[1]\r\n\r\ns = sum(l2)\r\n\r\nif x - s != n - 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n,t=list(map(int,input().split()))\r\nco=0\r\nnn=list(map(int,input().split()))\r\nfor i in range(0,n):\r\n co+=nn[i]\r\nif(co+n-1==t):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "[n, x] = map(int, input().split(' '))\narr = list(map(int, input().split(' ')))\n\nif (sum(arr) + n-1) == x:\n print('YES')\nelse:\n print('NO')\n\t\t \t \t\t\t \t \t \t\t\t \t", "if __name__ == \"__main__\":\r\n (n, x) = map(int, input().split())\r\n encoding = list(map(int, input().split()))\r\n zeros = n - 1\r\n ones = sum(encoding)\r\n if zeros + ones == x:\r\n print('YES')\r\n else:\r\n print('NO')", "def japanese_crossword_again():\n n, x = input().split()\n x = int(x)\n encoding = list(map(int, input().split()))\n\n print('YES') if (sum(encoding)+len(encoding)-1==x) else print('NO')\n\njapanese_crossword_again()\n\n\n\t\t\t \t \t \t \t\t\t \t\t \t\t\t\t\t \t\t\t\t", "from functools import reduce\r\n\r\n(n, x) = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nlength = reduce(lambda x, y: x + y, a)\r\n\r\nif ((x - length) - (len(a) - 1)) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, x = input().split()\nn, x = int(n), int(x)\na = input().split()\na = list(map(int, a))\n\ns = sum(a)\n\nif(s + (n - 1) == x):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t \t\t \t\t \t \t\t\t\t\t", "n = list(map(int,input().split()))\r\nm = list(map(int,input().split()))\r\n\r\nsum_m = sum(m)\r\nif n[1] == (sum_m + n[0]-1):\r\n print('YES')\r\nelse:\r\n print('NO')", "# your code goes here\r\nsegment, length = map(int, input().split(' '))\r\nsegments = [int(x) for x in input().strip().split(' ')]\r\ntotal = sum(segments)\r\nif total + segment - 1 == length:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint (\"NO\")", "n, x = input().split(' ')\nn, x = int(n), int(x)\nstring = input().split(' ')\nscore = len(string)-1\n\nfor char in string:\n score += int(char)\n\n\nif(score == x):\n print('YES')\nelse:\n print('NO')\n\t \t \t \t\t \t \t \t \t \t\t \t\t\t \t\t", "#!/usr/bin/python\r\nt=input()\r\nk=input()\r\nA=[]\r\nB=[]\r\nfor x in t.split(): \r\n A.append(int(x))\r\nfor x in k.split(): \r\n B.append(int(x))\r\nif (sum(B)+A[0]-1)==A[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "n, x = map(int, input().split())\r\ncode = list(map(int, input().split()))\r\nzeroes = n - 1\r\nif x - sum(code) - zeroes == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nn,m = list(map(int,s.split(\" \")))\r\nt = input()\r\nx = t.split(\" \")\r\nx = list(map(int, x))\r\nif(sum(x) + len(x) - 1 == m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, x = map(int, input().split())\r\nsm = sum(map(int, input().split()))\r\nprint(\"YES\" if sm + n - 1 == x else \"NO\")\r\n", "n, x = map(int, input().split())\r\nA = list(map(int, input().split()))\r\ntot = sum(A)\r\nprint('YES' if tot + n - 1 == x else 'NO')", "n,t = map(int,input().split()) \r\ndata = list(map(int,input().split()))\r\ns=sum(data)\r\nprint('YES' if t==n-1+s else 'NO')\r\n", "from sys import stdin, stdout\r\nn, x = map(int, stdin.readline().split())\r\na = list(map(int, stdin.readline().split()))\r\nif sum(a) + n - 1 == x: stdout.write(\"YES\")\r\nelse: stdout.write(\"NO\")", "n, x = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nprint('YES') if sum(l) + len(l) - 1 == x else print('NO')", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in a[:-1]:\r\n cnt += i + 1\r\n\r\ncnt += a[-1]\r\n\r\nif cnt == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=[int(q) for q in input().strip().split()]\r\nb=[int(q) for q in input().strip().split()]\r\nif a[1]-sum(b)==a[0]-1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, x = list(map(int ,input().split()))\nencoding = list(map(int ,input().split()))\n\n\n\nif x - sum(encoding) == len(encoding) - 1:\n print(\"YES\")\n\nelse:\n print(\"NO\")\n", "n,x=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif x==(sum(l)+(n-1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nif sum(arr)+len(arr)-1 == x:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "R=lambda:list(map(int,input().split()))\r\nn, x = R()\r\nprint('YES' if sum(R())+n-1 == x else 'NO')", "import sys\r\nn, m = map(int, sys.stdin.readline().split())\r\narr = list(map(int, sys.stdin.readline().split()))\r\nval = sum(arr)\r\ntemp = m - val\r\nif temp == n - 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "N, X = [int(x) for x in input().split()]\nA = [int(x) for x in input().split()]\n\nCount = N-1\nfor I in A :\n Count += I\n\nif (Count == X) :\n print('YES')\nelse :\n print('NO')\n", "n, x = list( map( int, input().split( \" \" ) ) )\nprint( \"YES\" if ( x - n + 1 - sum( list( map( int , input().split( \" \" ) ) ) ) ) == 0 else \"NO\" )\n", "if __name__==\"__main__\":\r\n i=lambda :map(int,input().split())\r\n n,x=i()\r\n a=list(i())\r\n print([\"NO\",\"YES\"][x==(sum(a)+n-1)])", "n, x = map(int, input().split())\na = list(map(int, input().split()))\n\n#elements (begining and ending) + separators\n\nif sum(a) + n -1 == x:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t\t\t \t \t\t \t \t\t \t\t", "def main():\n n, expected = map(int, input().split())\n s = input().split(\" \")\n soma = 0\n for i in s:\n soma += int(i)\n\n if soma + n == expected + 1:\n print('YES')\n else:\n print('NO')\n\n\nif __name__ == '__main__':\n main()\n\n\t\t \t\t \t\t\t \t\t\t \t \t \t \t\t\t\t\t\t\t\t", "\n\nn, x = map(int, input().split())\n\nA = [int(x) for x in input().split()]\n\nif sum(A) + n - 1 == x:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n,x=map(int,input().split())\r\nflag=False\r\nl=list(map(int,input().split()))\r\nif(x-n+1==sum(l)):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "n, x = map(int, input().split())\r\nline = list(map(int, input().split()))\r\nif x == sum(line) + n - 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=map(int,input().split())\n\nl=[int(i) for i in input().split()]\n\nsm=sum(l)\nif sm+n-1==k:\n\tprint('Yes')\nelse:\n\tprint('No')\n", "if __name__ == \"__main__\":\n # Ler entrada\n n, x = [int(i) for i in input().split()]\n encoding = [int(i) for i in input().split()]\n # Critério para existir apenas uma possibilidade:\n # A soma dos grupos mais o número de elementos menos um deve ser igual ao tamanho do puzzle\n # OBS.: (n-1) simboliza o número de espaços entre cada grupo\n print(\"YES\" if (n-1)+sum(encoding) == x else \"NO\")\n\t\t\t \t\t\t\t \t\t\t\t\t\t \t\t \t\t \t \t\t", "n, x = [int(k) for k in input().split()]\nencoding = [int(k) for k in input().split()]\n\nif x == sum(encoding) + len(encoding) - 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t\t \t \t\t \t\t \t \t \t \t \t\t", "n, x = map(int, input().split())\n\ns = 0\n\nfor c in input().split():\n\ts += int(c)\n\nprint('YES' if x-s-(n-1)==0 else 'NO')", "X = list(map(int, input().split()))\r\nSeg = list(map(int, input().split()))\r\nprint(\"YES\" if sum(Seg) + X[0] - 1 == X[1] else \"NO\")\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: So Close man!! Take it easy!!!!\r\n# CodeNumber: 638\r\n", "\t\t###~~~LOTA~~~###\r\na,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif sum(l)+(a-1)==b:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "R=lambda:list(map(int,input().split()))\r\nn,x=R()\r\nprint('YES'if sum(R())+n-1==x else'NO')\r\n", "(n, length) = map(int, input().split())\r\n\r\nlst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\nk = sum(lst) + len(lst) - 1\r\nif k == length:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l = [int(x) for x in input().split()]\r\n\r\nn = l[0]\r\nx = l[1]\r\n\r\nl = [int(x) for x in input().split()]\r\n\r\ncount = 0\r\nfor e in l:\r\n count += e+1\r\n\r\nif count == x+1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,x = map(int,input().split());L = [\"NO\",\"YES\"]\r\nprint(L[sum(list(map(int,input().split()))) + n - 1 == x])\r\n", "n, tam = ((map(int, input().split())))\n\nenc = list((map(int, input().split())))\n\ndivs = n-1\n\nif sum(enc) + divs == tam:\n print('YES')\nelse:\n print('NO')\n\n\n \t\t \t\t\t\t \t\t \t \t \t\t \t", "# http://codeforces.com/contest/884/problem/B\r\nn, x = [int(x) for x in input().split()]\r\nq = sum([int(x) for x in input().split()])\r\nprint(\"YES\" if q+(n-1) == x else \"NO\")", "# import sys, codecs\r\n#\r\n# save_stdin = sys.stdin\r\n# save_stdout = sys.stdout\r\n# sys.stdin = codecs.open(\"input.txt\", \"r\", \"utf-8\")\r\n# sys.stdout = codecs.open(\"output.txt\", \"w+\")\r\n\r\nn, x = list(map(int, input().split()))\r\nif n != 0:\r\n lens = list(map(int, input().split()))\r\n must_len = n - 1 + sum(lens)\r\n\r\n if must_len == x:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"YES\")\r\n", "n, x = [int(x) for x in input().split(\" \")]\nencoding = [int(x) for x in input().split(\" \")]\nsoma = 0\n\nfor i in range(len(encoding)):\n soma = soma + encoding[i]\n\nif (soma+(n-1) == x):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t\t\t\t\t \t \t \t\t\t\t\t \t \t\t", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, length = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n new_length = sum(a) + len(a) - 1\r\n if length != new_length:\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\nmain_function()\r\n", "def main():\n\tn, x = map(int, input().split())\n\tns = list(map(int, input().split()))\n\t\n\tif (n-1) + sum(ns) == x:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n\nif __name__ == \"__main__\":\n\tmain()\t\t\t\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nprint('YES') if x == sum(a) + n - 1 else print('NO')\r\n", "n, x = map(int, input().split())\nsum_a = sum(map(int, input().split()))\nif x - sum_a == n - 1:\n print('YES')\nelse:\n print('NO')\n", "size, length = map(int, input().split())\r\narray = map(int, input().split())\r\ntotal = sum(array)\r\nif size - 1 + total == length:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,t=map(int, input().split())\r\nl=list(map(int,input().split()))\r\ntotal=0\r\nfor i in range(n):\r\n total+=(l[i])\r\n # if i<n:\r\n # total+=1\r\nif total+n-1==t:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsu=sum(a)\r\nif x==su and len(a)==1:\r\n print('YES')\r\nelif su==0:\r\n print('YES')\r\nelif x-su==n-1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n, x = map(int, input().split())\nif(sum(map(int, input().split())) + n - 1 == x):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ng = sum(l)\r\nif g+(n-1)==m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, x = [int(y) for y in input().split()]\nnumbers = [int(y) for y in input().split()]\nif sum(numbers) + len(numbers) - 1 == x:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n,x = map(int,input().split())\na = sum(list(map(int,input().split())))\nprint('YES') if a+n-1 == x else print('NO')\n\n \t \t \t\t \t \t\t\t\t \t \t\t \t \t\t", "a = [int(l) for l in input().split()]\r\ny = [int(i) for i in input().split()]\r\n\r\nx = 0\r\nfor o in range(0,len(y)):\r\n x = x + y[o]\r\n \r\nif x + a[0] - 1 == a[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nx=n[1]\r\n\r\nif x==sum(a)+(len(a)-1): \r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "r = lambda: map(int, input().split())\r\nn, x = r()\r\nprint(\"YES\" if sum(r()) + n - 1 == x else \"NO\")", "n, k = map(int,input().split())\r\na = sum(list(map(int,input().split())))\r\nif n == k-a+1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, x = map(int, input().split())\nA = list(map(int, input().split()))\nif x-sum(A) == n-1:\n print('YES')\nelse:\n print('NO')\n", "s = input()\r\nn, x = list(map(int, s.split()))\r\nss = input()\r\nk = list(map(int, ss.split()))\r\ncountz = x-sum(k)\r\nif countz == n-1:\r\n print('YES')\r\nelse:\r\n print('NO')", "R=lambda:map(int,input().split())\r\nn,x=R()\r\nprint(['NO','YES'][sum(R())+n-1==x])\r\n", "# problem name : Japanese Crosswords Strike Back\r\n# problem link : https://codeforces.com/problemset/problem/884/B\r\n# Rating : 1100\r\n\r\nn,x=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif sum(a)+n-1==x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n s += a[i]\r\nif (x - s ) == (len(a) - 1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "# 1100\r\nn, x = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\nz = n-1\r\nzz = x - sum(arr)\r\nif zz == z:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, x = map(int, input().split())\r\nif x == sum(map(int, input().split()))+n-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x,n=map(int, input().split())\r\nencoding=list(map(int, input().split()))\r\nif((sum(encoding)+(x-1))==n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, x = map(int, input().split())\na = map(int, input().split())\n\ntotal_of_ones = sum(a)\n\nif total_of_ones + n - 1 == x:\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", "n, x = list(map(int, input().split()))\r\nnumbers = list(map(int, input().split()))\r\n\r\nl = 0\r\n\r\nfor i in range(n):\r\n l += numbers[i] + 1\r\n\r\nif l - 1 == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "(n, x) = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\ns = sum(l)\r\ns += (n-1)\r\n\r\nif(s == x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n" ]

[ "import sys\r\nclass HappyNumbers:\r\n def solve(self):\r\n a, l = map(int, input().split())\r\n print(self.doit(a, l))\r\n def doit(self, a, l):\r\n if l >= 10:\r\n first = a\r\n last = a + l - 1\r\n return self.doit(first // 10, last // 10 - first // 10 + 1) * 10 + first % 10\r\n else:\r\n cnts = [self.count_lucky(a + i) for i in range(l)]\r\n return self.doit_from(cnts, a + 1)\r\n def doit_from(self, cnts, min_val):\r\n if len(cnts) == 1:\r\n return self.doit_one(cnts[0], min_val)\r\n elif len(cnts) == 2 and min_val <= 1:\r\n return self.doit_two_simple(cnts[0], cnts[1], min_val)\r\n res = sys.maxsize\r\n for last_digit in range(10):\r\n max_val = last_digit + len(cnts) - 1\r\n ncnts = [-1] * ((max_val // 10) + 1)\r\n ok = True\r\n for i in range(len(cnts)):\r\n cur = last_digit + i\r\n need = cnts[i]\r\n if cur % 10 == 4 or cur % 10 == 7:\r\n need -= 1\r\n if need < 0:\r\n ok = False\r\n break\r\n if ncnts[cur // 10] < 0 or ncnts[cur // 10] == need:\r\n ncnts[cur // 10] = need\r\n else:\r\n ok = False\r\n break\r\n if not ok:\r\n continue\r\n new_min = min_val // 10 - 3\r\n while new_min * 10 + last_digit < min_val:\r\n new_min += 1\r\n tmp = self.doit_from(ncnts, new_min) * 10 + last_digit\r\n res = min(res, tmp)\r\n return res\r\n def doit_two_simple(self, cnt_first, cnt_second, min_val):\r\n if cnt_first == 0 and cnt_second == 0:\r\n return min_val\r\n if cnt_first == cnt_second:\r\n res = 0\r\n for _ in range(cnt_first):\r\n res = res * 10 + 4\r\n return res * 10\r\n elif cnt_first == cnt_second + 1:\r\n res = 0\r\n for _ in range(cnt_first):\r\n res = res * 10 + 4\r\n return res\r\n elif cnt_first + 1 == cnt_second:\r\n res = 0\r\n for _ in range(cnt_second):\r\n res = res * 10 + 4\r\n return res - 1\r\n else:\r\n return sys.maxsize\r\n def doit_one(self, cnt, min_val):\r\n p10 = 1\r\n pow_val = 0\r\n while p10 <= min_val:\r\n p10 *= 10\r\n pow_val += 1\r\n p10 *= 100\r\n pow_val += 2\r\n while pow_val < cnt + 2:\r\n p10 *= 10\r\n pow_val += 1\r\n res = 0\r\n while True:\r\n for cur_digit in range(10):\r\n cur_cnt = 0\r\n if cur_digit == 4 or cur_digit == 7:\r\n cur_cnt = 1\r\n if self.possible(res, p10, pow_val, cnt - cur_cnt, min_val):\r\n cnt -= cur_cnt\r\n break\r\n res += p10\r\n if cur_digit == 9:\r\n raise RuntimeError()\r\n if p10 == 1:\r\n break\r\n p10 //= 10\r\n pow_val -= 1\r\n return res\r\n def possible(self, res, p10, pow_val, need_lucky, min_val):\r\n if need_lucky > pow_val or need_lucky < 0:\r\n return False\r\n cur = 0\r\n for _ in range(pow_val - need_lucky):\r\n cur = cur * 10 + 9\r\n for _ in range(need_lucky):\r\n cur = cur * 10 + 7\r\n return res + cur >= min_val\r\n def count_lucky(self, x):\r\n res = 0\r\n while x > 0:\r\n digit = x % 10\r\n x //= 10\r\n if digit == 4 or digit == 7:\r\n res += 1\r\n return res\r\n def main(self):\r\n self.reader = sys.stdin\r\n self.writer = sys.stdout\r\n self.solve()\r\n self.reader.close()\r\n self.writer.close()\r\n def next_int(self):\r\n return int(self.next_token())\r\n def next_long(self):\r\n return int(self.next_token())\r\n def next_double(self):\r\n return float(self.next_token())\r\n def next_token(self):\r\n while not self.tokenizer or not self.tokenizer.hasMoreTokens():\r\n self.tokenizer = input().split()\r\n return self.tokenizer.pop(0)\r\nif __name__ == \"__main__\":\r\n happy_numbers = HappyNumbers()\r\n happy_numbers.main()# 1693083120.1205668" ]

[ "def fmod(x, m):\r\n while x >= m:\r\n x = x - m\r\n return x\r\n\r\nl, d, v, g, r = map(int, input().split(' '))\r\n\r\nx = fmod(float(d / v), g + r)\r\n\r\nans = (d / v) + (l - d) / v\r\n\r\nif x >= g:\r\n ans = ans + g + r - x \r\n\r\nprint(\"%.10f\" % (ans))\r\n\r\n", "[l,d,v,g,r] = map(int,input(\"\").split(\" \"))\nt1 = d/v\ndur = t1%(g+r)\nt2 = 0\nif(dur>=g): t2 += r-(dur-g)\nt3 = (l-d)/v\nans = t1+t2+t3\nprint(ans)\n", "l,d,v,g,r = map(int,input().split())\r\nd1 = d\r\nd2 = (l-d)\r\nt1 = d1/v\r\n \r\na = int(t1/(g+r))\r\nif (t1- a*(g+r))<g:\r\n ans = l/v\r\nelse:\r\n ans=l/v+ (r+g) - (t1- a*(g+r))\r\nprint(\"{:.8f}\".format(ans)) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nl, d, v, g, r = map(int, input().split())\r\nif not d % v:\r\n t = d // v\r\nelse:\r\n t = d / v\r\nc = t // (g + r) * (g + r)\r\nif c <= t < c + g:\r\n ans = l / v\r\nelse:\r\n ans = c + (g + r) + (l - d) / v\r\nprint(ans)", "# LUOGU_RID: 101447273\nl, d, v, g, r = map(int, input().split())\r\nt = d / v\r\nwhile t > g + r:\r\n t -= g + r\r\nprint(l / v if t < g else l / v + (g + r - t))", "def main():\r\n l, d, v, g, r = map(int, input().split())\r\n\r\n m = l / v\r\n t_light = d / v\r\n if t_light % (g + r) >= g:\r\n m += g + r - t_light % (g + r)\r\n\r\n print(m)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l, d, v, g, r = map(int,input().split())\nt = 0.0\nif (d/v)%(g+r) < g:\n t = l/v\nelse:\n t = ((d / v)// (g + r)+1)*(g+r) + (l-d)/v\nprint(\"%.8f\"%t)\n\t\t\t \t \t \t \t\t \t \t \t \t", "import sys\n\ntarget_loc, light_loc,speed,green_duration,red_duration = \\\n map(int,sys.stdin.readline().split())\n\ntotal_time = 0\nreach_light = light_loc / speed\nperiod = green_duration+red_duration\nperiod_passed_time = reach_light % period\nif period_passed_time >= green_duration:\n total_time += (period - period_passed_time)\n\ntotal_time += target_loc / speed\nprint(total_time)\n", "l,d,v,g,r = map(int,input().split())\r\nm = (d/v % (g+r))\r\nprint(l/v + (m >= g)*(r + g - m) )", "l,d,v,g,r=map(int,input().split())\r\nans = l/v\r\ns = (d/v)%(g+r)\r\nif s >= g:\r\n ans+= g+r-s\r\nprint(ans)\r\n", "str1 = input().split()\r\nl = (int)(str1[0])\r\nd = (int)(str1[1])\r\nv = (int)(str1[2])\r\ng = (int)(str1[3])\r\nr = (int)(str1[4])\r\nt = 0.0\r\nt += d / v\r\ntt = l / v\r\ndelay = 0.0\r\nflag = True\r\nn = 1\r\nwhile flag:\r\n min = n * g + (n-1) * r\r\n max = n * g + n * r\r\n if t > max:\r\n n += 1\r\n continue\r\n if t >= min and t <= max:\r\n delay = max - t\r\n break\r\n else:\r\n break\r\nprint (tt + delay)", "l,d,v,g,r = map(int,input().split())\nd1 = d\nd2 = (l-d)\nt1 = d1/v\n\na = int(t1/(g+r))\nif (t1- a*(g+r))<g:\n ans = l/v\nelse:\n ans=l/v+ (r+g) - (t1- a*(g+r))\nprint(\"{:.8f}\".format(ans)) ", "l,d,v,g,r= map(int,input().split())\r\nif ((d/v)%(g+r))<g :\r\n print(l/v)\r\nelse:\r\n t1=d/v\r\n t2=r+g-((d/v)%(g+r))\r\n t3=(l-d)/v\r\n print(t1+t2+t3)", "l, d, v, g, r = map(int, input().split())\n\nseconds_to_traffic_light = (d / v)\nseconds_to_final_point = (l - d) / v\n\ndef get_waiting_time(t, g, r):\n while t > (g + r):\n t -= (g + r)\n\n if t < g:\n return 0\n\n return (g + r - t)\n# endfold\n\nwaiting_time = get_waiting_time(seconds_to_traffic_light, g, r)\nanswer = seconds_to_traffic_light + waiting_time + seconds_to_final_point\n\nprint(\"%.9f\" % answer)\n", "l,d,v,g,r = map(int, input().split())\r\nx = (d/v)%(g+r)\r\nif x<g:print(l/v)\r\nelse:print(d/v+abs(x-(g+r))+((l-d)/v))", "l,d,v,g,r=map(int,input().split())\r\nt=d/v\r\nk=t//(g+r)\r\nif t>=k*(g+r)+g:\r\n t=(k+1)*(g+r)\r\nt+=(l-d)/v\r\nprint(t)", "l, d, v, g, r=map(int,input().split())\nans = l / v\nt = (d / v) % (r + g)\nif t >= g:\n ans += r + g - t\nprint(ans)# 1698072686.8582635", "while True:\n try:\n l,d,v,g,r=map(int,input().split())\n t = d // v // (g + r)\n a = d / v - t * (g + r)\n eps = 0.00000001\n if (abs(a - g) < eps):\n ans = l / v + r\n elif (a < g):\n ans = l / v\n else:\n ans = g + r - a + l / v\n print('%.8f' % ans)\n except EOFError:\n break", "l,d,v,g,r = map(int,input().split())\nT = l/v \nt = d/v \nw = t-(g+r)*(t//(g+r)) \nlight = 1 if w >= g else 0 \nprint(T + light*(g+r - w))", "l,d,v,g,r=map(int,input().split())\r\n\r\nxx=d/v\r\n\r\nwhile xx-(g+r)>0:\r\n xx-=(g+r)\r\n\r\nif xx<g:\r\n print(l/v)\r\nelse:\r\n print(l/v+g+r-xx)\r\n\r\n", "a, d, v, g, r = map(int, input().split())\r\nif d>=a:\r\n print(a/v,'0')\r\nelse:\r\n n = d//((g+r)*v)\r\n if d-n*(g+r)*v<g*v:\r\n print(round(a/v,7))\r\n else:\r\n print(round((a-d+n*(r+g)*v)/v+r+g,7))", "while True:\r\n\ttry:\r\n\t\tl, d, v, g, r = map(int, input().split())\r\n\t\tacc = (d/ v) % (g+r)# displacmnt tim accrdng to trafic tim\r\n\t\tans = l/ v # avg tim to complt distnc\r\n\t\tif acc >= g: # if displcmnt > green tim\r\n\t\t ans += g+r - acc\r\n\t\tprint(ans)\r\n\t\t \r\n\texcept EOFError:\r\n\t\tbreak\r\n\r\n\r\n\r\n", "l,d,v,g,r=map(int,input().split())\r\nx=((d/v)/(g+r)-int((d/v)/(g+r)))*(g+r)\r\nif x<g:\r\n print(l/v)\r\nelif x>=g and x<g+r:\r\n print(l/v+r-x+g)\r\n", "dist, traffic, speed, green, red = map(int, input().split())\r\ncurr = traffic / speed\r\n\r\nper = curr % (green + red)\r\nstop = False\r\nif per - green >= 0:\r\n stop = True\r\nif stop == False:\r\n curr += (dist - traffic) / speed\r\nelse:\r\n curr += (dist - traffic) / speed + red - (per - green)\r\nprint(\"{:.8f}\".format(curr))\r\n", "l, d, v, g, r = map(int, input().split())\r\nans = d / v\r\nt, ct = 0, 0\r\nwhile t <= ans:\r\n if ct % 2:\r\n t += r\r\n else:\r\n t += g\r\n ct += 1\r\nif ct % 2 == 0:\r\n ans += t - ans\r\nans += (l - d) / v\r\nprint(\"{:.8f}\".format(ans))\r\n", "from math import floor\r\n\r\ndef gt(t,g,r):\r\n\tzt=floor(t)\r\n\trt=t-zt\r\n\tzt%=(g+r)\r\n\tt=zt+rt\r\n\tif t<g:\r\n\t\treturn 0\r\n\telse:\r\n\t\treturn r+g-t\r\n\r\nl,d,v,g,r=[int(x) for x in input().split(' ')]\r\nt=d/v\r\nt+=gt(t,g,r)\r\nt+=(l-d)/v\r\nprint(t)", "def solve():\r\n l, d, v, g, r = [int(x) for x in input().split(' ')]\r\n #Get to Traffic Lights\r\n t = d / v\r\n #Stop at lights if necessary\r\n x = t % (g + r)\r\n if x >= g:\r\n t += (g + r) - x\r\n #Continue to complete journey\r\n t += (l - d) / v\r\n #Return total time\r\n return t\r\n\r\nprint(solve())\r\n", "import sys\n\ndef solve():\n l, d, v, g, r, = rv()\n timetotraffic = d / v\n loops = timetotraffic // (g + r)\n extratime = timetotraffic - (g + r) * loops\n if extratime >= g: timetotraffic = (g + r) * (loops + 1)\n moretime = (l - d) / v\n print(timetotraffic + moretime)\n\n\n\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()", "\nfrom collections import defaultdict\nimport math\n\nl, d, v, g, r = map(int, input().split())\ntime = 0\nif v > d:\n print(l / v)\nelse:\n time = d / v\n value = (time % (g + r))\n if value >= g:\n remaining_time = (r + g) - value\n time += remaining_time \n\n time += (l - d) / v\n\n print(time)", "l,d,v,g,r=map(int,input().split())\r\nans=0\r\ni=1\r\nif v*g>d:\r\n ans=l/v\r\nelif v*g==d:\r\n ans=l/v+r\r\nelif v*g<d:\r\n t=d/v\r\n while t>=(g+r):\r\n t=t-(g+r)\r\n i+=1\r\n if t<g:\r\n ans=l/v\r\n elif t>=g and t<g+r:\r\n ans=i*(g+r)+(l-d)/v\r\nprint(ans)", "def traffic_time():\r\n\tl, d, v, g, r = map(int, input().split())\r\n\r\n\tanswer = (l + 0.0) / v;\r\n\r\n\tfor counter in range(1, 1001):\r\n\t\ttime1 = counter * g + (counter - 1) * r;\r\n\t\tdist1 = time1 * v;\r\n\t\ttime2 = counter * g + counter * r;\r\n\t\tdist2 = time2 * v;\r\n\t\tif dist1 <= d and dist2 > d:\r\n\t\t\tanswer = time2 + (l - d + 0.0) / v;\r\n\t\t\tbreak;\r\n\r\n\tprint(answer)\r\n\r\n\r\ntraffic_time()\r\n", "l,d,v,g,r=input().split(\" \")\r\nl=int(l)\r\nd=int(d)\r\nv=int(v)\r\ng=int(g)\r\nr=int(r)\r\nif d/v < g :\r\n print(l/v)\r\nelse :\r\n check=1 #red\r\n i=g\r\n while 1 :\r\n if check == 1 :\r\n i=i+r\r\n check=2\r\n elif check == 2 :\r\n i=i+g\r\n check=1\r\n \r\n if i > d/v :\r\n break\r\n # print(i,check)\r\n if check == 2 :\r\n print(i+((l-d)/v))\r\n elif check == 1 :\r\n print(l/v)\r\n \r\n\r\n\r\n\r\n", "l,d,v,g,r = map(int, input().split())\r\nt = l/v\r\nt1 = d/v\r\ni = g\r\nwhile i <= t1:\r\n\ti += r\r\n\tif i > t1:\r\n\t\tt += i-t1\r\n\ti +=g\r\nprint(t)", "#!/usr/bin/env python3\n\n\ndef read_case() :\n\tdist_tot, dist_light, speed, green, red = map(int, input().split())\n\treturn dist_tot, dist_light, speed, green, red\n\ndef is_stopped(green, red, dist_light, speed) :\n\tis_stopped = False\n\tdist_done = 0 \n\tcolor = \"green\"\n\n\n\twhile dist_done < dist_light :\n\t\tif color == \"green\" :\n\t\t\tdist_done = dist_done + green*speed\n\t\t\t#time = time + green\n\t\t\tcolor = \"red\"\n\t\telse : \n\t\t\tdist_done = dist_done + red*speed\n\t\t\t#time = time + red\n\t\t\tcolor = \"green\"\n\n\tif dist_done > dist_light :\n\t\tif color == \"green\" :\n\t\t\tttw = (dist_done-dist_light)/speed\n\t\telse : ttw = 0\n\telse :\n\t\tif color == \"green\" : \n\t\t\tttw=0\n\t\telse : ttw=red \n\treturn ttw\n\n\n\n\ndef main():\n\tdist_tot, dist_light, speed, green, red = read_case()\n\n\ttotal_time = dist_tot/speed\n\tttw = is_stopped( green, red, dist_light, speed)\n\ttotal_time = total_time + ttw\n\tprint(total_time)\n\n\n\nif __name__ == '__main__':\n\tmain()", "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\nl, d, v, g, r = map(int, input().split())\r\neps = 1e-9\r\n\r\nt1 = d / v\r\nif (t1 + eps) % (g + r) > g:\r\n t1 = ((t1 + eps) // (g + r) + 1) * (g + r)\r\n\r\nt2 = (l - d) / v\r\n\r\nprint(t1 + t2)\r\n", "import math\r\nl,d,v,g,r=[int(c) for c in input().split()]\r\nts=d/v\r\nte=(l-d)/v\r\npos=ts%(g+r)\r\nif pos==0:\r\n print(te+ts)\r\nelse:\r\n if ts>=(math.floor(ts/(g+r)))*(g+r)+g:\r\n print((math.ceil(ts/(g+r)))*(g+r)+te)\r\n else:\r\n print(te+ts)", "l,d,v,g,r=map(int,input().split())\ns=(d/v)%(g+r)\nans=l/v\nif s>=g:\n\tans+=g+r-s\nprint(ans)\n\n \t \t\t \t\t \t \t \t\t\t\t\t \t\t \t", "l, d, v, g, r = map(int, input().split())\r\nt = d/v\r\nft = t%(g+r)\r\nif ft >= g:\r\n t += r-(ft-g) \r\nt += (l-d)/v\r\nprint(t)", "l, d, v, g, r = map(int, input().split())\r\n\r\nR = d/(v*(g+r))\r\nL = (d-g*v)/(v*(g+r))\r\nif int(R) > L:\r\n print(l/v)\r\nelse:\r\n k = int(R)\r\n ans = (g+r)*k+g+r+(l-d)/v\r\n print(ans)\r\n", "l, d, v, g, r = map(int, input().split())\n\nt = d / v\nc = 0\n\nwhile t > g + r:\n t -= (g + r)\n c += 1\n\nif t < g:\n print(l / v)\n\nelif t <= (g + r):\n c += 1\n print(c * (g + r) + (l - d) / v)\n\n", "I = input().split()\r\nl = int(I[0])\r\nd = int(I[1])\r\nv = int(I[2])\r\ng = int(I[3])\r\nr = int(I[4])\r\n\r\n# Travelling from point A to traffic light:\r\nt1 = d/v\r\n\r\nconstant = t1 % (g+r)\r\nif constant >= g:\r\n move = False\r\nelse:\r\n move = True\r\n\r\n\r\n# Waiting in traffic:\r\nif move:\r\n t_wait = 0\r\nelse:\r\n t_wait = g + r - (t1 % (g + r))\r\n\r\n\r\n# Travelling from traffic light to point B:\r\nt2 = (l-d)/v\r\n\r\n# Total time taken:\r\nTIME = t1 + t_wait + t2\r\nprint(TIME)", "l,d,v,g,r = map(int,input().split())\r\nans = d/v\r\nt, ct = 0, 0\r\nwhile ( t <= ans ) :\r\n if ct&1 :\r\n t += r\r\n else :\r\n t += g\r\n ct += 1\r\nif (ct&1) == 0 :\r\n ans += t - ans\r\nans += (l - d)/v\r\nprint(\"{0:.8f}\".format(ans))", "l,d,v,g,r = list(map(int, input().split(\" \")))\nt = l/v\nt1 = d/v\nx = g\nwhile x <= t1:\n\tx += r\n\tif x > t1:\n\t\tt += x-t1\n\tx +=g\nprint(t)\n\n", "l,d,v,g,r = map(int,input().split())\r\nt = d/v\r\nans = l/v\r\nif((t%(g+r))>=g):\r\n ans+=r+g-t%(g+r)\r\nprint(ans)", "# n=int(input())\r\nl,d,v,g,r=map(int,input().split())\r\nz=d/v\r\ny=(l-d)/v\r\ntemp=z\r\nlight=True\r\nx=0\r\n# print(z,y)\r\nwhile(1):\r\n if(x%2==0):\r\n if(temp>=g):\r\n temp-=g\r\n light=False\r\n else:\r\n break\r\n else:\r\n if(temp>=r):\r\n temp-=r\r\n light=True\r\n else:\r\n break\r\n x+=1 \r\nif(light):\r\n print(\"{0:.8f}\".format(z+y))\r\nelse:\r\n print(\"{0:.8f}\".format(z+(r-temp)+y))\r\n ", "import math\r\nl,d,v,g,r=map(int,input().split())\r\nans=d/v\r\nif(ans%(g+r)>=g):\r\n ans=math.ceil(ans/(g+r))*(g+r)\r\nans+=(l-d)/v\r\nprint(ans)", "l,d,v,g,r = [int(c) for c in input().split()]\r\nlight = d/v\r\nwhile (light >= g+r): light -= (g+r)\r\nret = 0.00\r\nif (light < g): ret = l/v\r\nelse:\r\n\twait = g + r - light\r\n\tret = d/v + wait + (l-d)/v\r\nprint(ret)\r\n", "dist, toLight, maxSpeed, green, red = map(int, input().split())\n\nf = toLight // maxSpeed\n\nt = 0\nfor i in range(1010):\n if i % 2 == 0:\n if t <= f < t + green:\n print(toLight * 1.0 / maxSpeed + (dist - toLight) * 1.0 / maxSpeed)\n break\n t += green\n else:\n if t <= f < t + red:\n tm = toLight * 1.0 / maxSpeed\n print(t + red + (dist - toLight) * 1.0 / maxSpeed)\n break\n t += red\n\n", "l, d, v, g, r = map(int,input().split())\r\n\r\nm = (d / v % (g + r))\r\n\r\nprint(l / v + (m >= g) * (r + g - m))", "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\nmod = int(1e9)+7\r\n\r\nl, d, v, g, r = rinput()\r\n\r\ntime = (d/v)%(g+r)\r\nans = l/v\r\n\r\nif time<g:\r\n\tprint(ans)\r\nelse:\r\n\tans += r + g - time\r\n\tprint(ans)", "l,d,v,g,r=list(map(int,input().split()))\r\nt1=(d/v)%(g+r)-g\r\nif t1<0:\r\n print(l/v)\r\nelse:\r\n print(l/v+r-t1)", "\nl, d, v, g, r = map(int, input().split())\n\ntime_to_lights = d / v\n\ntime_at_lights = 0\n\nif time_to_lights % (g + r) >= g:\n time_at_lights = (g + r) - (time_to_lights % (g + r))\n\ntime_after_lights = (l - d) / v\n\nprint(time_to_lights + time_at_lights + time_after_lights)\n", "l,d,v,g,r=map(int,input().split())\r\n\r\nt=l/v\r\n \r\ntest = d/v\r\nn=0\r\nwhile test >= 0:\r\n if n%2 == 0:\r\n test -= g\r\n else:\r\n test -= r\r\n n+=1\r\n \r\nif n%2==0:\r\n t+=abs(test)\r\nprint(t)\r\n" ]

[ "import bisect\r\nfrom functools import lru_cache\r\n\r\ng, d, f = tuple(map(int, input().split()))\r\n\r\ngoals = list(map(int, input().split()))\r\ndefs = list(map(int, input().split()))\r\nforwards = list(map(int, input().split()))\r\n\r\ngoals.sort()\r\ndefs.sort()\r\nforwards.sort()\r\n\r\nforwards.append(100000000)\r\ndefs.append(100000000)\r\ngoals.append(100000000)\r\n\r\nnumers = []\r\nroles = []\r\ngi, di, fi = 0, 0, 0\r\n\r\nfor i in range(d + g + f):\r\n numers.append(min(goals[gi], defs[di], forwards[fi]))\r\n\r\n if numers[-1] == goals[gi]:\r\n roles.append(1)\r\n gi += 1\r\n\r\n if numers[-1] == forwards[fi]:\r\n roles.append(3)\r\n fi += 1\r\n\r\n if numers[-1] == defs[di]:\r\n roles.append(2)\r\n di += 1\r\n\r\n#print(numers)\r\n#print(roles)\r\n\r\n\r\n@lru_cache()\r\ndef my_comb(n, k):\r\n if k == 0:\r\n return 1\r\n if n < k:\r\n return 0\r\n if n == k:\r\n return 1\r\n if k == 3:\r\n return (n * (n - 1) * (n - 2)) // 6\r\n if k == 2:\r\n return (n * (n - 1)) // 2\r\n if k == 1:\r\n return n\r\n assert False\r\n\r\n\r\ndef solve(numers, roles):\r\n ans = 0\r\n for i in range(len(numers)):\r\n # check all combinations with guy i\r\n\r\n possible_max_num = bisect.bisect_right(numers, numers[i] * 2)\r\n\r\n if possible_max_num - i < 5:\r\n continue\r\n\r\n avaliable_f = roles[i + 1: possible_max_num].count(3)\r\n avaliable_d = roles[i + 1: possible_max_num].count(2)\r\n avaliable_g = roles[i + 1: possible_max_num].count(1)\r\n\r\n needed_f, needed_d, needed_g = 3, 2, 1\r\n\r\n if roles[i] == 1:\r\n needed_g -= 1\r\n elif roles[i] == 2:\r\n needed_d -= 1\r\n else:\r\n needed_f -= 1\r\n\r\n possible_combinations_with_ith = my_comb(avaliable_d, needed_d) * my_comb(avaliable_f, needed_f) * my_comb(\r\n avaliable_g, needed_g)\r\n ans += possible_combinations_with_ith\r\n\r\n return ans\r\n\r\n\r\nprint(solve(numers, roles))\r\n", "def getLength(x, mn):\r\n i1, i2 = -1, -2\r\n for i in range(len(x)):\r\n if x[i] >= mn and x[i] <= 2 * mn:\r\n if i1 == -1:\r\n i1 = i\r\n i2 = i\r\n return i2 - i1 + 1\r\n \r\na, b, c = map(int, input().split())\r\nx = sorted(list(map(int, input().split())))\r\ny = sorted(list(map(int, input().split())))\r\nz = sorted(list(map(int, input().split())))\r\nans = 0\r\nfor i in range(a):\r\n mn = x[i]\r\n J = getLength(y, mn)\r\n K = getLength(z, mn)\r\n ans += ((J * (J - 1)) // 2) * ((K * (K - 1) * (K - 2)) // 6)\r\nfor j in range(b):\r\n mn = y[j]\r\n I = getLength(x, mn)\r\n J = getLength(y, mn)\r\n J = J - 1 if J != 0 else 0\r\n K = getLength(z, mn)\r\n ans += I * J * ((K * (K - 1) * (K - 2)) // 6)\r\nfor k in range(c):\r\n mn = z[k]\r\n I = getLength(x, mn)\r\n J = getLength(y, mn)\r\n K = getLength(z, mn)\r\n K = K - 1 if K != 0 else 0\r\n ans += I * ((J * (J - 1)) // 2) * ((K * (K - 1)) // 2)\r\nprint(ans)", "g, d, f = map(int, input().split())\nag = list(map(int, input().split()))\nad = list(map(int, input().split()))\naf = list(map(int, input().split()))\nans = 0\nfor i in range(g):\n\tcountd = 0\n\tcountf = 0\n\tfor j in range(d):\n\t\tif ad[j] > ag[i] and ad[j] < 2 * ag[i] + 1:\n\t\t\tcountd += 1\n\tfor k in range(f):\n\t\tif af[k] > ag[i] and af[k] < 2 * ag[i] + 1:\n\t\t\tcountf += 1\n\tans += (countd * (countd - 1) // 2) * ((countf * (countf - 1) * (countf - 2)) // 6)\nfor i in range(d):\n\tcountd, countf, countg = 0, 0, 0\n\tfor j in range(g):\n\t\tif ag[j] > ad[i] and ag[j] < 2 * ad[i] + 1:\n\t\t\tcountg += 1\n\tfor k in range(f):\n\t\tif af[k] > ad[i] and af[k] < 2 * ad[i] + 1:\n\t\t\tcountf += 1\n\tfor h in range(d):\n\t\tif ad[h] > ad[i] and ad[h] < 2 * ad[i] + 1:\n\t\t\tcountd += 1\n\tans += countg * countd * ((countf * (countf - 1) * (countf - 2)) // 6)\nfor i in range(f):\n\tcountd, countf, countg = 0, 0, 0\n\tfor j in range(g):\n\t\tif ag[j] > af[i] and ag[j] < 2 * af[i] + 1:\n\t\t\tcountg += 1\n\tfor k in range(f):\n\t\tif af[k] > af[i] and af[k] < 2 * af[i] + 1:\n\t\t\tcountf += 1\n\tfor h in range(d):\n\t\tif ad[h] > af[i] and ad[h] < 2 * af[i] + 1:\n\t\t\tcountd += 1\n\tans += countg * (countd * (countd - 1) // 2) * \t(countf * (countf - 1) // 2)\nprint(ans)\t\t\t\t\n\n\n\n\n\n\n\n\n\n\n\t\t\n", "from math import factorial\r\n\r\ndef bin_search(l, r, x):\r\n\twhile l < r - 1:\r\n\t\tm = (l+r)//2\r\n\t\tif players[m][0] == x:\r\n\t\t\treturn m\r\n\t\tif players[m][0] < x:\r\n\t\t\tl = m\r\n\t\telse:\r\n\t\t\tr = m\r\n\treturn l\r\n\r\ndef cmds_in_range(rang):\r\n\troles = []\r\n\ttemp_rang = [i[1] for i in rang]\r\n\tfor i in range(3):\r\n\t\troles.append(temp_rang.count(i))\r\n\tif roles[0] < 1 or roles[1] < 2 or roles[2] < 3:\r\n\t\treturn 0\r\n\tcomb_d = factorial(roles[1])//(factorial(roles[1]-2)*2)\r\n\tcomb_f = factorial(roles[2])//(factorial(roles[2]-3)*6)\r\n\treturn roles[0] * comb_d * comb_f\r\n\r\ninput()\r\nplayers = []\r\nfor i in range(3):\r\n\tfor j in (int(k) for k in input().split()):\r\n\t\tplayers.append((j, i))\r\nplayers.sort()\r\nplayers.append((200001, 0))\r\n\r\ncount = 0\r\nr = 0\r\nfor l in range(len(players) - 5):\r\n\tif l == 0:\r\n\t\tinter_cmds = 0\r\n\telse:\r\n\t\tinter_cmds = cmds_in_range(players[l:r + 1])\r\n\tr = bin_search(l, len(players) - 1, players[l][0] * 2)\r\n\tcur_cmds = cmds_in_range(players[l:r + 1])\r\n\tcount += cur_cmds - inter_cmds\r\n\t\r\nprint(count)", "g,d,f=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\na=[(x,0) for x in a]\r\nb=[(x,1) for x in b]\r\nc=[(x,2) for x in c]\r\na=a+b+c\r\nans=0\r\nfor (b,c) in a:\r\n x=[0,0,0]\r\n for (d,e) in a:\r\n if (d>=b and d<=2*b): x[e]+=1\r\n if (c==0): ans+=x[1]*(x[1]-1)/2*x[2]*(x[2]-1)*(x[2]-2)/6\r\n if (c==1): ans+=x[0]*(x[1]-1)*x[2]*(x[2]-1)*(x[2]-2)/6\r\n if (c==2): ans+=x[0]*x[1]*(x[1]-1)/2*(x[2]-1)*(x[2]-2)/2\r\nprint(int(ans))", "import getpass\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b // math.gcd(a, b)\r\n\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef dr(v):\r\n sm = sum([int(i) for i in str(v)])\r\n return sm if sm < 10 else dr(sm)\r\n\r\n\r\ndef range_sum(a, b):\r\n ass = (((b - a + 1) // 2) * (a + b))\r\n if (a - b) % 2 == 0:\r\n ass += (b - a + 2) // 2\r\n return ass\r\n\r\n\r\ndef comba(n, x):\r\n return (math.factorial(n) // math.factorial(n - x)) // math.factorial(x)\r\n\r\n\r\nfiles = True\r\ndebug = False\r\n\r\nif getpass.getuser() == 'frohenk' and files:\r\n debug = True\r\n sys.stdin = open(\"test.in\")\r\n # sys.stdout = open('test.out', 'w')\r\n pass\r\n\r\ng, d, f = ria()\r\ngs = sorted(ria())\r\nds = sorted(ria())\r\nfs = sorted(ria())\r\n\r\nar = []\r\nfor i in gs:\r\n ar.append((i, 0))\r\nfor i in ds:\r\n ar.append((i, 1))\r\nfor i in fs:\r\n ar.append((i, 2))\r\nar = sorted(ar)\r\nsuma = 0\r\nfor i, tp in ar:\r\n gl = bisect.bisect_right(gs, i * 2) - bisect.bisect_left(gs, i)\r\n dl = bisect.bisect_right(ds, i * 2) - bisect.bisect_left(ds, i)\r\n fl = bisect.bisect_right(fs, i * 2) - bisect.bisect_left(fs, i)\r\n if gl < 1 or dl < 2 or fl < 3:\r\n continue\r\n mp = 1\r\n if tp == 0:\r\n pass\r\n else:\r\n mp *= comba(gl, 1)\r\n \r\n if tp == 1:\r\n mp *= comba(dl - 1, 1)\r\n else:\r\n mp *= comba(dl, 2)\r\n\r\n if tp == 2:\r\n mp *= comba(fl - 1, 2)\r\n else:\r\n mp *= comba(fl, 3)\r\n suma += mp\r\nprint(suma)\r\n", "g,d,f = map(int,input().split())\n\ngoalkeepers = list(map(int,input().split()))\ndefenders = list(map(int,input().split()))\nforwards = list(map(int,input().split()))\n\n\n\n#min goalkeeper\ncount = 0\n\nfor keeper in goalkeepers:\n defend = len(list(filter(lambda x:x>keeper and x<=keeper*2,defenders)))\n forw = len(list(filter(lambda x:x>keeper and x<=keeper*2,forwards)))\n count+=defend*(defend - 1)*forw*(forw-1)*(forw-2)/12\n\n\n\n# min def\n\nfor defend in defenders:\n second_defend = len(list(filter(lambda x:x>defend and x<=defend*2,defenders)))\n forw = len(list(filter(lambda x:x>defend and x<=defend*2,forwards)))\n goal = len(list(filter(lambda x:x>defend and x<=defend*2,goalkeepers)))\n count+=second_defend*goal*forw*(forw-1)*(forw-2)/6\n\nfor defend in forwards:\n second_defend = len(list(filter(lambda x: x > defend and x <= defend * 2, defenders)))\n forw = len(list(filter(lambda x: x > defend and x <= defend * 2, forwards)))\n goal = len(list(filter(lambda x: x > defend and x <= defend * 2, goalkeepers)))\n count += second_defend *(second_defend-1)* goal * forw * (forw - 1) / 4\n\nprint(int(count))", "def C(n, k):\r\n if n < k:\r\n return 0\r\n\r\n if k == 1:\r\n return n # Сочетания из n по 1\r\n elif k == 2:\r\n return n * (n-1) // 2 # Сочетания из n по 2\r\n elif k == 3:\r\n return n * (n-1) * (n-2) // 6 # Сочетания из n по 3\r\n\r\n\r\ndef main():\r\n g, d, f = [int(_) for _ in input().split()]\r\n gs = [int(_) for _ in input().split()]\r\n ds = [int(_) for _ in input().split()]\r\n fs = [int(_) for _ in input().split()]\r\n\r\n ans = 0\r\n\r\n gs.sort()\r\n ds.sort()\r\n fs.sort()\r\n # print(gs)\r\n # print(ds)\r\n # print(fs)\r\n\r\n gmin, dmin, fmin = 0, 0, 0\r\n gmax, dmax, fmax = 0, 0, 0\r\n\r\n while g-gmin >= 1 and d-dmin >= 2 and f-fmin >= 3:\r\n term = 1\r\n mn = min(gs[gmin], ds[dmin], fs[fmin])\r\n\r\n while gmax < g and gs[gmax] <= mn * 2:\r\n gmax += 1\r\n gn = gmax - gmin\r\n if mn == gs[gmin]:\r\n term *= 1\r\n gmin += 1\r\n else:\r\n term *= C(gn, 1)\r\n\r\n while dmax < d and ds[dmax] <= mn * 2:\r\n dmax += 1\r\n dn = dmax - dmin\r\n if mn == ds[dmin]:\r\n term *= C(dn-1, 1)\r\n dmin += 1\r\n else:\r\n term *= C(dn, 2)\r\n\r\n while fmax < f and fs[fmax] <= mn * 2:\r\n fmax += 1\r\n fn = fmax - fmin\r\n if mn == fs[fmin]:\r\n term *= C(fn-1, 2)\r\n fmin += 1\r\n else:\r\n term *= C(fn, 3)\r\n\r\n ans += term\r\n\r\n print(ans)\r\n\r\n\r\ndef print_test():\r\n from random import randint\r\n g, d, f = 200, 400, 600\r\n # g, d, f = 3, 4, 5\r\n print(g, d, f)\r\n for _ in range(g):\r\n print(randint(1, 100000), end=' ')\r\n print()\r\n for _ in range(d):\r\n print(randint(1, 100000), end=' ')\r\n print()\r\n for _ in range(f):\r\n print(randint(1, 100000), end=' ')\r\n print()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n # print_test()\r\n\r\n# 3 4 5\r\n# 71655 49064 41937\r\n# 64260 37491 58885 40628\r\n# 23852 36500 67530 33756 73\r\n\r\n# 3 4 5\r\n# 71 49 41\r\n# 64 37 58 40\r\n# 23 36 67 33 1\r\n\r\n# 3 4 6\r\n# 71 49 41\r\n# 64 37 58 40\r\n# 23 36 67 33 1 60\r\n", "import bisect\r\n\r\ndef binom(n, k):\r\n if k > n:\r\n return 0\r\n elif k == 1:\r\n return n\r\n elif k == 2:\r\n return n * (n - 1) // 2\r\n elif k == 3:\r\n return n * (n - 1) * (n - 2) // 6\r\n else:\r\n assert False\r\n\r\ndef get_len(arr, a, b):\r\n lo = bisect.bisect_left(arr, a)\r\n hi = bisect.bisect_right(arr, b)\r\n return hi - lo\r\n\r\ndef solve(gs, ds, fs):\r\n ans = 0\r\n\r\n # min is goalkeeper, could be equal to attacker or defender if there were equal numbers\r\n for num_g in gs:\r\n ways_g = 1\r\n len_d = get_len(ds, num_g, num_g * 2)\r\n ways_d = binom(len_d, 2)\r\n len_f = get_len(fs, num_g, num_g * 2)\r\n ways_f = binom(len_f, 3)\r\n ways = ways_g * ways_d * ways_f\r\n # print(f'goalkeeper: ways={ways}, ways_gdf={ways_g, ways_d, ways_f}, num_g={num_g}')\r\n ans += ways\r\n\r\n # min is defender, could be equal to attacker if there were equal numbers\r\n for i, num_d in enumerate(ds[:-1]):\r\n ways_g = get_len(gs, num_d + 1, num_d * 2)\r\n ways_d = get_len(ds, num_d + 1, num_d * 2)\r\n len_f = get_len(fs, num_d, num_d * 2)\r\n ways_f = binom(len_f, 3)\r\n ways = ways_g * ways_d * ways_f\r\n # print(f'defender: ways={ways}, ways_gdf={ways_g, ways_d, ways_f}, num_d={num_d}')\r\n ans += ways\r\n\r\n # min is attacker\r\n for i, num_f in enumerate(fs[:-2]):\r\n ways_g = get_len(gs, num_f + 1, num_f * 2)\r\n len_d = get_len(ds, num_f + 1, num_f * 2)\r\n ways_d = binom(len_d, 2)\r\n len_f = get_len(fs, num_f + 1, num_f * 2)\r\n ways_f = binom(len_f, 2)\r\n ways = ways_g * ways_d * ways_f\r\n # print(f'attacker: ways={ways}, ways_gdf={ways_g, ways_d, ways_f}, num_f={num_f}')\r\n ans += ways\r\n\r\n return ans\r\n\r\n_, _, _ = [int(v) for v in input().split()]\r\ngs = [int(v) for v in input().split()]\r\nds = [int(v) for v in input().split()]\r\nfs = [int(v) for v in input().split()]\r\n\r\ngs.sort()\r\nds.sort()\r\nfs.sort()\r\n\r\nans = solve(gs, ds, fs)\r\nprint(ans)\r\n", "g, d, f = map(int, input().split())\r\ngg = list(map(int, input().split()))\r\ndd = list(map(int, input().split()))\r\nff = list(map(int, input().split()))\r\ngg.sort()\r\ndd.sort()\r\nff.sort()\r\ndef get_kolvo(left, right, lst):\r\n l = -1\r\n r = len(lst)\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n if lst[m] >= left:\r\n r = m\r\n else:\r\n l = m\r\n ql = r\r\n l = -1\r\n r = len(lst)\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n if lst[m] > right:\r\n r = m\r\n else:\r\n l = m\r\n \r\n qr = l\r\n \r\n return qr - ql + 1\r\n \r\ndef c(n, k):\r\n if k == 1:\r\n return n\r\n elif k == 2:\r\n return n * (n - 1) // 2\r\n elif k == 3:\r\n return n * (n - 1) * (n - 2) // 6\r\n\r\ndef get(l, r):\r\n return c(get_kolvo(l, r, gg), 1) * c(get_kolvo(l, r, dd), 2) * c(get_kolvo(l, r, ff), 3)\r\n \r\nans = 0\r\nfor i in range(4, 100001):\r\n ans += get(i, 2 * i) - get(i, 2 * i - 2)\r\nprint(ans)", "import math\r\ndef main():\r\n g, d, f = map(int, input().split())\r\n lst1 = list(map(int, input().split()))\r\n lst2 = list(map(int, input().split()))\r\n lst3 = list(map(int, input().split()))\r\n lst0 = []\r\n precounted = []\r\n ans = 0\r\n\r\n lst0 += [(c, 1) for c in lst1]\r\n lst0 += [(c, 2) for c in lst2]\r\n lst0 += [(c, 3) for c in lst3]\r\n\r\n lst0.sort()\r\n\r\n for i in range(len(lst0)):\r\n\r\n if len(precounted) == 0:\r\n a1, a2, a3 = (0, 0, 0)\r\n else:\r\n a1, a2, a3 = precounted[len(precounted) - 1]\r\n\r\n if (lst0[i][1] == 1):\r\n a1 += 1\r\n elif (lst0[i][1] == 2):\r\n a2 += 1\r\n else:\r\n a3 += 1\r\n\r\n precounted.append((a1, a2, a3))\r\n\r\n def product(iterable):\r\n prod = 1\r\n for n in iterable:\r\n prod *= n\r\n return prod\r\n\r\n def npr(n, r):\r\n assert 0 <= r <= n\r\n return product(range(n - r + 1, n + 1))\r\n\r\n def ncr(r, n):\r\n if r > n:\r\n return 0\r\n assert 0 <= r <= n\r\n if r > n // 2:\r\n r = n - r\r\n return npr(n, r) // math.factorial(r)\r\n\r\n for i in range(len(lst0) - 1):\r\n l = i + 1\r\n r = len(lst0)\r\n while l + 1 < r:\r\n m = (l + r) // 2\r\n if lst0[i][0] * 2 >= lst0[m][0]:\r\n l = m\r\n else:\r\n r = m\r\n max_possible_num = lst0[l][0]\r\n max_possible_ind = l\r\n\r\n a1 = precounted[max_possible_ind][0] - precounted[i][0]\r\n a2 = precounted[max_possible_ind][1] - precounted[i][1]\r\n a3 = precounted[max_possible_ind][2] - precounted[i][2]\r\n n1 = 1\r\n n2 = 2\r\n n3 = 3\r\n\r\n if lst0[i][1] == 1:\r\n n1 -= 1\r\n elif lst0[i][1] == 2:\r\n n2 -= 1\r\n else:\r\n n3 -= 1\r\n ans += ncr(n1, a1) * ncr(n2, a2) * ncr(n3, a3)\r\n\r\n print(ans)\r\n\r\nmain()", "import math\nfrom bisect import bisect_right as bis\n\ndef nCr(n, r):\n if r > n:\n return 0\n f = math.factorial\n return f(n) // f(r) // f(n - r)\n\ng, d, f = map(int, input().split())\n\ngs = list(map(int, input().split()))\ngs.sort()\nds = list(map(int, input().split()))\nds.sort()\nfs = list(map(int, input().split()))\nfs.sort()\n\n\ndef find_max(first, nums):\n nums_max = 0\n for i in range(bis(nums, first), len(nums)):\n if nums[i] <= first * 2:\n nums_max += 1\n else:\n break\n return nums_max\n\n\ndef count_by_first(first, gs_count=1, ds_count=2, fs_count=3):\n gs_max = find_max(first, gs)\n ds_max = find_max(first, ds)\n fs_max = find_max(first, fs)\n return nCr(gs_max, gs_count) * nCr(ds_max, ds_count) * nCr(fs_max, fs_count)\n\nanswer = 0\nfor i in gs:\n answer += count_by_first(i, gs_count=0)\nfor i in ds:\n answer += count_by_first(i, ds_count=1)\nfor i in fs:\n answer += count_by_first(i, fs_count=2)\n\nprint(answer)\n", "def f1(n):\r\n if n in gl:\r\n k = \"g\"\r\n elif n in dl:\r\n k = \"d\"\r\n else:\r\n k = \"f\"\r\n return n, k\r\n\r\n\r\ndef fg(d, f):\r\n if d >= 2 and f >= 3:\r\n k = d * (d - 1) * f * (f - 1) * (f - 2) // 12\r\n else:\r\n k = 0\r\n return k\r\n\r\n\r\ndef fd(g, d, f):\r\n if g >= 1 and d >= 1 and f >= 3:\r\n k = g * d * f * (f - 1) * (f - 2) // 6\r\n else:\r\n k = 0\r\n return k\r\n\r\n\r\ndef ff(g, d, f):\r\n if g >= 1 and d >= 2 and f >= 2:\r\n k = g * d * (d - 1) * f * (f - 1) // 4\r\n else:\r\n k = 0\r\n return k\r\n\r\n\r\ncomb = 0\r\ninput()\r\n#g, d, f = map(int, inp.split())\r\ninp = input()\r\ngl = list(map(int, inp.split()))\r\ninp = input()\r\ndl = list(map(int, inp.split()))\r\ninp = input()\r\nfl = list(map(int, inp.split()))\r\nl = gl + dl + fl\r\nl.sort()\r\nl = list(map(f1, l))\r\nn = len(l)\r\nfor i, c in enumerate(l):\r\n gr, dr, fr = 0, 0, 0\r\n st = c[0] * 2\r\n j = i\r\n while True:\r\n if j == n:\r\n break\r\n cur = l[j][0]\r\n if cur > st:\r\n break\r\n if l[j][1] == \"g\":\r\n gr += 1\r\n elif l[j][1] == \"d\":\r\n dr += 1\r\n else:\r\n fr += 1\r\n j += 1\r\n if l[i][1] == \"g\":\r\n comb += fg(dr, fr)\r\n elif l[i][1] == \"d\":\r\n comb += fd(gr, dr - 1, fr)\r\n else:\r\n comb += ff(gr, dr, fr - 1)\r\nprint(comb)\r\n", "_ = input()\r\na = list(map(lambda x: (int(x), 1), input().split()))\r\na.extend(map(lambda x: (int(x), 2), input().split()))\r\na.extend(map(lambda x: (int(x), 3), input().split()))\r\na.sort()\r\ng, d, f, n = [0], [0], [0], len(a)\r\nfor x, y in a:\r\n g.append(g[-1])\r\n d.append(d[-1])\r\n f.append(f[-1])\r\n if y == 1: g[-1] += 1\r\n elif y == 2: d[-1] += 1\r\n else: f[-1] += 1\r\n\r\ns = i = 0\r\nj = 1\r\n\r\nwhile i < n:\r\n while j < n and a[j][0] <= 2*a[i][0]: j += 1\r\n j -= 1\r\n g1 = g[j+1] - g[i]\r\n d1 = d[j+1] - d[i]\r\n f1 = f[j+1] - f[i]\r\n # print(i, j, g1, d1, f1)\r\n if a[i][1] == 1: s += d1 * (d1 - 1) * f1 * (f1 - 1) * (f1 - 2) // 12\r\n elif a[i][1] == 2: s += g1 * (d1 - 1) * f1 * (f1 - 1) * (f1 - 2) // 6\r\n else: s += g1 * d1 * (d1 - 1) * (f1 - 1) * (f1 - 2) // 4\r\n i += 1\r\n\r\nprint(s)\r\n", "def bin_coeff(n, k): # 0 <= k <= 3\n return [1, n, n * (n - 1) // 2, n * (n - 1) * (n - 2) // 6][k]\n\nGOALS, DEFS, FORWS = 1, 2, 3\n\ng, d, f = list(map(int, input().split()))\ngoalkeepers = list(map(int, input().split()))\ndefenders = list(map(int, input().split()))\nforwards = list(map(int, input().split()))\n\nnteams = 0\nfor min_num in goalkeepers + defenders + forwards:\n goals_cnt, defs_cnt, forws_cnt = [sum(min_num < x <= 2 * min_num\n for x in a) for a in [goalkeepers, defenders, forwards]]\n nteams += bin_coeff(goals_cnt, GOALS - (min_num in goalkeepers)) * \\\n bin_coeff(defs_cnt, DEFS - (min_num in defenders)) * \\\n bin_coeff(forws_cnt, FORWS - (min_num in forwards))\nprint(nteams)\n", "#упрощенное вычисление C\r\ndef c2(n):\r\n return n*(n-1)//2\r\ndef c3(n):\r\n return n*(n-1)*(n-2)//6\r\n\r\ng,d,f=map(int,input().split())\r\n#Костыль\r\nif g<1 or d<2 or f<3:\r\n print(0)\r\n exit()\r\n\r\nans=0\r\na=[]\r\nn=g+d+f\r\n#скидываем все в один массив и запоминаем типы\r\nfor i in map(int,input().split()):\r\n a.append((i,0))\r\nfor i in map(int,input().split()):\r\n a.append((i,1))\r\nfor i in map(int,input().split()):\r\n a.append((i,2))\r\n\r\n#сортируем этот массив по номеру\r\na.sort()\r\n\r\nfor i in range(n): #в i перебераем минимум\r\n types=[0,0,0]\r\n j=i+0#в j перебераем максимум\r\n while j<n and a[j][0]<=2*a[i][0]: #если максимум в 2 раза меньше минимума, то и все остальные\r\n types[a[j][1]]+=1\r\n now_types=types.copy()\r\n now_types[a[j][1]]-=1\r\n now_types[a[i][1]]-=1\r\n #проверка на то, какого типа минимум и максимум, их мы не учитываем при подсчете кол-ва вариантов, потому что мы их зафиксировали, чтобы не было повторов\r\n if a[j][1]==0 and a[i][1]==1 or a[j][1]==1 and a[i][1]==0:\r\n if now_types[1]>=1 and now_types[2]>=3:\r\n ans+=now_types[1]*c3(now_types[2])\r\n elif a[j][1]==0 and a[i][1]==2 or a[j][1]==2 and a[i][1]==0:\r\n if now_types[1]>=2 and now_types[2]>=2:\r\n ans+=c2(now_types[1])*c2(now_types[2])\r\n elif a[j][1]==2 and a[i][1]==1 or a[j][1]==1 and a[i][1]==2:\r\n if now_types[0]>=1 and now_types[1]>=1 and now_types[2]>=2:\r\n ans+=now_types[0]*now_types[1]*c2(now_types[2])\r\n elif a[j][1]==1 and a[i][1]==1:\r\n if now_types[0]>=1 and now_types[2]>=3:\r\n ans+=now_types[0]*c3(now_types[2])\r\n elif a[j][1]==2 and a[i][1]==2:\r\n if now_types[0]>=1 and now_types[1]>=2 and now_types[2]>=1:\r\n ans+=now_types[0]*c2(now_types[1])*now_types[2]\r\n j+=1\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n", "import sys\nfrom bisect import bisect_left, bisect_right\n\ndef binom(n, k):\n if k > n:\n return 0\n elif k == 0:\n return 1\n elif k == 1:\n return n\n elif k == 2:\n return (n * (n - 1)) // 2\n elif k == 3:\n return (n * (n - 1) * (n - 2)) // 6\n else:\n raise NotImplementedError\n\n\ndef ways_to_pick(xs, wx, lo, hi):\n idx_lo = bisect_left(xs, lo)\n idx_hi = bisect_right(xs, hi)\n return binom(idx_hi - idx_lo, wx)\n\n\ndef number_of_teams(gs, wg, ds, wd, fs, wf, lo, hi):\n return ways_to_pick(gs, wg, lo, hi) * \\\n ways_to_pick(ds, wd, lo, hi) * \\\n ways_to_pick(fs, wf, lo, hi)\n\n\nng, nd, nf = map(int, input().split())\ngs = list(sorted(map(int, input().split())))\nds = list(sorted(map(int, input().split())))\nfs = list(sorted(map(int, input().split())))\n\nwg = 1\nwd = 2\nwf = 3\n\nif nd < 2 or nf < 3:\n print(0)\n sys.exit(0)\n\nans = 0\nfor idx, min_el in enumerate(gs):\n ans += number_of_teams(gs[idx + 1:], wg - 1,\n ds, wd,\n fs, wf,\n min_el, 2 * min_el)\nfor idx, min_el in enumerate(ds):\n ans += number_of_teams(gs, wg,\n ds[idx + 1:], wd - 1,\n fs, wf,\n min_el, 2 * min_el)\nfor idx, min_el in enumerate(fs):\n ans += number_of_teams(gs, wg,\n ds, wd,\n fs[idx + 1:], wf - 1,\n min_el, 2 * min_el)\nprint(ans)\n", "def sub_pairs(r, l):\r\n if r-l<2: return 0\r\n n = r-l\r\n return (n*(n-1))//2\r\n\r\ndef sub_triples(r, l):\r\n if r-l<3: return 0\r\n n = r-l\r\n return (n*(n-1)*(n-2))//6\r\n\r\ndef fast(g, d, f):\r\n g.sort()\r\n d.sort()\r\n f.sort()\r\n res = 0\r\n gl, dl, fl = 0, 0, 0\r\n gr, dr, fr = 0, 0, 0\r\n while gl < len(g) and dl < len(d)-1 and fl < len(f)-2:\r\n mn = min(g[gl], d[dl], f[fl])\r\n mx = mn*2\r\n while gr < len(g) and g[gr] <= mx: gr+=1\r\n while dr < len(d) and d[dr] <= mx: dr+=1\r\n while fr < len(f) and f[fr] <= mx: fr+=1\r\n if g[gl] == mn:\r\n res += sub_pairs(dr, dl) * sub_triples(fr, fl)\r\n gl+=1\r\n elif d[dl] == mn:\r\n res += (max(0, dr-dl-1))*max(0, gr-gl) * sub_triples(fr, fl)\r\n dl+=1\r\n else:\r\n res += sub_pairs(fr, fl+1)*max(0, gr-gl) * sub_pairs(dr, dl)\r\n fl+=1\r\n## print(res, mn, mx, (gl, gr), (dl, dr), (fl, fr))\r\n return res \r\n\r\n\r\n \r\n\r\n\r\ninput()\r\ng = [int(x) for x in input().split()]\r\nd = [int(x) for x in input().split()]\r\nf = [int(x) for x in input().split()]\r\nprint(fast(g, d, f))\r\n", "s = input().split()\nl = sum([int(i) for i in s])\n\ndata = []\nfor j in range(3):\n data += [[int(i) for i in input().split()]]\n data[j] += [100001]\n data[j].sort()\n\ncursor = [0, 0, 0]\nposCnt = [0, 0, 0]\nlowerBound = 0\nupperBound = 0\n\nfinalCounter = 0\n\nmainQueue = []\nplayer = []\n\ni = 0\nwhile i < l:\n\n player = min([data[0][cursor[0]], 0], [data[1][cursor[1]], 1], [data[2][cursor[2]], 2])\n\n if lowerBound == i:\n mainQueue += [player]\n cursor[player[1]] += 1\n upperBound = mainQueue[lowerBound][0] * 2\n posCnt[player[1]] += 1\n else:\n if player[0] > upperBound:\n if posCnt[0] > 0 and posCnt[1] > 1 and posCnt[2] > 2:\n\n posCnt[mainQueue[lowerBound][1]] -= 1\n if mainQueue[lowerBound][1] == 0:\n finalCounter += posCnt[1] * (posCnt[1] - 1) * posCnt[2] * (posCnt[2] - 1) * (posCnt[2] - 2) // 12\n elif mainQueue[lowerBound][1] == 1:\n finalCounter += posCnt[0] * posCnt[1] * posCnt[2] * (posCnt[2] - 1) * (posCnt[2] - 2) // 6\n else:\n finalCounter += posCnt[0] * posCnt[1] * (posCnt[1] - 1) * posCnt[2] * (posCnt[2] - 1) // 4\n\n lowerBound += 1\n upperBound = mainQueue[lowerBound][0] * 2\n else:\n posCnt[mainQueue[lowerBound][1]] -= 1\n lowerBound += 1\n if lowerBound < i:\n upperBound = mainQueue[lowerBound][0] * 2\n i -= 1\n\n else:\n mainQueue += [player]\n cursor[player[1]] += 1\n posCnt[player[1]] += 1\n i += 1\n\n\nwhile posCnt[0] > 0 and posCnt[1] > 1 and posCnt[2] > 2:\n\n posCnt[mainQueue[lowerBound][1]] -= 1\n if not mainQueue[lowerBound][1]:\n finalCounter += posCnt[1] * (posCnt[1] - 1) * posCnt[2] * (posCnt[2] - 1) * (posCnt[2] - 2) // 12\n elif mainQueue[lowerBound][1] == 1:\n finalCounter += posCnt[0] * posCnt[1] * posCnt[2] * (posCnt[2] - 1) * (posCnt[2] - 2) // 6\n else:\n finalCounter += posCnt[0] * posCnt[1] * (posCnt[1] - 1) * posCnt[2] * (posCnt[2] - 1) // 4\n\n lowerBound += 1\n\nprint(finalCounter)\n", "import bisect\r\n\r\ndef count(a, low):\r\n top = low*2\r\n lowi = bisect.bisect_left(a, low)\r\n topi = bisect.bisect_right(a, top)\r\n return topi - lowi\r\n\r\ngn, dn, fn = map(int, input().split())\r\ng = [int(x) for x in input().split()]\r\nd = [int(x) for x in input().split()]\r\nf = [int(x) for x in input().split()]\r\n\r\ng = sorted(g)\r\nd = sorted(d)\r\nf = sorted(f)\r\n\r\nans = 0\r\nfor x in g:\r\n dc = count(d, x)\r\n fc = count(f, x)\r\n ans += dc * (dc-1) * fc * (fc-1) * (fc-2) // 12\r\nfor x in d:\r\n gc = count(g, x)\r\n dc = count(d, x)\r\n fc = count(f, x)\r\n ans += gc * (dc-1) * fc * (fc-1) * (fc-2) // 6\r\nfor x in f:\r\n gc = count(g, x)\r\n dc = count(d, x)\r\n fc = count(f, x)\r\n ans += gc * dc * (dc - 1) * (fc - 1) * (fc - 2) // 4\r\n\r\nprint(ans)", "g, d, f = map(int, input().split())\r\nG = sorted([0] + list(map(int, input().split())))\r\nD = sorted([0] + list(map(int, input().split())))\r\nF = sorted([0] + list(map(int, input().split())))\r\nG.append(0)\r\nD.append(0)\r\nF.append(0)\r\na = [0]*1000000\r\nb = [0]*1000000\r\nc = [0]*1000000\r\nx = 1\r\ny = 1\r\nz = 1\r\nfor i in range(1, 200001):\r\n if G[x] == i:\r\n a[i] = a[i - 1] + 1\r\n x += 1\r\n else:\r\n a[i] = a[i - 1]\r\n if D[y] == i:\r\n b[i] = b[i - 1] + 1\r\n y += 1\r\n else:\r\n b[i] = b[i - 1]\r\n if F[z] == i:\r\n c[i] = c[i - 1] + 1\r\n z += 1\r\n else:\r\n c[i] = c[i - 1]\r\nq = 0\r\nfor i in range(1, 100001):\r\n a2 = a[2*i] - a[i]\r\n b2 = b[2*i] - b[i]\r\n c2 = c[2*i] - c[i]\r\n if a[i] - a[i - 1] == 1:\r\n q += (b2*(b2 - 1) // 2) * (c2*(c2 - 1)*(c2 - 2) // 6)\r\n if b[i] - b[i - 1] == 1:\r\n q += a2*b2*(c2*(c2 - 1)*(c2 - 2) // 6)\r\n if c[i] - c[i - 1] == 1:\r\n q += a2*(b2*(b2 - 1) // 2)*(c2*(c2 - 1) // 2)\r\nprint(q)" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_trie():\r\n G0, G1, cnt = [-1], [-1], [0]\r\n return G0, G1, cnt\r\n\r\ndef insert(x, l):\r\n j = 0\r\n for i in range(l, -1, -1):\r\n cnt[j] += 1\r\n if x & pow2[i]:\r\n if G1[j] == -1:\r\n G0.append(-1)\r\n G1.append(-1)\r\n cnt.append(0)\r\n G1[j] = len(cnt) - 1\r\n j = G1[j]\r\n else:\r\n if G0[j] == -1:\r\n G0.append(-1)\r\n G1.append(-1)\r\n cnt.append(0)\r\n G0[j] = len(cnt) - 1\r\n j = G0[j]\r\n cnt[j] += 1\r\n return\r\n\r\ndef erase(x, l):\r\n j = 0\r\n for i in range(l, -1, -1):\r\n cnt[j] -= 1\r\n if x & pow2[i]:\r\n j = G1[j]\r\n else:\r\n j = G0[j]\r\n cnt[j] -= 1\r\n return\r\n\r\ndef kth_min(k, l):\r\n j = 0\r\n ans = 0\r\n for i in range(l, -1, -1):\r\n if not G0[j] == -1 and cnt[G0[j]] >= k:\r\n j = G0[j]\r\n else:\r\n ans += pow2[i]\r\n if not G0[j] == -1:\r\n k -= cnt[G0[j]]\r\n j = G1[j]\r\n return ans\r\n\r\ndef count_min(k, l):\r\n j = 0\r\n ans = 0\r\n for i in range(l, -1, -1):\r\n if k & pow2[i]:\r\n if G0[j] ^ -1:\r\n ans += cnt[G0[j]]\r\n j = G1[j]\r\n else:\r\n j = G0[j]\r\n return ans\r\n\r\nn, q = map(int, input().split())\r\ns = list(input().rstrip())\r\ns = [-1] + [i - 97 for i in s]\r\nG0, G1, cnt = binary_trie()\r\nl = 17\r\npow2 = [1]\r\nfor _ in range(l):\r\n pow2.append(2 * pow2[-1])\r\nla = 0\r\nu = [-1] * (n + 1)\r\nv = [-1] * (n + 1)\r\nfor i in range(1, n + 1):\r\n if s[i] ^ s[la]:\r\n insert(i, l)\r\n la = i\r\n v[i] = s[i]\r\n u[la] = i\r\nfor _ in range(q):\r\n i, j, k = map(int, input().split())\r\n x = kth_min(count_min(i + 1, l), l)\r\n if x ^ i:\r\n insert(i, l)\r\n u[x], u[i], v[i] = i - 1, u[x], v[x]\r\n y = kth_min(count_min(j + 1, l), l)\r\n if u[y] ^ j:\r\n insert(j + 1, l)\r\n u[y], u[j + 1], v[j + 1] = j, u[y], v[y]\r\n z = count_min(i, l) + 1\r\n c = [0] * 26\r\n while z <= cnt[0]:\r\n x = kth_min(z, l)\r\n if x > j:\r\n break\r\n erase(x, l)\r\n c[v[x]] += u[x] - x + 1\r\n u[x], v[x] = -1, -1\r\n if k:\r\n x, y, z = 0, 26, 1\r\n else:\r\n x, y, z = 25, -1, -1\r\n for j in range(x, y, z):\r\n if not c[j]:\r\n continue\r\n insert(i, l)\r\n u[i], v[i] = i + c[j] - 1, j\r\n i += c[j]\r\ni = 1\r\nans = []\r\nwhile i <= n:\r\n ans.append(chr(v[i] + 97) * (u[i] - i + 1))\r\n i = u[i] + 1\r\nsys.stdout.write(\"\".join(ans))" ]

[ "from bisect import bisect_right\r\nfrom collections import defaultdict\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nfrom types import GeneratorType\r\nfrom collections import defaultdict\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nsys.setrecursionlimit(10**5)\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n@bootstrap\r\ndef dfs(u,p):\r\n global curr\r\n for j in adj[u]:\r\n if(j!=p):\r\n l=last[u]\r\n\r\n if(l==0):\r\n pass\r\n else:\r\n edges.append([l,curr])\r\n last[u] = curr\r\n last[j] = curr\r\n ty.append([2, u, j])\r\n\r\n curr+=1\r\n for j in adj[u]:\r\n if(j!=p):\r\n yield dfs(j,u)\r\n\r\n yield\r\n\r\n\r\nn=int(input())\r\nadj=[[] for i in range(n+1)]\r\nfor j in range(n-1):\r\n u,v=map(int,input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\nlast=[0 for i in range(n+1)]\r\ncurr=1\r\nedges=[]\r\nty=[]\r\ndfs(1,0)\r\nprint(n-1)\r\nfor j in ty:\r\n print(*j)\r\nfor j in edges:\r\n print(*j)" ]

[ "n=int(input())\r\nl=list(map(int,input().split()))\r\nf=0\r\nfor i in range(n):\r\n #print(l[i],l[i+1])\r\n if l[i]>1 and l[i+1]>1:\r\n ind=i\r\n f+=1\r\n break\r\nif f==0:\r\n print(\"perfect\")\r\nelse:\r\n print(\"ambiguous\")\r\n l1,l2=[],[]\r\n cnt=0\r\n for i in range(len(l)):\r\n for j in range(l[i]):\r\n l1.append(cnt)\r\n cnt+=l[i]\r\n print(*l1)\r\n cnt1=0\r\n for i in range(len(l)):\r\n if i==ind+1:\r\n k=cnt1-1\r\n for j in range(l[i]-1):\r\n l2.append(cnt1)\r\n l2.append(k)\r\n cnt1+=l[i]\r\n else:\r\n for j in range(l[i]):\r\n l2.append(cnt1)\r\n cnt1+=l[i]\r\n print(*l2)\r\n \r\n", "# https://codeforces.com/contest/902\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nh = int(input())\na = list(map(int, input().split()))\n\nfor i in range(1, h + 1):\n if a[i] >= 2 and a[i - 1] >= 2:\n t1, t2 = [0], [0]\n parent = 1\n for j in range(1, h + 1):\n if j == i:\n t1 += [parent]\n t2 += [parent + 1]\n for x in range(1, a[j]):\n t1 += [parent + 1]\n t2 += [parent + 1]\n else:\n for x in range(a[j]):\n t1 += [parent]\n t2 += [parent]\n parent += a[j - 1]\n print(\"ambiguous\")\n print(*t1)\n print(*t2)\n\n exit()\n\nprint(\"perfect\")\n", "h = int(input())\r\n\r\nA = list(map(int,input().split()))\r\n\r\nf = False\r\nfor i,a in enumerate(A):\r\n if f and a != 1:\r\n f = None\r\n break\r\n else:\r\n f = a != 1\r\n\r\nif f is not None:\r\n print('perfect')\r\nelse:\r\n T = []\r\n for j,a in enumerate(A):\r\n if j == i:\r\n x = len(T)\r\n T += [len(T)]*a\r\n\r\n print('ambiguous')\r\n print(' '.join(map(str,T)))\r\n T[x+1] = x-1\r\n print(' '.join(map(str,T)))", "n = int(input())\r\nh = [int(x) for x in input().split()]\r\nperfect = True\r\nfor i in range(n):\r\n if h[i] > 1 and h[i+1] > 1:\r\n perfect = False\r\nif perfect:\r\n print('perfect')\r\nelse:\r\n print('ambiguous')\r\n # build 1\r\n parent = 0\r\n vertex = 1\r\n for i in range(n+1):\r\n for j in range(h[i]):\r\n print(parent, end=' ')\r\n parent = vertex\r\n vertex += h[i]\r\n print()\r\n # build 2\r\n parent = 0\r\n vertex = 1\r\n for i in range(n+1):\r\n for j in range(h[i]):\r\n print(parent, end=' ')\r\n parent = vertex\r\n vertex += h[i]\r\n if i < n and h[i] > 1 and h[i+1] > 1:\r\n print(parent + 1, end=' ')\r\n h[i+1] -= 1\r\n vertex += 1\r\n print()\r\n", "import sys\nfrom collections import Counter, deque\ndef lInt(d = None): return map(int, input().split(d))\n\nn, *_ = lInt()\na = list(lInt())\na.append(0)\nj = 0\n\ntot = sum(a)\n\ntry:\n for i, va in enumerate(a):\n if va > 1 and a[i-1] > 1:\n print(\"ambiguous\")\n j = i\n raise\nexcept:\n p = 0\n ans = []\n\n for i in range(0, n+1):\n va = a[i]\n for u in range(va):\n ans.append(p)\n p += va\n\n for u in ans:\n sys.stdout.write(str(u)+\" \")\n print(\"\")\n p = 0\n ans = []\n for i in range(0, n+1):\n va = a[i]\n if i == j:\n for u in range(va//2):\n ans.append(p-1)\n for u in range(va//2, va):\n ans.append(p)\n else:\n for u in range(va):\n ans.append(p)\n p += va\n\n for u in ans:\n sys.stdout.write(str(u)+\" \")\n print(\"\")\n\nelse:\n print(\"perfect\")\n", "h = int(input())\r\narr = list(map(int,input().split()))\r\ns = 0\r\nflag = True\r\nfor i in range(0,h):\r\n if arr[i]>1 and arr[i+1]>1:\r\n flag = False\r\nif flag:\r\n print(\"perfect\")\r\nelse: \r\n total = sum(arr)\r\n ch = []\r\n temp = 0\r\n for i in range(h+1):\r\n if temp>total:\r\n break\r\n for j in range(arr[i]):\r\n ch.append(s)\r\n temp += 1\r\n s += arr[i]\r\n j=0 \r\n for i in range(1,h+1):\r\n if arr[i]>1 and arr[i-1]>1:\r\n j = i\r\n break\r\n tot2 = sum(arr[:j]) \r\n print(\"ambiguous\")\r\n ans1 = list(ch[:total])\r\n print(*ans1)\r\n ch[tot2+1] -= 1\r\n ans2 = list(ch[:total])\r\n print(*ans2) \r\n", "import sys\n\nh = int(input())\na = list(map(int,input().split()))\n\nok = True\nfor i in range(h):\n if a[i]>=2 and a[i+1]>=2:\n ok = False\n idx = i+1\nif ok:\n print('perfect')\nelse:\n print('ambiguous')\n ans = []\n p = 0\n for x in a:\n ans.extend([p]*x)\n p = len(ans)\n print(' '.join(map(str,ans)))\n ans[sum(a[:idx])] -= 1\n print(' '.join(map(str,ans)))\n\n\t\t \t\t\t \t \t\t\t\t\t\t\t\t \t \t \t\t \t", "h = int(input())\nwidths = [int(x) for x in input().split()]\n\nindex = -1\nisAmbiguous = False\nfor i, a, b in zip(range(h), widths, widths[1:]):\n # print(a, b)\n if a > 1 and b > 1:\n isAmbiguous = True\n index = i + 1\n break\nelse:\n print(\"perfect\")\n exit(0)\n\nparents = [0 for i in range(sum(widths))]\nparents2 = [0 for i in range(sum(widths))]\npos = 0\nparent = 0\nfor j, w in enumerate(widths):\n for i in range(w):\n parents[pos + i] = parent\n parents2[pos + i] = parent\n if j == index:\n parents2[pos + i] -= 1\n pos += w\n parent += w\n\nprint(\"ambiguous\")\nprint(*parents)\nprint(*parents2)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nh = int(input())\r\na = list(map(int, input().split()))\r\nn = sum(a)\r\npar = [-1]*n\r\ncnt = 1\r\ns, t = -1, -1\r\n\r\nfor i in range(1, h+1):\r\n for v in range(cnt, cnt+a[i]):\r\n par[v] = cnt-1\r\n \r\n if a[i-1]>=2 and a[i]>=2:\r\n s = cnt\r\n t = cnt-a[i-1]\r\n \r\n cnt += a[i]\r\n\r\nif s==-1 and t==-1:\r\n print('perfect')\r\nelse:\r\n print('ambiguous')\r\n print(*list(map(lambda x: x+1, par)))\r\n par[s] = t\r\n print(*list(map(lambda x: x+1, par)))", "def tree(h,a,special=False):\r\n ind = 0\r\n\r\n parent = [-1]*sum(a)\r\n bottom = []\r\n for i in range(a[-1]):\r\n bottom.append(ind)\r\n ind+=1\r\n prev = bottom\r\n for y in range(h-1,-1,-1):\r\n root = ind\r\n ind+=1\r\n if special and a[y]>1 and a[y+1]>1: \r\n for node in prev[1:]:\r\n parent[node]=root\r\n parent[prev[0]]=root+1\r\n special = False\r\n else:\r\n for node in prev:\r\n parent[node]=root\r\n nextlayer = [root]\r\n for i in range(a[y]-1):\r\n nextlayer.append(ind)\r\n ind+=1\r\n prev = nextlayer\r\n return parent,special\r\n\r\nh=int(input())\r\na = [int(x) for x in input().split()]\r\n\r\np1,special = tree(h,a)\r\np2,special =tree(h,a,special=True)\r\nif not special:\r\n print('ambiguous')\r\n print(*[x+1 for x in p1])\r\n print(*[x+1 for x in p2])\r\nelse:\r\n print('perfect')\r\n", "n=int(input())\nar=list(map(int,input().split()))\nb=False\nc=False\nfor x in ar:\n if x > 1:\n if b == True:\n c=True\n break\n b=True\n else:\n b=False\nif not c:\n print('perfect')\nelse:\n print('ambiguous')\n ar1=[]\n ar2=[]\n c=0\n b=0\n d=0\n for x in range(n+1):\n if ar[x] > 1 :\n if b and not d:\n for el in range(ar[x]-1):\n ar1.append(c)\n ar2.append(c-1)\n ar1.append(c)\n ar2.append(c)\n d=1\n else:\n for el in range(ar[x]):\n ar1.append(c)\n ar2.append(c)\n \n b=True\n else:\n b=False\n for el in range(ar[x]):\n ar1.append(c)\n ar2.append(c)\n c+=ar[x]\n #print(c)\n print(*ar1)\n print(*ar2)", "h = int(input())\r\nnodes = [int(x) for x in input().split()]\r\n\r\nfirst = []\r\nsecond = []\r\n\r\nmbo = True\r\nstillgood = True\r\n\r\npn = 0\r\nfor nc in nodes:\r\n if mbo and nc == 1:\r\n first.append(pn)\r\n second.append(pn)\r\n pn += 1\r\n mbo = False\r\n elif mbo and nc != 1:\r\n stillgood = False\r\n for i in range(nc-1):\r\n first.append(pn)\r\n second.append(pn)\r\n first.append(pn)\r\n second.append(pn-1)\r\n pn += nc\r\n mbo = True\r\n\r\n elif (not mbo) and nc == 1:\r\n first.append(pn)\r\n second.append(pn)\r\n pn += 1\r\n mbo = False\r\n elif (not mbo) and nc != 1:\r\n for i in range(nc):\r\n first.append(pn)\r\n second.append(pn)\r\n pn += nc\r\n mbo = True\r\nif stillgood:\r\n print('perfect')\r\nelse:\r\n print('ambiguous')\r\n print(' '.join((str(x) for x in first)))\r\n print(' '.join((str(x) for x in second)))", "h = int(input())\r\na = list(map(int,input().split()))\r\nf = False\r\nfor i in range(h):\r\n\tif a[i] > 1 and a[i+1] > 1:\r\n\t\tf = True\r\nif(not f):\r\n\tprint(\"perfect\")\r\nelse:\r\n\tcur = 0\r\n\tcur2 = 0\r\n\tx = []\r\n\ty = []\r\n\tbruh = False\r\n\tfor i in range(h+1):\r\n\t\tif i and a[i] > 1 and a[i-1] > 1 and bruh == False:\r\n\t\t\tx.append(cur2)\r\n\t\t\tfor j in range(a[i]-1): x.append(cur)\r\n\t\t\tbruh = True\r\n\t\telse:\r\n\t\t\tfor j in range(a[i]): x.append(cur)\r\n\t\tfor j in range(a[i]): y.append(cur)\t\r\n\t\tcur = len(x)\r\n\t\tcur2 = len(x)-1\t\t\t\t\r\n\t\t# print(i,x,y)\r\n\tprint(\"ambiguous\")\t\r\n\tfor i in x:\t\r\n\t\tprint(i,end=' ')\r\n\tprint(\"\")\r\n\tfor i in y:\t\r\n\t\tprint(i,end=' ')", "n = int(input())\r\nfl = 1\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nfor i in range(1,n+1):\r\n if a[i] > 1 and a[i-1] > 1:\r\n fl = 0\r\n break\r\n\r\nif fl == 1:\r\n print(\"perfect\")\r\nelse :\r\n print(\"ambiguous\")\r\n print(\"0\", end=\" \")\r\n cnt=1\r\n x=1\r\n fl=1\r\n for i in range(1,n+1):\r\n for j in range(a[i]):\r\n print(cnt,end=\" \")\r\n x += 1\r\n cnt=x\r\n print()\r\n print(\"0\", end=\" \")\r\n cnt=1\r\n x=1\r\n fl=1\r\n for i in range(1,n+1):\r\n if a[i] > 1 and a[i-1] > 1 and fl == 1:\r\n fl = 0\r\n for j in range(a[i]-1):\r\n print(cnt, end=\" \")\r\n x += 1\r\n print(cnt-1,end=\" \")\r\n x += 1\r\n else:\r\n for j in range(a[i]):\r\n print(cnt,end=\" \")\r\n x += 1\r\n cnt=x\r\n \r\n \r\n", "import sys\n\n\nlines = []\nfor line in sys.stdin:\n lines.append(line.rstrip(\"\\r\\n\\t \"))\nh = int(lines[0])\nids = lines[1].split(\" \")\nleafs1 = \"0\"\nleafs2 = \"0\"\nparents = []\nlast_id = 1\nis_perfect = True\nleafs = int(ids[1])\nlast_leafs = leafs\nfor j in range(0, leafs):\n last_id += 1\n leafs1 += \" 1\"\n leafs2 += \" 1\"\n parents.append(last_id)\nfor i in range(3, h + 2):\n leafs = int(ids[i - 1])\n s0 = \" \" + str(parents[0])\n if last_leafs > 1 and leafs > 1:\n is_perfect = False\n last_id += 1\n s1 = \" \" + str(parents[1])\n parents = []\n leafs1 += s0\n leafs2 += s1\n parents.append(last_id)\n for j in range(1, leafs):\n last_id += 1\n leafs1 += s0\n leafs2 += s0\n parents.append(last_id)\n else:\n parents = []\n for j in range(0, leafs):\n last_id += 1\n leafs1 += s0\n leafs2 += s0\n parents.append(last_id)\n last_leafs = leafs\n\nif is_perfect:\n print(\"perfect\")\nelse:\n print(\"ambiguous\")\n print(leafs1)\n print(leafs2)\n", "def read():\r\n\treturn tuple(int(x) for x in input().split())\r\n\r\ndef main():\r\n\t(h, ) = read()\r\n\ta = read()\r\n\ttree = []\r\n\tfi = 0\r\n\tflag = False\r\n\tfor i, x in enumerate(a):\r\n\t\tif fi == 0:\r\n\t\t\tif not flag and x > 1:\r\n\t\t\t\tflag = True\r\n\t\t\telif flag and x > 1:\r\n\t\t\t\tfi = len(tree)\r\n\t\t\telse:\r\n\t\t\t\tflag = False\r\n\t\ttree.extend([len(tree)] * x)\r\n\tif fi == 0:\r\n\t\tprint('perfect')\r\n\t\treturn\r\n\telse:\r\n\t\tprint('ambiguous')\r\n\tprint(' '.join(str(x) for x in tree))\r\n\ttree[fi] = fi - 1\r\n\tprint(' '.join(str(x) for x in tree))\r\n\r\nmain()", "def main():\n from sys import stdin, stdout\n from collections import defaultdict\n h = int(input())\n if h <= 1:\n stdout.write(\"perfect\\n\")\n return\n a = list(map(int, stdin.readline().strip().split(' ')))\n ambiguous = False\n for i in range(0, h + 1):\n if a[i] > 1 and a[i - 1] > 1:\n ambiguous = True\n break\n \n if not ambiguous:\n stdout.write(\"perfect\\n\")\n return\n\n stdout.write(\"ambiguous\\n\")\n t = defaultdict(list)\n prev = 1\n cur = 2\n r = [0]\n for i in range(1, h + 1):\n for j in range(a[i]):\n t[prev].append(cur)\n cur += 1\n for l in t[prev]:\n r.append(prev)\n prev = cur - 1\n stdout.write(' '.join(list(map(str, r))) + \"\\n\")\n\n t = defaultdict(list)\n prev = 1\n cur = 2\n r = [0]\n o = True\n for i in range(1, h + 1):\n for j in range(a[i]):\n t[prev].append(cur)\n cur += 1\n for l in t[prev]:\n if a[i] > 1 and a[i - 1] > 1 and o:\n r.append(prev - 1)\n o = False\n else:\n r.append(prev)\n prev = cur - 1\n stdout.write(' '.join(list(map(str, r))) + \"\\n\")\n\nmain()\n", "h = int(input())\r\nd = list(map(int, input().split()))\r\nf = True\r\nix = -1\r\nc = 0\r\nfor i in range(len(d) - 1):\r\n\tif d[i] > 1 and d[i + 1] > 1:\r\n\t\tf = False\r\n\t\tix = i\r\n\t\tbreak\r\n\tc += d[i]\r\nif f:\r\n\tprint('perfect')\r\nelse:\r\n\tprint('ambiguous')\r\n\tb = 0\r\n\ts = 0\r\n\tfor i in range(ix):\r\n\t\tfor j in range(d[i]):\r\n\t\t\tprint(b, end = ' ')\r\n\t\ts += d[i]\r\n\t\tb = s\r\n\tfor i in range(d[ix]):\r\n\t\tprint(b, end = ' ')\r\n\ts += d[ix]\r\n\tb = s\r\n\tfor i in range(d[ix + 1]):\r\n\t\tprint(b, end = ' ')\r\n\ts += d[ix + 1]\r\n\tb = s\r\n\tfor i in range(ix + 2, len(d)):\r\n\t\tfor j in range(d[i]):\r\n\t\t\tprint(b, end = ' ')\r\n\t\ts += d[i]\r\n\t\tb = s\r\n\tprint()\r\n\tb = 0\r\n\ts = 0\r\n\tfor i in range(ix):\r\n\t\tfor j in range(d[i]):\r\n\t\t\tprint(b, end = ' ')\r\n\t\ts += d[i]\r\n\t\tb = s\r\n\tfor i in range(d[ix]):\r\n\t\tprint(b, end = ' ')\r\n\ts += d[ix]\r\n\tb = s\r\n\tfor i in range(d[ix + 1] - 1):\r\n\t\tprint(b, end = ' ')\r\n\tprint(b - 1, end = ' ')\r\n\ts += d[ix + 1]\r\n\tb = s\r\n\tfor i in range(ix + 2, len(d)):\r\n\t\tfor j in range(d[i]):\r\n\t\t\tprint(b, end = ' ')\r\n\t\ts += d[i]\r\n\t\tb = s", "h = int(input())\r\na = list(map(int,input().split()))\r\n\r\nperfect = True\r\nfor i in range(h):\r\n if a[i]>1 and a[i+1]>1:\r\n perfect = False\r\n break\r\n\r\nif perfect:\r\n print(\"perfect\")\r\nelse:\r\n print(\"ambiguous\")\r\n tree1 = list(range(h+1))\r\n tree2 = list(tree1)\r\n for i in range(1,h+1):\r\n tree1.extend([i]*(a[i]-1))\r\n for i in range(1,h+1):\r\n p = i\r\n if a[i]>1 and a[i-1]>1:\r\n p = len(tree2)\r\n tree2.extend([p]*(a[i]-1))\r\n print(\" \".join(map(str,tree1)))\r\n print(\" \".join(map(str,tree2)))\r\n", "n = int(input())\ntrees = list(map(int, input().split()))\nres1, res2 = [], []\ndef create_tree(n, trees, flag):\n t = 0\n for i, num in enumerate(trees):\n for _ in range(num):\n res1.append(t)\n res2.append(t)\n if i == flag:\n res2[-1] -= 1\n t += num\n print(' '.join(map(str,res1)))\n print(' '.join(map(str,res2)))\nfor i in range(1, n + 1):\n if trees[i] != 1 and trees[i - 1] != 1:\n print('ambiguous')\n create_tree(n, trees, i)\n break\nelse:\n print('perfect')\n\t \t\t \t \t \t \t \t \t \t\t \t", "#!/usr/bin/env python3\n\ndef solve():\n h = get(int)\n A = [1] + get([int])\n t1 = []\n t1p = 0\n t2 = []\n t2p = 0\n perfect = True\n for a, b in zip(A, A[1:]):\n t1.extend([t1p]*b)\n if a > 1 and b > 1:\n perfect = False\n t2.extend([t2p]*(b-1) + [t2p+1])\n else:\n t2.extend([t2p]*b)\n t1p += a\n t2p += a\n if perfect:\n return 'perfect'\n return '{}\\n{}\\n{}'.format('ambiguous', ' '.join(map(str, t1)), ' '.join(map(str, t2)))\n\n\n\n_testcases = \"\"\"\n2\n1 1 1\n\nperfect\n\n\n\n2\n1 2 2\n\nambiguous\n0 1 1 3 3\n0 1 1 3 2\n\n\n\n3\n1 2 1 2\n\nperfect\n\n\n\n3\n1 1 2 2\n\nambiguous\n\"\"\".strip()\n\n# ======================= B O I L E R P L A T E ======================= #\n# Practicality beats purity\n\nfrom bisect import bisect_left, bisect_right\nfrom collections import defaultdict\nfrom functools import lru_cache\nfrom heapq import heapify, heappop, heappush\nfrom operator import itemgetter, attrgetter\nimport bisect\nimport collections\nimport functools\nimport heapq\nimport itertools\nimport math\nimport operator\nimport re\nimport string\nimport sys\n\ninf = float('inf')\ncache = lru_cache(None)\nsys.setrecursionlimit(10000)\n\ndef tree():\n return collections.defaultdict(tree)\n\ndef equal(x, y, epsilon=1e-6):\n # https://code.google.com/codejam/kickstart/resources/faq#real-number-behavior\n if -epsilon <= x - y <= epsilon:\n return True\n if -epsilon <= x <= epsilon or -epsilon <= y <= epsilon:\n return False\n return (-epsilon <= (x - y) / x <= epsilon or -epsilon <= (x - y) / y <= epsilon)\n\n\ndef get(_type): # For easy input\n if type(_type) == list:\n if len(_type) == 1:\n _type = _type[0]\n return list(map(_type, input().strip().split()))\n else:\n return [_type[i](inp) for i, inp in enumerate(input().strip().split())]\n else:\n return _type(input().strip())\n\nif __name__ == '__main__':\n printRecursionTree = timeit = lambda x: x\n _p, print = print, lambda *a, **b: None\n _p(solve())\n", "#Abhigyan Khaund - syl\n\nn = int(input())\n\na = list(map(int, input().split()))\n\nambi = 0\n\nfor i in range(1,len(a)):\n\tif(a[i]>1 and a[i-1]>1):\n\t\tambi = 1\nans1 = \"\"\nans2 = \"\"\nif(ambi == 0):\n\tprint (\"perfect\")\nelse:\n\tprint (\"ambiguous\")\n\tans1+=\"0 \"\n\tk = 0\n\ts = sum(a)\n\tj = 1\n\th = 1\n\tc = 0\n\tst = 2\n\tans2+= \"0\" + \" \"\n\tk1 = 0\n\t# s = sum(a)\n\tj1 = 1\n\th1 = 1\n\tc1 = 0\n\tst1 = 2\n\tprev_st1 = 1\n\tfor i in range(1,s):\n\t\t# print j,\n\t\tans1+= str(j) + \" \"\n\t\tans2+= str(j1) + \" \"\n\t\tk+=1\n\t\tc+=1\n\t\tif(c>=a[h]):\n\t\t\tk = 0\n\t\t\th+=1\n\t\t\tc = 0\n\t\t\tj = st\n\t\t\tst = i+2\n\t\tk1+=1\n\t\tif(k1==1):\n\t\t\tk1 = 0\n\t\t\tj1+=1\n\t\tc1+=1\n\t\tif(c1>=a[h1-1]):\n\t\t\tj1 = prev_st1\n\t\t\tk1 = 0 \n\t\tif(c1>=a[h1]):\n\t\t\tk1 = 0\n\t\t\th1+=1\n\t\t\tc1 = 0\n\t\t\tj1 = st1\n\t\t\tprev_st1 = st1\n\t\t\tst1 = i+2\n\t\t\t\n\t# print \n\t# print \n\tprint (ans1)\n\tprint (ans2)\n", "def ii():\r\n return int(input())\r\ndef mi():\r\n return map(int, input().split())\r\ndef li():\r\n return list(mi())\r\n \r\ndef gen(r):\r\n p = q = 1\r\n t = [0]\r\n for i in range(h):\r\n pp = p\r\n p = len(t) + 1\r\n if r and i and min(a[i], a[i-1]) > 1:\r\n t += [q]\r\n t += [pp] * (a[i]-1)\r\n else:\r\n t += [pp] * a[i]\r\n q = len(t)\r\n return t\r\n\r\nh = ii()\r\na = li()[1:]\r\nt1, t2 = gen(0), gen(1)\r\nif t1 == t2:\r\n print('perfect')\r\nelse:\r\n print('ambiguous')\r\n print(*t1)\r\n print(*t2)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * (n + 1)\r\npos = 0\r\nwhile pos < n and (a[pos] == 1 or a[pos + 1] == 1):\r\n pos += 1\r\nif pos == n:\r\n print(\"perfect\")\r\nelif pos != 0:\r\n print(\"ambiguous\")\r\n b[0] = 1\r\n for i in range(1, n + 1):\r\n b[i] = b[i - 1] + a[i - 1]\r\n print(\"0\", end=\"\")\r\n for i in range(1, n + 1):\r\n for j in range(a[i]):\r\n print(f\" {b[i - 1]}\", end=\"\")\r\n print()\r\n print(\"0\", end=\"\")\r\n for i in range(1, n + 1):\r\n if i == pos + 1:\r\n print(f\" {b[i - 1] + 1}\", end=\"\")\r\n for j in range(1, a[i]):\r\n print(f\" {b[i - 1]}\", end=\"\")\r\n else:\r\n for j in range(a[i]):\r\n print(f\" {b[i - 1]}\", end=\"\")\r\n print()# 1691242755.1479506", "n = int(input())\r\nh = list(map(int, input().split()))\r\nt1 = [0]\r\nt2 = [0]\r\nans = 'perfect'\r\nfor i in range(1, len(h)):\r\n l = len(t1)\r\n if h[i-1] > 1 and h[i] > 1:\r\n l = len(t1)\r\n pl = len(t1)-1\r\n for j in range(h[i]):\r\n t1.append(l)\r\n for j in range(h[i]):\r\n if j % 2:\r\n t2.append(l)\r\n else:\r\n t2.append(pl)\r\n ans = 'ambiguous'\r\n else:\r\n for j in range(h[i]):\r\n t1.append(l)\r\n t2.append(l)\r\nif ans == 'perfect':\r\n print(ans)\r\nelse:\r\n print(ans)\r\n print(' '.join([str(i) for i in t1]))\r\n print(' '.join([str(i) for i in t2]))", "h=int(input())\r\na=list(map(int,input().split()))\r\nflak=0\r\nfor i in range(h+1):\r\n if a[i]>1 and flak==1:\r\n print(\"ambiguous\")\r\n b=[]\r\n c=[]\r\n d=0\r\n for j in range(h+1):\r\n for x in range(a[j]):\r\n b.append(d)\r\n c.append(d)\r\n if j==i and x==a[j]-1:\r\n c[-1]=d-1\r\n \r\n d+=a[j]\r\n print(*b)\r\n print(*c)\r\n break\r\n elif a[i]>1:\r\n flak=1\r\n else:\r\n flak=0\r\nelse:\r\n print(\"perfect\")", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\"\"\"\r\nOK one option:\r\nput all the vertices to the right as much as possible.\r\nOr, the first time there's two > 1's in a row\r\nPut the leftmost on not-the-rightmost.\r\n\r\n\"\"\"\r\ndef process(A):\r\n n = len(A)\r\n m = sum(A)\r\n t1 = [0 for i in range(m)]\r\n curr = 1\r\n first_mult = None\r\n for i in range(1, n):\r\n if i < n-1 and A[i+1] > 1 and A[i] > 1 and first_mult is None:\r\n first_mult = curr+A[i]\r\n for j in range(curr, curr+A[i]):\r\n t1[j] = curr\r\n curr+=A[i]\r\n if first_mult is None:\r\n return ['perfect', None, None]\r\n # print(first_mult)\r\n t2 = [x for x in t1]\r\n done = False\r\n for i in range(m):\r\n if t2[i]==first_mult:\r\n t2[i]-=1\r\n break\r\n return ['ambiguous', t1, t2]\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\na1, a2, a3 = process(A)\r\nprint(a1)\r\nif a1=='ambiguous':\r\n sys.stdout.write(' '.join(map(str, a2))+'\\n')\r\n sys.stdout.write(' '.join(map(str, a3))+'\\n')", "n = int(input())\r\narr = list(map(int, input().split()))\r\nb, c = [0], [0]\r\ncurr = 1\r\nfor i in range(1, n+1):\r\n b.extend([curr]*arr[i])\r\n curr += arr[i]\r\ncurr = 1\r\nfor i in range(1, n+1):\r\n if arr[i] > 1 and arr[i-1] > 1:\r\n c.append(curr-1)\r\n c.extend([curr]*(arr[i]-1))\r\n else:\r\n c.extend([curr]*arr[i])\r\n curr += arr[i]\r\nif b == c:\r\n print('perfect')\r\nelse:\r\n print('ambiguous')\r\n print(*b)\r\n print(*c)\r\n", "h=int(input())\r\nl=list(map(int,input().split()))\r\nx=False\r\npos=0\r\ns=1\r\nfor i in range(h):\r\n if (l[i]!=1) and (l[i+1]!=1) :\r\n pos=i+1\r\n x=True\r\n print(\"ambiguous\")\r\n break\r\nif not x:\r\n print(\"perfect\")\r\nelse:\r\n ch=\"0\"\r\n ch1=\"0\"\r\n for i in range(1,len(l)):\r\n ch+=(\" \"+str(s))*l[i]\r\n if i!=pos:\r\n ch1+=(\" \"+str(s))*l[i]\r\n else:\r\n ch1+=\" \"+str(s-1)+(\" \"+str(s))*(l[i]-1)\r\n s+=l[i]\r\n print(ch)\r\n print(ch1)", "n = int(input())\r\n\r\nh = [int(i) for i in input().split()]\r\n\r\nflag = 0\r\nfor i in range(n):\r\n if h[i] >= 2 and h[i+1] >= 2:\r\n flag = i\r\n\r\nif flag:\r\n a = []\r\n c = 0\r\n for i in range(n+1):\r\n for j in range(h[i]):\r\n a.append(c)\r\n c += h[i]\r\n \r\n \r\n b = []\r\n c = 0\r\n for i in range(n+1):\r\n for j in range(h[i]):\r\n if i == flag+1 and j == 0:\r\n b.append(c-1)\r\n else:\r\n b.append(c)\r\n c += h[i]\r\n \r\n \r\n print(\"ambiguous\")\r\n print(\" \".join([str(i) for i in a]))\r\n print(\" \".join([str(i) for i in b]))\r\n\r\nelse:\r\n print(\"perfect\")", "n = int(input())\r\na = list(map(int, input().split()))\r\npre = a[0]\r\nindex = -1\r\nfor i in range(1, n + 1):\r\n if pre >= 2 and a[i] >= 2:\r\n index = i\r\n break\r\n pre = a[i]\r\nelse:\r\n print(\"perfect\")\r\n exit()\r\n\r\nprint(\"ambiguous\")\r\nN = sum(a)\r\nR = [0]\r\nfor i in range(1, n + 1):\r\n k = len(R)\r\n for j in range(a[i]):\r\n R.append(k)\r\n\r\nL = [0]\r\nflag = False\r\nfor i in range(1, n + 1):\r\n k = len(L)\r\n m = 0\r\n if i == index:\r\n L.append(k - a[i - 1] + 1)\r\n m = 1\r\n for j in range(a[i] - m):\r\n L.append(k)\r\n\r\nprint(*R)\r\nprint(*L)", "n=int(input())\r\narr=list(map(int,input().strip().split(' ')))\r\nans=0\r\nj=arr[1]\r\nfor i in range(2,n+1):\r\n\tif(j>1 and arr[i]>1):\r\n\t\tans=1\r\n\t\tbreak\r\n\tj=arr[i]\r\nif(ans==0):\r\n\tprint(\"perfect\")\r\nelse:\r\n\tprint(\"ambiguous\")\r\n\tprint(0,end=' ')\r\n\tfor i in range(arr[1]):\r\n\t\tprint(1,end=' ')\r\n\tprev=1+arr[1]\r\n\t\r\n\tfor i in range(2,n+1):\r\n\t\tfor j in range(arr[i]):\r\n\t\t\tprint(prev,end=' ')\r\n\t\tprev+=arr[i]\r\n\tprint()\r\n\tprint(0,end=' ')\r\n\tfor i in range(arr[1]):\r\n\t\tprint(1,end=' ')\r\n\tk=arr[1]\r\n\tprev=1+arr[1]\r\n\tflag=0\r\n\tfor i in range(2,n+1):\r\n\t\tif(k>1 and arr[i]>1 and flag==0):\r\n\t\t\tprint(prev-1,end=' ')\r\n\t\t\tflag=1\r\n\t\t\tfor j in range(arr[i]-1):\r\n\t\t\t\tprint(prev,end=' ')\r\n\t\telse:\r\n\t\t\tfor j in range(arr[i]):\r\n\t\t\t\tprint(prev,end=' ')\r\n\t\tprev+=arr[i]\r\n\t\tk=arr[i]\r\n\tprint()\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin as cin\r\nfrom sys import stdout as cout\r\n\r\ndef main():\r\n h = int(cin.readline())\r\n a = list(map(int, cin.readline().split()))\r\n f = 1\r\n for i in range(h):\r\n if a[i] > 1 and a[i + 1] > 1:\r\n f = 0\r\n break\r\n if f:\r\n print('perfect')\r\n return\r\n print('ambiguous')\r\n s = sum(a)\r\n b = [0] * s\r\n c = [0] * s\r\n w = 1\r\n r = 1\r\n f = 1\r\n for i in range(1, len(a)):\r\n for j in range(a[i]):\r\n b[w] = r\r\n c[w] = r\r\n if f and a[i - 1] > 1 and a[i] > 1:\r\n f = 0\r\n c[w] -= 1\r\n w += 1\r\n r = w\r\n print(*b)\r\n print(*c)\r\n\r\nmain()\r\n", "h = int( input() )\r\n\r\nnums = [int(x) for x in input().split()]\r\n\r\nif not any([nums[i] > 1 and nums[i+1] > 1 for i in range(h)]):\r\n print('perfect')\r\nelse:\r\n print('ambiguous')\r\n # tree 1\r\n cur = 1\r\n flag = False\r\n print(0, end=' ')\r\n for l in range(1, h+1):\r\n [print(cur, end=' ') for i in range(nums[l])]\r\n cur += nums[l]\r\n print()\r\n # tree 2\r\n cur = 1\r\n flag = False\r\n print(0, end=' ')\r\n for l in range(1, h+1):\r\n if not flag and nums[l] > 1 and nums[l-1] > 1:\r\n # can be different here!\r\n flag = True\r\n print(cur-1, end=' ')\r\n [print(cur, end=' ') for i in range(nums[l]-1)]\r\n else:\r\n [print(cur, end=' ') for i in range(nums[l])]\r\n cur += nums[l]\r\n\r\n", "h = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nprev = 0\r\nambiguous = False\r\nind = 0\r\nfor i in a:\r\n if i>1 and prev>1:\r\n ambiguous = True\r\n break\r\n prev = i\r\n ind += 1\r\nif ambiguous:\r\n print(\"ambiguous\")\r\n res = []\r\n lenSeq = 0\r\n for i in a:\r\n res += [lenSeq]*i\r\n lenSeq += i\r\n print(*res)\r\n lenSeq = 0\r\n for i in a[:ind]:\r\n lenSeq += i\r\n res[lenSeq+1] -= 1\r\n print(*res)\r\nelse:\r\n print(\"perfect\")", "n=int(input())\n\na=list(map(int,input().split()))\n\np=[]\n\nq=[]\n\nr=0\n\nls=-1\n\nfor i in a:\n\n for j in range(i):\n\n p.append(r)\n\n if j:q.append(r-(ls>1))\n\n else:q.append(r)\n\n r+=i\n\n ls=i\n\nif p==q:print('perfect')\n\nelse:\n\n print('ambiguous')\n\n print(*p)\n\n print(*q)\n\n\n\n# Made By Mostafa_Khaled", "''' Hey stalker :) '''\nINF = 10**10\ndef main():\n print = out.append\n ''' Cook your dish here! '''\n h = get_int()\n li = get_list()\n possible = False\n for i in range(h):\n if li[i]>1 and li[i+1]>1:\n possible = True\n break\n if not possible:\n print(\"perfect\")\n return\n res1 = []\n res2 = []\n for index, i in enumerate(li):\n ele = len(res1)\n for _ in range(i):\n res1.append(ele)\n res2.append(ele)\n if index > 0 and li[index - 1] > 1 and i > 1: res2[-1] -= 1\n print(\"ambiguous\")\n print(\" \".join(map(str, res1)))\n print(\" \".join(map(str, res2)))\n #print(\" \".join(res2))\n\n\n\n''' Pythonista fLite 1.1 '''\nimport sys\n#from collections import defaultdict, Counter\n#from bisect import bisect_left, bisect_right\n#from functools import reduce\n#import math\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\nout = []\nget_int = lambda: int(input())\nget_list = lambda: list(map(int, input().split()))\nmain()\n#[main() for _ in range(int(input()))]\nprint(*out, sep='\\n')\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n#print(a)\r\nans = -1\r\nq = -1\r\nq2 = -1\r\nfor i in range(len(a)-1):\r\n if a[i] > 1 and a[i+1] > 1:\r\n q = i\r\n \r\n \r\n \r\nif q > 0:\r\n prev = 0\r\n res = [0]\r\n cur = 1\r\n print('ambiguous')\r\n for i in range(1, len(a)):\r\n res.extend([cur]*a[i])\r\n cur += a[i]\r\n print(*res)\r\n \r\n res = [0]\r\n cur = 1\r\n mem = -1\r\n for i in range(1, len(a)):\r\n \r\n if i == q:\r\n mem = cur\r\n if i -1 != q:\r\n res.extend([cur]*a[i])\r\n cur += a[i]\r\n \r\n else:\r\n res.extend([cur]*(a[i]-1))\r\n res.append(mem+1)\r\n cur += a[i]\r\n \r\n print(*res)\r\n \r\n \r\nelse:\r\n print('perfect')", "# https://codeforces.com/contest/902\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nh = int(input())\na = list(map(int, input().split()))\n\ni = next((j for j in range(1, h + 1) if a[j] >= 2 and a[j - 1] >= 2), -1)\nif i == -1:\n print(\"perfect\")\nelse:\n t1, t2 = [0], [0]\n parent = 1\n for j in range(1, h + 1):\n if j == i:\n t1 += [parent] + [parent + 1] * (a[j] - 1)\n t2 += [parent + 1] * a[j]\n else:\n t1 += [parent] * a[j]\n t2 += [parent] * a[j]\n parent += a[j - 1]\n print(\"ambiguous\")\n print(*t1)\n print(*t2)\n", "def do_amb(v, n, sum):\r\n print(\"ambiguous\")\r\n diff = []\r\n \r\n for i in v:\r\n temp = len(diff)\r\n diff.extend((temp for j in range(i)))\r\n print(\" \".join(str(i) for i in diff))\r\n diff[sum+1] = sum-1\r\n print(\" \".join(str(i) for i in diff))\r\n \r\nn = int(input())\r\nv = [int(i) for i in input().split()]\r\nans = []\r\nind = -1\r\nsum = 0\r\nfor i in v:\r\n if i != 1 and v[ind] != 1:\r\n do_amb(v, ind, sum)\r\n exit()\r\n sum+=i\r\n ind+=1\r\n \r\nprint(\"perfect\")", "h = int(input())\r\na = map(int, input().split())\r\n\r\nw, q = [], []\r\np = r = 0\r\n\r\nfor i in a:\r\n for j in range(i):\r\n w.append(r)\r\n q.append(r - (j and p > 1))\r\n\r\n p = i\r\n r += i\r\n\r\nif w == q:\r\n print('perfect')\r\nelse:\r\n print('ambiguous')\r\n print(*w)\r\n print(*q)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nt1 = []\r\nalert = 0\r\nrecord = 0\r\nfor i in range(n + 1):\r\n if a[i] != 1:\r\n if alert == 1:\r\n t1.append(0)\r\n record = i\r\n break\r\n else:\r\n alert = 1\r\n else:\r\n alert = 0\r\nif t1 == []:\r\n print('perfect')\r\n exit(0)\r\nprint('ambiguous')\r\nindex = 1\r\nfor x in a[1:]:\r\n for i in range(x):\r\n t1.append(index)\r\n index += x\r\nt2 = t1[:]\r\nchange = sum(a[:record])\r\ni = t1.index(change)\r\nt2[i] -= 1\r\n# print(index)\r\nprint(*t1)\r\nprint(*t2)", "h = int(input())\r\na = list(map(int, input().split()))\r\nk = 0\r\nfor i in range(h):\r\n if a[i] > 1 and a[i + 1] > 1:\r\n k = i + 1\r\n break\r\nelse:\r\n print('perfect')\r\n exit()\r\nprint('ambiguous')\r\n\r\nh1 = 1\r\np = 1\r\nprint(0, end=' ')\r\nwhile h1 <= h:\r\n for i in range(a[h1]):\r\n print(p, end=' ')\r\n p += a[h1 - 1]\r\n h1 += 1\r\nprint('')\r\n\r\nh1 = 1\r\np = 1\r\nprint(0, end=' ')\r\nwhile h1 <= h:\r\n if h1 == k:\r\n for i in range(a[h1] - 1):\r\n print(p, end=' ')\r\n print(p + 1, end=' ')\r\n p += a[h1 - 1]\r\n h1 += 1\r\n continue\r\n for i in range(a[h1]):\r\n print(p, end=' ')\r\n p += a[h1 - 1]\r\n h1 += 1", "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 = int(input())\r\n e = get_array()\r\n flag = False\r\n bp = 0\r\n for i in range(n):\r\n if e[i] > 1 and e[i + 1] > 1:\r\n flag = True\r\n bp = i + 1\r\n break\r\n print(\"ambiguous\" if flag else \"perfect\")\r\n if flag:\r\n a, b = [], []\r\n i = 0\r\n val = 0\r\n while i < n + 1:\r\n for _ in range(e[i]):\r\n a.append(val)\r\n b.append(val)\r\n if i == bp: b[-1] -= 1\r\n val += e[i]\r\n i += 1 \r\n print_array(a)\r\n print_array(b)\r\nif __name__ == \"__main__\":\r\n main()", "\"\"\"\nNTC here\n\"\"\"\nimport sys\ninp= sys.stdin.readline\ninput = lambda : inp().strip()\nflush= sys.stdout.flush\n# import threading\n# sys.setrecursionlimit(10**6)\n# threading.stack_size(2**25)\n\ndef iin(): return int(input())\ndef lin(): return list(map(int, input().split()))\n\n# range = xrange\n# input = raw_input\n\n\ndef main():\n \n h =iin()\n a = lin()\n ans = 0 \n for i in range(h):\n if a[i]>1 and a[i+1]>1:\n ans = 1\n break\n if ans == 0:\n print('perfect')\n else:\n print('ambiguous')\n sol1 = [0]\n sol2 = [0]\n #for 1st\n pv = 1\n ch = 1\n sm = a[0]\n for i in range(1,h+1):\n for j in range(a[i]):\n ch+=1\n sol1.append(pv)\n pv = sm+1\n sm+=a[i]\n \n #for 2nd\n ch = 1\n did = 0\n pv = 1\n sm = a[0]\n for i in range(1, h+1):\n for j in range(a[i]):\n ch+=1\n sol2.append(pv)\n if did == 0:\n if a[i-1]>1 and a[i]>1:\n # print(sol2,pv+1)\n sol2[-1]+=1\n did = 1\n pv = sm + 1\n sm += a[i] \n print(*sol1)\n print(*sol2)\n\n\n\n\n\n\n \n \n\n \nmain()\n# threading.Thread(target=main).start()\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(2, n + 1):\r\n if a[i] != 1 and a[i - 1] != 1:\r\n print('ambiguous')\r\n break\r\nelse:\r\n print('perfect')\r\n exit()\r\ns1 = ''\r\ns2 = ''\r\ncnt = 0\r\nfor i in range(n + 1):\r\n s1 += a[i] * (str(cnt) + ' ')\r\n if i > 1 and a[i] != 1 and a[i - 1] != 1:\r\n s2 += str(cnt - 1) + ' '\r\n s2 += (a[i] - 1) * (str(cnt) + ' ')\r\n else:\r\n s2 += a[i] * (str(cnt) + ' ')\r\n cnt += a[i]\r\nprint(s1)\r\nprint(s2)" ]

[ "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\n#input,print = stdin.readline,stdout.write\r\n\r\nn = input()\r\nprint(n+n[::-1])", "s = input()\r\nss = s[::-1]\r\nprint(s+ss)", "s = input()\nprint(s + ''.join(reversed(s)))", "n = int(input())\r\nn = str(n)\r\nnn = n[::-1]\r\nres = ''\r\nres += n\r\nres += nn\r\nprint(res) ", "def solve():\r\n n = input()\r\n print(n + ''.join(reversed(n)))\r\n return\r\n\r\nsolve()", "s = input()\nt = s\nfor i in range(len(s)-1, -1, -1):\n t+=s[i]\n\nprint(t)\n\n\t \t\t\t\t\t \t \t\t\t \t\t \t \t\t\t \t \t", "n = int(input())\r\n\r\nif n<10 :\r\n print(n*11)\r\nelse:\r\n h = str(n)\r\n k = h[::-1]\r\n print(h+k)", "n = input ()\r\nprint (n + n [ : : -1])", "# from sys import stdin, stdout\r\n\r\n# import re\r\n# import string\r\n\r\n# import math\r\n# import statistics\r\n# import itertools\r\n# import collections\r\n# import cmath\r\n# import calendar\r\n# import datetime\r\n\r\n# import operator\r\n\r\n#----------Profiling----------\r\n# import cProfile\r\n# import pstats\r\n\r\nstring = input()\r\nans = ''\r\nfor i in range(-1, -len(string)-1, -1):\r\n ans = ans + string[i]\r\nprint(string+ans)\r\n \r\n", "n = input()\r\nprint(n,end='')\r\nprint(n[::-1],end=\"\")\r\n\r\n\r\n\r\n", "import sys\r\n\r\ntry:\r\n t=1\r\n while(t):\r\n t-=1\r\n \r\n #n=int(input())\r\n s=input()\r\n print(s+''.join(reversed(s)))\r\n\r\nexcept:\r\n pass\r\n\r\n", "import sys\nimport math\ninput = sys.stdin.readline\n\ns = input().strip()\nprint(s + s[::-1])\n", "x = input()\r\ny = x[::-1]\r\nz = x+y\r\nprint(z)", "n = int(input())\nl = n // 10\nif l < 1: print(f\"{n}{n}\")\nelse:\n r = l = str(l)\n r = r[::-1]\n print(f\"{l}{n%10}{n%10}{r}\")", "\r\n\r\na = input()\r\n\r\nprint( a + a[::-1] )\r\n", "val = input()\nprint(val+val[::-1])\n# comment because code is too short\n\t \t\t \t\t\t \t\t\t\t \t \t \t", "num=input()\r\nll=len(num)\r\nfor x in range(ll-1,-1,-1):\r\n num+=num[x]\r\nprint(num)", "s=input()\r\nans=s\r\nans+=s[::-1]\r\nprint(ans)", "\n\n# https://codeforces.com/contest/688/problem/B\ndef split(word):\n return [char for char in word]\n\ndef listToString(s): \n \n # initialize an empty string\n str1 = \"\" \n \n # traverse in the string \n for ele in s: \n str1 += ele \n \n # return string \n return str1 \n\nx = input()\nprint(x,end='')\n\ns = split(x)\nn = len(s)\n\n# for i in range(n):\n# \ts[i] = int(s[i])\n\nfor i in range(n):\n\tprint(s[n-1-i],end='')\n\n", "s=list(input())\r\nk=s+[]\r\ns.reverse()\r\nprint(\"\".join(k+s))", "n = list(input())\r\n\r\nprint(''.join(n + n[::-1]))", "n=int(input())\r\ns=''\r\ns+=str(n)\r\ns+=str(n)[::-1]\r\nprint(s)", "s=input();print(s+s[::-1])\n#s=input();print(s+s[::-1])\n#s=input();print(s+s[::-1])\n#s=input();print(s+s[::-1])\n#s=input();print(s+s[::-1])\n#s=input();print(s+s[::-1])\n#s=input();print(s+s[::-1])\n\t \t \t\t\t\t\t\t \t\t \t\t \t\t \t \t \t\t", "n = input()\r\npalindrom = n + n[::-1]\r\nprint(palindrom)", "def solve():\r\n n = input()\r\n return f'{n}{n[::-1]}'\r\nprint(solve())", "n = str(input())\r\nn2=n+n[::-1]\r\nprint(n2)", "def solve():\r\n q=int(input())\r\n #q,w=map(int,input().split())\r\n #e=list(map(int,input().split()))\r\n q=str(q)\r\n print(q,end='')\r\n w=[]\r\n for i in q:\r\n w.append(i)\r\n for i in range(len(w)-1,-1,-1):\r\n print(w[i],end='')\r\na=1\r\n#a=int(input())\r\nfor i in range(a):\r\n solve()\r\n", "\r\nnum = int(input())\r\nnum = str(num)\r\n\r\nsub = num\r\n\r\nsub = sub[::-1]\r\n\r\n\r\nprint(num+sub)\r\n\r\n", "data = input()\r\nprint(data + data[::-1])\r\n", "n=int(input())\r\ns=str(n)\r\nc=len(s)\r\nx=''\r\nwhile c>0:\r\n x+=s[c-1]\r\n c-=1\r\no=s+x\r\nprint(o)", "def sol(n):\r\n return n + n[::-1]\r\n\r\nif __name__ == '__main__':\r\n\r\n n = input()\r\n print(sol(n))", "a= str(input())\r\n\r\nb=a[::-1]\r\nprint(a+b)", "n = int(input())\r\nprint(n, str(n)[::-1], sep='')", "\r\nt = input()\r\nif len(t)==1:\r\n print(t+t)\r\nelse:\r\n t1 = ''.join(reversed(t))\r\n print(t+t1)", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\ns = inpu().rstrip('\\n')\r\nprin(f\"{s}{s[::-1]}\\n\")", "def main():\r\n # input\r\n n = int(input())\r\n\r\n # soln\r\n s = str(n)\r\n print(s + s[::-1])\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = input()\r\nl = len(n)\r\nfor i in range(l):\r\n\tn += n[l-i-1]\r\nprint(n)", "import math\nn = input()\nn = n + n[::-1]\nprint(n)\n", "n = int(input())\ns = str(n)\nprint(s + s[::-1])", "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 = input()\n print(n + \"\".join([x for x in reversed(n)]))\n\n\nif __name__ == \"__main__\":\n main()\n", "n=input()\r\nans=n+n[::-1]\r\nprint(ans)", "def create_palindrom():\r\n n = input()\r\n print(n+n[::-1])\r\n\r\ncreate_palindrom()\r\n", "n = input()\r\noutput = \"\"\r\noutput+=n\r\n\r\nn = list(n)\r\n\r\nfor i in range(len(n)-1, -1, -1):\r\n\r\n output+=n[i]\r\n\r\nprint(output)", "import math\r\ndef solve():\r\n n=input()\r\n \r\n print(n+n[::-1]) \r\n\r\n#while t>0:\r\nsolve()\r\n # t-=1", "b=input()\r\nb+=b[::-1]\r\nprint(b)", "n = int(input())\r\nif(n<=9):\r\n print(str(n)+str(n))\r\nelse:\r\n print(str(n)+str(n)[::-1])\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = input().rstrip().decode()\r\nans = n + n[::-1]\r\nprint(ans)", "q = input()\r\nprint(q+\"\"+q[::-1])", "n = input()\nn1 = n[::-1]\nprint(n + n1)\n\t\t\t \t \t\t\t \t\t \t \t\t \t \t\t\t\t\t", "def yzd_solution(n):\r\n\r\n s = str(n)\r\n return s + \"\" + s[::-1]\r\n\r\n\r\n\r\nn = int(input())\r\nprint(yzd_solution(n))", "# import sys\n# sys.stdin=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/input.txt\",\"r\")\n# sys.stdout=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/output.txt\",\"w\")\n\nimport math\nfor _ in range(1):\n n=input()\n print(n,n[::-1],sep='')\n \n\n \n \n\n\n \n\n\n\n\n\n\n \n\n\n", "l1 = list(input())\r\nl2 = l1.copy()\r\nl2.reverse()\r\nprint(\"\".join(l1)+\"\".join(l2))\r\n", "n = int(input())\r\ns = str(n)\r\nfor i in range(len(s)-1,-1,-1):\r\n s+= s[i]\r\nprint(s)", "n = int(input())\r\nn_str = str(n)\r\nn_str_rev = n_str[::-1]\r\nprint(n_str+n_str_rev)\r\n", "n = int(input())\r\nre = reversed(str(n))\r\nprint(n,*re,sep=\"\")", "a=str(input())\r\nprint(a+a[::-1])", "import sys\nimport math\nfrom collections import defaultdict\nimport itertools\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n sys.stdout.write()\n pass\n\n\ndef solve(ans):\n pass\n\n\ndef readinput():\n k = getString()\n print(k + ''.join([i for i in reversed(k)]))\n\nreadinput()\n", "from collections import deque\r\nfrom collections import Counter\r\nfrom itertools import permutations\r\nimport heapq\r\n\r\ndef counterExample():\r\n arr = [1, 3, 4, 1, 2, 1, 1, 3, 4, 3, 5, 1, 2, 5, 3, 4, 5]\r\n counter = Counter(arr)\r\n top_three = counter.most_common(3)\r\n print(top_three)\r\n\r\nq = deque()\r\n\r\n#For stack we have:\r\n#q.append()\r\n#q.pop()\r\n\r\n#For queue we have:\r\n#q.append()\r\n#q.popleft()\r\n\r\n\r\n#for heap we have:\r\n#heapify(a list)\r\n#heapq.heappush()\r\n#heapq.heappop()\r\n#heapq.nlargest(k, iterable, key = fun)\r\n#heapq.nsmallest(k, iterable, key = fun)\r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n n = input()\r\n print (n + n[::-1])\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\nk = str(n)\nprint(k +\"\".join(reversed(k)))\n\n", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\noutput = str(n) + str(n)[::-1] \r\nstdout.write(output)", "def solve():\n n = input()\n print(''.join([n, n[::-1]]))\n\nif __name__ == '__main__':\n solve()\n \n", "import string\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nread=lambda :map(lambda s:int(s),input().strip().split())\r\nreadi=lambda :int(input())\r\nfrom collections import defaultdict,Counter,deque\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\nimport heapq\r\nfrom random import randint\r\nfrom math import gcd,ceil\r\nRANDOM = randint(1, 10 ** 9)\r\nclass Wrapper(int):\r\n def __hash__(self):\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\ns=input().strip()\r\nprint(s+s[::-1])\r\n", "n = input()\r\nout = n + n[::-1]\r\nprint(out)", "n = input()\r\nn2 = \"\"\r\nfor i in range(len(n)-1, -1, -1):\r\n n2 += (n[i])\r\n\r\nprint(n + n2)", "# https://codeforces.com/contest/688/problem/B\r\n\r\na=input()\r\nprint(a+a[::-1])", "if __name__ == '__main__':\r\n n = input()\r\n x = list(n)\r\n x.reverse()\r\n x = ''.join(x)\r\n print(n + x)\r\n", "#688B Lovely Palindrome\r\nn=input()\r\ns=n+n[::-1]\r\nprint(s)", "s=input()\r\nprint(s,end=\"\")\r\nfor i in range(len(s)-1,-1,-1):\r\n print(s[i],end=\"\")", "#author: riyan\r\n\r\nif __name__ == '__main__': \r\n inp = input()\r\n print(inp + inp[::-1])\r\n ", "def main(n):\r\n \r\n return (n+\"\".join(reversed(n)))\r\n\r\nn=input()\r\nprint(main(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\nimport math\r\n# t=int(input())\r\n# for i in range(t):\t\t\r\nn=input()\r\nprint(n+n[::-1])\r\n", "number = str(input())\r\nprint(number + number[::-1])", "n = [x for x in input()]\r\nx = len(n)\r\n\r\nfor j in range(x-1,-1,-1):\r\n n.append(n[j])\r\nprint(\"\".join(n))\r\n \r\n\r\n", "N = input(); print(N + N[::-1])\r\n", "n = input()\n\nprint(n + n[::-1])", "n=input()\r\np=n+n[::-1]\r\nprint(p)", "n=input()\r\n\r\ns=n\r\nfor i in range(len(n)):\r\n s=s+n[len(n)-1-i]\r\n\r\nprint(s)\r\n", "n=int(input());s=str(n)\r\nprint(s+s[::-1])\r\n", "n = input()\r\nnum = n + n[::-1]\r\nprint(num)\r\n", "n=list(input())\r\nans=n+n[::-1]\r\nprint(''.join(ans))", "def inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\n \r\nif __name__ == \"__main__\":\r\n x = insr()\r\n _x = x[::-1]\r\n\r\n x.extend(_x) \r\n x = ''.join([i for i in x])\r\n\r\n print(x)", "n = int(input())\r\n\r\na = \"\"\r\n\r\na += str(n)\r\n\r\nb = a\r\n\r\nb = b[::-1]\r\n\r\n\r\na += b\r\n\r\nprint(a)", "def solve(n):\r\n\r\n\tsegments = [(n[max(0, i - 10): i]) for i in range(len(n), 0, -10)]\r\n\r\n\tsegments[-1] = segments[-1].lstrip('0')\r\n\r\n\tans = ''\r\n\tfor i in range(len(segments) - 1, -1, -1): ans += segments[i]\r\n\r\n\treturn ans + ans[::-1]\r\n\r\nprint(solve(input()))\r\n", "n = input()\r\nn = n+ ''.join(reversed(n))\r\nprint(n)", "n = input()\r\nans = [n]\r\nfor i in range(len(n)-1, -1, -1):\r\n ans.append(n[i])\r\nprint(\"\".join(ans))", "n = input()\r\nx = n[::-1]\r\nprint(n+x)", "#Program for finding the nth even length palindrome number\nn=input()\np=n[::-1]\nc=n+p\nprint(c)\n\t \t \t\t \t \t \t \t\t\t \t\t \t\t\t", "n = int(input())\r\nlis = [ str(i)+str(i) for i in range(0,10)]\r\nif n<10:\r\n print(lis[n])\r\nelse:\r\n pali = str(n)+str(n)[::-1]\r\n print(pali)", "n = input()\r\nl = 2*len(n)\r\nprint(n+n[l-1::-1])", "#https://codeforces.com/problemset/problem/688/B\r\n\r\nn = input()\r\nanswer = int(n+n[::-1])\r\nprint(answer)", "st = input()\r\nprint(st + st[::-1])", "n = str(input())\r\nprint (n + ''.join(reversed(n)))", "s=input()\r\ns1=\"\"\r\ns1+=s[::-1]\r\nprint(s+s1)", "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\ns=str(input())\r\nprint(s+\"\".join(reversed(s)))\r\n", "n=str(input())\r\na=list(n)\r\na.reverse()\r\nprint(n+(''.join(a)))", "n = input()\r\nprint(n[0::], n[-1::-1], sep='')", "n = input()\r\nn= n + ''.join(reversed(n))\r\nprint (n)", "n = input()\n\ndef reverse(s):\n return s[::-1]\n\nprint((n) + reverse(n))", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn = list(input())\r\ntemp = n.copy()\r\ntemp.reverse()\r\nprint(\"\".join(n) + \"\".join(temp))\r\n", "getInts = lambda : list(map(int,input().split()))\r\n\r\nn = input()\r\nans = n + n[::-1]\r\nprint(ans)", "n = input()\r\n\r\nr = n[::-1]\r\n\r\na = n+r\r\nprint(a)", "n=input()\r\ns=n[::-1]\r\nk=n+s\r\nprint(k)\r\n", "# B. Lovely Palindromes\r\n\r\nuserInput = input()\r\nprint(f'{userInput}{userInput[::-1]}')\r\n", "s = input()\r\nprint(s, end = \"\")\r\nlongueur = len(s) \r\nfor iLongueur in range(longueur) : \r\n print(s[longueur-iLongueur-1], end = \"\") ", "n = input()\nres = n\nl = len(n)\nfor i in range(l-1,-1,-1):\n res+=n[i]\nprint(res)\n", "# your code goes here\r\n\r\nfrom sys import stdin, stdout\r\n\r\nn = stdin.readline().strip()\r\nstdout.write(n)\r\nstdout.write(n[::-1])", "#bisect.bisect_left(a, x, lo=0, hi=len(a)) is the analog of std::lower_bound()\r\n#bisect.bisect_right(a, x, lo=0, hi=len(a)) is the analog of std::upper_bound()\r\n#from heapq import heappop,heappush,heapify #heappop(hq), heapify(list)\r\n#from collections import deque as dq #deque e.g. myqueue=dq(list)\r\n#append/appendleft/appendright/pop/popleft\r\n#from bisect import bisect as bis #a=[1,3,4,6,7,8] #bis(a,5)-->3\r\n#import bisect #bisect.bisect_left(a,4)-->2 #bisect.bisect(a,4)-->3\r\n#import statistics as stat # stat.median(a), mode, mean\r\n#from itertools import permutations(p,r)#combinations(p,r)\r\n#combinations(p,r) gives r-length tuples #combinations_with_replacement\r\n#every element can be repeated\r\n \r\nimport sys, threading\r\nimport math\r\nimport time\r\nfrom os import path\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\nfrom functools import cmp_to_key\r\nimport heapq\r\n \r\n \r\n# # # # # # # # # # # # # # # #\r\n# JAI SHREE RAM #\r\n# # # # # # # # # # # # # # # #\r\n\r\n \r\ndef lcm(a, b):\r\n return (a*b)//(math.gcd(a,b))\r\n \r\n \r\nsi= lambda:str(input())\r\nii = lambda: int(input())\r\nmii = lambda: map(int, input().split())\r\nlmii = lambda: list(map(int, input().split()))\r\ni2c = lambda n: chr(ord('a') + n)\r\nc2i = lambda c: ord(c) - ord('a')\r\n\r\n'''\r\nFor simplifications, in the following solution we define lovely integer as an even-length positive palindrome number.\r\n\r\nAn even-length positive integer is lovely if and only if the first half of its digits is equal to the reverse of the second half.\r\n\r\nSo if a and b are two different 2k-digit lovely numbers, then the first k digits of a and b differ in at least one position.\r\n\r\nSo a is smaller than b if and only if the first half of a is smaller than the the first half of b.\r\n\r\nAnother useful fact: The first half of a a lovely number can be any arbitrary positive integer.\r\n\r\nUsing the above facts, it's easy to find the first half of the n-th lovely number — it exactly equals to integer n. When we know the first half of a lovely number, we can concatenate it with its reverse to restore the lovely integer. To sum up, the answer can be made by concatenating n and it's reverse together.\r\n\r\n\r\n'''\r\n \r\ndef solve():\r\n n=si()\r\n rev_n=n[::-1]\r\n new_string = n+rev_n\r\n number = int(new_string)\r\n\r\n print(number)\r\n\r\n\r\n \r\n \r\ndef main():\r\n\r\n solve()\r\n \r\nif __name__ == '__main__':\r\n main()\r\n \r\n \r\n\r\n\r\n", "s = input()\r\nres = s\r\nfor i in range(len(s)-1, -1, -1):\r\n res += s[i]\r\nprint(res)", "#\tAuthor\t: debugster\r\n#\tEmail\t: [email protected]\r\n#\tDate\t: 2020-06-21 20:03:31\r\n\r\nimport sys\r\nimport os\r\n\r\ndef get_int():\r\n return map(int, input().split())\r\n\r\ndef get_array():\r\n return list(map(int, input().split()))\r\n\r\ndef str_replacer(old_str, new_str, index):\r\n if index in range(len(old_str)):\r\n return old_str[:index] + new_str + old_str[index + 1:]\r\n else:\r\n return old_str\r\n\r\nif os.environ.get(\"DEBUGSTER_PYTHON\"):\r\n sys.stdin = open('in.txt', 'r')\r\n sys.stdout = open('out.txt','w')\r\n\r\ns = input()\r\nprint(s + s[-1::-1])", "# list(map(int,input().split()))\r\nn=input()\r\nprint(n+''.join(reversed(n)))", "n = input()\nprint(n+n[::-1])\n# for i in range(1,10000000000):\n# if str(i)== str(i)[::-1] and len(str(i))%2==0:\n# if n ==1 :\n# print(i)\n# break\n# n -=1\n", "n = int(input())\r\n\r\nprint(f\"{n}{str(n)[::-1]}\")", "n=int(input())\r\nl=list(str(n))\r\nx=[]\r\nfor i in range(1,len(l)+1):\r\n x.append(l[len(l)-i])\r\nprint(str(n)+ ''.join(str(i) for i in x)) ", "a=input()\r\nk=a[::-1]\r\nprint(a,k,sep='')", "val = input()\nprint(val+val[::-1])\n#first time i'm using python \n \t\t \t \t\t \t \t\t\t \t \t \t\t \t", "n = input()\r\nn += n[::-1]\r\nprint(n)", "number = input()\nnumber2=number+number[::-1]\nprint(number2)\n \t \t\t\t\t \t \t\t\t \t\t \t \t\t \t\t\t", "n = input()\r\nm = ''.join(reversed(n))\r\nprint(n,end='')\r\nprint(m)", "n=input()\r\nn1=list(n)\r\nn1.reverse()\r\nn2=''.join(n1)\r\nprint(n+n2)", "n = input()\nres = n + n[::-1]\nprint(res)\n", "def solve(n):\n return n + n[::-1]\n\n\ndef main():\n n = input()\n print(solve(n))\n\n\nmain()\n", "n = [str(x) for x in input().split()][0]\nprint (n + n[::-1])", "n = input()\r\nres = n\r\nif int(n)<10:\r\n print(n*2)\r\nelse:\r\n print(n + n[::-1])", "n=list(input())\r\nn1=n*1\r\nn.reverse()\r\nans=''\r\nfor x in range(len(n)):\r\n print(n1[x],end='')\r\nfor x in range(len(n)):\r\n print(n[x],end='')\r\n", "t=input()\r\ns=t[::-1]\r\nprint(t+s)", "\r\n\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\n\r\ns=input();print(s+s[::-1])\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n", "ch= input()\r\nprint(ch+ch[::-1])", "n=int(input())\r\na= [int(x) for x in str(n)]\r\nb=a[:]\r\nb.reverse()\r\nc=a+b\r\ns = ''.join(str(x) for x in c)\r\nprint(s)", "s1= input()\r\nl=list(s1)\r\nl.reverse()\r\ns2=''.join(l)\r\nprint(s1+s2)", "def sol():\r\n n=input()\r\n print(n+n[::-1])\r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\nsol()\r\n", "n = input()\r\nfor i in reversed(range(len(n))):\r\n n += n[i]\r\nprint(n)", "import statistics\r\nimport math\r\nimport datetime\r\nfrom collections import Counter\r\nimport itertools\r\n\r\nn = input()\r\n\r\nprint(n + n[::-1])\r\n", "X=input()\r\nprint(X+X[::-1])", "\"Codeforces Beta Round #6 (Div. 2\"\n\"B. President's Office\"\n# n,m,p=input().split()\n# n=int(n)\n# m=int(m)\n# a=[]\n# s=set()\n# for i in range(n):\n# l=list(input())\n# a.append(l)\n# l=[]\n# for i in range(n):\n# for j in range(m):\n# if a[i][j]==p:\n# l.append([i,j])\n \n# for i in l:\n# x=i[0]\n# y=i[1]\n# if x+1>=0 and x+1<n:\n# if a[x+1][y]!='.' and a[x+1][y]!=p:\n# s.add(a[x+1][y])\n# if y+1>=0 and y+1<m:\n# if a[x][y+1]!='.' and a[x][y+1]!=p:\n# s.add(a[x][y+1]) \n# if x-1>=0 and x-1<n:\n# if a[x-1][y]!='.' and a[x-1][y]!=p:\n# s.add(a[x-1][y])\n# if y-1>=0 and y-1<m:\n# if a[x][y-1]!='.' and a[x][y-1]!=p:\n# s.add(a[x][y-1]) \n\n# print(len(s))\n\"Codeforces Round #360 (Div. 2)\"\n\"B. Lovely Palindromes\"\ny=input()\nprint(y+y[::-1])", "n = input()\r\nn1 = n[::-1]\r\nn2 = n + n1\r\nif n2 == n2[::-1]:\r\n print(n2)\r\nelse:\r\n for i in range(len(n)):\r\n n2 += n1[i]\r\n if n2 == n2[::-1]:\r\n print(n2)\r\n break", "num = input()\r\nn = len(num)\r\nprint(num + num[::-1])\r\n\r\n", "n = input()\r\n\r\nk = n[::-1]\r\n\r\nprint(n + k)\r\n", "num = input()\r\n\r\nprint(num + ''.join(num [::-1]))", "t = input()\r\nprint(t+ \"\".join(reversed(t)))\r\n", "n = input()\r\ns1 = str(n)\r\ns2 = s1[::-1]\r\nprint(s1 + s2)", "def main():\r\n s = input()\r\n print(s + ''.join(reversed(s)))\r\n\r\n\r\nmain()\r\n", "#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ \t\t⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣶⣿⣿⣿⣿⣿⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣿⣿⣿⠿⠟⠛⠻⣿⠆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⣿⣆⣀⣀⠀⣿⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠻⣿⣿⣿⠅⠛⠋⠈⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⢼⣿⣿⣿⣃⠠⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣟⡿⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣛⣛⣫⡄⠀⢸⣦⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣠⣴⣾⡆⠸⣿⣿⣿⡷⠂⠨⣿⣿⣿⣿⣶⣦⣤⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣤⣾⣿⣿⣿⣿⡇⢀⣿⡿⠋⠁⢀⡶⠪⣉⢸⣿⣿⣿⣿⣿⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣿⣿⣿⣿⣿⣿⣿⣿⡏⢸⣿⣷⣿⣿⣷⣦⡙⣿⣿⣿⣿⣿⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣿⣿⣿⣿⣿⣿⣿⣇⢸⣿⣿⣿⣿⣿⣷⣦⣿⣿⣿⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n#⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣿⣵⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣯⡁⠀⠀⠀⠀⠀⠀\r\n#https://www.youtube.com/watch?v=dQw4w9WgXcQ\r\n#Never gonna give you up\r\n#Never gonna let you down\r\n#Never gonna run around and desert you\r\n#Never gonna make you cry\r\n#Never gonna say goodbye\r\n#Never gonna tell a lie and hurt you\r\nfrom functools import cache\r\nfrom collections import Counter,deque,defaultdict\r\nfrom heapq import heapify\r\nfrom math import ceil,inf,sqrt,floor\r\nfrom itertools import accumulate as acc\r\nfrom sys import stdin\r\nfrom bisect import bisect_left as bi\r\nfrom itertools import permutations\r\n\r\nSins1 = lambda : stdin.readline().rstrip()\r\nSint1 = lambda : int(stdin.readline().rstrip())\r\nSlster = lambda : [int(x) for x in stdin.readline().split()]\r\ndef isvowel(a:str) -> bool:\r\n if a in 'AEIOUaeiou': return True\r\n return False\r\nfrom heapq import heappop,heappush\r\nimport random\r\ndef primesbelow(N):\r\n\tif (N==1):\r\n\t\treturn []\r\n\tif (N==2):\r\n\t\treturn []\r\n\tif (N==3):\r\n\t\treturn [2]\r\n\tcorrection = N % 6 > 1\r\n\tN = {0:N, 1:N-1, 2:N+4, 3:N+3, 4:N+2, 5:N+1}[N%6]\r\n\tsieve = [True] * (N // 3)\r\n\tsieve[0] = False\r\n\tfor i in range(int(N ** .5) // 3 + 1):\r\n\t\tif sieve[i]:\r\n\t\t\tk = (3 * i + 1) | 1\r\n\t\t\tsieve[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)\r\n\t\t\tsieve[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)\r\n\treturn [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve[i]]\r\n\r\nsmallprimeset = set(primesbelow(100000))\r\n_smallprimeset = 100000\r\n\r\n\r\ndef isprime(n, precision=7):\r\n if n <= 3:\r\n return n >= 2\r\n elif n % 2 == 0:\r\n return False\r\n elif n < _smallprimeset:\r\n return n in smallprimeset\r\n d = n - 1\r\n s = 0\r\n while d % 2 == 0:\r\n d //= 2\r\n s += 1\r\n for repeat in range(precision):\r\n a = random.randrange(2, n - 2)\r\n x = pow(a, d, n)\r\n \r\n if x == 1 or x == n - 1: continue\r\n \r\n for r in range(s - 1):\r\n x = pow(x, 2, n)\r\n if x == 1: return False\r\n if x == n - 1: break\r\n else: return False\r\n\r\n return True\r\n\r\n\r\ndef pollard_brent(n):\r\n if n % 2 == 0: return 2\r\n if n % 3 == 0: return 3\r\n\r\n y, c, m = random.randint(1, n-1), random.randint(1, n-1), random.randint(1, n-1)\r\n g, r, q = 1, 1, 1\r\n while g == 1:\r\n x = y\r\n for i in range(r):\r\n y = (pow(y, 2, n) + c) % n\r\n\r\n k = 0\r\n while k < r and g==1:\r\n ys = y\r\n for i in range(min(m, r-k)):\r\n y = (pow(y, 2, n) + c) % n\r\n q = q * abs(x-y) % n\r\n g = gcd(q, n)\r\n k += m\r\n r *= 2\r\n if g == n:\r\n while True:\r\n ys = (pow(ys, 2, n) + c) % n\r\n g = gcd(abs(x - ys), n)\r\n if g > 1:\r\n break\r\n\r\n return g\r\n\r\nsmallprimes = primesbelow(1000)\r\n\r\ndef primefactors(n, sort=False):\r\n factors = []\r\n\r\n for checker in smallprimes:\r\n while n % checker == 0:\r\n factors.append(checker)\r\n n //= checker\r\n if checker > n: break\r\n\r\n if n < 2: return factors\r\n\r\n while n > 1:\r\n if isprime(n):\r\n factors.append(n)\r\n break\r\n factor = pollard_brent(n)\r\n factors.extend(primefactors(factor))\r\n n //= factor\r\n\r\n if sort: factors.sort()\r\n\r\n return factors\r\n\r\ndef factorization(n):\r\n factors = {}\r\n for p1 in primefactors(n):\r\n try:\r\n factors[p1] += 1\r\n except KeyError:\r\n factors[p1] = 1\r\n return factors\r\n\r\ntotients = {}\r\n\r\ndef totient(n):\r\n if n == 0: return 1\r\n\r\n try: return totients[n]\r\n except KeyError: pass\r\n\r\n tot = 1\r\n for p, exp in factorization(n).items():\r\n tot *= (p - 1) * p ** (exp - 1)\r\n\r\n totients[n] = tot\r\n return tot\r\n\r\ndef gcd(a, b):\r\n if a == b: return a\r\n while b > 0: a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return abs((a // gcd(a, b)) * b)\r\n \r\nclass topN(list):\r\n def __init__(self,n:int) -> None:\r\n self.n = n\r\n def add(self, x):\r\n heappush(self, x)\r\n if len(self) > self.n:\r\n return heappop(self)\r\n return -1\r\n\r\n\r\nlster= lambda: list(map(int,input().split()))\r\nin1 = lambda: int(input())\r\nstrlistint = lambda: [int(i) for i in input()]\r\nstrlistchr = lambda: [i for i in input()]\r\nintset = lambda : set(strlistint())\r\ncharset = lambda : set(strlistchr())\r\n\r\ndef sol():\r\n s = input()\r\n print(s+s[::-1])\r\n\r\n\r\n#FORCES--CHEF\r\nfor _ in range(1):\r\n sol()\r\n\r\n# # ATCODER\r\n# if __name__==\"__main__\":\r\n# sol()", "x = list(input())\r\nn = x.copy()\r\nn.reverse()\r\nn = ''.join(n)\r\nx = ''.join(x)\r\nprint(x + n)", "b=(input())\r\nreverse=b[::-1]\r\nprint(b+reverse)\r\n\r\n", "number = input()\r\nif int(number) < 10:\r\n print(number * 2)\r\nelse:\r\n first = number\r\n second = \"\"\r\n for i in range(len(number),0,-1):\r\n second += number[i - 1]\r\n print(first + str(second))\r\n", "# https://codeforces.com/problemset/problem/688/B\r\n\r\nn = input()\r\nprint(n + n[::-1])", "n = int(input())\r\nif (1<=n<=9):\r\n print(str(n)+str(n))\r\nelse:\r\n print(str(n)+str(n)[::-1])\r\n", "inp = input()\r\nprint(inp + inp[::-1])\r\n", "s=input()\nprint(s+s[::-1])\n#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\n\n \t \t\t \t \t \t \t \t\t \t \t\t\t \t\t \t", "n=input()\r\nn1=n[::-1]\r\nprint(n+n1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nprint(s+s[::-1])", "from sys import stdin, stdout\r\ndef istr(): return input()\r\ndef inum(): return int(stdin.readline())\r\ndef imul(): return map(int, stdin.readline().split())\r\ndef ilst(): return list(map(int, stdin.readline().split()))\r\ndef splt(): return list(stdin.readline().strip())\r\ndef emat(row): return [ilst() for i in range(row)]\r\nmax_itr = 100\r\nfrom itertools import combinations\r\nimport math\r\n\r\n#************************* Code******************************\r\n#************************************************************\r\n\r\nn = inum()\r\na = str(n)\r\nb = a[::-1]\r\nprint(a+b)\r\n", "a=input();print(a+\"\".join(reversed(a)))", "n=str(input())\r\nm=n[::-1]\r\nprint(str(n)+m)", "s=input()\r\nprint(f\"{s}{s[::-1]}\")", "s=str(input())\r\nprint(s,end=\"\")\r\nfor _ in range(len(s)-1,-1,-1):\r\n print(s[_],end=\"\")", "[print(n + n[::-1]) for n in input().split()]", "s = input().strip()\r\nprint(s + s[::-1])\r\n", "t = int(input())\r\n\r\nprint(str(t)+str(t)[::-1])", "n = input()\r\n\r\n\r\nreverseNum = ''.join(reversed(n))\r\n\r\nn = n + reverseNum\r\n\r\nprint(n)", "n=(input())\ndef reverse (x):\n return x[::-1]\nprint (n+reverse(n))\n\n\n", "if __name__ == \"__main__\":\r\n n = list(input())\r\n n = n +n[::-1]\r\n print(''.join(n))", "n = input()\r\nstr = \"\"\r\nstr+=n+n[::-1]\r\nprint(str)", "z=list(input())\r\nx=z.copy()\r\nx.reverse()\r\nz=z+x\r\nprint(\"\".join(z))", "number = input()\r\nreversedNumber = number[::-1]\r\nresult = number + reversedNumber\r\nprint(result)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jul 29 10:05:42 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 20 - CF668-DIV2B\r\n\"\"\"\r\n\r\nn = str(input())\r\nprint(n + n[::-1])", "s=input()\r\nprint(s,s[::-1],sep='')", "s=input()\r\na=s[::-1]\r\nprint(s+a)", "ip = input()\r\nprint(ip+ip[::-1])", "n = input()\r\nprint(n + n[-1::-1])", "n=input()\r\ns=''\r\nfor i in range(len(n)-1):\r\n s+=n[i]\r\nif(len(n)>1):\r\n s+=n[len(n)-1]\r\nelse:\r\n s+=n[len(n)-1]\r\ns+=s[::-1]\r\nprint(s)", "a = str(input())\nprint(a + a[::-1])", "a = input()\r\nb = a[::-1]\r\nprint(a+b)", "n = input()\r\n\r\nprint(n + \"\".join(reversed(n)))", "n = str(input())\r\nn_str = str(n)\r\nn_str += n_str[::-1]\r\nprint(n_str)", "n=input()\r\na=n[::-1]\r\nprint(n+a)", "# 2位数: 11 22 33 ... 99 9个\r\n# 4位数: 1001 1111 ...1991\r\n# 2002 2112 ...2992\r\n# 9009 ...9999\r\n#6位 取4位数中的一个数 往最里面添加00-99 90*10\r\nn=input()\r\nprint(n+n[::-1])", "nth = input()\r\nprint(nth+nth[::-1])", "value = input()\r\nprint(value+value[::-1])\r\n", "n = input()\r\nprint(n+n[-1::-1])\r\n", "str = input()\r\n\r\nprint(str+str[::-1])", "n = input()\r\nreversed_n = ''\r\n\r\nfor i in range(len(n) - 1, -1, -1):\r\n reversed_n += n[i]\r\n\r\nprint(n + reversed_n)\r\n", "n = input()\r\nresult = n + n[::-1]\r\nprint(result)", "s=str(input())\r\nn=len(s)\r\nl=[s]\r\nfor i in range(-1,-(n+1),-1):\r\n l.append(s[i])\r\nprint(*l,sep=\"\")\r\n", "number = input()\r\nprint(number + ''.join(number[::-1]))", "n=int(input())\r\ns=str(n)\r\nprint(int(s+s[::-1]))", "a=input()\r\nb=a[::-1]\r\nprint(a+b)", "num = input()\r\nprint(num + num[::-1])", "n =input()\r\nl = len(n)\r\na=\"\"\r\na+=n\r\na+=n[::-1]\r\nprint(a)", "def main() :\r\n n = int(input())\r\n l = list(str(n))\r\n r = \"\".join(l) + \"\".join(l[::-1])\r\n print(r)\r\n\r\n\r\nmain()", "x = input().strip()\r\nprint(x+x[::-1])", "x = input()\r\nprint(x + x[::-1])", "w = input()\r\nans = w+w[::-1]\r\nprint(ans)", "i = input()\r\np = i[::-1]\r\nprint(int(i+p))\r\n", "if __name__=='__main__':\r\n n = input()\r\n out = n + n[::-1]\r\n print(out)", "n = list(input())\r\n\r\nfor s in n:\r\n print(s, end=\"\")\r\n\r\nfor s in reversed(n):\r\n print(s, end=\"\")", "import sys\r\ninput = sys.stdin.readline\r\ns = input().strip()\r\nsys.stdout.write(s+s[::-1])", "num = input()\r\nprint(num+num[::-1])", "n = input()\r\n\r\nr1 = n[::-1]\r\n\r\nprint(n + r1)\r\n\r\n\r\n\r\n", "# Lovely Palindromes\r\nn = input()\r\ns = n + n[::-1]\r\nprint(s)", "x=input()\r\nar=[]\r\ns=''\r\ng=[]\r\nfor i in x:\r\n ar.append(i)\r\n g.append(i)\r\nar.reverse()\r\nd=g+ar\r\np=s.join(d)\r\nprint(p)\r\n", "# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\n\r\n# import inbuilt standard input output\r\nimport sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n\r\n\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n\r\ndef Solution(n):\r\n print(n+\"\".join(reversed(n)))\r\n\r\n\r\ndef main():\r\n # //TAKE INPUT HERE\r\n n = input()\r\n Solution(n)\r\n\r\n\r\n# call the main method pa\r\nif __name__ == \"__main__\":\r\n main()\r\n", "ans = input()\r\nprint(ans, end = '')\r\nfor ch in list(reversed(ans)):\r\n print(ch, end = '')\r\n", "k=input()\r\nprint(k+k[::-1])", "st=input()\r\nprint(st+st[-1::-1])", "n=int(input())\r\nh1=str(n)\r\nh2=h1[::-1]\r\nh3=h1+h2\r\nprint(h3)", "n = int(input())\r\nn = str(n)\r\nprint(n + n[::-1])\r\n", "n=(input())\r\np=n[::-1]\r\nprint(n+p)", "a=input()\r\nb=\"\"\r\nfor i in range(0,len(a)):\r\n b=a[i]+b\r\nprint(a+b);", "n = str(input().strip())\n\nprint(n + \"\".join(list(n)[::-1]))\n", "# https://codeforces.com/contest/688/problem/B\r\n\r\n\r\ndef single_integer():\r\n return int(input())\r\n\r\n\r\ndef multi_integer():\r\n return map(int, input().split())\r\n\r\n\r\ndef string():\r\n return input()\r\n\r\n\r\ndef multi_string():\r\n return input().split()\r\n\r\n\r\ns = string()\r\n\r\nprint(s + s[::-1])", "n= input()\r\nprint((n+n[::-1]))", "n = input()\r\ns = n[::-1]\r\n\r\nprint(n+s)", "# Untitled-1.py\n\n# from pathlib import Path\n# ROOT = Path(__file__).parent.absolute()\n\ndef main():\n\n\ti = input()\n\tprint(i + i[::-1])\n\n\nif __name__ == '__main__':\n\t# print('Running Untitled-1.py')\n\tmain()\n\n \t\t\t \t\t \t\t\t \t\t \t\t\t \t", "from sys import stdin, stdout\r\ndef main():\r\n input = stdin.readline\r\n output = stdout.write\r\n s = input().strip()\r\n s2 = s[::-1] # Reverse the input string\r\n s3 = ''.join(s+s2) # Concatenate the original string and its reverse\r\n output(s3)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "# koDer :P\n\n\n\nx = input().strip()\nprint(x+x[::-1])\n \t\t\t\t\t\t \t\t\t \t\t\t\t\t \t\t\t\t\t \t", "n = int(input())\r\nq = str(n)\r\nprint(q + q[::-1])", "n=int(input())\r\ns=str(n)\r\na=s\r\nb=s[-1::-1]\r\nprint(a+b)", "n=list(str(input()))\r\ny=n.copy()\r\nn.reverse()\r\nprint(*(y+n),sep='')\r\n\r\n\r\n\r\n", "n = input()\r\nans = \"\"\r\nif(len(n) == 1):\r\n ans = n + n\r\nelse:\r\n rev = n[::-1]\r\n ans = n + rev\r\nprint(ans)", "n=int(input())\r\ns=str(n)\r\nd=str(n)+s[::-1]\r\nprint(d)\r\n", "n=input()\r\nx=n+n[::-1]\r\nprint(x)", "number = input()\r\nrevers_string = ''\r\nfor i in range(len(number)-1 , -1 , -1 ):\r\n revers_string = revers_string + number[i]\r\nprint(number + revers_string)", "a = input()\r\nprint(a+a[-1::-1])", "n = input()\r\nn+=n[::-1]\r\nprint(n)", "s=input()\r\nres=s+s[::-1]\r\nprint(res)", "s=input()\r\nprint(s,end=\"\")\r\nprint(s[::-1])\r\n", "k = input()\r\nprint(k+k[::-1])", "#n, m, k =map(int,input().split())\r\n\r\n#for i in range(int(input())):\r\n\r\ns =input()\r\ns1=\"\"\r\nfor i in range(0,len(s)):\r\n s1 += s[len(s)-i-1]\r\nprint(s+s1)\r\n\r\n", "n = list(input().strip())\r\n\r\nprefix = ''.join(n)\r\nn.reverse()\r\nsuffix = ''.join(n)\r\n\r\nprint(prefix, suffix, sep='')", "import sys\r\nfrom os import path\r\n\r\n\r\ndef solve():\r\n a = str(input())\r\n print(a,end=\"\")\r\n print(a[::-1])\r\n \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\n\r\nt = 1\r\n# t = int(input())\r\nwhile t: \r\n solve()\r\n t -= 1\r\n", "n=input()\r\np=n[::-1]\r\nprint(n+p)", "from sys import stdin\r\nfrom collections import defaultdict\r\ninput=lambda:stdin.readline().strip()\r\nn=int(input())\r\ns=str(n)\r\nprint(s+s[::-1])\r\n", "# 688B - Lovely Palindromes\r\nx = input()\r\nprint(x+x[::-1])\r\n", "i = input()\nprint(i+i[::-1])\n", "num=input()\r\nif int(num)<10:\r\n print (int(num)*11)\r\nelse:\r\n temp=\"\"\r\n for i in range (len(num)-1,-1,-1):\r\n temp=temp+num[i]\r\n print (num+temp)", "n = input()\nlt = list(n)\nans = [\"0\" for _ in range(len(lt)*2)]\nl = 0\nr = len(ans) - 1\ni = 0 \nwhile l < r:\n v = lt[i]\n ans[l] = v \n ans[r] = v \n l += 1\n r -= 1\n i += 1\nprint(\"\".join(ans))\n\n\n", "\r\n\r\n\r\nn=input()\r\n\r\na=n[::-1]\r\nprint(n+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", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nn=input()\r\nm=n[::-1]\r\nprint(n,end=\"\")\r\nprint(m)", "c = list(input())\r\nd = c.copy()\r\nc.reverse()\r\nprint(\"\".join(d+c))\r\n", "n = str(input())\r\nres = n + n[::-1]\r\nprint(res)", "# Wadea #\r\n\r\nn = int(input())\r\nnew_num = list(str(n))\r\nnew_num.reverse()\r\nnew_num = \"\".join(new_num)\r\nprint(str(n)+new_num)", "#https://codeforces.com/problemset/problem/688/B\ns=input()\nprint(s+\"\"+s[::-1])\n", "from py_compile import PycInvalidationMode\r\n\r\n\r\ndef T(): return int(input())\r\ndef V(): return map(int, input().split())\r\ndef L(): return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n = T()\r\n print(str(n)+str(n)[::-1])\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline().strip()\n\nn = int(input())\n\nres = None\n\na = str(n)\nb = a[::-1]\nres = a+b\n\t\nprint(res)\n\n", "t=int(input())\r\nt1=str(t)\r\nt2=t1[::-1]\r\nt1=t1+t2\r\nprint(t1)", "n = int(input())\nb = str(n)\nnew = \"\"\nfor i in range(len(b)):\n new+=b[len(b)-i-1]\nprint(b+new)\n \t \t\t \t \t \t \t \t \t\t\t\t \t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 18 14:49:22 2020\r\n\r\n@author: Alok\r\n\"\"\"\r\n\r\ndef palin(num):\r\n f_no=num+num[::-1]\r\n print(f_no)\r\n \r\n \r\n \r\nnum=input()\r\npalin(num) ", "def my_function(x):\r\n return x[::-1]\r\n\r\nx = input()\r\nx += my_function(x)\r\nprint(x)", "n = input()\nprint(n,end=\"\")\nfor i in range(len(n)-1,-1,-1):\n print(n[i],end=\"\")\nprint()", "a = input()\r\nb= a[-1::-1]\r\nprint(a+b)", "S = input()\r\ns2 = S[::-1]\r\nprint(S+s2)", "n = input()\r\nans = n[::-1]\r\nn += ans\r\nprint(n)\r\n", "s = input()\r\nprint(s, end=\"\")\r\nprint(s[::-1])", "n = input()\r\nj = len(n)-1\r\nwhile(j>=0):\r\n n+=n[j]\r\n j = j-1\r\nprint(n)", "s = input()\r\ny = s[::-1]\r\nprint(s+y)", "s = input()\r\na = list(reversed(s))\r\nprint(s+\"\".join(a))", "n=str(input())\nx=n[::-1]\nprint(n+x)", "n=input()\r\nx=n[::-1]\r\nans= n+x\r\nprint(ans)", "n = input()\r\nn1 = n[::-1]\r\nprint(n, n1, sep='')", "number = input()\r\nprint(number + number[::-1])", "n=int(input())\r\nimport math\r\na=str(n)+str(n)[::-1]\r\nprint(a)", "i = list(map(int,input()))\r\ng = i[::-1]\r\np = i + g\r\nprint(''.join([str(elem) for elem in p]))", "n=int(input())\r\ns=str(n)\r\na=str(n)\r\nfor i in reversed(range(len(s))):\r\n a+=s[i]\r\nprint(a)", "def main():\r\n\r\n\t# палиндромы чётной длины\r\n\tn = input()\r\n\tprint(n + n[::-1])\r\n\r\n\t\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n", "n = input()\n\nanswer = n + n[::-1]\nprint(answer)", "n = input()\r\nprint(n + ''.join(n[::-1]))", "number=input()\nreverse=''\nfor i in range(len(number)-1,-1,-1):\n\treverse=reverse+number[i]\nprint(number+reverse)\n\n\n", "s = input()\r\nn = len(s)\r\nfor i in range(0, n):\r\n print(s[i], end = '')\r\nfor i in range(n-1, -1, -1):\r\n print(s[i], end = '')", "n=input()\r\ns=n[::-1]\r\nprint(n+s)", "s = input()\r\nprint(s , end = '')\r\nfor i in range(0 , len(s)):\r\n print(s[len(s) - i - 1] , end = '')\r\n", "is_debug = False\r\n\r\ns = input()\r\n\r\nprint(f\"{s}{s[::-1]}\")\r\n", "# '''\r\n# shelby70\r\n# '''\r\nn= input()\r\nprint(n+ n[::-1])", "n = input()\r\na = list(n)\r\na.reverse()\r\nprint(n+ (\"\".join(a)))", "s = input()\n\nprint (s + s[::-1])\n", "s = input()\r\nb = s[::-1]\r\nprint(s+b)", "big_int = input()\r\nrevesed_half = ''\r\nprint(big_int, end='')\r\nfor i in range(len(big_int)-1, -1, -1):\r\n print(big_int[i], end='')", "# B. Lovely Palindromes\n\nnumber = str(input())\nprint(number + \"\".join(reversed(number)))", "str = str(input())\r\nrev = str[::-1]\r\nstr = str + rev\r\nprint(str)", "def solution(n):\n a = n + n[::-1]\n return int(a)\n\n\nprint(solution(input()))\n\t \t\t\t\t\t \t \t \t \t \t \t \t\t", "n=list(input())\r\nnRev=list(reversed(n))\r\npalindrome=\"\".join(n)+\"\".join(nRev)\r\nprint(palindrome)", "string=input()\r\n\r\nnew_str=string[::-1]\r\n\r\nprint(string+new_str)", "f = input();x = f[::-1];f += x;print(f)\r\n", "number = input()\r\ntemp = number[::-1]\r\npal = number+temp\r\nprint(pal)", "q=input()\r\nprint(q+q[::-1])", "s=input();print(s+s[::-1])", "n = input()\r\nfor i in range(len(n)):\r\n print(n[i],end = \"\")\r\nfor i in range(len(n)):\r\n print(n[len(n)-i-1],end = \"\")\r\nprint()\r\n#print(n,str(reversed(n)))", "# author: violist\n# created: 20.05.2022 19:24:44\n\nimport sys\ninput = sys.stdin.readline\n\nn = input()[:-1]\nprint(n + n[::-1])\n", "t = input()\r\nprint(t+t[::-1])", "n = list(input())\nprint(*n, sep='', end='')\nn.reverse()\nprint(*n, sep='', end='')\n", "n = input()\r\nn2 = n[::-1]\r\nprint(n+n2)\r\n\r\n\r\n", "a=str(input())\r\nb=''\r\nb+=a\r\nb+=a[::-1]\r\nprint(b)", "i = list(map(int,input()))\r\ng = i[:]\r\ng.reverse()\r\np = i + g\r\nprint(''.join([str(elem) for elem in p]))", "def main():\r\n # input\r\n n = int(input())\r\n\r\n # soln\r\n print(str(n)+str(n)[::-1])\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = input()\r\nprint(n, end=\"\")\r\nprint(n[::-1])", "n=input()\r\ns=n[::-1]\r\nprint(int(n+s))", "n=int(input())\r\nk=str(n)\r\nprint(k+k[::-1])", "n = input()\r\nprint(f'{n}{n[::-1]}')\r\n", "n=input()\r\nn=n+n[::-1]\r\nprint(n)", "# Koder | err\n\nx = input().strip()\nprint(x+x[::-1])\n\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\ns = sys.stdin.readline().strip()\r\nprint(s + s[::-1])", "n = (input())\r\na = n\r\nfor x in range(len(n)-1,-1,-1):\r\n a += n[x]\r\nprint(a)", "number = input()\r\nprint(''.join([number, number[::-1]]))", "# توكلت على الله\r\n\r\nimport sys \r\ninput = sys.stdin.readline \r\n\r\ndef solve():\r\n s = input().strip()\r\n if len(s) == 1 :\r\n print(s+s)\r\n else :\r\n \r\n print(s+s[::-1])\r\n \r\n#for i in range(int(input())):\r\nsolve()", "# import math\r\n# for i in range(int(input())):\r\n# a,b,n,s=map(int,input().split())\r\nn=input()\r\nprint(n+n[::-1])\r\n\r\n\r\n\r\n", "a=input()\r\nprint(a+\"\".join(reversed(a))) ", "s = str(input())\r\ns = s + ''.join(reversed(s))\r\nprint(s)", "import sys\ninput = sys.stdin.readline\nimport math\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\nimport math\ndef lcm(a):\n return abs(math.prod(a)) // math.gcd(*a)\n\nn = str(inpit())\nprint(n + n[::-1])", "n=input()\r\nl=list(n)\r\nfor i in range(len(l)-1,-1,-1):\r\n\tl.append(l[i])\r\nprint(\"\".join(l))", "a = input()\r\nprint(a + a[::-1])", "n=input()\r\ns=n[::-1]\r\nprint(n,end=\"\")\r\nprint(s,end=\"\")", "x=input()\r\ny=x[::-1]\r\nprint(x+y)", "x= input()\r\nprint (x+x[len(x)::-1])", "\r\n\r\nstring = str( input() )\r\n\r\nrstr = \"\"\r\nx = -1\r\nfor ch in string :\r\n\r\n rstr += string[ x ]\r\n\r\n x -= 1\r\n\r\nprint( string+rstr )\r\n", "from collections import Counter\r\nn = input()\r\n# x,y,z = map(int,input().split())\r\nans = n+n[::-1]\r\nprint(ans)\r\n\r\n# ", "n = input()\n\nresult = n\nfor i in range(len(n)-1,-1,-1):\n result += n[i]\nprint(result)", "string = input()\r\nprint(string, end='')\r\nprint(string[::-1])", "n=input()\r\nr=''\r\nfor i in range(len(n)-1,-1,-1):\r\n\tr=r+n[i]\r\nprint(n+r)", "x = input()\r\nprint(x+x[::-1])", "n = input()\r\nres = n\r\nres += n[: : -1]\r\nprint(res)", "n = input()\r\nprint(n + n[::-1])\r\n\r\n# num = 10\r\n# palindrome = 0\r\n#\r\n# while True:\r\n# if not n == 0:\r\n# num += 1\r\n# number = str(num)\r\n# if number == number[::-1]:\r\n# if len(str(num)) % 2 == 0:\r\n# n -= 1\r\n# palindrome = num\r\n# else:\r\n# print(palindrome)\r\n# break", "n = input() # as a string\r\nprint(n + n[::-1])\r\n", "n=int(input())\r\nans=str(n)+str(n)[::-1]\r\nprint(ans)\r\n", "n = (input()) \r\nprint(n+n[::-1])\r\n", "n=input()\r\nprint(n+n[-1::-1])", "n = input()\r\n\r\ns = n\r\n\r\ns += n[::-1]\r\n\r\nprint(s)\r\n\r\n", "n = (input())\r\nA = n\r\nprint(n, end = '')\r\nprint(A[::-1])\r\n", "n=input()\r\nif len(n)==1:\r\n rn=n\r\nelse:\r\n rn=''.join(n[::-1])\r\nprint(n+rn)", "n=input()\r\nn=list(n)\r\nf=list(n)\r\nf.reverse()\r\nfinal=n+f\r\nprint(''.join(final))", "m = input()\r\nprint(m, end=\"\")\r\nprint(m[::-1])", "i=input()\r\nprint(i+i[::-1])\r\n\r\n", "s = input()\r\nrev = s + \"\".join(reversed(s))\r\nprint(rev)\r\n", "h = input()\n\nprint(h + h[::-1])\n", "n=input()\r\nk=''\r\nfor i in range(len(n)):\r\n\tk+=n[len(n)-i-1]\r\nprint(n+k)", "a = input()\r\nprint(a, a[::-1], sep='')", "n=input()\r\ns=n+\"\"\r\nfor x in reversed(s):\r\n s=s+x\r\nprint(s)\r\n ", "f=input()\r\nprint(f+f[::-1])", "def solve(n):\r\n return f\"{n}{n[::-1]}\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(solve(input()))", "import sys\r\ninput = sys.stdin.readline\r\np = print\r\nfrom collections import deque, defaultdict\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in range(n)]\r\ndef pb(b): print('Yes' if b else 'No')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\ns = S()\r\nprint(s+s[::-1])", "from sys import stdin\r\n\r\n\r\nn = stdin.readline().strip()\r\n\r\ntest = ''.join(reversed(n))\r\n\r\nprint(n + test)\r\n ", "# -*- coding: utf-8 -*-\n\"\"\"StringConcatenation.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1NsgCuuyaVa_RRii6a0LY0ayDwWO_mrXw\n\"\"\"\n\nnum = str(input())\nreverse_num = num[::-1]\nprint(num+reverse_num)", "t = list(input())\r\na = t[::-1]\r\nfor i in a:\r\n\tt.append(i)\r\nprint(''.join(str(x) for x in t))", "S=input()\nprint(S+S[::-1])", "n=input()\r\nb=n[::-1]\r\nc=n+b\r\nprint(c)", "n = str(input())\narreglo = list(n)\n\ninvertido = reversed(arreglo)\npalabra1=\"\"\npalabra2=\"\"\nfor i in arreglo:\n palabra1=palabra1+str(i)\nfor i in invertido:\n palabra2=palabra2+str(i)\nprint(palabra1+palabra2)\n \n \n \n\n\t \t \t \t \t\t\t\t\t\t\t\t \t \t \t \t \t\t", "import sys\r\n\r\n\r\ndef ints_input():\r\n return [int(i) for i in sys.stdin.readline().strip(\"\\n\").split(\" \")]\r\n\r\n\r\ndef print_list(arr):\r\n sys.stdout.writelines(str(x)+\" \" for x in arr)\r\n sys.stdout.write(\"\\n\")\r\n\r\n\r\ndef fast_input(type=str):\r\n return type(sys.stdin.readline().strip(\"\\n\"))\r\n \r\n \r\nn= fast_input(int)\r\nn = list(str(n))\r\nrev_n = n[-1:-len(n)-1:-1]\r\nprint(\"\".join(n+rev_n))\r\n", "n=input()\r\np=len(n)\r\nk=0\r\ns=''\r\ns+=n\r\nwhile p>k:\r\n k+=1\r\n s=s+n[-k]\r\nprint(s)", "n=input()\r\nx=n[::-1]\r\nprint(n+x)", "x=input()\r\nR=\"\"\r\nR=x+x[::-1]\r\nprint(R)", "n = input()\r\nrev_n = n[::-1]\r\n\r\nprint(n+rev_n)", "n = input()\r\nprint ( str(n) + \"\".join(reversed(str(n))))\r\n", "n = input()\r\nn2 = int(n)\r\nout=\"\"\r\nfor i in range (1,len(n)+1):\r\n out+=n[-i]\r\nprint(n+out)", "def find_even_length_palindrome(n):\n\n palindrome_number = n + n[::-1]\n\n return palindrome_number\n\nresult = find_even_length_palindrome(input())\nprint(result)\n\n\t \t\t \t\t\t \t\t\t \t\t\t\t\t\t\t \t \t", "\r\n\r\nif __name__ == '__main__':\r\n n = input()\r\n if int(n) < 10:\r\n print(int(n)*11)\r\n else:\r\n l=['']*(len(n)*2)\r\n i = 1\r\n for s in n:\r\n l[i-1] = s\r\n l[-i] = s\r\n i += 1\r\n print(*l,sep=\"\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "num = str(input())\r\nprint(num + num[::-1])", "def solve(st1):\r\n st2 = st1[::-1];\r\n res = st1 + st2;\r\n return res;\r\n\r\nst1 = input();\r\nprint(solve(st1));\r\n", "\r\nn=input()\r\nif int(n)<10:\r\n print(n,end='')\r\n print(n)\r\nelif int(n)==10:\r\n print(\"1001\")\r\nelif int(n)==11:\r\n print(\"1111\")\r\nelse:\r\n print(n,end='')\r\n n=n[::-1]\r\n print(n)\r\n", "#688B (68No. Problem B)\r\nn = int(input())\r\ns = str(n)\r\nt = s[::-1]\r\nans = s+t\r\nprint(ans)", "'''\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\nnumber = str(input())\r\nres = number + number[::-1]\r\nprint(res)\r\n\r\n\r\n", "n = input()\r\nprint (n + ''.join(reversed(n)))", "n= input()\r\nnr = n[::-1]\r\nprint(n+nr)\r\n\r\n", "x=input()\r\nc=x+x[::-1]\r\nprint(c)\r\n", "n = input()[::-1]\r\na = \"\"\r\nfor s in n:\r\n a = s + a + s\r\nprint(a)\r\n", "n = input()\r\na = n[::-1]\r\nprint(n + a)", "n = input()\r\n\r\nfor i in range(len(n)-1,-1,-1):\r\n n += n[i]\r\nprint(n)\r\n", "x = input()\r\ns= x[::-1]\r\nprint(x+s)\r\n\r\n", "x=input();print(x+x[::-1])", "def check(n):\r\n if(n<10):\r\n return n*11\r\n re=''\r\n re+=str(n)\r\n re+=''.join(list(reversed(str(n))))\r\n return re\r\n\r\nn=int(input())\r\nprint(check(n))", "n = int(input())\r\n\r\nif n<=9:\r\n print(n*11)\r\nelse:\r\n print(str(n)+str(n)[::-1])", "from collections import defaultdict as dd\nfrom collections import deque\nimport bisect\nimport heapq\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \nn = input()\nss = str(n)\nans = ss + ss[::-1]\nprint(ans)\n\n\n\n\n", "n = input()\r\nn2 = list(n)\r\nn2.reverse()\r\nprint(n + ''.join(n2))", "# / *\r\n#\r\n# / \\ | | / \\ | | | |\r\n# / __\\ | | / __\\ |--| | |\r\n# / \\ |__ | __ / \\ | | \\__ /\r\n#\r\n# __ __\r\n# / \\ | / | ) / \\ | )\r\n# / __\\ |< |-< / __\\ |-<\r\n# / \\ | \\ |__) / \\ | \\\r\n#\r\n# * /\r\n# Function to count frequency of each element\r\n\r\n\r\ndef main():\r\n s = input()\r\n sre = s[::-1]\r\n print(s+sre)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n # n = int(input())\r\n # arr = [int(i) for i in input().split()]\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\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\n\r\ns = input().strip()\r\n\r\nprint(s + s[::-1])\r\n", "n=input()\r\nn1=''\r\nfor i in n:\r\n n1=i+n1\r\n# print(n1)\r\ns=n+n1\r\nprint(s)", "# import math\nfrom collections import Counter, deque, defaultdict\n# from math import *\n\nfrom bisect import bisect_right\n\nMOD = 1000000007\n\n\n# from functools import reduce\n# from itertools import permutations\n# import queue\n\n\ndef solve():\n n=input()\n print(n+n[::-1])\n\n\n\n# t = int(input())\nt = 1\nfor num in range(t):\n # print(\"Case #{}: \".format(num + 1), end=\"\")\n solve()\n\n\t\t \t \t \t\t\t \t \t \t \t \t", "n=int(input())\r\ns=str(n)\r\ns1=s[::-1]\r\nprint(s+s1)", "#!/usr/bin/python3\r\n\r\ninput = input()\r\nprint(input+input[::-1])", "'''\r\n-------------------------------------------------------\r\n\t\tCompetitive programing\r\n\t\tName: Đào Xuân Hoàng Tuấn (Salmon1)\r\nNothing is impossible, as you as you believe you can do it\r\n\t\t You can do it!!!\r\n-------------------------------------------------------\r\n'''\r\na = input()\r\nb = list(a)\r\nb.reverse()\r\nc = ''.join(b)\r\nprint(a+c)", "n = input()\nprint(n, end='')\nprint(n[::-1])\n#this is to make it longer than 50 char\n \t\t\t \t \t\t \t \t\t\t \t \t \t \t", "q=int(input())\r\ns=str(q)\r\ns=s+s[::-1]\r\nprint(s)", "x = input()\r\nprint(x, end=\"\")\r\nfor i in range(len(x)):\r\n print(x[len(x) - i - 1], end=\"\")\r\n", "from math import *\nimport sys\ndef cin(): return sys.stdin.readline().strip()\n\n\ncout = sys.stdout.write\n\n\ndef main(tc):\n a = cin()\n b = a[::-1]\n print(a+b)\n\n\nmain(0)\nexit(0)\nfor i in range(int(input())):\n main(i + 1)\n", "x=input()\r\nprint(x+x[::-1])", "n = input()\nprint(n, n[::-1], sep=\"\")\n\n\n", "n = int(input())\r\ns = str(n)\r\nprint(s+s[::-1])\r\n", "n = int(input())\r\nch = str(n)\r\nch1 = ch[::-1]\r\nprint(ch + ch1)", "n = input()\r\nk = n + n[::-1]\r\nprint(k)", "x = input()\ny = x[::-1]\nprint(x+y)\n", "palindNum = input()\r\n\r\nprint(palindNum + palindNum[::-1])\r\n\r\n", "n = input()\r\n\r\nprint(n + \"\".join(list(reversed(list(n)))))\r\n", "def main():\r\n num = input()\r\n print(num+num[::-1])\r\n \r\n \r\nmain()", "t=input()\r\ns=t+t[::-1]\r\nprint(s)", "n1 = int(input())\r\nprint(str(n1) + ''.join(list(str(n1))[::-1]))", "inpt = input()\r\nprint(inpt + inpt[::-1])", "b = input()\r\na = list(b)\r\nfor i in range(1, len(a) + 1):\r\n b += a[-i]\r\n\r\nprint(str(b))\r\n", "n = int(input())\r\ns = str(n)\r\nprint(s + s[::-1])\r\n", "n = int(input())\r\nk = []\r\nb = str(n)\r\nbu = b[::-1]\r\n\r\n\r\nprint(''.join(map(str, b))+''.join(map(str, bu)))", "n=list(input())\r\na=[]\r\nfor i in n:\r\n a+=i\r\na=a[::-1]\r\nb=n+a\r\nstr=\"\"\r\nfor i in b:\r\n str+=i\r\nprint(str)", "n = int(input())\r\nch = str(n)\r\nreversed_ch = ch[::-1] \r\nprint(ch + reversed_ch)\r\n", "string = input()\nprint(string, string[::-1], sep='')\n", "# Read input\r\nn = input()\r\n# Generate and print the n-th even-length palindrome number\r\nprint(n+n[::-1])\r\n", "# cook your dish here\r\n\r\n# t=int(input())\r\n# for tc in range(t):\r\n\r\nn=input()\r\np=n[::-1]\r\nprint(n+p) \r\n", "n = input()\r\nchar = n\r\nfor i in range(len(n) - 1, -1, -1):\r\n char += n[i]\r\n\r\nprint(char)", "n = input()\nprint(n + n[::-1])\n\n# Why do I need 50 characters?! What if it is solvable in fewer characters than that?!\n# Like, I dunno... if I used Python? :)\n \t\t \t\t\t \t \t\t\t\t\t\t\t\t\t \t", "n=input()\r\nk=n[::-1]\r\n\r\nprint(n+k)\r\n", "n=str(input())\r\nl=n[::-1]\r\nprint(n+l)\r\n", "\r\n#from math import ceil, sqrt\r\n\r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n#print = lambda x: sys.stdout.write(str(x) + \"\\n\")\r\n \r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\n#SLMII = lambda: sorted(LMII())\r\n\r\nn = input()\r\n\r\nprint(n+n[::-1])", "def solve():\r\n n = input()\r\n n1 = n[::-1]\r\n print(n+n1)\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "n=list(input())\r\np=list(n)\r\nn.reverse()\r\nprint(*(p+n),sep=\"\")\r\n", "# Waco Texas was a mistake\nn = input()\nn2 = n + n[::-1]\nprint(n2)\n \t\t\t\t\t \t \t\t\t \t \t \t \t\t \t\t\t", "n = str(input())\r\nprint(n,end='')\r\nprint(''.join(reversed(n)))", "a = input()\r\ns = []\r\nfor i in a:\r\n\ts.append(i)\r\ns.reverse()\r\ns = ''.join(s)\r\nprint(a+s)", "# link: https://codeforces.com/contest/688/problem/B\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n if n<=9:\r\n print( n * 11)\r\n else:\r\n n_string = str(n)\r\n n = len(n_string)\r\n output = n_string \r\n for i in range(n-1,-1,-1):\r\n output = output + n_string[i]\r\n print(output) \r\n", "n = input()\r\nprint(n,n[::-1],sep='')\r\n", "s = list(input())\ns += reversed(s)\nprint(*[x for x in s], sep = '')\n", "s = input()\r\nans = s+s[::-1]\r\nprint(ans)", "n = input()\r\nif n == '1':\r\n print(11)\r\nelse:\r\n print(n+n[::-1])\r\n", "n = input()\nm = list(n)\np = list(m)\np.reverse()\nresult = m + p\nfor x in result:\n print(x,end='')\n", "m=input();print(m+m[::-1])\r\n", "n = int(input())\r\n\r\n# Convert the input number to a string\r\ns = str(n)\r\n\r\n# Create the palindrome string\r\npalindrome = s + s[::-1]\r\n\r\nprint(palindrome)\r\n", "n = input()\r\n\r\nfinal = []\r\n\r\nfinal.extend(list(n))\r\nfinal.extend(n[::-1])\r\n\r\nprint(*final, sep='')", "n = str(input())\nres = n\nfor j in range(len(n) - 1, -1, -1):\n res += n[j]\n\n\nprint(res)", "n=input()\r\ns1=list(n)\r\ns1.reverse()\r\nn1=''.join(s1)\r\nprint(n+n1)", "import sys\r\n\r\n\r\ndef main() -> None:\r\n read = sys.stdin.readline\r\n val = read().strip()\r\n val_2 = val[::-1]\r\n print(val+val_2)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "a=input()\r\nprint(a+a[::-1])", "p=input()\r\nprint(p+p[::-1])", "\r\ns = list(input())\r\n\r\ns2 = list(reversed(s))\r\n\r\n#print(s , s2)\r\n\r\nfor i in s :\r\n print(i , end = '')\r\n\r\nfor i in s2 :\r\n print(i , end = '')\r\n", "s=input()\r\nprint(s[::]+s[::-1])", "s = input()\nres = ['0'] * (2* len(s))\n\nfor i in range(len(s)):\n res[i] = res[len(res)-1-i] = s[i]\n\nprint(''.join(res))\n", "a = str(input())\r\nprint(a,end='')\r\nprint(a[::-1])\r\n\r\n", "from math import*\r\nfrom random import*\r\nn=input()\r\nm=n[::-1]\r\nprint(n+m)\r\n", "def reverse(string): \r\n string = string[::-1] \r\n return string \r\n \r\ns=input()\r\ns1=reverse(s)\r\n\r\nprint(s+s1)\r\n", "a = str(input())\r\nch = [i for i in a]\r\nch.reverse()\r\nb = \"\".join(ch)\r\nprint(f\"{a}{b}\")\r\n\r\n \r\n \r\n", "#688B (68No. Problem B)\r\ns = input()\r\nt = s[::-1]\r\nprint(s+t)", "san = str(input())\r\npalindrome = san[::-1]\r\nprint(san+palindrome)", "n = input()\nprint (n + n[::-1])\n", "n = input()\r\na = n\r\nfor i in range(len(n)-1, -1, -1):\r\n a += n[i]\r\nprint(a)", "n = input()\r\nprint (n+''.join([x for x in n[::-1]]))", "# Pari has a friend who loves palindrome numbers. A palindrome number is a number that\r\n# reads the same forward or backward. For example 12321, 100001 and 1 are palindrome\r\n# numbers, while 112 and 1021 are not.\r\n# Pari is trying to love them too, but only very special and gifted people can understand\r\n# the beauty behind palindrome numbers. Pari loves integers with even length (i.e. the\r\n# numbers with even number of digits), so she tries to see a lot of big palindrome\r\n# numbers with even length (like a 2-digit 11 or 6-digit 122221), so maybe she could\r\n# see something in them.\r\n# Now Pari asks you to write a program that gets a huge integer n from the input and\r\n# tells what is the n-th even-length positive palindrome number?\r\n# Input\r\n# The only line of the input contains a single integer n (1 ≤ n ≤ 10100 000).\r\n# Output\r\n# Print the n-th even-length palindrome number.\r\n\r\n# get an integer from user and check the validity of it\r\nwhile True:\r\n try:\r\n n = int(input())\r\n except ValueError:\r\n continue\r\n\r\n if n >= 1:\r\n break\r\n\r\nnum_list = list(str(n))\r\npalindrom_num = (\"\".join([char for char in num_list]))\r\nnum_list.reverse()\r\npalindrom_num += (\"\".join([char for char in num_list]))\r\nprint(palindrom_num)\r\n", "import math as mt\ndef evenlen(n):\n pal = n\n for j in range(len(n) - 1, -1, -1):\n pal += n[j] \n return pal\n \nn = input()\nprint(evenlen(n))\n \t\t\t \t \t\t \t\t\t\t\t \t \t \t", "n=input()\r\nw=n\r\nn=n[::-1]\r\nw=w+n\r\nprint(w)", "n = input()\r\nn += n[::-1]\r\nprint (n)", "t=input()\r\nprint(t+t[::-1])", "n=input()\r\nl1=[]\r\nfor i in n:\r\n l1.append(i)\r\nl2=l1[::-1]\r\nl3=l1+l2\r\nfor i in l3:\r\n print(i,end=\"\")", "n=input()\r\nprint(n,end=\"\")\r\nfor x in range(len(n)):\r\n print(n[len(n)-x-1],end=\"\")", "n = int(input())\n\nif n < 10:\n print(\"{}{}\".format(n,n))\n\nelse:\n n = str(n)\n print(n+n[::-1])\n\t\t\t\t\t \t\t\t \t\t \t\t\t\t \t\t\t \t\t", "from sys import stdin\r\nn=stdin.readline().rstrip()\r\nprint(n+n[::-1])", "times=input()\r\n\r\nprint(times+times[::-1])\r\n", "import math\r\ndef main():\r\n n = input()\r\n print(str(n) + ''.join(reversed(str(n))))\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input ()\nprint (s+s[::-1])", "i=input()\r\ni+=\"\".join(reversed(i))\r\nprint(i)", "a = int(input())\r\nprint(str(a) + str(a)[::-1])", "def solve(n):\r\n\r\n return n + ''.join(reversed(n))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n = input()\r\n print(solve(n))\r\n", "n = int(input())\r\nans = str(n) + str(n)[::-1]\r\nprint(ans)", "n = input()\r\nprint(n+str(n[::-1]))", "def solution(n: int):\n\treturn n + n[::-1]\n\n\nif __name__ == \"__main__\":\n\tn = input()\n\tprint(solution(n))\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n a = str(n)\r\n b = a[len(a) - 1]\r\n for i in range(len(a) - 2, -1, -1):\r\n b += a[i]\r\n print(f\"{a}{b}\")", "n = input()\nsize = len(n)\narr = [0 for _ in range(2*size)]\nN = len(arr)\nfor i in range(size):\n arr[i] = int(n[i])\n arr[N-i-1] = int(n[i])\nprint(''.join([str(i) for i in arr]))\n\n\n", "# LUOGU_RID: 113684216\na=input()\nprint(a+a[::-1])", "string = input()\r\ntoPrint = [string,string[::-1]]\r\nprint(\"\".join(toPrint))", "n = input()\r\nsol = n + n[::-1]\r\nprint(sol)", "a=input()\r\nc=''\r\nc+=a\r\nif len(a)==1:\r\n c+=a\r\nelse:\r\n for i in range(len(a),0,-1):\r\n c+=a[i-1]\r\nprint(c)", "import sys\nfrom collections import deque\ndef main(n):\n q = deque()\n for i in range(len(n) - 1, -1, -1):\n q.appendleft(n[i])\n q.append(n[i])\n\n print(\"\".join(d for d in q))\n\nif __name__ == \"__main__\":\n mat = []\n for e, line in enumerate(sys.stdin.readlines()):\n if e == 0:\n n = line.strip()\n main(n)\n", "x = input()\r\na = str(x)\r\ns = ''\r\ns = a + a[::-1]\r\nprint(s)", "n=input()\r\ns=n[::-1]\r\nprint((n+s))", "n=input()\r\nc=n[::-1]\r\nprint(n+c)", "\r\ndef s_rev(s):\r\n s_list = list(s) \r\n sr_list = []\r\n for i in range(len(s_list)-1, -1, -1):\r\n sr_list.append(s_list[i])\r\n \r\n return ''.join(sr_list)\r\n\r\ndef answer(n):\r\n n_s = str(n)\r\n\r\n return n_s + s_rev(n_s)\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n print(answer(n))\r\n\r\n\r\nmain()", "\r\noutput = input()\r\noutput = output + output[::-1]\r\nprint(output)\r\n", "n = input()\r\ns = n[::-1]\r\nprint(n+s)", "def even_palindrome (n) :\r\n return n + n[::-1]\r\n\r\nprint (even_palindrome(input()))\r\n", "k = input()\r\nprint(str(k)+str(k)[::-1])", "n = str(input()) # Read input\nprint(n+n[::-1]) # Reverse input and concat\n# Source code should be longer than 50 characters\n\n\t\t \t\t \t \t\t \t \t\t \t\t \t\t \t\t", "x=input()\r\ny=x[-1::-1]\r\nz=x+y\r\nprint(z)", "n=input().strip('\\n')\r\nprint(n+n[::-1])", "inp=input()\r\nprint(inp+inp[::-1])", "n=str(input())\r\nch=n\r\nch+=n[::-1]\r\nprint(ch) ", "s = input()\r\nrev_s = s[::-1]\r\nnew_s = s + rev_s\r\nif new_s == new_s[::-1]:\r\n print(new_s)\r\nelse:\r\n for i in range(len(s)):\r\n new_s += rev_s[i]\r\n if new_s == new_s[::-1]:\r\n print(new_s)\r\n break" ]

[ "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = 1\r\nansc = 0\r\n\r\nfor x in a:\r\n i = 0\r\n while (x % (2 ** i) == 0):\r\n i += 1\r\n i -= 1\r\n if (2 ** i == ans):\r\n ansc += 1\r\n if (2 ** i > ans):\r\n ans = 2 ** i\r\n ansc = 1\r\n\r\nprint(str(ans) + ' ' + str(ansc))", "n=int(input())\n\r\na=list(map(int,input().split()))\r\n\n\r\n\nq=0\r\n\nnum=0\r\n\r\n\n\nfor i in range(n):\r\n\n\tfor j in range(q,30):\r\n\n\t\tif a[i]%(2**j)==0:\r\n\n\t\t\tif q<j:\r\n\n\t\t\t\tq=j\r\n\n\t\t\t\tnum=0\r\n\n\t\t\tnum+=1\r\n\n\t\telse:\r\n\n\t\t\tbreak\r\n\n\r\n\nr=2**q\r\n\r\n\n\nprint(r,num)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nstep = [1, 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]\r\nr = 0\r\nc = 0\r\nfor i in range(n):\r\n for j in range(29, -1, -1):\r\n if arr[i] % step[j] == 0:\r\n break\r\n if j == r:\r\n c += 1\r\n if j > r:\r\n r = j\r\n c = 1\r\n \r\nprint(step[r], c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nr = 0\r\nk = 0\r\nb = a[:]\r\nfor i in range(n):\r\n c = 1\r\n while b[i] % 2 == 0:\r\n c *= 2\r\n b[i] //= 2\r\n if c > r:\r\n r = c\r\nfor i in range(n):\r\n if a[i] % r == 0:\r\n k += 1\r\nprint(r, k)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from math import *\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\nans = []\r\nfor i in range(100):\r\n help = [2 ** i, 0]\r\n for j in range(n):\r\n if data[j] % (2 ** i) == 0:\r\n help[1] += 1\r\n ans.append(help)\r\nans.sort()\r\nindex = 0\r\nwhile ans[index][1]:\r\n index += 1\r\nindex -= 1\r\nprint(*ans[index])", "n = int(input())\r\ns = list(map(int,input().split()))\r\nx = n\r\nd=2\r\nc=0\r\nused = [False]*n\r\nwhile x>0:\r\n c=x\r\n for i in range(n):\r\n if used[i]==True:\r\n continue\r\n if s[i]%d!=0:\r\n x -= 1\r\n used[i]=True\r\n d *= 2\r\nprint(d//4,c)", "def check(a):\r\n cnt = 0\r\n while a % 2 == 0:\r\n a = a // 2\r\n cnt += 1\r\n return cnt\r\n\r\nn = int(input())\r\nd = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n ans = max(ans, check(d[i]))\r\nans = [2 ** ans, 0]\r\nfor i in range(n):\r\n if d[i] % ans[0] == 0:\r\n ans[1] += 1\r\nprint(*ans)\r\n", "r = 1\r\nk = 0\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i in a:\r\n if (i % r == 0):\r\n k += 1\r\n while(i % (r * 2) == 0):\r\n r *= 2\r\n k = 1\r\nprint(r, k)\r\n ", "n = int(input())\r\nst = str(input())\r\narr = st.split()\r\nmaxR = 1\r\nmaxC = len(arr)\r\ncurr = 2\r\nfor i in range(len(arr)):\r\n while curr<=int(arr[i]):\r\n if (int(arr[i])%curr == 0):\r\n if (maxR == curr): \r\n maxC += 1\r\n if (maxR < curr):\r\n maxR = curr\r\n maxC = 1\r\n curr*=2\r\n curr = 2\r\nprint(maxR,maxC)\r\n", "def form(sstr):\r\n\targ = []\r\n\tnum=''\r\n\tfor e in range(0, len(sstr)):\r\n\t\tif sstr[e] != ' ':\r\n\t\t\tnum+=sstr[e]\r\n\t\t\tif e == (len(sstr)-1):\r\n\t\t\t\targ.append(int(num))\r\n\t\telse:\r\n\t\t\targ.append(int(num))\r\n\t\t\tnum = ''\r\n\treturn arg\r\n\r\ndef findr(arg):\r\n\tj=1\r\n\tret=1\r\n\twhile(True):\r\n\t\tif arg - pow(2,j)<0:\r\n\t\t\tbreak\r\n\t\tif arg%pow(2,j)==0:\r\n\t\t\tret = pow(2,j)\r\n\t\tj+=1\r\n\treturn ret\r\n\r\n\r\n\r\nvals = int(input())\r\nnums = []\r\nc=0\r\npr=0\r\nr=0\r\nsstr = input()\r\nnums = form(sstr)\r\n\r\n\r\nfor i in range (0, len(nums)):\r\n\trnew = 1\r\n\tif nums[i]%2==0:\r\n\t\trnew = findr(nums[i])\r\n\tif rnew>r:\r\n\t\tr = rnew\r\nfor e in nums:\r\n\tif e%r==0:\r\n\t\tc+=1\r\n\r\nprint (str(r) + ' ' + str(c))\r\n", "def step(x):\r\n\tres = 0\r\n\twhile x > 0 and x % 2 ** (res + 1) == 0:\r\n\t\tres += 1\r\n\treturn res\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nr = 0\r\nm = 0\r\nfor i in range(n):\r\n\tif step(x[i]) > r:\r\n\t\tm = 1\r\n\t\tr = step(x[i])\r\n\telif step(x[i]) == r:\r\n\t\tm += 1\r\nprint(2 ** r, m)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmax1 = 1\r\nfor i in l:\r\n k = 1\r\n x = i\r\n while x % 2 == 0:\r\n k *= 2\r\n x //= 2\r\n max1 = max(max1, k)\r\nc = 0\r\nfor i in l:\r\n if i % max1 == 0:\r\n c += 1\r\nprint(max1, c)", "a = int(input())\r\nb = input().split()\r\nhighest = 0\r\ncounter = 0\r\nfor c in b:\r\n i = 0\r\n while (2 ** i) <= int(c):\r\n if int(c) % (2**i) == 0:\r\n if i > highest:\r\n highest = i\r\n counter = 1\r\n elif i == highest:\r\n counter += 1\r\n i += 1\r\nprint(2**highest, counter)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = 0\r\nfor i in a:\r\n j = 0\r\n while i%2**(j+1) == 0:\r\n j += 1\r\n if j > m:\r\n m = j\r\nc = 0\r\nfor i in a:\r\n if i%2**m == 0:\r\n c += 1\r\n\r\nprint(2**m, c)\r\n", "a=int(input())\r\nb=list(map(int, input().split()))\r\nm=max(b)\r\nr=0\r\nf=0\r\nu=0\r\no=0\r\nk=0\r\nwhile f<=m:\r\n f=2**r\r\n r+=1\r\nr-=1\r\nfor i in range(a):\r\n for j in range(r):\r\n if b[i]%(2**j)==0:\r\n if 2**j>o:\r\n o=2**j\r\nfor i in range(a):\r\n if b[i]%o==0:\r\n k+=1\r\nprint(o,k)\r\n", "from math import log2\r\ndef c(a, b):\r\n for i in a:\r\n if i % b == 0:\r\n return True\r\n return False\r\ndef cnt(a, b):\r\n ans = 0\r\n for i in a:\r\n if i % b == 0:\r\n ans += 1\r\n return ans\r\ninput()\r\na = [int(i) for i in input().split()]\r\nb = 2\r\nwhile c(a, b):\r\n b *= 2\r\nprint(b // 2, cnt(a, b // 2))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = 0\r\nc = 0\r\nd = []\r\nfor i in range(n) :\r\n while True :\r\n b = a[i] / 2 ** c\r\n if b != int(b) :\r\n break\r\n c += 1\r\n d.append(2 ** (c-1))\r\n c = 0\r\np = max(d)\r\np1 = d.count(p)\r\nprint(p , p1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=1\r\nn=0\r\nfor i in range(len(a)):\r\n s=a[i]\r\n f=True\r\n while f:\r\n if s%(k*2)==0:\r\n k*=2\r\n else:\r\n f=False\r\n \r\nfor i in range(len(a)):\r\n if a[i]%k==0:\r\n n+=1\r\nprint(k,n)\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nans = [0 for i in range(n)]\r\nj = 2\r\nfor i in range(n):\r\n while arr[i] % j == 0:\r\n ans[i] += 1\r\n arr[i] //= j\r\nprint(2 ** max(ans), ans.count(max(ans)))\r\n", "a = input()\r\na = list(map(int,input().split()))\r\ni = 0\r\n\r\nwhile len(a) > 0:\r\n n = len(a)\r\n i += 1\r\n a = [x//2 for x in a if not x % 2]\r\n\r\nprint(2 ** (i-1), n)\r\n", "n = int(input())\r\ncount = 0\r\nmax_t = 0\r\np = list(map(int,input().split()))\r\nfor i in range(n):\r\n x = bin(p[i])\r\n j = len(x) - 1\r\n now_t = 0\r\n while x[j] == '0':\r\n now_t += 1\r\n j -= 1\r\n if i == 0:\r\n max_t = now_t\r\n count = 1\r\n else:\r\n if now_t > max_t:\r\n count = 1\r\n max_t = now_t\r\n elif now_t == max_t:\r\n count += 1\r\nprint(2**max_t, count)", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(read())\r\nans = -1\r\ncnt = 0\r\nfor i in range(n):\r\n r = 0\r\n while a[i] % (2 ** r) == 0:\r\n r += 1\r\n r -= 1\r\n if r > ans:\r\n ans = r\r\n cnt = 1\r\n elif r == ans:\r\n cnt += 1\r\nprint(2 ** ans, cnt)\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nma=0\r\nfor i in range(n):\r\n s=a[i]\r\n st=1\r\n while s!=1:\r\n if s%2==0:\r\n s//=2\r\n st*=2\r\n else:\r\n break\r\n if st>ma:\r\n ma=st\r\nv=0\r\nfor i in range(n):\r\n if a[i]%ma==0:\r\n v+=1\r\nprint(ma,v)\r\n\r\n", "\r\nlength = input()\r\na = input().split(\" \")\r\ns = []\r\nh = 0\r\nfor i in a:\r\n s.append(0)\r\n #print(h)\r\n for j in range(0, 100):\r\n if int(i) % 2**j != 0:\r\n # print(2**(j-1))\r\n s[h] = j-1\r\n break\r\n h += 1\r\n# print(s)\r\nmaxi = max(s)\r\nprint(str(2**maxi) + \" \" + str(s.count(maxi)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "input()\nns = list(map(int, input().split()))\n\nans = []\n\nfor n in ns:\n i = 0\n while n & 1 == 0:\n n >>= 1\n i += 1\n ans.append(i)\n\nx = max(ans)\nn = ans.count(x)\n\nprint(1 << x, n)\n\n", "import sys\r\nn=int(input())\r\nz=list(map(int,input().split()))\r\nmax_=0\r\nfor i in range(n):\r\n f=z[i]\r\n ctr=0\r\n while True:\r\n if f%2==0:\r\n f//=2\r\n ctr+=1\r\n else:\r\n break\r\n max_=max(max_,ctr)\r\nprint(2**max_,end=' ')\r\nctr=0\r\nf=2**max_\r\nfor i in range(n):\r\n if z[i]%f==0:\r\n ctr+=1\r\nprint(ctr)", "n = int(input())\r\na = [0]*n\r\ns = input().split()\r\nx = 0\r\ny = 0\r\nb = []\r\nfor i in range(n):\r\n a[i] = int(s[i])\r\nfor i in range(n):\r\n while (a[i])%2==0:\r\n a[i]=(a[i]//2)\r\n x += 1\r\n b.append(x)\r\n x = 0\r\nprint(2**(max(b)), b.count(max(b)))\r\n\r\n", "maxst = 0\r\ncount = 0\r\nn = int(input())\r\nM = input().split()\r\nfor i in range(0,n):\r\n ni = int(M[i])\r\n for j in range(maxst,30):\r\n if ni % 2**j==0:\r\n if maxst<j:\r\n maxst = j\r\n count = 0\r\n count += 1\r\n else: break\r\nprint(2**maxst,count)\r\n", "input()\nnumbers = list(map(int, input().split(\" \")))\n\n\ndef max2pow(number):\n answer = []\n for y in range(0, 1000):\n if number % pow(2, y) == 0:\n answer.append(y)\n return max(answer)\n\nans = []\nfor x in numbers:\n ans.append(max2pow(x))\nans = pow(2, max(ans))\nans1 = 0\nfor x in numbers:\n if x % ans == 0:\n ans1 += 1\nprint(ans, ans1)\n", "from math import sqrt\nn = int(input())\na = list(map(int,input().split()))\ndelit = []\nstepen= []\nfor i in a:\n stepen = []\n for z in range(i):\n if i/2**z<1:\n break\n if i%(2**z)==0: stepen.append(2**z)\n delit.append(max(stepen))\nprint(max(delit),delit.count(max(delit)))", "from math import log\r\nn = int(input())\r\nA = list(map(int,input().split()))\r\nA.sort(reverse=True)\r\nmaxi = int(log(A[0] , 2))\r\nb = 0\r\nwhile True:\r\n for i in range(n):\r\n if A[i] % 2**maxi == 0:\r\n b += 1\r\n if b == 0:\r\n maxi -= 1\r\n else:\r\n print(2**maxi, b)\r\n break\r\n \r\n\r\n", "n = input()\ncur = 0\ncnt = 0\nfor i in map(int, input().split()):\n c = 0\n while i % 2 == 0:\n i >>= 1\n c += 1\n if c > cur:\n cur = c\n cnt = 1\n elif c == cur:\n cnt += 1\nprint(2 ** cur, cnt)", "n=int(input())\r\na=list(map(int,input().split()))\r\nr=2\r\nk=0\r\nr1=1\r\nk1=0\r\nt=True\r\nwhile t:\r\n for i in range(n):\r\n if a[i]%r1==0:\r\n k1+=1\r\n if k1!=0:\r\n k=k1\r\n k1=0\r\n r=r1\r\n r1*=2\r\n t=True\r\n else:\r\n break\r\nprint(r,k)\r\n \r\n", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\na = [[i,0] for i in a]\r\n\r\nfor i in a:\r\n while i[0]%2 == 0:\r\n i[0] //= 2\r\n i[1]+=1\r\n\r\nfake = [i[1] for i in a]\r\nm = max(fake)\r\nprint(2**m,fake.count(m))", "n = int(input())\na = list(map(int, input().split()))\npw = [0] * 40\nfor i in a:\n\tx = 1\n\tpos = 0\n\twhile i % x == 0:\n\t\tpw[pos] += 1\n\t\tpos += 1\n\t\tx *= 2\nfor i in range(39, -1, -1):\n\tif pw[i] != 0:\n\t\tprint(2 ** i, pw[i])\n\t\tbreak", "import math\r\n\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\ndef checkStepen(a):\r\n stepen=0\r\n while True:\r\n if a%2==0:\r\n a//=2\r\n stepen+=1\r\n else: break;\r\n return 2**stepen\r\nr=0\r\nmax=0\r\nfor i in a:\r\n k=checkStepen(i)\r\n if(k>r):\r\n max=1\r\n r=k\r\n elif (k==r):\r\n max+=1\r\nprint(r,max)" ]

[ "n, s, t = int(input()), input(), input()\nans = []\nfor i in range(n):\n cur = 0\n for j in range(n - i):\n if s[j] == t[i]:\n cur = j\n break\n else:\n print(-1)\n raise SystemExit\n ans.extend([n - 1 - cur, 1, n])\n #print('s[%d:0:-1]:' % (cur - 1), s[cur - 1:0:-1])\n #print('s[%d:]:' % (cur + 1), s[cur + 1:])\n #print('cur:', cur)\n s = s[max(cur - 1, 0):0:-1] + (s[0] if cur != 0 else '') + s[cur + 1:]\n #print('s:', s)\n #print('*'*20)\n \nprint(len(ans))\nprint(*ans)\n", "n = int(input())\r\ns = input()\r\nt = input()\r\ns0 = sorted(list(s))\r\nt0 = sorted(list(t))\r\nif s0 != t0 :\r\n print(-1)\r\nelse:\r\n ans = []\r\n for i in range(n):\r\n j = 0\r\n while (s[j] != t[i]):\r\n j = j + 1\r\n ans += [n - j - 1, 1, n]\r\n s = ''.join(reversed(s[:j])) + s[j + 1:] + s[j]\r\n print(len(ans))\r\n print(\" \".join(str(i) for i in ans))", "import math\nimport sys\ninput = sys.stdin.readline\nresult = []\ndef move(s, x):\n result.append(x)\n # print(s[-1:-1-x:-1] + s[:len(s) - x])\n return s[-1:-1-x:-1] + s[:len(s) - x]\ndef getFirst(s, need, size):\n piv = -1\n for i in range(size, len(s)):\n if s[i] == need:\n piv = i\n break\n if piv == -1:\n print(-1)\n exit(0)\n s = move(s, len(s) - piv)\n s = move(s, piv - size)\n s = move(s, size + 1)\n return s\nn = int(input())\ns = input().strip()\nt = input().strip()\nl, r = len(s) // 2, len(s) // 2\ns = getFirst(s, t[l], 0)\nsize = 1\nwhile size < len(s):\n if size % 2 == 1:\n l = l - 1\n s = getFirst(s, t[l], size)\n else:\n r = r + 1\n s = getFirst(s, t[r], size)\n size = size + 1\n # print(s)\nif s != t:\n s = move(s, len(s))\n# print(s)\nprint(len(result))\nprint(' '.join(map(str, result)))\n", "size = int(input())\r\nstart = input()\r\ntarget = input()\r\ncapture = []\r\nfirst = sorted(start); second = sorted(target)\r\nif first != second:\r\n print(-1)\r\nelse:\r\n for x in range(size):\r\n similar = 0\r\n while start[similar] != target[x]:\r\n similar += 1\r\n capture.append(str(size - similar - 1))\r\n capture.append(str(1))\r\n capture.append(str(size))\r\n # the three operations \r\n start = \"\".join(reversed(start[:similar]))+start[similar+1:]+start[similar]\r\n print(len(capture))\r\n print(\" \".join(capture))\r\n", "n, s, t = int(input()), input(), input()\r\n#print n, s, t\r\nif sorted(s)!=sorted(t):\r\n print(-1)\r\nelse:\r\n ans = []\r\n def shift(k, cur):\r\n if k == 0:\r\n return cur\r\n return cur[:-k-1:-1] + cur [:-k]\r\n \r\n def DO_SWAP(x):\r\n ans.append(x)\r\n return shift(x, s)\r\n #[begin:end:step]\r\n \r\n \r\n for i in range(n):\r\n curr = t[i]\r\n j = -1\r\n for k in range(n-i):\r\n if s[k] == curr:\r\n j = k\r\n break\r\n s = DO_SWAP(n-j-1)\r\n s = DO_SWAP(1)\r\n s = DO_SWAP(n-1)\r\n assert s == t\r\n print (len(ans))\r\n for x in ans:\r\n print(x, end = \" \") \r\n #print(*args, sep=' ', end='\\n', file=None)", "n = int(input())\n\ns = input()\n\nt = input()\n\n\n\nif sorted(s) != sorted(t):\n\n print(-1)\n\nelse:\n\n res = []\n\n for i in range(n):\n\n k = 0\n\n while(s[k] != t[i]):\n\n k += 1\n\n res += [n - k - 1, 1, n]\n\n s = ''.join(reversed(s[:k])) + s[k + 1:] + s[k]\n\n# print(s)\n\n print(len(res))\n\n print(*res)\n\n\n\n \n\n\n\n# Made By Mostafa_Khaled", "ans = []\n\ndef op(s, l):\n if l == 0:\n return s\n ans.append(l)\n return s[-l:][::-1] + s[:-l]\n\ndef reform(s, a, b, c):\n if b < c:\n s = op(s, len(s) - c - 1)\n s = op(s, c - b + 1)\n s = op(s, len(s) - c + b)\n s = op(s, c - b - 1)\n return s\n else:\n s = op(s, len(s) - b - 1)\n s = op(s, 1)\n s = op(s, b - c)\n s = op(s, n)\n s = op(s, b - c - 1)\n return s\n\nn = int(input())\ns, t = input(), input()\n\ndef countSig(u):\n d = {}\n for c in u:\n if c in d:\n d[c] += 1\n else:\n d[c] = 1\n return tuple(sorted(d.items()))\n\nif countSig(s) != countSig(t):\n print('-1')\n exit()\n\nif t[0] != s[-1]:\n s = op(s, n - s.index(t[0]) - 1)\n\na = 1\nwhile a + 2 <= len(s):\n u, v = t[a], t[a + 1]\n if u == v:\n x = s.index(u)\n y = s.index(u, x + 1)\n else:\n x = s.index(u)\n y = s.index(v)\n s = reform(s, a, x, y)\n a += 2\n\nif a < n:\n s = op(s, n - 1)\n s = op(s, 1)\n s = op(s, n)\n a = n\n\nprint(len(ans))\nprint(*ans)\n", "n, s, t = int(input()), input(), input()\nans = []\nfor i in range(n):\n cur = 0\n for j in range(n - i):\n if s[j] == t[i]:\n cur = j\n break\n else:\n print(-1)\n raise SystemExit\n ans.extend([n - 1 - cur, 1, n])\n s = ''.join(reversed(s[0:cur])) + s[cur + 1:]\n #print('cur:', cur)\n #print('s:', s)\nprint(len(ans))\nprint(*ans)\n" ]

[ "p = int(1e9+7)\r\nN = 100\r\nfact= [1]*(N+1)\r\nfor i in range(2,N+1):\r\n fact[i]=(fact[i-1]*i)%p\r\n\r\ndef bpow(a,b,p):\r\n c = 1\r\n while b>0:\r\n if b&1: c=(c*a)%p\r\n a = (a*a)%p\r\n b = b>>1\r\n return c\r\n\r\ndef inv(a,p):\r\n return bpow(a,p-2,p)\r\n\r\ndef bino(n,k):\r\n global fact,p\r\n if k==0: return 1\r\n return fact[n]*inv(fact[k],p)%p*inv(fact[n-k],p)%p\r\n\r\ndef solv(n,A):\r\n global p\r\n sa = sum(A)\r\n if sa>n: return 0\r\n F = [1]+[0]*n\r\n mi = 0\r\n for d in range(9,0,-1): #A[9]..A[0]\r\n mi += A[d]\r\n for i in range(n,mi-1,-1): #enough bits to have val\r\n tf = 0\r\n k1 = A[d]\r\n k2 = k1 + (i-mi)\r\n for k in range(k1,k2+1):\r\n tf = (tf+bino(i,k)*F[i-k]%p)%p\r\n F[i] = tf\r\n for i in range(mi): F[i]=0\r\n mi += A[0]\r\n for i in range(n,mi-1,-1):\r\n tf = 0\r\n k1 = A[0]\r\n k2 = k1 + (i-mi)\r\n for k in range(k1,k2+1):\r\n b = bino(i-1,k) if i>k else 0\r\n tf = (tf+b*F[i-k]%p)%p\r\n F[i] = tf\r\n for i in range(mi): F[i]=0\r\n return sum(F[1:])%p\r\n \r\nn = int(input())\r\nl = list(map(int,input().split())) \r\nprint(solv(n,l))\r\n", "M=10**9+7\r\nR=100\r\nFact=[1]*(R+1)\r\nfor i in range(2,R+1):\r\n Fact[i]=(i*Fact[i-1])%M\r\nFacthyp=[1]*(R+1)\r\nFacthyp[R]=pow(Fact[R],M-2,M)\r\nfor i in range(R-1,-1,-1):\r\n Facthyp[i]=((i+1)*Facthyp[i+1])%M\r\ndef C(n,k):\r\n if n<k or n<0 or k<0:\r\n return 0\r\n return (Fact[n]*Facthyp[n-k]*Facthyp[k])%M\r\nn=int(input())\r\na=[int(e) for e in input().split()]\r\nif sum(a)>n:\r\n print(0)\r\nelse:\r\n c0=a[0]\r\n a=a[1:]\r\n F=[[0]*9 for i in range(n+1)]\r\n for i in range(n+1):\r\n F[i][0]=(i>=a[0])\r\n for j in range(1,9):\r\n for i in range(n+1):\r\n F[i][j]=sum(C(i,i-k)*F[i-k][j-1] for k in range(a[j],i+1))%M\r\n s=0\r\n for i in range(1,n+1):\r\n s+=sum(C(k+i-1,i-1)*F[i][8] for k in range(c0,n-i+1))%M\r\n s%=M\r\n print(s)", "R,G=lambda:map(int,input().split()),range;n,=R();N=n+1\r\nc=[*R()];s=sum(c);M=10**9+7;z=0;C=[[0]*N for _ in G(N)]\r\nfor i in G(N):\r\n C[i][0]=C[i][i]=1\r\n for j in G(1,i):C[i][j]=(C[i-1][j]+C[i-1][j-1])%M\r\nf=[[0]*N for _ in G(11)];f[10][0]=1\r\nfor d in G(9,0,-1):\r\n for i in G(c[d],N):\r\n for j in G(c[d],N):\r\n f[d][i]=(f[d][i]+f[d+1][i-j]*C[i][j])%M\r\nfor i in G(1,N):\r\n for j in G(c[0],i):\r\n z=(z+f[1][i-j]*C[i-1][j])%M\r\nprint(z)", "n = int(input())\r\na = list(map(int, input().split()))\r\n \r\n \r\nfrom functools import lru_cache\r\n \r\nfrom math import comb\r\n \r\nM = 10 ** 9 + 7\r\n \r\n@lru_cache(None)\r\ndef dp(l, i):\r\n if i > 9:\r\n return int(l == 0)\r\n if l < 0:\r\n return 0\r\n \r\n if i == l == 0:\r\n return 0\r\n \r\n m = l - 1 if i == 0 else l\r\n extra = dp(l - 1, i) if i == 0 else 0\r\n \r\n return (sum((comb(m, k) % M) * dp(l - k, i + 1) for k in range(a[i], l + 1)) + extra) % M\r\n \r\nprint(dp(n, 0))", "R,G=lambda:map(int,input().split()),range\r\nn,=R();N=n+1;c=[*R()];M=10**9+7;z=0\r\nC=[[0]*N for _ in G(N)]\r\nfor i in G(N):\r\n C[i][0]=C[i][i]=1\r\n for j in G(1,i):C[i][j]=(C[i-1][j]+C[i-1][j-1])%M\r\nf=[[0]*N for _ in G(11)];f[10][0]=1\r\nfor d in G(9,0,-1):\r\n for i in G(n-c[d]+1):\r\n for j in G(c[d],n-i+1):\r\n f[d][i+j]=(f[d][i+j]+f[d+1][i]*C[i+j][j])%M\r\nfor i in G(1,n+1):\r\n for j in G(c[0],i):\r\n z=(z+f[1][i-j]*C[i-1][j])%M\r\nprint(z)" ]

[ "import operator\n\nn = int(input())\npoints = list(map(int, input().split()))\n\ndef praf(g):\n for i in g[1:]:\n print(''.join(i))\n\ndef calc(n):\n global points\n a = b = 0\n step = 1\n for i in range(n):\n a += points[i]\n b += points[i] * step\n step = -step\n return (a, b)\n\nseq = [(0, 0)]\nfor i in range(len(points)):\n seq.append(calc(i+1))\n\nseq = sorted(seq, key=lambda x: x[0])\nseq = {i: seq[i] for i in range(len(seq))}\n#print(seq)\n\nfor i in range(len(seq)):\n r = 0\n if i != len(seq)-1:\n if seq[i][1] > seq[i+1][1]:\n r = -1\n else:\n r = 1\n\n seq[i] = seq[i] + tuple([r])\n\n\nseqy = sorted(seq.items(), key=lambda x: x[1][1], reverse=True)\n\npts = {x[0]: x[2] for x in seq.values()}\n\npts[seq[len(seq)-1][0]] = 1\n\n#print('---seq---')\n#print(seq)\n#print('----seqy---')\n#print(seqy)\n#print('---pts---')\n#print(pts)\n\ngraph = [[' '] * seq[len(seq)-1][0] for x in range(seqy[0][1][1]-seqy[-1][1][1]+1)]\n\ny = seqy[0][1][1]\n\n\nway = pts[0]\nfor i in range(len(graph[0])):\n if i in pts.keys():\n if pts[i] != way:\n if way == 1:\n y+=1\n else:\n y-=1\n\n way = pts[i]\n\n\n graph[y][i] = '/' if way == 1 else '\\\\'\n y -= way\n# praf(graph)\n\n\n#print('----------------graph-----------------------------------------------------------')\npraf(graph)\n\n\n\n\n\n\n\n#praf(graph)\n\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nheight = 0\r\nmax_height = 0\r\nmin_height = 0\r\nwidth = 0\r\nfor i in range(n):\r\n width+=lis[i]\r\n if i %2 == 0:\r\n height+=lis[i]\r\n if height> max_height:\r\n max_height =height\r\n else:\r\n height-=lis[i]\r\n if height < min_height:\r\n min_height = height\r\nheight = max_height - min_height\r\narr = {}\r\nfor i in range(max_height-1,min_height-1,-1):\r\n arr[i] = [\" \"]*width\r\nx = 0\r\ny = 0\r\nfor i in range(n):\r\n if i%2 == 0:\r\n for j in range(lis[i]):\r\n arr[y][x] = \"/\"\r\n x+=1\r\n if(j != lis[i]-1):\r\n y+=1\r\n else:\r\n for j in range(lis[i]):\r\n arr[y][x] = \"\\\\\"\r\n x+=1\r\n if (j != lis[i] - 1):\r\n y-= 1\r\nfor i in arr.keys():\r\n print(\"\".join(arr[i]))", "n = int(input())\r\na = list(map(int, input().split()))\r\ngraph = [[' '] * 1000 for _ in range(2001)]\r\nx, y = 0, 1000\r\n\r\nfor i in range(n):\r\n for j in range(a[i]):\r\n if i % 2:\r\n graph[y][x] = '\\\\'\r\n if j != a[i] - 1:\r\n y += 1\r\n else:\r\n graph[y][x] = '/'\r\n if j != a[i] - 1:\r\n y -= 1\r\n x += 1\r\n\r\nfor i in range(2000, -1, -1):\r\n graph[i] = ''.join(graph[i][:x])\r\n if not len(set(graph[i]) & set(['/', '\\\\'])):\r\n graph.pop(i)\r\n\r\nprint('\\n'.join(graph))\r\n", "n = int(input())\r\na = [int(c) for c in input().split()]\r\n\r\nkardio = [[]]\r\n\r\n\r\n# for i in range(len(a)):\r\n# x += a[i]\r\n# if i % 2 == 1:\r\n# y -= a[i]\r\n# else:\r\n# y += a[i]\r\n#\r\n# kardio.append((x,y))\r\n#\r\n# print(kardio)\r\n\r\n\r\ndef add_to_kardio(index, symbol):\r\n # print('before_add',kardio,index,symbol)\r\n for i in range(len(kardio)):\r\n tmp = symbol if i == index else ' '\r\n kardio[i].append(tmp)\r\n # print('after_add',kardio)\r\n\r\ndef add_empty_top(length):\r\n # print('add_top',length,[' '] * length)\r\n kardio.insert(0, [' '] * length)\r\n\r\n\r\ndef add_empty_bottom(length):\r\n kardio.append([' '] * length)\r\n\r\ncurrent_x = 0\r\ncurrent_y = -1\r\n\r\nfor i in range(len(a)):\r\n if i % 2 == 0:\r\n current_y += 1\r\n for t in range(a[i]):\r\n # print('trying to up: ',current_y)\r\n current_y -= 1\r\n\r\n if current_y >= 0:\r\n add_to_kardio(current_y,'/')\r\n else:\r\n add_empty_top(current_x)\r\n current_y = 0\r\n add_to_kardio(current_y, '/')\r\n\r\n\r\n current_x +=1\r\n # print(kardio)\r\n else:\r\n current_y -= 1\r\n for t in range(a[i]):\r\n # print('trying to down: ',current_y)\r\n current_y += 1\r\n\r\n if current_y < len(kardio):\r\n add_to_kardio(current_y, '\\\\')\r\n else:\r\n add_empty_bottom(current_x)\r\n add_to_kardio(current_y, '\\\\')\r\n\r\n current_x +=1\r\n # print(kardio)\r\n\r\nfor i in range(len(kardio)):\r\n print(''.join(kardio[i]))", "import os\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom decimal import *\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict, deque\r\n\r\ndef r():\r\n return int(input())\r\ndef rm():\r\n return map(int,input().split())\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\nn = r()\r\na = rl()\r\nw = sum(a)\r\nh = -math.inf\r\nd = math.inf\r\nptr = 0\r\nfor i,j in enumerate(a):\r\n ptr += (j-1 if i%2==0 else 1-j)\r\n h = max(h,ptr)\r\n d = min(d,ptr)\r\n\r\nb = [[' ']*w for i in range(h+abs(d)+1)]\r\nj=0\r\nincr=True\r\nfor i in range(n):\r\n H=a[i]\r\n while H!=0:\r\n if incr:\r\n b[h][j]='/'\r\n j+=1\r\n h-=1\r\n else:\r\n b[h][j]='\\\\'\r\n j+=1\r\n h+=1\r\n H-=1\r\n if incr:\r\n h+=1\r\n else:\r\n h-=1\r\n incr = not incr\r\nfor i in b:\r\n print(*i,sep='')", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nminy = 0\r\nmaxy = 0\r\ns = 0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n s += a[i]\r\n else:\r\n s -= a[i]\r\n maxy = max(s, maxy)\r\n miny = min(s, miny)\r\ndif = maxy - miny\r\nsize = sum(a)\r\nres = [[\" \"] * size for i in range(dif)]\r\ncur = [maxy, 0]\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n cur[0] -= 1\r\n else:\r\n cur[0] += 1\r\n for j in range(a[i]):\r\n if i % 2 == 0:\r\n res[cur[0]][cur[1]] = \"/\"\r\n cur[0] -= 1\r\n else:\r\n res[cur[0]][cur[1]] = \"\\\\\"\r\n cur[0] += 1\r\n cur[1] += 1\r\n\r\nfor i in res:\r\n print(\"\".join(i))", "import operator\n\n\nn = int(input())\na = tuple(map(int, str.split(input())))\n\np = [(0, 0)]\nfor i, x in enumerate(a):\n\n p.append((p[-1][0] + x, p[-1][1] + (-1) ** i * x))\n\nymax = max(p, key=operator.itemgetter(1))[1]\nymin = min(p, key=operator.itemgetter(1))[1]\n\ncolumns = []\nfor i in range(n):\n\n x1, y1 = p[i]\n x2, y2 = p[i + 1]\n while x1 != x2:\n\n if y1 < y2:\n\n columns.append(\" \" * (ymax - y1 - 1) + \"/\" + \" \" * (y1 - ymin))\n y1 += 1\n\n else:\n\n columns.append(\" \" * (ymax - y1) + \"\\\\\" + \" \" * (y1 - ymin - 1))\n y1 -= 1\n\n x1 += 1\n\nprint(str.join(\"\\n\", map(lambda t: str.join(\"\", t), zip(*columns))))\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nmx=0\r\nmn=0\r\ns=0\r\nsm=0\r\na=[0]*(n+1)\r\nfor i in range(n):\r\n\tsm+=l[i]\r\n\tif i%2==0:\r\n\t\ts+=l[i]\r\n\telse:\r\n\t\ts-=l[i]\r\n\tmx=max(mx,s)\r\n\tmn=min(mn,s)\r\n\ta[i+1]=s\r\nfor i in range(n+1):\r\n\ta[i]-=mn\r\n\r\nmat=[]\r\nfor i in range(mx-mn):\r\n\tll=[\" \"]*sm\r\n\tmat.append(ll)\r\nj=a[0]\r\nk=0\r\na.append(5)\r\n# print(a,mx,mn,sm)\r\nf=0\r\nfor i in range(n):\r\n\tfor g in range(l[i]):\r\n\t\t# print(i,j,k)\r\n\t\tif i%2==0:\r\n\t\t\tif f==1:\r\n\t\t\t\tj+=1\r\n\t\t\t\tf=0\r\n\t\t\tmat[j][k]=\"/\"\r\n\t\t\tk+=1\r\n\t\t\tj+=1\r\n\t\t\tif j>=a[i+1]:\r\n\t\t\t\tj-=1\r\n\t\telse:\r\n\t\t\t# print(j,k)\r\n\t\t\tmat[j][k]='\\\\'\r\n\t\t\tk+=1\r\n\t\t\tj-=1\r\n\t\t\tf=1\r\n\t\t\t# if j<=a[i+1]:\r\n\t\t\t# \tj+=1\r\ni=len(mat)-1\r\nwhile(i>=0):\r\n\tfor j in mat[i]:\r\n\t\tprint(j,end=\"\")\r\n\tprint()\r\n\ti-=1\r\n# for i in l:\r\n# \tprint(i)\r\n# print(1)\r\n", "n, a = int(input()), list(map(int, input().split()))\n\nif n & 1: a.append(0)\n\nx, t = 0, [[' '] * sum(a) for i in range(2001)]\n\ny = u = v = 1000\n\nfor i in range(0, n, 2):\n\n for j in range(a[i]):\n\n t[y][x] = '/'\n\n x += 1\n\n y += 1\n\n v = max(v, y)\n\n for j in range(a[i + 1]):\n\n y -= 1\n\n t[y][x] = '\\\\'\n\n x += 1\n\n u = min(u, y)\n\nfor i in range(v - 1, u - 1, -1): print(''.join(t[i]))\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = [0] * (n + 1)\r\ny = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n x[i] = x[i - 1] + a[i - 1]\r\n y[i] = y[i - 1]\r\n if i % 2 == 0:\r\n y[i] -= a[i - 1]\r\n else:\r\n y[i] += a[i - 1]\r\n# print(x)\r\n# print(y)\r\nm = min(y)\r\nif m < 0:\r\n for i in range(n + 1):\r\n y[i] -= m\r\n# print(y)\r\nw = max(x)\r\nh = max(y)\r\n# print(h, w)\r\nd = [[\" \"] * w for i in range(h)]\r\nfor i in range(n):\r\n if y[i] < y[i + 1]:\r\n for j in range(a[i]):\r\n# print(y[i] + j, x[i] + j, \"/\")\r\n d[y[i] + j][x[i] + j] = \"/\"\r\n else:\r\n for j in range(a[i]):\r\n# print(y[i] - j - 1, x[i] + j, \"\\\\\")\r\n d[y[i] - j - 1][x[i] + j] = \"\\\\\"\r\nprint(\"\\n\".join(\"\".join(d[i]) for i in reversed(range(h))))", "#!/usr/bin/python3\n\nimport sys\nimport math\n\nn = int(sys.stdin.readline())\nmovement_array = [int(nbr) for nbr in sys.stdin.readline().split()]\n\nrelative_pos = [(0,1)]\ncurrentPos = 0\ndirection = 1\nfor move in movement_array:\n\tcurrentPos += move * direction\n\tdirection *= -1\n\trelative_pos.append((currentPos,direction))\n\nobjective_pos = []\n#print(relative_pos)\nminimum = min(relative_pos, key=lambda x: x[0])[0]\nfor n in range(0,len(relative_pos)):\n\tobjective_pos.append((relative_pos[n][0] + (-minimum), relative_pos[n][1]))\n\nwidth = 0\nfor n in range(0,len(objective_pos)-1):\n\twidth += math.fabs(objective_pos[n+1][0]-objective_pos[n][0])\nwidth = int(width)\n\nheight = max(objective_pos, key=lambda x: x[0])[0] + 1\n\nmatrix = [[\" \" for x in range(width)] for x in range(height-1)]\n\n#print(objective_pos)\n \nxpos = 0\nfor n in range(0,len(objective_pos)-1):\n\tdirection = objective_pos[n][1]\n\typos = objective_pos[n][0]\n\t#print(ypos)\n\ttargetpos = objective_pos[n+1][0]\n\twhile math.fabs(ypos - targetpos) > 0:\n\t\tif direction == 1:\n\t\t\tmatrix[ypos][xpos] = \"/\"\n\t\t\typos += 1\n\t\telse:\n\t\t\tmatrix[ypos-1][xpos] = \"\\\\\"\n\t\t\typos -= 1\n\t\txpos += 1\n\nfor row in reversed(matrix):\n\tprint(\"\".join(row))\n\n\n\n\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nMax = 1000\r\nMin = 1000\r\n\r\nsum = 0\r\nfor i in range(len(a)):\r\n sum += a[i]\r\n\r\nmyMap = [[\" \"] * 2020 for i in range(2020)]\r\n\r\nx, y = 1000, 0\r\nfor i in range(n):\r\n if (i & 1) == 0:\r\n for j in range(a[i]):\r\n myMap[x][y] = \"/\"\r\n x -= 1\r\n y += 1\r\n x += 1\r\n else:\r\n for j in range(a[i]):\r\n myMap[x][y] = \"\\\\\"\r\n x += 1\r\n y += 1\r\n x -= 1\r\n Max = max(Max, x)\r\n Min = min(Min, x)\r\n\r\n\r\n \r\nfor i in range(Min, Max + 1):\r\n print(\"\".join(myMap[i][:y]))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nl = 0\r\nmx = 0\r\nmn = 0\r\ns = 0\r\n\r\nfor i in range(n):\r\n s = s + a[i]\r\n if(i%2==0):\r\n l = l + a[i]\r\n if(l > mx):\r\n mx = l\r\n else:\r\n l = l - a[i]\r\n if(l<mn):\r\n mn = l\r\n\r\nm = mx - mn\r\n\r\nans = []\r\nfor i in range(m):\r\n ans.append([' ']*s)\r\n\r\nr = mx\r\nc = -1\r\nfor i in range(n):\r\n if(i%2==0):\r\n for j in range(a[i]):\r\n c = c+1\r\n r = r-1\r\n ans[r][c] = '/'\r\n else:\r\n for j in range(a[i]):\r\n c = c+1\r\n ans[r][c] = '\\\\'\r\n r = r+1\r\n\r\n\r\nfor i in range(m):\r\n print(*ans[i],sep = '')" ]

[ "mod = 998244353\r\n\r\ndef binpow(num, p):\r\n if(p == 0):\r\n return 1\r\n if(p % 2 == 0):\r\n return binpow((num * num) % mod, p // 2)\r\n return (num * binpow(num, p - 1)) % mod\r\n\r\ndef rev(num):\r\n return binpow(num, mod - 2)\r\n\r\ndef solve(a, b):\r\n result = 1\r\n prev = 1\r\n for k in range(1, min(a, b) + 1):\r\n now = (prev * (a - (k - 1)) * (b - (k - 1)) * rev(k)) % mod\r\n result = (result + now) % mod\r\n prev = now\r\n return (result) % mod\r\n\r\na, b, c = map(int, input().split())\r\n\r\nres1 = solve(a, b)\r\nres2 = solve(b, c)\r\nres3 = solve(a, c)\r\n\r\nprint((res1 * res2 * res3) % mod)\r\n", "def extendedEuclidean(a,b,x,y):\n\n if b==0:\n return a,1,0\n\n d,x1,y1 = extendedEuclidean(b,a%b,x,y)\n \n x,y = y1,x1-y1*(a//b)\n\n return d,x,y\n\na,b,c = map(int,input().split())\n\nf = [1]*(1+max(a,b,c))\nfi = [1]*(1+max(a,b,c))\nm = 998244353\n\nfor i in range(1,1+max(a,b,c)):\n x = (f[i-1]*i)%m\n f[i] = x\n d,x,y = extendedEuclidean(x,m,1,1)\n fi[i] = x%m\n\n\nab=0\nbc=0\nca=0\n\nfor i in range(min(a,b)+1):\n ab+=(f[a]*fi[a-i]*f[b]*fi[b-i]*fi[i])%m\n\nfor i in range(min(b,c)+1):\n bc+=(f[c]*fi[c-i]*f[b]*fi[b-i]*fi[i])%m \n\nfor i in range(min(a,c)+1):\n ca+=(f[a]*fi[a-i]*f[c]*fi[c-i]*fi[i])%m\n\nprint((ab*bc*ca)%m)\n\n\n\n\n", "#Code by Sounak, IIESTS\r\n#------------------------------warmup----------------------------\r\n\r\nimport os\r\nimport sys\r\nimport math\r\nfrom io import BytesIO, IOBase\r\nfrom fractions import Fraction\r\nimport collections\r\nfrom itertools import permutations\r\nfrom collections import defaultdict\r\n\r\n\r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n#-------------------game starts now-----------------------------------------------------\r\nmod = 998244353\r\n \r\nf = [1]\r\nfor i in range(1, 5010):\r\n f += [f[i - 1] * i % mod]\r\n \r\n \r\ndef powmod(n, k):\r\n if k == 0:\r\n return 1\r\n res = powmod(n, k // 2)\r\n res *= res\r\n res %= mod\r\n if k % 2:\r\n res *= n\r\n res %= mod\r\n return res\r\n \r\n \r\ndef inv(n):\r\n return powmod(n, mod - 2)\r\n \r\n \r\ndef c(n, k):\r\n return f[n] * inv(f[n - k]) % mod * inv(f[k]) % mod\r\n \r\n \r\ndef match(a, b):\r\n res = 0\r\n for i in range(min(a, b) + 1):\r\n res += c(a, i) * c(b, i) * f[i] % mod\r\n res %= mod\r\n return res\r\n \r\n \r\nn,m,k = list(map(int, input().split()))\r\nprint(match(n, m) * match(n, k) * match(m, k) % mod)", "import sys\r\ninput=sys.stdin.readline\r\nabc=list(map(int,input().split()))\r\na=min(abc);c=max(abc);b=sum(abc)-a-c\r\ndef comb(n,r,mod):\r\n if r<0 or r>n:\r\n return 0\r\n return g1[n]*g2[r]*g2[n-r]%mod\r\nmod=998244353\r\nN=10**5\r\ng1=[1,1]\r\ng2=[1,1]\r\ninv=[0,1]\r\nfor i in range(2,N+1):\r\n g1.append((g1[-1]*i)%mod)\r\n inv.append((-inv[mod%i]*(mod//i))%mod)\r\n g2.append((g2[-1]*inv[-1])%mod)\r\nbc,ab,ca=0,0,0\r\nfor k in range(b+1):\r\n bc+=comb(c,k,mod)*comb(b,k,mod)*g1[k]%mod\r\n bc%=mod\r\nfor l in range(a+1):\r\n ab+=comb(b,l,mod)*comb(a,l,mod)*g1[l]%mod\r\n ab%=mod\r\nfor m in range(a+1):\r\n ca+=comb(a,m,mod)*comb(c,m,mod)*g1[m]%mod\r\n ca%=mod\r\nprint(ab*bc*ca%mod)", "def invmod(x, m):\r\n return pow(x, m - 2, m)\r\n\r\n\r\ndef nchoose(n, m):\r\n nchoose = [1]\r\n for i in range(n):\r\n nchoose.append(((nchoose[-1] * (n - i)) * invmod(i + 1, m)) % m)\r\n return nchoose\r\n\r\n\r\ndef fact(n, m):\r\n fact = [1]\r\n for i in range(n):\r\n fact.append((fact[-1] * (i + 1)) % m)\r\n return fact\r\n\r\nX = [int(x) for x in input().split(' ')]\r\nans = 1\r\nm = 998244353\r\nf = fact(max(X), m)\r\n\r\nfor i in range(3):\r\n for j in range(i + 1, 3):\r\n xci = nchoose(X[i], m)\r\n xcj = nchoose(X[j], m)\r\n c = 0\r\n for k in range(min(X[i], X[j]) + 1):\r\n c = (c + (((xci[k] * xcj[k]) % m) * f[k])) % m\r\n ans = (ans * c) % m\r\nprint(ans)", "p = 998244353\r\nN = 5000\r\nfact= [1]*(N+1)\r\nfor i in range(2,N+1):\r\n fact[i]=(fact[i-1]*i)%p\r\n\r\ndef bpow(a,b,p):\r\n c = 1\r\n while b>0:\r\n if b&1: c=(c*a)%p\r\n a = (a*a)%p\r\n b = b>>1\r\n return c\r\n \r\ndef inv(a,p): return bpow(a,p-2,p)\r\n\r\ndef comb(a,b):\r\n ans = 1\r\n for m in range(1,min(a,b)+1):\r\n t = fact[a]*fact[b]%p\r\n u = fact[a-m]*fact[b-m]%p*fact[m]%p\r\n ans += t*inv(u,p)%p\r\n return ans\r\n\r\ndef solv(a,b,c):\r\n return comb(a,b)*comb(b,c)%p*comb(a,c)%p\r\n\r\na,b,c = map(int,input().split())\r\nprint(solv(a,b,c))\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\np = 998244353\r\nfact_dict = [1, 1]\r\nfor i in range(2, 10001):\r\n fact_dict.append((fact_dict[-1]*i) % p)\r\ninv_dict = []\r\nfor x in fact_dict:\r\n inv_dict.append(pow(x, p-2, p))\r\n \r\ndef binom(a, b):\r\n return (fact_dict[a]*inv_dict[b]*inv_dict[a-b]) % p\r\ndef f(a, b):\r\n answer = 0 \r\n for c in range(min(a, b)+1):\r\n answer = (answer+binom(a, c)*binom(b, c)*fact_dict[c]) % p\r\n return answer \r\ndef process(a, b, c):\r\n answer = (f(a, b)*f(b, c)*f(a, c))% p \r\n sys.stdout.write(f'{answer}\\n')\r\n return \r\n \r\na, b, c = [int(x) for x in input().split()]\r\nprocess(a, b, c)", "import math\n\nmod = 998244353\n\nfactmod = [0]*5001\n\nfactmod[0] = 1\nfor i in range(1, 5001):\n\tfactmod[i] = (factmod[i-1] * i) % mod\n\n\t\ndef nCk(n,k):\n\t'''if k > n//2:\n\t\tk=n-k\n\tret = 1\n\tfor i in range(1, k+1):\n\t\tret = ret * (n-i+1) // i\n\treturn ret\t'''\n\tif n==a:\n\t\treturn aCks[k]\n\tif n==b:\n\t\treturn bCks[k]\n\tif n==c:\n\t\treturn cCks[k]\n\txxx\n\t\n\t#return math.factorial(n) // math.factorial(k) // math.factorial(n-k)\n\ndef calc(x,y):\n\tglobal mod\n\tx,y = min(x,y), max(x,y)\n\tsm = 0\n\tfor i in range(x+1):\n\t\t\n\t\tsm += ((nCk(x, i)) % mod) * ((nCk(y, i)) % mod) * ((factmod[i]) % mod)\n\t\tsm = sm % mod\n\treturn sm\n\n#print(factmod[5], nCk(5, 3))\n\na,b,c = list(map(int, input().split()))\n\naCks = [1]*(a+1)\nfor i in range(1, a):\n\taCks[i] = aCks[i-1] * (a-i+1) // (i)\naCks = [aCks[i] % mod for i in range(len(aCks))]\n#print(aCks[:a+1])\n\nbCks = [1]*(b+1)\nfor i in range(1, b):\n\tbCks[i] = bCks[i-1] * (b-i+1) // (i)\nbCks = [bCks[i] % mod for i in range(len(bCks))]\n\ncCks = [1]*(c+1)\nfor i in range(1, c):\n\tcCks[i] = cCks[i-1] * (c-i+1) // (i)\ncCks = [cCks[i] % mod for i in range(len(cCks))]\n\n#print(aCks)\n#print(bCks)\n#print(cCks)\n\t\n\nprint((calc(a,b)*calc(b,c)*calc(a,c)) % mod)\n\n", "a,b,c=map(int,input().split())\r\nmod=998244353\r\nab=0\r\nfac=[1]*5001\r\ndef modinv(a):\r\n global mod\r\n return pow(a,mod-2,mod)\r\nmodiv=[0]*5001\r\nfor i in range(2,5001):\r\n fac[i]=(fac[i-1]*i)%mod\r\nfor i in range(5001):\r\n modiv[i]=modinv(fac[i])\r\ndef ncr(n,r):\r\n global modiv,fac\r\n ans=1\r\n ans=fac[n]\r\n ans*=modiv[n-r]\r\n ans*=modiv[r]\r\n return ans%mod\r\nfor i in range(min(a,b)+1):\r\n ab+=ncr(a,i)*ncr(b,i)*fac[i]\r\nbc=0\r\nfor i in range(min(c,b)+1):\r\n bc+=ncr(c,i)*ncr(b,i)*fac[i]\r\nac=0\r\nfor i in range(min(a,c)+1):\r\n ac+=ncr(a,i)*ncr(c,i)*fac[i]\r\nprint((ab*bc*ac)%mod)", "f=[1]*50001\r\nmod=998244353\r\nfor i in range(1,5001):\r\n f[i]=(f[i-1]*i)%mod\r\na,b,c=(int(i) for i in input().split())\r\ndef pwr(b,e):\r\n if(b==0): return 0\r\n if(e==0): return 1\r\n if(e%2==0):\r\n z=pwr(b,e/2)%mod\r\n return (z*z)%mod\r\n return (b*pwr(b,e-1))%mod\r\ndef nCr(n,r):\r\n den=(f[r]*f[n-r])%mod\r\n return (f[n]*pwr(den,mod-2))%mod\r\ndef g(x,y):\r\n mn=min([x,y])\r\n sm=0\r\n global mod\r\n for i in range(0,mn+1):\r\n sm+=(nCr(x,i)*nCr(y,i)*f[i])%mod\r\n sm=sm%mod\r\n return sm\r\nans=g(a,b)*g(b,c)*g(c,a)\r\nans=ans%mod\r\nprint(int(ans))\r\n \r\n", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[a, b, c] = list(map(int, input().split()))\r\n\r\nN = 5005;\r\nMOD = 998244353\r\nbin = [[0 for j in range(N)] for i in range(N)]\r\nfac = [0 for i in range(N)]\r\n\r\nfac[0] = 1\r\nfor i in range(1, N):\r\n fac[i] = (fac[i-1]*i)%MOD\r\nfor i in range(0, N):\r\n bin[i][0] = 1\r\nfor i in range(1, N):\r\n for j in range(1, N):\r\n bin[i][j] = (bin[i-1][j]+bin[i-1][j-1])%MOD\r\n\r\ndef calc(p, q):\r\n res = 0\r\n for i in range(min(p, q)+1):\r\n res += ((bin[p][i]*bin[q][i])%MOD*fac[i])%MOD\r\n res %= MOD\r\n return res\r\n\r\nres = ((calc(a, b)*calc(a, c))%MOD*calc(b, c))%MOD\r\nprint(res)\r\n", "mod=998244353\r\ndef cmb(n,r):\r\n if r<0 or r>n:\r\n return 0\r\n return (g1[n]*g2[r]*g2[n-r])%mod\r\n\r\ng1=[1,1]\r\ng2=[1,1]\r\ninv=[0,1]\r\nfor i in range(2,10003):\r\n g1.append((g1[-1]*i)%mod)\r\n inv.append((-inv[mod%i]*(mod//i))%mod)\r\n g2.append((g2[-1]*inv[-1])%mod)\r\nA,B,C=map(int,input().split())\r\nx=0\r\nfor i in range(B+1):\r\n x+=cmb(A,i)*cmb(B,i)*g1[i]\r\nz=0\r\nfor j in range(C+1):\r\n z+=cmb(A,j)*cmb(C,j)*g1[j]%mod\r\ny=0\r\nfor k in range(B+1):\r\n y+=cmb(B,k)*cmb(C,k)*g1[k]%mod\r\nprint(x*y*z%mod)", "def calcop(a,b): \r\n t=1\r\n p=1\r\n for i in range(0,min(a,b)):\r\n p *= (a-i)*(b-i) #Este algoritmo aprovecha los cálculos hechos hasta la iteración n\r\n p //= i+1 #para llevar a cabo los de la iteración n+1\r\n t+=p \r\n return t\r\na,b,c = map(int,input().split())\r\nf = 998244353\r\nans = calcop(a,b)*calcop(b,c)*calcop(c,a)%f\r\nprint(ans)\r\n\r\n", "a, b, c = map(int, input().split(' '))\r\np = 998244353\r\n\r\ndef calc (a, b) :\r\n\tif a > b:\r\n\t\ta, b = b, a\r\n\tans = 0\r\n\ttmp = 1\r\n\tfor i in range(a + 1):\r\n\t\tans = (ans + tmp) % p\r\n\t\ttmp = tmp * (a - i) * (b - i) * pow(i + 1, p - 2, p) % p\r\n\treturn ans\r\n\r\nans = calc(a, b) * calc(b, c) * calc(a, c) % p\r\n\r\nprint(ans)\r\n", "def ncr(n,r):\n\treturn (fact[n]*pow((fact[n-r]*fact[r])%mod,mod-2,mod))%mod\n\ndef calc(a,b):\n\tcount=1\n\tcount+=(a*b)\n\tfor i in range(2,min(a,b)+1):\n\t\t# print (ncr(a,i))\n\t\tcount=(count+(ncr(a,i)*ncr(b,i)*fact[i]))%mod\n\treturn count\n\nmod=998244353\nfact=[1,1]\nfor i in range(2,5001):\n\tfact.append((fact[-1]*i)%mod)\na,b,c=map(int,input().split())\nx1=calc(a,b)\nx2=calc(b,c)\nx3=calc(a,c)\n# print (x1,x2,x3)\nprint ((x1*x2*x3)%mod)", "a, b, c = map(int, input().split())\r\nmod = 998244353\r\n\r\n\r\ndef calc(x, y):\r\n ans, tmp = 1, 1\r\n for k in range(1, min(x, y) + 1):\r\n tmp = tmp * (x - k + 1) * (y - k + 1) // k\r\n ans += tmp\r\n\r\n return ans % mod\r\n\r\n\r\nprint((calc(a, b) * calc(b, c) * calc(c, a)) % mod)", "def schet(a, b) :\n\tMOD = 998244353\n\tif a > b:\n\t\ta, b = b, a\n\tans = 0\n\tk = 1\n\tfor i in range(a + 1):\n\t\tans = (ans + k) % MOD\n\t\tk = k * (a - i) * (b - i) * pow(i + 1, MOD - 2, MOD) % MOD\n\treturn ans\n\n\n\na, b, c = map(int, input().split())\nMOD = 998244353\nans = schet(a, b) * schet(b, c) * schet(a, c) % MOD\nprint(ans)\n\n \t\t\t\t\t\t \t\t \t \t\t\t\t\t\t\t\t\t\t", "a,b,c=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(5001):\r\n l.append([0])\r\n for j in range(5000):\r\n l[-1].append(0)\r\nl[1][0]=1\r\nl[1][1]=1\r\nfor i in range(2,5001):\r\n l[i][0]=1\r\n for j in range(1,5001):\r\n l[i][j]=(l[i-1][j]+l[i-1][j-1])%998244353\r\nfnl=[]\r\nfor i in range(5001):\r\n fnl.append(0)\r\nfnl[0]=0\r\nfnl[1]=1\r\nfnl[2]=2\r\nfor i in range(3,5001):\r\n fnl[i]= ((i-1)*(fnl[i-1]+fnl[i-2]))%998244353\r\ns1=1\r\nm1=min(a,b)\r\nfor i in range(1,m1+1):\r\n s1 = (s1 + (((fnl[i]*l[a][i])%998244353)* (l[b][i]%998244353))%998244353)%998244353\r\ns2=1\r\nm2=min(b,c)\r\nfor i in range(1,m2+1):\r\n s2 = (s2 + (((fnl[i]*l[b][i])%998244353)* (l[c][i]%998244353))%998244353)%998244353\r\ns3=1\r\nm3=min(c,a)\r\nfor i in range(1,m3+1):\r\n s3 = (s3 + (((fnl[i]*l[a][i])%998244353)* (l[c][i]%998244353))%998244353)%998244353\r\n\r\nprint ((((s1*s2)%998244353)*s3)%998244353)", "import os, sys, atexit\r\nfrom io import BytesIO, StringIO\r\n \r\ninput = BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n_OUTPUT_BUFFER = StringIO()\r\nsys.stdout = _OUTPUT_BUFFER\r\n \r\[email protected]\r\ndef write():\r\n sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\nf = [1] * 5003\r\nM = 998244353\r\nfor i in range(1, 5003):\r\n f[i] = (i % M * f[i - 1] % M) % M\r\ndef ncr(n, r):\r\n t1 = f[n]\r\n t2 = (f[r] % M * f[n - r] % M) % M\r\n return t1 * pow(t2, M - 2, M)\r\na, b, c = map(int, input().split())\r\nans = 1\r\ndef func(a, b):\r\n global ans\r\n M = 998244353\r\n if a > b: a, b = b, a\r\n count = 0\r\n for i in range(a + 1):\r\n t1 = ncr(a, i) % M\r\n t2 = (f[b] * pow(f[b - i], M - 2, M)) % M\r\n count += ((t1 * t2) % M)\r\n ans = ((ans % M) * (count % M)) % M\r\nfunc(a, b)\r\nfunc(b, c)\r\nfunc(c, a)\r\nprint(int(ans))", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\ndef cal(x, n):\r\n ans = 1\r\n sum1 = x\r\n while n > 0:\r\n if n&1:\r\n ans = (ans * sum1)%MON\r\n n >>= 1\r\n sum1 = (sum1 * sum1)%MON\r\nMON = 998244353\r\nN = 5000+20\r\n\r\ndef pecal():\r\n fact[0] = 1\r\n rfact[0] = 1\r\n for i in range(1,N):\r\n fact[i] = (fact[i-1]*i)%MON\r\n rfact[i] = pow(fact[i], MON-2, MON)\r\n return None\r\n\r\ndef cal(a, i):\r\n return (((fact[a] * rfact[a-i]) % MON) *rfact[i]) % MON\r\n\r\ndef solve(x, y):\r\n ans = 0\r\n k = min(x, y)\r\n for i in range(k+1):\r\n ans += (cal(x, i) * cal(y, i) % MON) * fact[i] % MON\r\n return ans\r\n\r\n\r\na,b,c = [int(x) for x in input().split(' ')]\r\nfact = [0]*N\r\nrfact = [0]*N\r\npecal()\r\nans = (solve(a, b) * solve(a, c) % MON)* solve(b, c) % MON\r\nprint(ans)", "a,b,c=map(int,input().split())\nM=998244353\ndef C(x, y):\n\tz,t=0, 1\n\tfor i in range(min(x,y)+1):\n\t\tz+=t\n\t\tt*=(x-i)*(y-i)*pow(i+1,M-2,M)%M\n\treturn z\nprint(C(a,b)*C(a,c)*C(b,c)%M)\n\n \t\t \t \t\t\t \t\t\t\t \t \t\t\t \t\t", "a, b, c = map(int, input().split())\r\nM = 998244353\r\ndef calc(a, b) :\r\n\tif a > b:\r\n\t\ta, b = b, a\r\n\tans = 0\r\n\tt = 1\r\n\tfor i in range(a + 1):\r\n\t\tans = (ans + t) % M\r\n\t\tt = t * (a - i) * (b - i) * pow(i + 1, M - 2, M) % M\r\n\treturn ans\r\nans = calc(a, b) * calc(b, c) * calc(a, c) % M\r\nprint(ans)", "def TheIntriguingObsession(a,b,c):\r\n return CantSegment(a,b) * CantSegment(b,c) * CantSegment(c,a) % 998244353\r\n\r\ndef CantSegment(a,b): \r\n result=1\r\n aux=1\r\n for i in range(0,min(a,b)):\r\n aux *= (a-i)*(b-i) \r\n aux //= i+1 \r\n result += aux \r\n return result\r\n\r\na,b,c = map(int,input().split())\r\nprint(TheIntriguingObsession(a,b,c))\r\n\r\n", "a, b, c = map(int, input().split())\r\nd = 998244353\r\n\r\ndef f(x, y):\r\n s, t = 0, 1\r\n for i in range(min(x, y) + 1):\r\n s = (s + t) % d\r\n t = t * (x - i) * (y - i) * pow(i + 1, d - 2, d) % d\r\n return s\r\n\r\nprint(f(a, b) * f(a, c) * f(b, c) % d)", "def swap(a, b):\n\ttemp = a\n\ta = b\n\tb = temp\n\n\n\ndef cc(a, b):\n\tif a> b:\n\t\tswap(a, b)\n\tk = 1\n\tans = 0\n\tfor i in range(a+1):\n\t\tans = (ans+k)%m\n\t\tk = (k* (a-i)*(b-i)*pow(i+1, m-2,m))%m\n\treturn ans\n\n\n\n\n\n\na, b, c = map(int, input().split())\nm = 998244353\nprint(cc(a, b)*cc(b, c)*cc(a, c)%m)\n\n\t \t \t \t\t\t\t\t\t\t \t\t\t \t\t \t\t\t", "def comb(n,r):\r\n if r>n or r<0:\r\n return 0\r\n return (fact[n]*inv_fact[r]*inv_fact[n-r]) % mod\r\n\r\nmod=998244353\r\nfact=[1,1]\r\ninv_fact=[1,1]\r\ninv=[0,1]\r\n\r\nfor i in range(2,10003):\r\n fact.append(fact[-1]*i%mod)\r\n inv.append((-inv[mod%i]*(mod//i)) % mod)\r\n inv_fact.append(inv_fact[-1]*inv[-1] % mod)\r\n\r\nr,b,p=map(int,input().split())\r\nans1,ans2,ans3=0,0,0\r\nfor i in range(r+1):\r\n ans1+=comb(r,i)*comb(b,i)*fact[i] % mod\r\nfor i in range(r+1):\r\n ans2+=comb(r,i)*comb(p,i)*fact[i] % mod\r\nfor i in range(b+1):\r\n ans3+=comb(b,i)*comb(p,i)*fact[i] % mod\r\nprint(ans1*ans2*ans3 % mod)", "a,b,c=map(int,input().split())\r\nans=0\r\nmod=998244353\r\nfact=[1]\r\nz=max(a,b,c)\r\nfor i in range(1,z+1):\r\n fact.append((fact[-1]*i)%mod)\r\nz=min(a,b)\r\nans1=0\r\ndef power(i,a,b):\r\n return pow(i,a,b)\r\nfor i in range(z+1):\r\n ans1=(ans1+(fact[a]*fact[b]*power(fact[i],mod-2,mod)*power(fact[i],mod-2,mod)*power(fact[a-i],mod-2,mod)*power(fact[b-i],mod-2,mod)*fact[i])%mod)%mod\r\nz=min(b,c)\r\nans2=0\r\nfor i in range(z+1):\r\n ans2=(ans2+(fact[c]*fact[b]*power(fact[i],mod-2,mod)*power(fact[i],mod-2,mod)*power(fact[c-i],mod-2,mod)*power(fact[b-i],mod-2,mod)*fact[i])%mod)%mod\r\nz=min(a,c)\r\nans3=0\r\nfor i in range(z+1):\r\n ans3=(ans3+(fact[c]*fact[a]*power(fact[i],mod-2,mod)*power(fact[i],mod-2,mod)*power(fact[c-i],mod-2,mod)*power(fact[a-i],mod-2,mod)*fact[i])%mod)%mod\r\nprint((ans1*ans2*ans3)%mod)", "import sys,math as mt\r\nimport heapq as hp\r\nimport collections as cc\r\nimport bisect as bi\r\nimport math as mt\r\nimport itertools as it\r\ninput=sys.stdin.readline\r\nI=lambda:list(map(int,input().split()))\r\nmod=998244353\r\n\r\ndef ncr(n,r,mod=998244353):\r\n\ttemp=1\r\n\ttem=min(n-r,r)\r\n\twhile r:\r\n\t\ttemp=((temp*n)%mod*pow(r,mod-2,mod))%mod\r\n\t\tn-=1\r\n\t\tr-=1\r\n\treturn temp\r\ndef ans(a,b):\r\n if(a<b):\r\n a,b=b,a\r\n temp=0\r\n an=1;\r\n for i in range(b+1):\r\n temp+=an;\r\n an=an*(a-i)//(i+1)*(b-i);\r\n return temp;\r\na,b,c=sorted(I())\r\nprint((ans(a,b)*ans(b,c)*ans(c,a))%mod)\r\n", "def calcop(a,b): \r\n t=1\r\n p=1\r\n for i in range(0,min(a,b)):\r\n p *= (a-i)*(b-i)\r\n p //= i+1\r\n t+=p \r\n return t\r\na,b,c = map(int,input().split())\r\nf = 998244353\r\nans = calcop(a,b)*calcop(b,c)*calcop(c,a)%f\r\nprint(ans)\r\n\r\n", "import math\r\nimport random \r\nimport time\r\nfrom collections import defaultdict\r\n \r\n \r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\nalfabet_2={'1':\"a\", '2':\"b\", '3':\"c\", '4':\"d\", '5':\"e\", '6':\"f\", '7':\"g\", '8':\"h\", '9':\"i\", '10':\"j\", '11':\"k\", '12':\"l\", '13':\"m\", '14':\"n\", '15':\"o\", '16':\"p\", '17':\"q\", '18':\"r\", '19':\"s\", '20':\"t\", '21':\"u\", '22':\"v\", '23':\"w\", '24':\"x\", '25':\"y\", '26':\"z\"}\r\n \r\n \r\n \r\ndef prime_generator(nr_elemente_prime):\r\n \r\n vector_prime=[-1]*nr_elemente_prime\r\n vector_rasp=[0]*nr_elemente_prime\r\n \r\n vector_prime[1]=1\r\n \r\n vector_rasp[1]=1\r\n#primes sieve \r\n contor=2\r\n \r\n for i in range(2,nr_elemente_prime):\r\n if vector_prime[i]==-1:\r\n vector_prime[i]=1\r\n vector_rasp[contor]=i\r\n contor=contor+1\r\n for j in range(i+i,nr_elemente_prime,i):\r\n if vector_prime[j]==-1:\r\n vector_prime[j]=i\r\n #print(i,j)\r\n \r\n \r\n \r\n set_prime=set(vector_rasp)\r\n set_prime.remove(0)\r\n set_prime.remove(1)\r\n \r\n answ_prime=list(set_prime)\r\n answ_prime.sort()\r\n return answ_prime\r\n \r\ndef binary_search(vector,valoarea):\r\n \r\n left=0\r\n right=len(vector)-1\r\n \r\n while left<=right:\r\n \r\n \r\n centru=(left+right)//2\r\n # print(left,right,centru,vector[centru])\r\n \r\n if vector[centru]<=valoarea:\r\n left=centru+1\r\n else:\r\n right=centru-1\r\n \r\n# print(left,right,centru,vector[centru]) \r\n return left\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\ndef main():\r\n answ=[]\r\n pp=10**9\r\n #teste=int(input())\r\n \r\n vector_factorial=[]\r\n vector_factorial.append(1)\r\n vector_factorial.append(1)\r\n rest=998244353\r\n #print(vector_factorial)\r\n \r\n for i in range(2,5001):\r\n #print(\"i=\",i,vector_factorial[i-1])\r\n val=i*vector_factorial[i-1]\r\n #print(\"val=\",val)\r\n \r\n vector_factorial.append(val)\r\n \r\n for gg in range(1):\r\n \r\n #stringul=input()\r\n #n=len(stringul)\r\n #answer=''\r\n #n=int(input())\r\n a,b,c=list(map(int,input().split()))\r\n \r\n #ab\r\n rest= 998244353\r\n \r\n total_ab=1\r\n min_ab=min(a,b)\r\n max_ab=max(a,b)\r\n factorial=1\r\n \r\n\r\n \r\n partial_max=max_ab\r\n partial_min=min_ab\r\n \r\n total_ab+=(max_ab*min_ab)\r\n \r\n \r\n #print(\"min ab=\",min_ab)\r\n # print(math.comb(39,6))\r\n \r\n for i in range(2,min_ab+1):\r\n #print(\"i=\",i)\r\n factorial=vector_factorial[i]\r\n \r\n partial_max=partial_max*(max_ab+1-i)//i\r\n partial_min=partial_min*(min_ab+1-i)//i\r\n\r\n c2=partial_max%rest\r\n c1=partial_min%rest\r\n \r\n total_ab+=(c1%rest*c2%rest*factorial%rest)%rest\r\n #print(i,total_ab,vector_factorial[min_ab],vector_factorial[min_ab-i])\r\n #print(\"i=\",i,total_ab)\r\n # print(\"total ab=\",total_ab)\r\n \r\n total_bc=1\r\n min_ab=min(b,c)\r\n max_ab=max(b,c)\r\n \r\n partial_max=max_ab\r\n partial_min=min_ab\r\n \r\n factorial=1\r\n \r\n \r\n \r\n total_bc+=(max_ab*min_ab)\r\n for i in range(2,min_ab+1):\r\n \r\n factorial=vector_factorial[i]\r\n \r\n partial_max=partial_max*(max_ab+1-i)//i\r\n partial_min=partial_min*(min_ab+1-i)//i\r\n\r\n c2=partial_max%rest\r\n c1=partial_min%rest\r\n \r\n \r\n total_bc+=(c1%rest*c2%rest*factorial%rest)%rest\r\n # print(\"total_bc=\",total_bc)\r\n \r\n total_ca=1\r\n min_ab=min(a,c)\r\n max_ab=max(a,c)\r\n \r\n partial_max=max_ab\r\n partial_min=min_ab\r\n factorial=1\r\n \r\n \r\n numitor_max=1\r\n numitor_min=1\r\n \r\n numarator_max=max_ab\r\n numarator_min=min_ab\r\n \r\n total_ca+=(max_ab*min_ab)\r\n \r\n for i in range(2,min_ab+1):\r\n \r\n factorial=vector_factorial[i]\r\n \r\n partial_max=partial_max*(max_ab+1-i)//i\r\n partial_min=partial_min*(min_ab+1-i)//i\r\n\r\n c2=partial_max%rest\r\n c1=partial_min%rest\r\n \r\n \r\n total_ca+=(c1%rest*c2%rest*factorial%rest)%rest\r\n \r\n \r\n answ=((total_ab*total_bc)%rest * total_ca)%rest\r\n #print(total_ab,total_bc,total_ca)\r\n print(int(answ))\r\n \r\nmain()", "M=998244353\r\nR=5000\r\nFact=[1]*(R+1)\r\nfor i in range(2,R+1):\r\n Fact[i]=(i*Fact[i-1])%M\r\nFacthyp=[1]*(R+1)\r\nFacthyp[R]=pow(Fact[R],M-2,M)\r\nfor i in range(R-1,-1,-1):\r\n Facthyp[i]=((i+1)*Facthyp[i+1])%M\r\ndef C(n,k):\r\n if n<k or n<0 or k<0:\r\n return 0\r\n return (Fact[n]*Facthyp[n-k]*Facthyp[k])%M\r\ndef A(n,k):\r\n if n<k or n<0 or k<0:\r\n return 0\r\n return (Fact[n]*Facthyp[n-k])%M\r\na,b,c=[int(e) for e in input().split()]\r\nprint((sum(C(a,i)*A(b,i) for i in range(min(a,b)+1))*sum(C(a,i)*A(c,i) for i in range(min(a,c)+1))*sum(C(b,i)*A(c,i) for i in range(min(b,c)+1)))%M)" ]

[ "n = int(input())\r\nmat=[]\r\na=-1\r\nb=-1\r\nans=True\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n mat.append(l)\r\ns =set()\r\n\r\nfor i in range(n):\r\n sum=0\r\n flag = False\r\n for j in range(n):\r\n if mat[i][j]==0:\r\n flag = True\r\n sum+=mat[i][j]\r\n if flag:\r\n if a==-1:\r\n a = sum\r\n else:\r\n if a!=sum:\r\n ans = False\r\n else:\r\n if b==-1:\r\n b = sum\r\n else:\r\n if b!=sum:\r\n ans = False\r\nfor i in range(n):\r\n sum=0\r\n flag = False\r\n for j in range(n):\r\n if mat[j][i]==0:\r\n flag = True\r\n sum+=mat[j][i]\r\n if flag:\r\n if a==-1:\r\n a = sum\r\n else:\r\n if a!=sum:\r\n ans = False\r\n else:\r\n if b==-1:\r\n b = sum\r\n else:\r\n if b!=sum:\r\n ans = False\r\nsum=0\r\nflag = False\r\nfor i in range(n):\r\n if mat[i][i]==0:\r\n flag=True\r\n sum+=mat[i][i]\r\nif flag:\r\n if a==-1:\r\n a = sum\r\n else:\r\n if a!=sum:\r\n ans = False\r\nelse:\r\n if b==-1:\r\n b = sum\r\n else:\r\n if b!=sum:\r\n ans = False\r\n\r\nsum=0\r\nflag = False\r\nfor i in range(n):\r\n if mat[i][n-i-1]==0:\r\n flag = True\r\n sum+=mat[i][n-i-1]\r\nif flag:\r\n if a==-1:\r\n a = sum\r\n else:\r\n if a!=sum:\r\n ans = False\r\nelse:\r\n if b==-1:\r\n b = sum\r\n else:\r\n if b!=sum:\r\n ans = False\r\nif n==1:\r\n print(1)\r\n\r\nelif ans and b>a:\r\n print(abs(a-b))\r\nelse:\r\n print(-1)\r\n# print(s)\r\n \r\n \r\n \r\n\r\n \r\n ", "n = int(input())\nmatrix = []\ni, j = 0, 0\nfor row in range(n):\n matrix.append([int(s) for s in input().split()])\n if 0 in matrix[-1]:\n i, j = row, matrix[-1].index(0)\n\nif n == 1:\n print(1)\nelse:\n x = sum(v for v in matrix[0 if i else 1]) - sum(v for v in matrix[i])\n matrix[i][j] = x\n ss = [sum(matrix[i]) for i in range(n)]\n ss += [sum(matrix[i][j] for i in range(n)) for j in range(n)]\n ss += [sum(matrix[i][i] for i in range(n))]\n ss += [sum(matrix[n - i - 1][i] for i in range(n))]\n\n print(x if len(set(ss)) == 1 and x > 0 else -1)\n\t \t \t\t \t \t \t \t\t\t \t\t\t\t\t", "def nums(a, n):\r\n S={sum(a[i][i] for i in range(n)), sum(a[i][n-i-1] for i in range(n))}\r\n for i in range(n):\r\n S|={sum(a[i]), sum(a[j][i] for j in range(n))}\r\n return {0, 1} if S=={0} else S\r\nn=int(input())\r\na=[list(map(int, input().split())) for i in range(n)]\r\nx, y=next((i, j) for i in range(n) for j in range(n) if a[i][j]==0)\r\nS=nums(a, n)\r\na[x][y]=max(S)-min(S)\r\nprint(-1 if len(nums(a, n))!=1 or a[x][y]<=0 else a[x][y])", "def sum_row(arr):\r\n ans = sum(arr[0])\r\n for i in range(1,len(arr)):\r\n if sum(arr[i])!=ans:\r\n return [False]\r\n return [True,ans]\r\ndef sum_col(arr):\r\n ans = None\r\n for i in range(len(arr)):\r\n temp = 0\r\n for j in range(len(arr[0])):\r\n temp+=arr[j][i]\r\n if ans==None:\r\n ans = temp\r\n else:\r\n if temp!=ans:\r\n return [False]\r\n return [True,ans]\r\ndef sum_diagonal(arr):\r\n ans = 0\r\n ans1 = 0\r\n for i in range(len(arr)):\r\n ans+=arr[i][i]\r\n ans1+=arr[i][len(arr)-i-1]\r\n return [True,ans] if ans==ans1 else [False]\r\ndef calculate_value(arr,row):\r\n return sum(arr[row])\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nif n==1:\r\n print(1)\r\n exit()\r\nflag = False\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]==0:\r\n if i!=0:\r\n want = calculate_value(a,i-1)-sum(a[i])\r\n else:\r\n want = calculate_value(a,i+1)-sum(a[i])\r\n a[i][j] = want\r\n flag = True\r\n break\r\n if flag:\r\n break\r\nrow = sum_row(a)\r\ncol = sum_col(a)\r\ndia = sum_diagonal(a)\r\nif row[0] and col[0] and dia[0]:\r\n if want<=0:\r\n print(-1)\r\n elif row[1]==col[1]==dia[1]:\r\n print(want)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)\r\n", "I=input\r\nR=range\r\nn=int(I())\r\nm=[list(map(int,I().split()))for _ in R(n)]\r\nif n==1:print(1);exit()\r\nx=0\r\nwhile m[x].count(0)==0:x+=1\r\nl=sum(m[0+(x==0)])-sum(m[x])\r\nm[x][m[x].index(0)]=l\r\na=[0]*n\r\nb=[0]*n\r\ng=[0]*2\r\nfor i in R(n):\r\n g[0]+=m[i][i];g[1]+=m[i][n-1-i]\r\n for j in R(n):a[i]+=m[i][j];b[i]+=m[j][i]\r\na+=b+g\r\nprint([-1,l][(min(a)==max(a))*(l>0)])", "n = int(input())\r\narr = [list(map(int, input().split())) for i in range(n)]\r\nif n == 1:\r\n print(1)\r\n exit()\r\ni = 0\r\nwhile i < n and arr[i].count(0) == 0: \r\n i += 1\r\nres = sum(arr[i == 0]) - sum(arr[i])\r\narr[i][arr[i].index(0)] = res\r\na, b, c =[0] * n, [0] * n, [0] * 2\r\nfor i in range(n):\r\n c[0] += arr[i][i]\r\n c[1] += arr[i][n-1-i]\r\n for j in range(n):\r\n a[i] += arr[i][j]\r\n b[i] += arr[j][i]\r\na += b + c\r\nif res <= 0 or min(a) != max(a):\r\n print(-1)\r\nelse:\r\n print(res)\r\n", "#See the constraints; check if Brute force is useful\r\n#Figure out a realtion or general formula if possible\r\n#Find the corner cases\r\n#dp,prefix sum, greedy solution or logical \r\n#Ek baar aur kr bro\r\n#Be organised \r\n#Think hard you can do it\r\n\r\ndef singleinput():R = int(input());return R\r\ndef strinput():R = str(input());return R\r\ndef intarray():As = list(map(int,input().split()));return As\r\ndef matrixinput(arr): As = list(map(int,input().split())); arr.append(As)\r\n\r\n\r\nn = singleinput()\r\nmatrix =[]\r\nfor i in range(0,n):\r\n matrixinput(matrix) \r\n\r\nrow,col,x = 0,0,0\r\nfor k in range(n):\r\n if 0 in matrix[k]:\r\n row = k\r\n col = matrix[row].index(0)\r\n break\r\n\r\nif(n==1):\r\n print(1)\r\nelse:\r\n \r\n if(row==0):\r\n x = sum(matrix[1]) - sum(matrix[row])\r\n \r\n else:\r\n x = sum(matrix[0]) - sum(matrix[row])\r\n matrix[row][col] = x\r\n s = [sum(matrix[i]) for i in range(n)]\r\n s += [sum(matrix[i][j] for i in range(n)) for j in range(n)]\r\n s += [sum(matrix[i][i] for i in range(n))]\r\n s += [sum(matrix[n-i-1][i] for i in range(n))]\r\n \r\n print(x if len(set(s))==1 and x>0 else -1)", "from sys import stdin\r\n\r\ninput = lambda: stdin.buffer.readline().rstrip(b'\\r\\n').decode('ascii')\r\nget_col = lambda arr, i: [row[i] for row in arr]\r\n\r\nn = int(input())\r\na = [[int(x) for x in input().split()] for _ in range(n)]\r\nsu, dis, ans = max([sum(x) for x in a]), set(), 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == 0:\r\n a[i][j] = ans = max(su - sum(a[i]), 1)\r\n dis.add(sum(a[i]))\r\n\r\nfor i in range(n):\r\n dis.add(sum(get_col(a, i)))\r\ndis.update({sum([a[i][i] for i in range(n)]), sum([a[i][n - i - 1] for i in range(n)])})\r\nprint(ans if len(dis) == 1 else -1)\r\n", "n=int(input())\r\n# import sys\r\n# for i in range(int(input())):\r\n # n=int(input())\r\n # arr=list(map(int,input().split()))\r\nif n==1:\r\n print(1)\r\n exit()\r\nans=set()\r\ndiag1=0;d1=0;d2=0;diag2=0;sum1=0;sum2=0\r\nres=set();zero=set();matrix=[]\r\nfor i in range(n):\r\n row=list(map(int,input().split()))\r\n matrix.append(row)\r\n if row[i]==0:\r\n d1=1\r\n if row[n-1-i]==0:\r\n d2=1\r\n diag1+=row[i]\r\n diag2+=row[n-1-i]\r\nif d1:\r\n zero.add(diag1)\r\nelse:\r\n res.add(diag1)\r\nif d2:\r\n zero.add(diag2)\r\nelse:\r\n res.add(diag2) \r\nf=0\r\nr=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if matrix[i][j]==0:\r\n f=1\r\n if matrix[j][i]==0:\r\n r=1\r\n sum1+=matrix[j][i]\r\n sum2+=matrix[i][j]\r\n if f:\r\n zero.add(sum2)\r\n f=0\r\n else:\r\n res.add(sum2)\r\n if r:\r\n zero.add(sum1)\r\n r=0\r\n else:\r\n res.add(sum1)\r\n sum1=0;sum2=0\r\nif (len(res)+len(zero))!=2:\r\n print(-1)\r\nelse:\r\n zero=list(zero)\r\n res=list(res)\r\n if zero[0]<res[0]:\r\n print(res[0]-zero[0])\r\n else:\r\n print(-1)", "n = int(input())\r\nflag = True\r\na = []\r\nfor i in range(n):\r\n b = [int(x) for x in input().split()]\r\n a.append(b)\r\n if flag:\r\n for j in range(n):\r\n if b[j]==0:\r\n flag = False\r\n row = i\r\n col = j\r\n break\r\nif n==1:\r\n print(\"1\")\r\nelse:\r\n d = set()\r\n e = set()\r\n for i in range(n):\r\n if i!=row:\r\n d.add(sum(a[i]))\r\n else:\r\n e.add(sum(a[i]))\r\n if i!=col:\r\n d.add(sum(a[j][i] for j in range(n)))\r\n else:\r\n e.add(sum(a[j][i] for j in range(n)))\r\n if len(d)==1 and len(e)==1:\r\n if row==col and row==n-col-1:\r\n temp1 = sum(a[i][i] for i in range(n))\r\n temp2 = sum(a[i][n-j-1] for i in range(n))\r\n temp3 = e.pop()\r\n if temp1==temp2==temp3:\r\n temp4 = d.pop()\r\n if temp4-temp1>0:\r\n print(temp4-temp1)\r\n else:\r\n print(\"-1\")\r\n else:\r\n print(\"-1\")\r\n elif row==col:\r\n e.add(sum(a[i][i] for i in range(n)))\r\n d.add(sum(a[i][n-i-1] for i in range(n)))\r\n if len(d)==len(e)==1:\r\n temp1 = d.pop()\r\n temp2 = e.pop()\r\n if temp1-temp2>0:\r\n print(temp1-temp2)\r\n else:\r\n print(\"-1\")\r\n else:\r\n print(\"-1\")\r\n elif row==n-col-1:\r\n d.add(sum(a[i][i] for i in range(n)))\r\n e.add(sum(a[i][n-i-1] for i in range(n)))\r\n if len(d)==len(e)==1:\r\n temp1 = d.pop()\r\n temp2 = e.pop()\r\n if temp1-temp2>0:\r\n print(temp1-temp2)\r\n else:\r\n print(\"-1\")\r\n else:\r\n print(\"-1\")\r\n else:\r\n d.add(sum(a[i][i] for i in range(n)))\r\n d.add(sum(a[i][n-i-1] for i in range(n)))\r\n if len(d)==1 and len(e)==1:\r\n temp1 = d.pop()\r\n temp2 = e.pop()\r\n if temp1-temp2>0:\r\n print(temp1-temp2)\r\n else:\r\n print(\"-1\")\r\n else:\r\n print(\"-1\")\r\n else:\r\n print(\"-1\")\r\n" ]

[ "#iterate through numbers\r\n#find prime factorization for each number\r\n#compute max value among each prime factor\r\n#increment each by 1\r\n\r\nfrom collections import defaultdict\r\nimport math\r\n\r\ndef primeFactors(n): \r\n prime = set()\r\n while n % 2 == 0: \r\n prime.add(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 prime.add(i)\r\n n = n//i \r\n if n > 2: \r\n prime.add(n)\r\n return list(prime)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nl = defaultdict(int)\r\n\r\nfor i in range(n):\r\n pf = primeFactors(a[i])\r\n mx = 0\r\n for j in pf:\r\n mx = max(mx, l[j])\r\n\r\n for j in pf:\r\n l[j] = mx+1\r\n\r\nmx = 1\r\nfor k,v in l.items():\r\n mx = max(mx, v)\r\n \r\nprint(mx)", "input()\r\na=list(map(int,input().split()))\r\nn=max(a)+1\r\nw=[0]*n\r\nt=[[]for i in range(n)]\r\nt[1]=[1]\r\nfor i in range(2,n):\r\n if not t[i]:\r\n for j in range(i,n,i): t[j]+=[i]\r\nfor i in a:\r\n q=max(w[j] for j in t[i])+1\r\n for j in t[i]:w[j]=q\r\nprint(max(w))", "n = int(input())\r\na = list(map(int, input().split()))\r\ndp = [1] * (n + 5)\r\ntmax = [0 for _ in range(100005)]\r\np = [[] for _ in range(100005)]\r\np[1] = [1]\r\nfor i in range(2, 100001):\r\n if p[i]==[]:\r\n for j in range(i, 100001, i):\r\n p[j].append(i)\r\n\r\nfor i in range(len(a)):\r\n dp[i] = max(tmax[j] for j in p[a[i]]) + 1\r\n for j in p[a[i]]: tmax[j] = max(tmax[j], dp[i])\r\nprint(max(dp))", "n = 100001\np = [0] * n\nt = [[] for i in range(n)]\nt[1] = [1]\nfor i in range(2, n):\n if not t[i]:\n t[i] = [i]\n for j in range(2 * i, n, i): t[j].append(i)\nn=int(input())\nl=[int(i) for i in input().split()]\n\nfor a in l:\n x=max(p[j] for j in t[a])+1\n for j in t[a]: p[j]=x\nprint(max(p))", "#!/usr/bin/env pypy3\r\n\r\nfrom sys import stdin, stdout\r\n\r\ndef input(): return stdin.readline().strip()\r\ndef read_int_list(): return list(map(int, input().split()))\r\ndef read_int_tuple(): return tuple(map(int, input().split()))\r\ndef read_int(): return int(input())\r\n\r\nimport math\r\n\r\nclass Sieve:\r\n def __init__(self, n=10**7+100):\r\n self.N = n\r\n\r\n s = [-1] * n\r\n for i in range(2, int(n**0.5)+1):\r\n if s[i] != -1: continue\r\n for j in range(i, n, i):\r\n if j > i: s[j] = i\r\n self.s = s\r\n\r\n self.PRIMES = self.primes()\r\n # print(len(self.PRIMES))\r\n\r\n def primes(self):\r\n return [i for i, e in enumerate(self.s) if e == -1 and i >= 2]\r\n\r\n def fastfactorize(self, n, exclude_duplicates=True):\r\n assert(n <= self.N)\r\n\r\n ret = []\r\n\r\n while self.s[n] != -1:\r\n p = self.s[n]\r\n ret += [p]\r\n if exclude_duplicates:\r\n while n % p == 0:\r\n n = n // p\r\n else:\r\n n = n // self.s[n]\r\n\r\n if n > 1:\r\n ret += [n]\r\n\r\n return ret\r\n\r\n def isprime(self, n):\r\n if n < self.N:\r\n return self.s[n] == -1\r\n for p in self.PRIMES:\r\n if p*p > n:\r\n return True\r\n if n % p == 0:\r\n return False\r\n\r\n def factorize(self, n):\r\n if n < self.N:\r\n return self.fastfactorize(n)\r\n\r\n for p in self.PRIMES:\r\n if p*p > n:\r\n break\r\n if n % p == 0:\r\n return [p] + self.factorize(n // p)\r\n\r\n return [n]\r\n\r\nsieve = Sieve()\r\n\r\ndef ans(A):\r\n A = sorted(list(set(A)))\r\n # print(A)\r\n MAX_A = max(A) + 1\r\n\r\n best_prime = [0]*MAX_A\r\n ret = [0]*MAX_A\r\n\r\n for a in A:\r\n ps = sieve.fastfactorize(a)\r\n ret[a] = 1\r\n for p in ps:\r\n ret[a] = max(ret[a], 1+best_prime[p])\r\n for p in ps:\r\n best_prime[p] = max(best_prime[p], ret[a])\r\n\r\n return max(ret)\r\n\r\ninput()\r\nprint(ans(read_int_list()))", "n=int(input())\r\nx=list(map(int,input().split()))\r\nv=[[] for i in range(100001)]\r\nmax,ans=[0]*100001,0\r\nfor i2 in range(1,x[n-1]+1):\r\n for i in range(i2,x[n-1]+1,i2):\r\n v[i].append(i2)\r\nfor i in range(n):\r\n temp=0\r\n for i2 in range(1,len(v[x[i]])):\r\n if temp<max[v[x[i]][i2]]:\r\n temp=max[v[x[i]][i2]]\r\n temp+=1\r\n for i2 in range(1,len(v[x[i]])):\r\n if temp>max[v[x[i]][i2]]:\r\n max[v[x[i]][i2]]=temp\r\n if ans<temp:\r\n ans=temp\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nN = 200001\r\n\r\np = [0] * N\r\na = [[] for _ in range(N)]\r\n\r\na[1] = [1]\r\n\r\nfor i in range(2, N):\r\n\ta[i].append(i)\r\n\tfor j in range(i * 2, N, i):\r\n\t\ta[j].append(i)\r\nfor i in map(int, input().split()):\r\n\tmx = max(p[j] for j in a[i]) + 1\r\n\tfor j in a[i]:\r\n\t\tp[j] = mx\r\nprint(max(p))\r\n", "n = 100001\r\np = [0] * n\r\nt = [[] for i in range(n)]\r\nt[1] = [1]\r\nfor i in range(2, n):\r\n if not t[i]:\r\n t[i] = [i]\r\n for j in range(2 * i, n, i): t[j].append(i)\r\ninput()\r\na = list(map(int, input().split()))\r\nfor i in a:\r\n x = max(p[j] for j in t[i]) + 1\r\n for j in t[i]: p[j] = x\r\nprint(max(p))", "def main():\n input()\n d = {}\n for a in map(int, input().split()):\n z, l = 0, []\n for p in (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,\n 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199,\n 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313):\n if not a % p:\n l.append(p)\n x = d.get(p, 0)\n if z < x:\n z = x\n a //= p\n while not a % p:\n a //= p\n if a == 1:\n break\n else:\n l.append(a)\n x = d.get(a, 0)\n if z < x:\n z = x\n d.update(dict.fromkeys(l, z + 1))\n print(max(d.values()))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\nimport collections\n\ninfile = sys.stdin.buffer\ndef gs() : return infile.readline().rstrip()\ndef gi() : return int(gs())\ndef gss() : return gs().split()\ndef gis() : return [int(x) for x in gss()]\n\nMOD = 10 ** 9 + 7\nINF = 10 ** 12\n\nN = 10 ** 5\ndivisors = [[] for i in range(N+1)]\nfor u in range(2, len(divisors)):\n cur = u\n while(cur < len(divisors)):\n divisors[cur].append(u)\n cur += u\n\n\ndef main(infn=\"\") :\n global infile\n infile = open(infn,\"r\") if infn else open(sys.argv[1],\"r\") if len(sys.argv) > 1 else sys.stdin\n ######################################################################\n n = gi()\n a = gis()\n a.sort()\n dp ,d = {},{}\n for e in a:\n dp[e] = max([(d[div] if div in d else 0) for div in divisors[e]] or [0]) + 1\n for div in divisors[e]:\n d[div] = max(d[div] if div in d else 0, dp[e])\n print (max(dp.values()))\n ######################################################################\nif __name__ == '__main__' :\n main()", "p=10**5+9 \r\nt=[[] for i in range(p)]\r\ndp=[0]*p\r\nfor i in range(2,p):\r\n if not t[i]:\r\n t[i].append(i)\r\n for j in range(2*i,p,i):\r\n t[j].append(i) #store the divisors \r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nif n==1:\r\n print(1)\r\n exit() \r\nfor i in l:\r\n #explore divisors what is dp of them \r\n maxi=0 \r\n for j in t[i]:\r\n maxi=max(maxi,dp[j])\r\n dp[i]=maxi+1 \r\n for j in t[i]:\r\n dp[j]=maxi+1 \r\n#print(dp[0:10])\r\nprint(max(dp))", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nd = [0 for _ in range(100007)]\r\n\r\nans = 0\r\n\r\nfor i in a:\r\n \r\n for j in range(1,i+1):\r\n if j*j > i:\r\n break\r\n \r\n if i%j == 0:\r\n d[i] = max(d[i], d[i//j] + 1)\r\n if j > 1:\r\n d[i] = max(d[i], d[j] + 1)\r\n \r\n for j in range(1,i+1):\r\n if j*j > i:\r\n break\r\n \r\n if i%j == 0:\r\n d[i//j] = d[i]\r\n d[j] = d[i]\r\n \r\n ans = max(ans,d[i])\r\n\r\nprint(ans)", "def gcd(a, b):\r\n return a if b == 0 else gcd(b, a % b)\r\n\r\n\r\ndef f0(arr):\r\n def dfs(i):\r\n if i == n:\r\n nonlocal ans, the\r\n if ans < len(path):\r\n ans = len(path)\r\n the = path[:]\r\n return\r\n ai = arr[i]\r\n dfs(i + 1)\r\n if len(path) == 0 or (path[-1] < ai and gcd(path[-1], ai) > 1):\r\n path.append(ai)\r\n dfs(i + 1)\r\n path.pop()\r\n\r\n the = None\r\n ans = 0\r\n n = len(arr)\r\n path = []\r\n dfs(0)\r\n return ans\r\n\r\n\r\ndef f1(arr):\r\n pre = {}\r\n for x in arr:\r\n maxv = 0\r\n xx = x\r\n i = 2\r\n while i * i <= xx:\r\n if xx % i == 0:\r\n maxv = max(maxv, pre.get(i, 0))\r\n while xx % i == 0:\r\n xx //= i\r\n i += 1\r\n if xx > 1:\r\n maxv = max(maxv, pre.get(xx, 0))\r\n maxv += 1\r\n\r\n xx = x\r\n i = 2\r\n while i * i <= xx:\r\n if xx % i == 0:\r\n pre[i] = max(pre.get(i, 0), maxv)\r\n while xx % i == 0:\r\n xx //= i\r\n i += 1\r\n if xx > 1:\r\n pre[xx] = max(pre.get(xx, 0), maxv)\r\n if not pre:\r\n return 1\r\n return max(pre.values())\r\n\r\n\r\ndef test():\r\n from utils.oj import J\r\n import numpy.random as r\r\n N = 25\r\n M = 1000\r\n T = 10000\r\n for t in range(T):\r\n n = r.randint(1, N + 1)\r\n arr = r.randint(1, M, n).tolist()\r\n arr = sorted(set(arr))\r\n J.same(funcs=(f0, f1), arr=arr)\r\n if t % 100 == 0:\r\n print(t)\r\n print(\"ac\")\r\n\r\n\r\nif __name__ == '__main__':\r\n def main():\r\n from utils.oj import J\r\n J.multi(test)\r\n\r\n\r\n # test()\r\n # main()\r\n\r\n_ = input()\r\narr = list(map(int, input().split()))\r\nprint(f1(arr))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n==1 and a[0]==1:print(1);exit()\r\ndp=[0]*(10**5+10)\r\nfor i in a:\r\n mx=0\r\n for f in range(2,int(i**0.5)+1):\r\n if not i%f:\r\n mx=max(mx,dp[f])\r\n mx=max(mx,dp[i//f])\r\n for f in range(2,int(i**0.5)+1):\r\n if not i%f:\r\n dp[f]=mx+1\r\n dp[i//f]=mx+1\r\n dp[i]=mx+1\r\nprint(max(dp))\r\n\r\n", "n = int(input())\r\ninf = 200001\r\n\r\np = [0] * inf\r\na = [[] for _ in range(inf)]\r\n\r\na[1] = [1]\r\n\r\nfor i in range(2, inf):\r\n\ta[i].append(i)\r\n\tfor j in range(i * 2, inf, i):\r\n\t\ta[j].append(i)\r\nfor i in map(int, input().split()):\r\n\tmx = max(p[j] for j in a[i]) + 1\r\n\tfor j in a[i]:\r\n\t\tp[j] = mx\r\nprint(max(p))\r\n", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n\r\n# from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n\r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\ninf = float(\"inf\") \r\n\r\nn, = gil()\r\na = gil()\r\n\r\n\r\ndef getPrimes(x):\r\n\tp = []\r\n\r\n\tif x&1 == 0:\r\n\t\tp.append(2)\r\n\r\n\twhile x&1 == 0:\r\n\t\tx //= 2\r\n\r\n\tfor i in range(3, ceil(sqrt(x))+1):\r\n\t\tif x%i == 0:\r\n\t\t\tp.append(i)\r\n\r\n\t\twhile x%i == 0:\r\n\t\t\tx //= i\r\n\r\n\tif x > 1:\r\n\t\tp.append(x)\r\n\r\n\treturn p\r\n\r\n\r\n\r\nprimes = {}\r\nans = 1\r\n\r\nfor v in a:\r\n\tmaxP = 0\r\n\tlocal_primes = getPrimes(v)\r\n\t# print(local_primes, primes)\r\n\tfor p in local_primes:\r\n\t\tmaxP = max(maxP, primes.get(p, 0))\r\n\r\n\tfor p in local_primes:\r\n\t\tprimes[p] = maxP+1\r\n\r\n\tans = max(maxP+1, ans)\r\n\r\nprint(ans)\r\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\ndef my_key (a, b ):\r\n res = str(a) +\"::\" + str(b)\r\n return res\r\n\r\nn = int (input()) \r\narr = list (map(int, input().split(' '))) \r\ndp = list()\r\ndiv = dict()\r\nres =1 \r\nfor i in range(n):\r\n dp.append(1)\r\n for j in range(2, int (math.sqrt(arr[i])) +1 ):\r\n if ((arr[i] % j) == 0 ):\r\n if j in div.keys():\r\n dp[i]= max(dp[i],div[j] +1 ) \r\n if int (arr[i]/j) in div.keys():\r\n dp[i]= max(dp[i],div[int (arr[i]/j)] +1 ) \r\n \r\n for j in range(2, int (math.sqrt(arr[i]))+1 ):\r\n if (arr[i] % j == 0 ):\r\n div.update( {j:dp[i]})\r\n div.update( {int (arr[i]/j):dp[i] })\r\n\r\n div.update({arr[i]:dp[i]})\r\n res = max(res,dp[i])\r\nprint (res)", "from math import sqrt\r\ndef seive(n):\r\n if n==1:\r\n return [0,1]\r\n a = [i for i in range(n+1)]\r\n for i in range(2,int(sqrt(n)+1)+1):\r\n if a[i]==i:\r\n for j in range(i*i, n+1, i):\r\n if a[j]==j:\r\n a[j] = i\r\n return a\r\n\r\ndef cpf(n):\r\n ans = set()\r\n while spf[n]!=n:\r\n ans.add(spf[n])\r\n n//=spf[n]\r\n ans.add(spf[n])\r\n return ans\r\nn = int(input())\r\na = [int(i) for i in input().strip().split()]\r\nd = {}\r\ndp = [0 for i in range(n)]\r\nspf = seive(a[n-1])\r\nans = 1\r\nfor i in range(n):\r\n pf = cpf(a[i])\r\n for p in pf:\r\n dp[i] = max(dp[i],d.get(p,0)+1)\r\n for p in pf:\r\n d[p] = max(d.get(p,0),dp[i])\r\n ans = max(ans,dp[i])\r\nprint(ans)", "\r\nfrom math import gcd\r\nfrom math import ceil,sqrt\r\nfrom collections import defaultdict\r\n\r\n# The largest prime of that divides i where 2 <= i <= N\r\ndef largestPrime(N): # N log log N\r\n #[0, 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]\r\n #[0, 1, 2, 3, 2, 5, 3, 7, 2, 3, 5, 11, 3, 13, 7, 5, 2, 17, 3, 19, 5, 7, 11, 23, 3, 5, 13, 3, 7, 29, 5]\r\n largerPrime = list(range(N+1))\r\n for i in range(2,N+1):\r\n if(largerPrime[i] == i):\r\n for j in range(i*2,N+1,i):\r\n largerPrime[j] = i\r\n return largerPrime\r\nPrimeFactors = defaultdict(list)\r\ndef primeFactors(N): # N Log log N\r\n Large = largestPrime(N) # Requires largestPrime function\r\n for i in range(2,N+1):\r\n temp = i\r\n while(i!=1):\r\n fact = Large[int(i)]\r\n PrimeFactors[temp].append(Large[int(i)])\r\n while(i % fact == 0):\r\n i/=fact\r\n\r\n\r\nN = int(input())\r\nList = [int(x) for x in input().split()]\r\nprimeFactors(max(List) + 1)\r\nd = defaultdict(int) # index is 1 based\r\nfor i in PrimeFactors[List[0]]:\r\n d[i] = 1\r\ndp = [1] * (N+1)\r\n\r\nfor i in range(1,N):\r\n for j in PrimeFactors[List[i]]:\r\n if(d[j]!=0):\r\n dp[i] = max(dp[i], dp[d[j]-1]+1)\r\n d[j] = i+1\r\nprint(max(dp))", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nfrom collections import deque\r\nfrom bisect import bisect_right\r\nma=int(1e5)+1\r\ndp=[[] for i in range(ma)]\r\nfor i in range(2,ma):\r\n\tdp[i].append(i)\r\n\tfor j in range(i+i,ma,i):\r\n\t\tdp[j].append(i)\r\ndp[1].append(1)\r\n# print(dp)\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nz=[0 for i in range(ma)]\r\nfor i in l:\r\n\tx=0\r\n\tfor j in dp[i]:\r\n\t\tx=max(x,z[j])\r\n\tfor j in dp[i]:\r\n\t\tz[j]=x+1\r\nprint(max(z))\r\n", "n = int(input())\na = [int(i) for i in input().split()]\n\nm = max(a)\nsieve = [i for i in range(m + 1)]\nfor i in range(2, m + 1):\n if sieve[i] == i:\n for j in range(i + i, m + 1, i):\n sieve[j] = i\n\ndef prime_factors(x):\n fs = set()\n while x > 1:\n f = sieve[x]\n x //= f\n fs.add(f)\n return fs\n\nprev = {}\ndp = [1 for _ in range(n)]\nfor i in range(n):\n fs = prime_factors(a[i])\n for f in fs:\n j = prev.get(f)\n if j is not None:\n dp[i] = max(dp[i], dp[j] + 1)\n for f in fs:\n prev[f] = i\n\nprint(max(dp))\n", "from math import *\nN=100002\ndp=[0]*N\nn=int(input())\na=[int(x) for x in input().split(' ')]\nminPrime=[0]*(N+1)\nfor i in range(2,N):\n if minPrime[i]==0:\n minPrime[i]=i\n max_j=N//i\n for j in range(i,max_j+1):\n if minPrime[i*j]==0:\n minPrime[i*j]=i\nres=0\nfor c in a:\n tmp=c\n t_ans=0\n while tmp>1:\n t_ans = max(t_ans, dp[minPrime[tmp]]);\n tmp //= minPrime[tmp];\n t_ans+=1\n res=max(res, t_ans);\n tmp=c;\n while tmp>1:\n dp[minPrime[tmp]] = max(t_ans, dp[minPrime[tmp]]);\n tmp //= minPrime[tmp];\nprint(res)\n", "\r\n\r\nfrom collections import defaultdict\r\nimport math\r\nimport sys \r\nfrom bisect import bisect_right\r\nmod = pow(10,8)\r\ndef clc():\r\n \r\n n = int(input())\r\n from collections import defaultdict\r\n arr = list(map(int,input().split()))\r\n \r\n dp = [0]*(pow(10,5)+10)\r\n arr = sorted(arr)\r\n fin = 1\r\n for ele in arr:\r\n ans = 1\r\n curd = []\r\n j= 2\r\n while j*j<=ele:\r\n if ele%j == 0:\r\n curd.append(j)\r\n if j!=(ele//j):\r\n curd.append(ele//j)\r\n j+=1\r\n if ele>1:\r\n curd.append(ele)\r\n \r\n for i in range(len(curd)):\r\n ans = max(ans,dp[curd[i]]+1)\r\n\r\n for i in range(len(curd)):\r\n dp[curd[i]] = ans\r\n fin= max(fin,ans)\r\n print(fin)\r\n \r\n \r\n\r\n\r\n return True\r\nans =clc()\r\n\r\n\r\n\r\n ", "\"\"\"\r\nCode of Ayush Tiwari\r\nCodeforces: servermonk\r\nCodechef: ayush572000\r\n\r\n\"\"\"\r\nimport sys\r\ninput = sys.stdin.buffer.readline\r\nimport math\r\ndef solution():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n dp=[0]*(100005)\r\n cnt=[0]*(100005)\r\n ans=0\r\n for i in range(n):\r\n x=l[i]\r\n for j in range(1,int(x**0.5)+1):\r\n if x%j==0:\r\n cnt[i+1]=max(cnt[i+1],cnt[dp[x//j]]+1)\r\n if j>1:\r\n cnt[i+1]=max(cnt[i+1],cnt[dp[j]]+1)\r\n ans=max(ans,cnt[i+1])\r\n dp[j]=i+1 \r\n dp[x//j]=i+1 \r\n print(ans)\r\n\r\nsolution()", "n = 100001\nk = int(input())\ndivisors = [[] for _ in range(n)]\ndivisors[1] = [1]\nfor i in range(2, n):\n if not divisors[i]:\n divisors[i] = [i]\n for j in range(2 * i, n, i):\n divisors[j].append(i)\na = list(map(int, input().rstrip().split()))\ndp = [0] * (n + 1)\nfor i in a:\n x = max(dp[j] for j in divisors[i]) + 1\n for j in divisors[i]:\n dp[j] = x\nprint(max(dp))", "n = int(input())\r\nb = n\r\nm = list(map(int, input().split()))\r\nn = m[n - 1]\r\na = [set()]*(n + 1)\r\nfor i in range(n + 1):\r\n a[i] = set()\r\ni = 2\r\na[1] = {1}\r\nwhile i <= n:\r\n if a[i] == set():\r\n for j in range(i + i, n + 1, i):\r\n a[j].add(i)\r\n a[i].add(i)\r\n i += 1\r\n\r\ndp = [0]*(n + 1)\r\nd = [0]*(n + 1)\r\nfor i in range(b):\r\n max_pos = 0\r\n for j in a[m[i]]:\r\n if d[j] >= max_pos:\r\n max_pos = d[j]\r\n dp[m[i]] = max_pos + 1\r\n for j in a[m[i]]:\r\n d[j] = max(d[j], dp[m[i]])\r\n\r\nprint(max(dp))", "n = int(input())\r\nfrom collections import defaultdict\r\narr = list(map(int,input().split()))\r\nans =1\r\ndp = [0]*(pow(10,5)+1)\r\nfor ele in arr:\r\n dp[ele] = 1\r\n j = 2\r\n while j*j<=ele :\r\n \r\n if ele%j == 0:\r\n dp[ele] =max(dp[ele],dp[j]+1)\r\n dp[ele] = max(dp[ele],dp[ele//j]+1)\r\n\r\n j+=1\r\n ans= max(ans,dp[ele])\r\n j = 2\r\n while j*j<=ele :\r\n if ele%j == 0:\r\n dp[j] =dp[ele]\r\n dp[ele//j] =dp[ele]\r\n j+=1\r\nprint(ans)\r\n", "import math\r\na=int(input())\r\nz=list(map(int,input().split()))\r\ndp=[0 for i in range(max(z)+1)]\r\ndp[0]=1\r\ndef fact(x):\r\n ans=[]\r\n for i in range(2,int(math.sqrt(x))+1):\r\n if(x%i==0):\r\n if(x//i!=i):\r\n ans.append(i)\r\n ans.append(x//i)\r\n else:\r\n ans.append(i)\r\n ans.append(x)\r\n return ans;\r\nfor i in range(len(z)):\r\n t=fact(z[i])\r\n maxa=0\r\n \r\n for i in range(len(t)):\r\n maxa=max(maxa,dp[t[i]])\r\n for i in range(len(t)):\r\n dp[t[i]]=maxa+1\r\n \r\nprint(max(dp))\r\n \r\n \r\n", "m=10**5+1\r\np=[0]*m\r\nt=[[] for i in range(m)]\r\nt[1]=[1]\r\nfor i in range(2,m):\r\n if not t[i]:\r\n t[i]=[i]\r\n for j in range(2*i,m,i):\r\n t[j].append(i)\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n x=max(p[j] for j in t[a[i]])+1\r\n for j in t[a[i]]:\r\n p[j]=x\r\nprint(max(p))", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport string\r\nimport sys\r\nimport time\r\nfrom typing import Counter, List\r\n\r\nsys.setrecursionlimit(99999)\r\n\r\ninput()\r\nmx = 10**5 + 5\r\nf = [0] * mx\r\nf[1] = 1\r\nfor i in range(2, mx):\r\n if f[i] == 0:\r\n f[i] = i\r\n for j in range(i * i, mx, i):\r\n if f[j] == 0:\r\n f[j] = i\r\nmp = collections.defaultdict(int)\r\nfor c in map(int, input().split()):\r\n p = []\r\n while f[c] != c:\r\n k = f[c]\r\n p.append(k)\r\n while c % k == 0:\r\n c //= k\r\n if c > 1:\r\n p.append(c)\r\n if p:\r\n mx = max(mp[x] for x in p)\r\n for c in p:\r\n mp[c] = mx + 1\r\nif mp:\r\n print(max(mp.values()))\r\nelse:\r\n print(1)", "n=10**5+1\r\np=[0]*n\r\nt=[[] for _ in range(n)]\r\nt[1]=[1]\r\nfor i in range(2,n):\r\n if not t[i]:\r\n t[i]=[i]\r\n for j in range(2*i,n,i):\r\n t[j].append(i)\r\nm=input()\r\narr=list(map(int,input().split()))\r\nx=0\r\n#print(t[:10])\r\nfor i in arr:\r\n x=0\r\n for j in t[i]:\r\n x=max(p[j],x)\r\n x+=1\r\n for j in t[i]:\r\n p[j]=x\r\n#print(p[0:12])\r\nprint(max(p))\r\n", "import math\r\n\r\ndef solve():\r\n n = int(input())\r\n # l, r = list(map(int, input().split(\" \")))\r\n a = list(map(int, input().split(\" \")))\r\n # b = list(map(int, input().split(\" \")))\r\n # s = input()\r\n\r\n N = int(10e5 + 5)\r\n\r\n dp = [0]*N\r\n fac = [[] for _ in range(N)]\r\n seive = [1] * N\r\n\r\n for i in range(2, N):\r\n if seive[i]:\r\n for j in range(i, N, i):\r\n seive[j] = 0\r\n fac[j].append(i)\r\n \r\n ans = 1\r\n\r\n for i in range(n):\r\n z = 0\r\n for x in fac[a[i]]:\r\n z = max(dp[x], z)\r\n \r\n z += 1\r\n ans = max(ans, z)\r\n \r\n for x in fac[a[i]]:\r\n dp[x] = max(z, dp[x])\r\n\r\n print(ans)\r\n\r\n return \r\n\r\n\r\n# for _ in range(int(input())):\r\n# solve()\r\n\r\nsolve()\r\n", "from collections import defaultdict \r\nn = int(input()) \r\nl = list(map(int, input().split())) \r\n \r\nd = defaultdict(int) \r\n\r\ndef fin_fac(x): \r\n result = []\r\n i = 2\r\n while i*i <= x:\r\n # Check if i divides x without leaving a remainder\r\n if x % i == 0:\r\n result.append(i)\r\n # Handle the case explained in the 4th\r\n while x % i == 0: # In Python, // operator performs integer/floored division\r\n x = x// i \r\n i += 1 \r\n if x >= 2: result.append(x)\r\n # Return the list of factors of x\r\n return result\r\nans = 1\r\nfor i in range (n) : \r\n lp = fin_fac(l[i])\r\n cu = 1\r\n for f in lp : \r\n d[f] += 1 \r\n cu = max(cu ,d[f]) \r\n for f in lp : \r\n d[f] = cu\r\n ans = max(ans , cu)\r\n # print(d, l[i])\r\n\r\n\r\nprint(ans)\r\n\r\n \r\n \r\n\r\n\r\n", "# import math\r\n# import collections\r\n# from itertools import permutations\r\n# from itertools import combinations\r\n# import sys\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\n\r\n'''def is_prime(n):\r\n j=2\r\n while j*j<=n:\r\n if n%j==0:\r\n return 0\r\n j+=1\r\n return 1'''\r\n\r\n\r\n'''def gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x'''\r\n\r\n'''fact=[]\r\ndef factors(n) :\r\n \r\n i = 1\r\n while i <= math.sqrt(n):\r\n \r\n if (n % i == 0) :\r\n \r\n if (n / i == i) :\r\n fact.append(i)\r\n\r\n else :\r\n \r\n fact.append(i)\r\n fact.append(n//i)\r\n i = i + 1'''\r\n\r\nn = 100001\r\np = [0] * n\r\ny = [[] for i in range(n)]\r\ny[1] = [1]\r\nfor i in range(2, n):\r\n if not y[i]:\r\n y[i] = [i]\r\n for j in range(2 * i, n, i): y[j].append(i)\r\n \r\ndef prob():\r\n \r\n n = int(input())\r\n \r\n # s=input()\r\n \r\n l = [int(x) for x in input().split()]\r\n\r\n # a,b = list(map(int , input().split()))\r\n\r\n for i in l:\r\n k = max(p[j] for j in y[i])+1\r\n\r\n for j in y[i]:\r\n p[j] = k\r\n\r\n print(max(p))\r\n\r\n\r\nt=1\r\n# t=int(input())\r\n\r\nfor _ in range(0,t):\r\n prob()", "\"\"\"\r\n#If FastIO not needed, used this and don't forget to strip\r\n#import sys, math\r\n#input = sys.stdin.readline\r\n\"\"\"\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport heapq as h \r\nfrom bisect import bisect_left, bisect_right\r\n\r\nfrom types import GeneratorType\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n import os\r\n self.os = os\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n self.os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nfrom collections import defaultdict as dd, deque as dq\r\nimport math, string\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\ndef prime_factors(n):\r\n factors = []\r\n num = 0\r\n while n % 2 == 0:\r\n num += 1\r\n n //= 2\r\n if num:\r\n factors.append(2)\r\n i = 3\r\n while n > 1 and i*i <= n:\r\n num = 0\r\n while n % i == 0:\r\n num += 1\r\n n //= i\r\n if num:\r\n factors.append(i)\r\n i += 2\r\n if n > 2:\r\n factors.append(n)\r\n return factors\r\n\r\n\"\"\"\r\nWe want to add A[i] onto the end of the longest possible sequence we can\r\nWe already know that numbers are strictly increasing, so it's just a case of finding non-coprimes\r\n\r\nFor each prime in a number, we look up the previous occurence of that prime and add one to that sequence, and take the max of these\r\n\"\"\"\r\n\r\n\r\ndef solve():\r\n N = getInt()\r\n A = [0] + getInts()\r\n prime_last_index = dd(int)\r\n dp = [1]*(N+1)\r\n for i in range(1,N+1):\r\n facs = prime_factors(A[i])\r\n for fac in facs:\r\n last = prime_last_index[fac]\r\n if last: dp[i] = max(dp[last]+1,dp[i])\r\n prime_last_index[fac] = i\r\n return max(dp)\r\n \r\n#for _ in range(getInt()):\r\nprint(solve())" ]

[ "mp = {0: 1, 1: 1}\nvec = []\n\n\ndef getLen(n):\n if n == 0 or n == 1:\n return 1\n m = n // 2\n mp[m] = getLen(m)\n mp[n] = 2 * mp[m] + 1\n return mp[n]\n\n\ndef getAns(n, interval):\n if n == 1:\n return len(interval)\n elif n == 0:\n return 0\n else:\n length = mp[n // 2]\n cnt = 0\n interv = []\n for v in interval:\n u = [v[0], v[1]]\n if v[1] <= length:\n interv.append(u)\n elif v[0] > length + 1:\n u[0] -= length + 1\n u[1] -= length + 1\n interv.append(u)\n else:\n if n % 2 == 1:\n cnt += 1\n if v[0] <= length:\n u[1] = length\n interv.append([u[0], u[1]])\n if v[1] > length + 1:\n u[0] = 1\n u[1] = v[1] - length - 1\n interv.append([u[0], u[1]])\n return getAns(n // 2, interv) + cnt\n\n\nif __name__ == '__main__':\n n, l, r = map(int, input().split())\n vec.append([l, r])\n getLen(n)\n print(getAns(n, vec))\n\t \t\t \t \t \t\t\t\t \t \t\t\t\t\t \t\t", "import sys # 导入sys模块\nsys.setrecursionlimit(10000000)\ncnt = 0 # 计数器，记录当前处理到第几个节点\nlevel = 0 # 层数\nzongshu = 1 # 总节点数\nq = [] # 存储符合条件的节点值\n\n# 递归函数，计算节点所在层数\ndef init(x):\n global level\n if x == 2 or x == 3: # 如果节点是2或3，直接返回\n return\n init(x // 2) # 否则递归求解父节点\n level += 1 # 当前节点层数加1\n\n# 计算完全二叉树总节点数\ndef count(level):\n global zongshu\n if level == 0: # 如果层数为0，总节点数为7\n zongshu = 7\n return\n for i in range(1, level + 3): # 否则根据层数计算总节点数\n zongshu *= 2\n zongshu -= 1 # 减去根节点\n\n# 递归函数，找到符合条件的节点\ndef did(x, l, r):\n global cnt, level, zongshu, q\n if x == 1 or x == 0: # 如果节点为1或0，直接记录计数器并返回\n cnt += 1\n if cnt >= l and cnt <= r: # 如果计数器在范围内，将节点值存入q\n q.append(x)\n return\n level = 0\n zongshu = 1\n init(x) # 计算节点所在层数\n count(level) # 计算当前完全二叉树总节点数\n length = (zongshu - 1) // 2 # 计算左子树节点数\n if cnt <= r: # 如果计数器未超过范围，继续递归\n if cnt >= l or l <= length + cnt: # 如果计数器在范围内，递归左子树、当前节点、右子树\n did(x // 2, l, r)\n did(x % 2, l, r)\n did(x // 2, l, r)\n else: # 否则计数器加上左子树节点数，递归右子树和当前节点\n cnt += length\n did(x % 2, l, r)\n did(x // 2, l, r)\n else: # 如果计数器超过范围，直接返回\n return\n\nn, l, r = map(int, input().split())\ndid(n, l, r)\n\nsum = 0\nfor i in range(len(q)):\n sum += q[i]\n\nprint(sum) # 输出符合条件的节点值之和\n \t \t\t \t \t\t\t\t \t\t\t\t\t\t \t\t \t", "def func(n, len, pos):\n if r < pos - len// 2 or pos + len // 2 < l:\n return 0\n if len== 1:\n return n % 2\n\n dis = (len + 1) // 4\n if l <= pos <= r:\n return func(n // 2, len // 2, pos - dis) + n % 2 + func(n // 2, len // 2, pos + dis)\n if r < pos:\n return func(n // 2, len // 2, pos - dis)\n if pos < l:\n return func(n // 2, len // 2, pos + dis)\n\n\ndef main(n,l,r):\n length = 0\n i = 0\n while 2 ** i <= n:\n length += 2 ** i\n i += 1\n print(func(n, length, (1 + length) // 2))\n\nif __name__==\"__main__\":\n n, l, r = map(int, input().split())\n main(n,l,r)\n\t \t\t\t\t\t\t \t \t\t\t \t\t \t\t\t \t \t\t\t", "def fir(n: int) -> int:\n if n == 0:\n return 0\n len = 0\n i = 0\n while 2 ** i <= n:\n len += 2 ** i\n i += 1\n return sec(int(n), int(len), int((len + 1) / 2))\n\ndef sec(n: int, m: int, middle: int) -> int:\n if a < middle - m / 2 or l > middle + m / 2:\n return 0\n if m == 1:\n return n % 2\n distance = int((m + 1) / 4)\n if l <= middle <= a:\n return sec(int(n / 2), int(m / 2), int(middle - distance)) + n % 2 + sec(int(n / 2), int(m / 2), int(middle + distance))\n if middle > a:\n return sec(int(n / 2), int(m / 2), int(middle - distance))\n if l > middle:\n return sec(int(n / 2), int(m / 2), int(middle + distance))\n\nenter = input().split()\nn, l, a = map(int, enter)\nresult = fir(n)\nprint(result)\n\t \t\t\t\t \t \t \t \t\t \t \t", "def main():\r\n # get input values and store them in variables\r\n n, left, right = map(int, input().strip().split())\r\n\r\n # calculate the total number of nodes in the tree\r\n num_nodes, total = n, 0\r\n while num_nodes > 0:\r\n total = total*2 + 1\r\n num_nodes //= 2\r\n \r\n # recursive function to find the number of nodes in a given range\r\n def range_finder(left, right, node_num, left_num, right_num):\r\n # if the range is outside of the current node or the node is empty, return 0\r\n if right_num < left or right < left_num or node_num == 0:\r\n return 0\r\n # if the node is a leaf, return 1\r\n if node_num == 1:\r\n return 1\r\n # otherwise, split the node into its two children and recursively search them\r\n mid_num = (left_num + right_num) // 2\r\n return range_finder(left, right, node_num//2, left_num, mid_num-1) + range_finder(left, right, node_num%2, mid_num, mid_num) + range_finder(left, right, node_num//2, mid_num+1, right_num)\r\n \r\n # call the range_finder function and print the result\r\n print(range_finder(left, right, n, 1, total))\r\n \r\nmain()", "n, l, r = list(map(int, input().split()))\r\n\r\ncur = n\r\nlog = 0\r\nwhile cur > 1:\r\n cur //= 2\r\n log +=1\r\n\r\ntot = 2**(log+1)-1\r\n\r\ndef rec(cur,e, i):\r\n\r\n\r\n if i+e -1 < l or i > r:\r\n return 0\r\n elif l <= i and i+e -1 <= r:\r\n return cur\r\n \r\n return rec(cur//2, e//2, i) + rec(cur%2, 1, i + e//2) + rec(cur//2, e//2, i+e//2+1)\r\n\r\nprint(rec(n, tot, 1))\r\n", "n,l,r = map(int, input().split())\r\nsum = 0\r\nlowerbound = 1\r\nupperbound = (2**(len(bin(n)[2:]))) -1\r\n\r\ndef divideandconquer(n, left, right):\r\n global sum\r\n mid = (left + right )//2\r\n if left > r or right < l:\r\n return\r\n if n==1:\r\n if l <= left <= r:\r\n sum += 1\r\n return\r\n\r\n if n%2:\r\n if l <= mid <= r:\r\n sum += 1\r\n n = n//2\r\n newright = mid-1\r\n newleft = mid+1\r\n divideandconquer(n, left, newright)\r\n divideandconquer(n, newleft, right)\r\n \r\ndivideandconquer(n, lowerbound, upperbound)\r\n\r\nprint(sum)", "import math\n\nn, l, r = map(int, input().split())\nls = list(map(int, list(bin(n)[2:])))\nrs = 0\nfor i in range(l, r + 1):\n rs += ls[int(math.log2(i & -i))]\nprint(rs)\n \t \t \t\t \t\t\t \t\t \t \t \t\t \t", "def main(n: int) -> int:\n if n == 0:\n return 0\n length = 0\n i = 0\n while (1 << i) <= n:\n length += 1 << i\n i += 1\n return insert(n, length, (length + 1) // 2)\n\ndef insert(n: int, length: int, mid: int) -> int:\n if r < mid - length // 2 or l > mid + length // 2:\n return 0\n if length == 1:\n return n % 2\n distance = (length + 1) // 4\n if l <= mid <= r:\n return (insert(n >> 1, length >> 1, mid - distance) + n % 2 + insert(n >> 1, length >> 1, mid + distance))\n if mid > r:\n return insert(n >> 1, length >> 1, mid - distance)\n if l > mid:\n return insert(n >> 1, length >> 1, mid + distance)\n\nenter = input()\nenter_list = enter.split()\nn = int(enter_list[0])\nl = int(enter_list[1])\nr = int(enter_list[2])\nm = main(n)\nprint(m)\n \t \t \t \t \t\t \t\t \t \t\t\t\t\t", "dc1={}\r\ndc2={}\r\n\r\ndef solve1(a):\r\n global dc\r\n if a in dc1:\r\n return\r\n if a==1:\r\n dc1[a]=1\r\n dc2[a]=1\r\n return\r\n if a==0:\r\n dc1[a]=1\r\n dc2[a]=0\r\n return\r\n solve1(a//2)\r\n dc1[a]=dc1[a//2]*2+1\r\n dc2[a]=dc2[a//2]*2+(a%2)\r\n \r\ndef solve2(a,y):\r\n if y==0:\r\n return 0\r\n if a==1:\r\n return 1\r\n if a==0:\r\n return 0\r\n tmp1=a//2\r\n tmp2=dc1[tmp1]\r\n if tmp2>=y:\r\n return solve2(a//2,y)\r\n ans=dc2[tmp1]+(a%2)\r\n return ans+solve2(a//2,y-tmp2-1)\r\n\r\ndef riku(a,x,y):\r\n solve1(a)\r\n ans=solve2(a,y)-solve2(a,x-1)\r\n return ans\r\n\r\na,x,y=map(int,input().split())\r\nprint(riku(a,x,y))\r\n", "def solve(a, b, l, r, d):\r\n global ans\r\n if a > b or l > r:\r\n return\r\n else:\r\n mid = (a + b) // 2\r\n if r < mid:\r\n solve(a, mid - 1, l, r, d // 2)\r\n elif mid < l:\r\n solve(mid + 1, b, l, r, d // 2)\r\n else:\r\n ans += d % 2\r\n solve(a, mid - 1, l, mid - 1, d // 2)\r\n solve(mid + 1, b, mid + 1, r, d // 2)\r\n\r\ndef main():\r\n global ans\r\n n, l, r = map(int, input().split())\r\n p = n\r\n s = 1\r\n while p >= 2:\r\n p //= 2\r\n s = s * 2 + 1\r\n ans = 0\r\n solve(1, s, l, r, n)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\ndef dfs(n,l,r,left,right):\r\n\tif left>r or right<l:\r\n\t\treturn 0\r\n\tif n==1:\r\n\t\treturn 1\r\n\tmid=(left+right)>>1\r\n\tt=0\r\n\tif n&1 and (mid>=l and mid<=r):\r\n\t\tt+=1\r\n\treturn dfs(n>>1,l,r,left,mid-1)+dfs(n>>1,l,r,mid+1,right)+t\r\n\r\nn,l,r=map(int,input().split())\r\nL=0\r\nk=n\r\nwhile k:\r\n\tL=L*2+1\r\n\tk>>=1\r\nprint(dfs(n,l,r,1,L))\r\n\r\n\r\n", "def is_one(pos, num):\r\n i = 0\r\n mid = pos\r\n while (mid % 2 == 0):\r\n i += 1\r\n mid /= 2\r\n return num[i] == '1'\r\n\r\nn, l, r = list(map(int, input().split()))\r\nnum = bin(n)[2:]\r\nans = 0\r\nfor i in range(l, r + 1):\r\n if is_one(i, num):\r\n ans += 1\r\nprint(ans)", "def count_ones(num, length, l, r):\n if l > r or r < 1 or l > length:\n return 0\n if num == 1:\n return 1 if l <= 1 <= r else 0\n\n mid = length // 2 + (length % 2)\n ones_count = 0\n\n # Process left part\n if l <= mid - 1:\n ones_count += count_ones(num // 2, mid - 1, l, min(r, mid - 1))\n\n # Process middle part\n if l <= mid <= r:\n ones_count += num % 2\n\n # Process right part\n if r >= mid + 1:\n ones_count += count_ones(num // 2, length - mid, max(1, l - mid), r - mid)\n\n return ones_count\n\ndef get_length(n):\n length = 1\n temp = n\n while temp > 1:\n length = length * 2 + 1\n temp //= 2\n return length\n\ndef countOnes(n, l, r):\n length = get_length(n)\n return count_ones(n, length, l, r)\n\nif __name__ == '__main__':\n n, l, r = map(int, input().split())\n print(countOnes(n, l, r))\n\n\t \t \t\t \t\t \t\t \t \t\t \t\t\t\t\t\t", "def main(n) -> int:\n if n == 0:\n return 0\n length = 0\n i = 0\n while 2 ** i <= n:\n length += 2 ** i\n i += 1\n return insert(n, length, (length + 1) // 2)\n\ndef insert(n, length, mid) -> int:\n if r < mid - length / 2 or l > mid + length / 2:\n return 0\n if length == 1:\n return n % 2\n distance = (length + 1) // 4\n if l <= mid <= r:\n return insert(n // 2, length // 2, mid - distance) + n % 2 + insert(n // 2, length // 2, mid + distance)\n if mid > r:\n return insert(n // 2, length // 2, mid - distance)\n if l > mid:\n return insert(n // 2, length // 2, mid + distance)\n\n\nenter = input()\nnewList = enter.split()\nn = int(newList[0])\nl = int(newList[1])\nr = int(newList[2])\nresult = main(n)\nprint(result)\n \t\t \t\t \t\t \t\t\t\t \t \t \t\t\t \t", "import math\ndef dfs(n,l,r,left,right):\n\tif left>r or right<l:\n\t\treturn 0\n\tif n==1:\n\t\treturn 1\n\tmid=(left+right)>>1\n\tt=0\n\tif n&1 and (mid>=l and mid<=r):\n\t\tt+=1\n\treturn dfs(n>>1,l,r,left,mid-1)+dfs(n>>1,l,r,mid+1,right)+t\n\nn,l,r=map(int,input().split())\nL=0\nk=n\nwhile k:\n\tL=L*2+1\n\tk>>=1\nprint(dfs(n,l,r,1,L))\n\t\t \t \t\t\t \t \t \t \t\t\t \t\t\t\t \t\t", "class Solution:\n def callable(self, n, right, left):\n\n def zeros(num):\n if num <= 1:\n return 0\n\n return (num % 2 == 0) + 2 * zeros(num//2)\n\n def recurse(num, start, end):\n if start > left or end < right:\n return 0\n\n if start >= right and end <= left:\n return num\n\n mid = (start+end) // 2\n return recurse(num//2, start, mid-1) + recurse(num % 2, mid, mid) + recurse(num//2, mid+1, end)\n\n size = n + zeros(n)\n x = recurse(n, 1, size)\n\n return x\n\n\nj = Solution()\nt = input()\nt = tuple(t.split())\nprint(j.callable(int(t[0]), int(t[1]), int(t[2])))\n", "def level(n):\n if n <= 1:\n return 1\n return level(n // 2) + 1\n\n\ndef length(level_n):\n return 2 ** level_n - 1\n\n\ndef operation(lst):\n while max(lst) > 1:\n for i in range(len(lst)):\n if lst[i] > 1:\n x = lst[i]\n lst[i:i + 1] = [x // 2, x % 2]\n\n\ndef check(index, lst, lv):\n for i in range(1, lv):\n n = 2 ** i\n if index % n == n/2:\n return lst[i-1]\n return lst[-1]\n\n\nn, l, r = map(int, input().split())\nlist1 = [n]\noperation(list1)\ncount = 0\nfor i in range(l, r+1):\n count += check(i, list1, level(n))\nprint(count)\n\t\t\t\t\t \t \t\t\t\t \t \t\t \t", "def count_ones(number, length, start, end):\n if start > end or end < 1 or start > length:\n return 0\n mid = length // 2 + (length % 2) # 列表中间的序列号\n left_ones = count_ones(number // 2, mid - 1, start, min(end, mid - 1))\n middle_ones = (number % 2) if start <= mid <= end else 0\n right_ones = count_ones(number // 2, length - mid, max(1, start - mid), end - mid)\n return left_ones + middle_ones + right_ones\n\ndef find_ones(n, l, r):\n length = 2 ** (n.bit_length()) - 1 # 2 ** (n.bit_length()) - 1 求 n 的二进制表示中所有位都为1时表示的最大整数\n return count_ones(n, length, l, r)\n\n# 输入\nn, l, r = map(int, input().split())\n\n# 输出\nresult = find_ones(n, l, r)\nprint(result)\n \t\t \t \t\t \t\t\t \t \t \t \t \t\t\t", "def count_ones(m, l, r):\n if m == 0:\n return 0\n length = 0\n i = 0\n while 2 ** i <= m:\n length += 2 ** i\n i += 1\n return insert(int(m), int(length), int((length + 1) / 2), l, r)\n\ndef insert(m, length, middle, l, r):\n if r < middle - length / 2 or l > middle + length / 2:\n return 0\n if length == 1:\n return m % 2\n distance = int((length + 1) / 4)\n if l <= middle <= r:\n return (insert(int(m / 2), int(length / 2), int(middle - distance), l, r) +\n m % 2 +\n insert(int(m / 2), int(length / 2), int(middle + distance), l, r))\n if middle > r:\n return insert(int(m / 2), int(length / 2), int(middle - distance), l, r)\n if l > middle:\n return insert(int(m / 2), int(length / 2), int(middle + distance), l, r)\n\nenter = input()\nenter_list = enter.split()\nm = int(enter_list[0])\nl = int(enter_list[1])\nr = int(enter_list[2])\nresult = count_ones(m, l, r)\nprint(result)\n\t\t \t\t \t \t \t\t \t \t \t\t \t\t\t", "# 01����\r\n#7->3 1 3->1 1 1 1 1 1 1\r\n\r\nimport math\r\n\r\ndef count_1(n,l,r):\r\n if(r<L or l > R):\r\n return 0\r\n if(n < 2):\r\n if(l>=L and r<=R):\r\n return n\r\n else:\r\n return 0\r\n mid = (l+r)//2\r\n return count_1(n//2,l,mid-1)+count_1(n%2,mid,mid)+count_1(n//2,mid+1,r)\r\n\r\nif __name__ == \"__main__\":\r\n global N,L,R \r\n N,L,R= [int(i) for i in input().split(\" \")]\r\n len,exp,temp = 0,0,N\r\n #����N�ij���\r\n #len = 2**(math.log2(int(N))+1)-1\r\n while(temp >= 1):\r\n len+=2**exp\r\n exp+=1\r\n temp = temp //2\r\n print(count_1(N,1,len))\r\n ", "import math\n\nn, l, r = map(int, input().split())\n\ndef countOnes(num, length, l, r):\n if n<0 or n>=math.pow(2,50) or r-l<0 or r-l>math.pow(10,5) or r<1 or l<1 or l>length:\n return 0\n mid_num = length // 2 + (length % 2)\n l_num = countOnes(num // 2, mid_num - 1, l, min(r, mid_num - 1))\n m_num = (num % 2) if l <= mid_num <= r else 0\n r_num = countOnes(num // 2, length - mid_num, max(1, l - mid_num), r - mid_num)\n return l_num + m_num + r_num\n\ndef findOnes(n, l, r):\n length = 2 ** (n.bit_length()) - 1 \n return countOnes(n, length, l, r) \n\nresult = findOnes(n, l, r)\nprint(result)\n\n \t \t\t\t\t \t\t\t \t \t\t \t \t", "class Solution:\r\n def callable(self, n, right, left):\r\n # first count the number of zeros there is going to be in the final array\r\n def zeros(num):\r\n if num <= 1:\r\n return 0\r\n\r\n return (num % 2 == 0) + 2 * zeros(num//2)\r\n\r\n def recurse(num, start, end):\r\n # if it is out of bound no need to do the recursion\r\n if start > left or end < right:\r\n return 0\r\n\r\n # if it is inbound the number of ones is the same as the number inserted\r\n if start >= right and end <= left:\r\n return num\r\n\r\n mid = (start+end) // 2\r\n # finally return the sum of the recursions\r\n return recurse(num//2, start, mid-1) + recurse(num % 2, mid, mid) + recurse(num//2, mid+1, end)\r\n\r\n # since the number of ones in the final array are the same as the magnitude of the given number\r\n # e.g 7 = [1,1,1,1,1,1,1]\r\n # thus the whole size of the array is the sum of the number and the number of zeroes\r\n size = n + zeros(n)\r\n x = recurse(n, 1, size)\r\n\r\n return x\r\n\r\n\r\nj = Solution()\r\nt = input()\r\nt = tuple(t.split())\r\nprint(j.callable(int(t[0]), int(t[1]), int(t[2])))", "def calculate_one_count(number, start, end):\n def recursive_count(value, size, left, right):\n if left > right or right < 1 or left > size:\n return 0\n\n if value == 1:\n return 1 if left <= 1 <= right else 0\n\n midpoint = size // 2 + (size % 2)\n count = 0\n\n if left <= midpoint - 1:\n count += recursive_count(value // 2, midpoint - 1, left, min(right, midpoint - 1))\n\n if left <= midpoint <= right:\n count += value % 2\n\n if right >= midpoint + 1:\n count += recursive_count(value // 2, size - midpoint, max(1, left - midpoint), right - midpoint)\n\n return count\n\n sequence_length = 1\n temp_value = number\n while temp_value > 1:\n sequence_length = sequence_length * 2 + 1\n temp_value //= 2\n\n return recursive_count(number, sequence_length, start, end)\n\n\ndef get_input_and_output():\n num, left_range, right_range = map(int, input().split())\n result = calculate_one_count(num, left_range, right_range)\n print(result)\n\n\nif __name__ == \"__main__\":\n get_input_and_output()\n \t\t\t\t \t\t \t\t\t\t \t\t\t \t \t \t", "dict = {}\ncnt_one = {}\n\n\ndef div_one(n):\n if cnt_one.get(n, 0):\n return cnt_one[n]\n elif n == 1:\n cnt_one[n] = 1\n elif n == 0:\n cnt_one[n] = 0\n else:\n cnt_one[n] = 2 * div_one(n // 2) + n % 2\n return cnt_one[n]\n\n\ndef divide_cnt(n):\n if dict.get(n, 0):\n return dict[n]\n elif n == 1 or n == 0:\n dict[n] = 1\n else:\n dict[n] = 2 * divide_cnt(n // 2) + 1\n return dict[n]\n\n\ndef div_cnt(x, cnt, ans):\n if cnt == 0:\n return 0\n else:\n if cnt == dict[x]:\n ans += cnt_one[x]\n return ans\n elif cnt < dict[x // 2]:\n return div_cnt(x // 2, cnt, ans)\n elif cnt == dict[x // 2]:\n ans += cnt_one[x // 2]\n return ans\n else:\n ans += cnt_one[x // 2] + x % 2\n cnt -= dict[x // 2] + 1\n if cnt:\n return div_cnt(x // 2, cnt, ans)\n else:\n return ans\n\n\nn, l, r = map(int, input().split())\ndiv_one(n)\ndivide_cnt(n)\nprint(div_cnt(n, r, 0) - div_cnt(n, l - 1, 0))\n\n \t\t\t\t \t \t \t\t\t \t\t \t\t\t\t \t \t \t\t\t", "import sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\n\r\ndef f(a):\r\n global c\r\n b = bisect(q, a)\r\n if a != q[b-1]:\r\n c += d[b-1] + int(x[b-1])\r\n f(a-q[b-1]-1)\r\n else:\r\n c += d[b-1]\r\n\r\n\r\nn, l, r = map(int, input().split())\r\nx = bin(n)[2:]\r\nm = len(x)\r\nd = [0]\r\nq = [0]\r\nfor i in range(m):\r\n d.append(d[-1]*2+int(x[i]))\r\n q.append(q[-1]*2+1)\r\n\r\nc = 0\r\nf(min(q[-1], l-1))\r\nc1, c = c, 0\r\nf(min(q[-1], r))\r\nprint(c-c1)\r\n", "n,x,y = input().split(' ')\nl = int(x)\nr = int(y)\nN = int(n)\n\ndef df(n,length,adr):\n if (r < adr-length//2) | ((adr + length//2)<l):\n return 0\n if length == 1:\n return n%2\n dis = (length+1)//4\n if (l <= adr) & (adr <= r):\n return df(n//2,length//2,adr-dis)+n%2+df(n//2,length//2,adr+dis)\n if r < adr:\n return df(n//2,length//2,adr-dis)\n if adr < l:\n return df(n//2,length//2,adr+dis)\nlength = 0\ni = 0\n\nwhile(2**i<=N):\n length+=2**i\n i+=1\nprint(df(N,length,(1+length)//2))\n\n\t \t \t\t \t \t \t\t \t \t\t \t\t \t \t", "from collections import defaultdict, Counter\r\n# import threading\r\n# import sys\r\n# input = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n\r\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\ndef main():\r\n # think first code later dorime\r\n n, l, r = rl()\r\n res = 0\r\n lvl = 0\r\n cn = n\r\n while cn:\r\n cn //= 2\r\n lvl += 1\r\n\r\n def rec(n, i, l):\r\n if i == 2**l:\r\n return n & 1\r\n elif i < 2**l:\r\n return rec(n//2, i, l-1)\r\n else:\r\n return rec(n//2, i-2**l, l-1)\r\n\r\n for i in range(l, r+1):\r\n res += rec(n, i, lvl-1)\r\n print(res)\r\n pass\r\n\r\n\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "from collections import defaultdict, deque\nfrom functools import lru_cache \ndef solution():\n\n @lru_cache()\n def count_nodes(n):\n if n < 2:\n return 1\n return 2 * count_nodes(n//2) + 1\n\n def rec(st, end, tl, tr, n):\n if st > end:\n return 0\n \n tm = (tl + tr)//2\n \n res = n%2 if st <= tm <= end else 0\n \n res += rec(st, min(tm-1, end), tl,tm-1, n//2) \n res += rec(max(tm+1, st), end, tm+1, tr, n//2) \n \n return res\n \n \n n, l, r = map(int, input().split())\n if n == 0:\n print(0)\n return;\n \n n_nodes = count_nodes(n)\n r = min(r, n_nodes)\n res = rec(l, r,1, n_nodes, n)\n print(res)\n \n \nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=solution)\nthread.start(); thread.join()\n#solution()\n", "def find_ones(n, l, r):\n def get_length(num):\n length = 1\n while num > 1:\n length = length * 2 + 1\n num //= 2\n return length\n\n def iterate(num, length, left, right):\n queue = [(num, length, 1)] # (number, total length, start position)\n ones_count = 0\n\n while queue:\n num, length, pos = queue.pop(0)\n mid_pos = pos + length // 2\n\n if l <= mid_pos <= r:\n ones_count += num % 2\n\n if num > 1 and length > 1:\n half_length = (length - 1) // 2\n if l <= pos + half_length:\n queue.append((num // 2, half_length, pos))\n if r >= mid_pos + 1:\n queue.append((num // 2, half_length, mid_pos + 1))\n\n return ones_count\n\n total_length = get_length(n)\n return iterate(n, total_length, l, r)\n\n# Input\nn, l, r = map(int, input().split())\n\n# Output\nresult = find_ones(n, l, r)\nprint(result)\n\n \t \t\t \t\t\t\t \t \t\t \t\t \t \t \t\t", "from math import ceil\r\n\r\ndef codeFor1(n):\r\n if n == 1:\r\n return [1] \r\n elif n == 0:\r\n return [0]\r\n return codeFor1(n//2) + [n%2]\r\n\r\ndef numOfOne(arr, l, r):\r\n if len(arr) == 1 and l == 1 and r == 1:\r\n return arr[0]\r\n l -= 1\r\n count = 0\r\n for i in range(len(arr)):\r\n if arr[i] == 0:\r\n continue\r\n a0 = pow(2, i) - 1\r\n if a0 >= r:\r\n break\r\n d = pow(2, i+1)\r\n j = 0 if l <= a0 else ceil((l-a0)/d)\r\n k = ceil((r-a0)/d)\r\n\r\n count += k - j \r\n \r\n return count\r\n\r\ninp = input().split(\" \")\r\nn = int(inp[0])\r\nl = int(inp[1])\r\nr = int(inp[2])\r\n\r\nprint(numOfOne(codeFor1(n), l, r))", "def squeeze(n):\n if n <= 1:\n return 1\n x = 2\n while (n // 2 > 1):\n n //= 2\n x += 1\n return x\n\n\nclass tree():\n def __init__(self, n):\n self.n = n\n self.value = n % 2\n self.count = 2 ** squeeze(n) - 1\n self.middle = (self.count + 1) // 2\n\n\ndef solve(n, l, r):\n t = tree(n)\n if l > r:\n return 0\n if t.n <= 1 or r - l + 1 == t.count:\n return t.n\n if l > t.middle:\n return solve(t.n // 2, l - t.middle, r - t.middle)\n if r < t.middle:\n return solve(t.n // 2, l, r)\n return t.value + solve(t.n // 2, 1, r - t.middle) + solve(t.n // 2, l, t.middle - 1)\n \n\nif __name__ == '__main__':\n n, l, r = map(int, input().split())\n print(solve(n, l, r))\n\n\n \t \t \t\t \t \t\t \t \t\t\t", "from functools import lru_cache\r\n\r\nn, l, r = [int(x) for x in input().split()]\r\n\r\n@lru_cache(maxsize=None)\r\ndef count(n):\r\n if n <= 1:\r\n return 1\r\n return 2*count(n//2)+1\r\n\r\n@lru_cache(maxsize=None)\r\ndef ones(n):\r\n if n <= 1:\r\n return n\r\n \r\n return 2*ones(n//2)+n%2\r\n\r\ndef solve(n, x):\r\n if n <= 1:\r\n return n\r\n\r\n if x <= count(n//2):\r\n return solve(n//2, x)\r\n elif x == count(n//2)+1:\r\n return ones(n//2)+n%2\r\n else:\r\n return ones(n//2)+n%2+solve(n//2, x-(count(n//2)+1))\r\n\r\nif l == 1:\r\n print(solve(n,r))\r\nelse:\r\n print(solve(n,r)-solve(n,l-1))", "n, l, r = map(int, input().split(' '))\ndef cut(n):\n half = []\n while n > 1:\n x2 = n % 2\n\n half.append(x2)\n n = n // 2\n return half, n\n\ndef divide(n):\n count = 0\n while n % 2 == 0 and n > 0:\n n = n // 2\n count += 1\n return count\n\nsum = 0\nhalf, n = cut(n)\nfor i in range (l,r+1):\n if i % 2 == 1:\n sum += n\n else:\n m = len(half)\n k = m - divide(i)\n sum += half[k]\nprint(sum)\n\t \t\t\t\t\t \t\t\t \t\t \t \t \t\t\t\t", "def get_num(n):\n if n == 1 or n == 0:\n return 1\n return 2 * get_num(n // 2) + 1\n\ndef merge(n, l, r):\n if n == 0 or n == 1:\n return n\n num = get_num(n // 2)\n if l == 1 and r == 2 * num + 1:\n return n\n if r <= num:\n return merge(n // 2, l, r)\n elif r == num + 1 and l <= num:\n return merge(n // 2, l, num) + n % 2\n elif r == num + 1 and l == num + 1:\n return n % 2\n elif r >= num + 2 and l <= num:\n return merge(n // 2, l, num) + n % 2 + merge(n // 2, 1, r - num - 1)\n elif r >= num + 2 and l == num + 1:\n return n % 2 + merge(n // 2, 1, r - num - 1)\n elif l >= num + 2:\n return merge(n // 2, l - num - 1, r - num - 1)\n\nif __name__ == \"__main__\":\n n, l, r = map(int, input().split())\n print(merge(n, l, r))\n\t\t \t\t\t \t\t\t \t \t\t\t \t\t\t\t \t", "import sys\r\nfrom collections import *\r\ninput = sys.stdin.readline\r\n\r\n''' \r\nlook for a pattern\r\n 10 -> [1,0,1,1,1,0,1, 0 ,1,0,1,1,1,0,1]\r\n 5 -> [1,0,1, 1 ,1,0,1] start = 1 end = 7\r\n 2 -> [1, 0 ,1]\r\n 1 -> [1]\r\n 0 -> [0]\r\n \r\n \r\n \r\n 10 l = 3\r\n 5 0 5 r = 10\r\n 2 1 2 \r\n 1 0 1\r\n ----------------\r\n 1,0,1,1,1,0,1, 0 ,1,0,1,1,1,0,1\r\n \r\nin the final list left & right from the mid are mirror to each other \r\n\r\nhow many 1s inside the last list \r\n number of 1s for number y is y\r\n eg. 2 -> [1 0 1] \r\n \r\nhow many 0s inside the last list\r\n final array is reflection so counting one side and multiply by 2 then add the middle if it is 0\r\n\r\noperation to perform\r\n remove element(x) then subtitue by x//2, x mod 2, x//2\r\n \r\n\r\n'''\r\n \r\ndef main():\r\n def backtrack(x):\r\n #code here\r\n if x <= 1:\r\n return 0\r\n \r\n return (x % 2 == 0) + 2 * backtrack(x//2)\r\n\r\n \r\n def recurse(num,start,end):\r\n if start > right or end < left:\r\n return 0\r\n \r\n if start >= left and end <= right:\r\n return num\r\n \r\n \r\n mid = (start + end) //2\r\n \r\n return recurse(num//2, start, mid-1) + recurse(num % 2, mid, mid) + recurse(num//2, mid + 1, end)\r\n \r\n \r\n \r\n n,left,right = [int(i) for i in input().strip().split()]\r\n \r\n length = n + backtrack(n)\r\n \r\n \r\n print(recurse(n, 1, length))\r\n \r\nmain()", "from typing import Tuple\n\n\ndef df(n: int, length: int, adr: float) -> int:\n if (r < adr-length//2) or ((adr + length//2) < l):\n return 0\n if length == 1:\n return n % 2\n dis = (length+1) // 4\n if l <= adr <= r:\n return (\n df(n // 2, length // 2, adr - dis)\n + n % 2\n + df(n // 2, length // 2, adr + dis)\n )\n if r < adr:\n return df(n // 2, length // 2, adr - dis)\n if adr < l:\n return df(n // 2, length // 2, adr + dis)\n\n\nn, x, y = input().split(' ')\nl = int(x)\nr = int(y)\nN = int(n)\n\nlength = sum(2 ** i for i in range(N.bit_length()))\nadr = (1 + length) / 2\n\nresult = df(N, length, adr)\nprint(result)\n\n \t \t \t\t \t \t\t \t \t\t\t \t \t \t\t", "def level(num):\n if num <= 1:\n return 1\n return level(num // 2) + 1\n\n\ndef operation(lst, lv):\n for temp in range(lv - 1):\n lst[0:1] = [lst[0] // 2, lst[0] % 2]\n\n\ndef check(index, lst, lv):\n for i in range(1, lv):\n temp = 2 ** i\n if index % temp == temp / 2:\n return lst[i - 1]\n return lst[-1]\n\n\nn, l, r = map(int, input().split())\nlist1 = [n]\noperation(list1, level(n))\ncount = 0\nfor each in range(l, r + 1):\n count += check(each, list1, level(n))\nprint(count)\n\n \t\t \t\t \t \t \t \t\t\t\t \t \t", "def main(a) -> int:\n if a == 0:\n return 0\n len = 0\n i = 0\n while 2 ** i <= a:\n len += 2 ** i\n i += 1\n return insert(int(a), int(len), int((len + 1) / 2))\n\n\ndef insert(a, len, middle) -> int:\n if r < middle - len / 2 or l > middle + len / 2:\n return 0\n if len == 1:\n return a % 2\n distance = int((len + 1) / 4)\n if l <= middle <= r:\n return insert(int(a / 2), int(len / 2), int(middle - distance)) + a % 2 + insert(int(a / 2), int(len / 2),\n int(middle + distance))\n if middle > r:\n return insert(int(a / 2), int(len / 2), int(middle - distance))\n if l > middle:\n return insert(int(a / 2), int(len / 2), int(middle + distance))\n\n\nenter = input()\nenter_list = enter.split()\na = int(enter_list[0])\nl = int(enter_list[1])\nr = int(enter_list[2])\nresult = main(a)\nprint(result)\n\n \t\t \t \t\t\t \t \t \t\t \t\t\t \t", "n, l, r = map(int, input().split())\r\nli = []\r\nif n == 0 :\r\n print(0)\r\nelse :\r\n while n != 0 :\r\n li = [n%2] + li\r\n n //= 2\r\n res = 0\r\n for i in range(l, r+1):\r\n c = 0\r\n while i%2 == 0:\r\n i //= 2\r\n c += 1\r\n if li[c] == 1:\r\n res += 1\r\n print(res)", "n, l, r = map(int, input().split())\n\ndef fun1(n, l, r):\n\n def fun2(num, length, l, r):\n if num == 1 or l > r or r < 1 or l > length:\n if l <= 1 and r >= 1:\n return num\n else:\n return 0\n\n mid = length // 2 + length % 2\n\n left = fun2(num // 2, mid - 1, l, min(r, mid - 1))\n\n right = fun2(num // 2, length - mid, max(1, l - mid), r - mid)\n\n if l <= mid and r >= mid:\n mid_ = num % 2\n else:\n mid_ = 0\n\n\n return (left + mid_ + right)\n\n length = 1\n temp = n\n while temp > 1:\n length = length * 2 + 1\n temp //= 2\n\n return fun2(n, length, l, r)\n\nnum_1 = fun1(n, l, r)\n\nprint(num_1)\n\n\n \t\t\t\t\t \t\t \t \t\t\t\t \t\t\t\t\t\t\t\t", "def count_ones_in_range(n, l, r):\n if n == 0:\n return 0\n mid = (1 << (n.bit_length() - 1))\n if r < mid:\n return count_ones_in_range(n // 2, l, r)\n elif l > mid:\n return count_ones_in_range(n // 2, l - mid, r - mid)\n else:\n return count_ones_in_range(n // 2, l, mid - 1) + (n % 2) + count_ones_in_range(n // 2, 1, r - mid)\n\ndef find_ones(n, l, r):\n return count_ones_in_range(n, l, r)\nn, l, r = map(int, input().split())\nres = find_ones(n, l, r)\nprint(res)\n\n\t \t \t\t\t \t\t\t \t\t\t \t\t\t\t \t \t", "def find_ones(n, l, r):\n def count_ones(num, length, l, r):\n if num == 1 or l > r or r < 1 or l > length:\n return num if l <= 1 <= r else 0\n \n mid = length // 2 + (length % 2)\n \n # Calculate ones in the left part\n left_ones = count_ones(num // 2, mid - 1, l, min(r, mid - 1))\n \n # Calculate ones in the middle (the remainder)\n middle_ones = (num % 2) if l <= mid <= r else 0\n \n # Calculate ones in the right part\n right_ones = count_ones(num // 2, length - mid, max(1, l - mid), r - mid)\n \n return left_ones + middle_ones + right_ones\n \n length = 1\n temp = n\n while temp > 1:\n length = length * 2 + 1\n temp //= 2\n \n return count_ones(n, length, l, r)\n\n\n# 输入\nn, l, r = map(int, input().split())\n\n# 输出\nresult = find_ones(n, l, r)\nprint(result)\n\n\t\t \t \t\t \t\t\t \t \t \t\t \t\t \t", "#import time\n\ndef div_number(n):\n first_div = []\n while n > 1:\n first_div.append(n%2)\n n //= 2\n first_div.append(1)\n return first_div\n\nif __name__ == \"__main__\":\n n, l, r = map(int, input().split())\n #start = time.time()\n if n == 0:\n print(0)\n elif n == 1:\n print(1)\n elif n == 2:\n if l<=1 and r>=1:\n print(1)\n else:\n print(0)\n elif n == 3:\n print(r-l+1)\n else:\n res = div_number(n)\n count=0\n for i in range(len(res)-1,-1,-1):\n m1 = 2**(len(res)-i)\n m2 = 2**(len(res)-i-1)\n for j in range(l,r+1):\n if j%m1==m2:\n count+=res[i]\n print(count)\n #end = time.time()\n #print(end-start)\n \t\t \t\t \t\t \t\t \t \t \t\t \t\t\t", "def main(n):\n if n == 0:\n return 0\n len = 0\n for i in range(n):\n if 2 ** i > n:\n break\n len += 2 ** i\n return insert(int(n), int(len), int((len + 1) / 2))\n\ndef insert(n, len, mid):\n if r < mid - len / 2 or l > mid + len / 2:\n return 0\n if len == 1:\n return n % 2\n dis = int((len + 1) / 4)\n if l <= mid<= r:\n return insert(int(n / 2), int(len / 2), int(mid - dis)) + n % 2 + insert(int(n / 2), int(len / 2), int(mid + dis))\n if mid > r:\n return insert(int(n / 2), int(len / 2), int(mid - dis))\n if l > mid:\n return insert(int(n / 2), int(len / 2), int(mid + dis))\n\n\nenter = input()\nlist = enter.split()\nn = int(list[0])\nl = int(list[1])\nr = int(list[2])\nresult = main(n)\nprint(result)\n\n\t \t \t \t \t\t\t\t \t \t \t\t \t \t", "def cnt_length(x):\n if x == 1 or x == 0:\n return 1\n else:\n return 2 * cnt_length(x // 2) + 1\n\ndef cnt_ones(x):\n if x == 1:\n return 1\n elif x == 0:\n return 0\n else: # 转化最后的左右两数只可能均为1,中间数取决于原数的奇偶\n return 2 * cnt_ones(x // 2) + x % 2 \n\ndef cnt_leftwing(x,pos):\n global cnt\n if pos == 0:\n return\n elif pos == cnt_length(x):\n cnt += cnt_ones(x)\n return\n elif pos <= cnt_length(x // 2):\n cnt_leftwing(x // 2,pos)\n else:\n cnt += cnt_ones(x // 2) + x % 2\n pos -= cnt_length(x // 2) + 1\n if pos:\n cnt_leftwing(x // 2,pos)\n\ncnt = 0\n\nn, l, r = map(int, input().split())\ncnt_leftwing(n,l-1)\nleft_cnt = cnt\ncnt = 0\ncnt_leftwing(n,r)\nright_cnt = cnt\nprint(right_cnt - left_cnt)\n\n\t\t \t\t\t \t\t\t\t \t\t \t\t \t \t\t\t \t", "from functools import lru_cache\r\nn, l, r = map(int, input().split())\r\n\r\n\r\n@lru_cache(53)\r\ndef count(x=n):\r\n if x == 1 or x == 0:\r\n return 1\r\n return count(x // 2) * 2 + 1\r\n\r\n\r\ncount()\r\n\r\n\r\n@lru_cache(53)\r\ndef ones(x=n):\r\n if x == 1 or x == 0:\r\n return x\r\n return count(x // 2) * 2 + 1\r\n\r\n\r\nones()\r\n\r\nl -= 1\r\nr -= 1\r\n\r\n\r\ndef ans(x=n, n_idx=0):\r\n # print(x, n_idx)\r\n a = 0\r\n\r\n if x == 1 or x == 0:\r\n if l <= n_idx <= r:\r\n return x\r\n return 0\r\n\r\n if n_idx <= r and n_idx + count(x // 2) >= l:\r\n # if n_idx >= l and n_idx + count(x // 2) < r:\r\n # a += ones(x//2)\r\n # else:\r\n a += ans(x//2, n_idx)\r\n\r\n n_idx += count(x // 2)\r\n\r\n if l <= n_idx <= r:\r\n a += x % 2\r\n\r\n n_idx += 1\r\n\r\n if n_idx <= r and n_idx + count(x // 2) >= l:\r\n # if n_idx >= l and n_idx + count(x // 2) < r:\r\n # a += ones(x//2)\r\n # else:\r\n a += ans(x//2, n_idx)\r\n\r\n return a\r\n\r\n\r\nprint(ans())\r\n", "def get_digits_bit(n):\n if n==1 or n==0:\n return 1\n digits = 0\n while(n):\n digits += 1\n n //= 2\n return digits\n \ndef f_recursion(x,pos,size,l,r):\n \n if(x <= 1):\n return x\n \n ans = 0\n if(l < pos):\n ans+=f_recursion(x//2,pos-size,size//2,l,r)\n if(pos>=l and pos<=r):\n ans+=x%2\n if(r > pos):\n ans+=f_recursion(x//2,pos+size,size//2,l,r)\n \n return ans\n \nn,l,r = map(int,input().split())\nlength = get_digits_bit(n)\nx = 1<<(length-1)\nans = f_recursion(n,x,x//2,l,r)\nprint(ans)\n \t \t\t\t\t \t\t \t\t\t\t \t\t \t\t\t\t\t\t\t", "from math import log2\r\nn,l,r=map(int,input().split())\r\na=list(map(int,list(bin(n)[2:])))\r\nans=0\r\nfor i in range(l,r+1):\r\n ans+=a[int(log2(i&-i))]\r\nprint(ans)", "def decompose_list(num, length, start, end):\n if num == 1 or start > end or end < 1 or start > length:\n if start <= 1 <= end:\n return num\n else:\n return 0\n\n middle = length // 2 + (length % 2)\n\n left = decompose_list(num // 2, middle - 1, start, min(end, middle - 1))\n\n if start <= middle <= end:\n mid = (num % 2)\n else:\n mid = 0\n\n right = decompose_list(num // 2, length - middle, max(1, start - middle), end - middle)\n\n return left + mid + right\n\n\nnum, start, end = [int(num) for num in input().split(\" \")]\n\nlength = 1\ntemp = num\nwhile temp > 1:\n length = length * 2 + 1\n temp //= 2\nprint(decompose_list(num, length, start, end))\n\n\t \t\t\t\t\t\t \t\t\t \t \t \t \t\t\t \t\t\t \t", "import sys\nsys.setrecursionlimit(100000) \ndef get_x(n):\n if n == 1 or n == 0:\n return 1\n return get_x(int(n / 2)) * 2 + 1\n\n\ndef digui(n, l, r):\n if n == 0 or n == 1:\n return n\n x = get_x(int(n / 2))\n if l == 1 and r == 2 * x + 1:\n return n\n if r <= x:\n return digui(int(n / 2), l, r)\n elif r == x + 1 and l <= x:\n return digui(int(n / 2), l, x) + n % 2\n elif r == x + 1 and l == x + 1:\n return int(n % 2)\n elif r >= x + 2 and l <= x:\n return digui(int(n / 2), l, x) + int(n % 2) + digui(int(n / 2), 1, r - x - 1)\n elif r >= x + 2 and l == x + 1:\n return int(n % 2) + digui(int(n / 2), 1, r - x - 1)\n elif l >= x + 2:\n return digui(int(n / 2), l - x - 1, r - x - 1)\n\n\narr = list(map(int, input().split()))\nn = arr[0]\nl = arr[1]\nr = arr[2]\nprint(digui(n, l, r))\n\t\t\t\t\t \t\t\t\t \t\t\t\t \t\t\t \t\t", "def main():\r\n n, l, r = map(int, input().strip().split())\r\n N, total = n, 0\r\n while N > 0:\r\n total = total*2 + 1\r\n N //= 2\r\n \r\n def rfn(l, r, n, ln, rn):\r\n if rn < l or r < ln or n == 0:\r\n return 0\r\n if n == 1:\r\n return 1\r\n mn = (ln + rn) // 2\r\n return rfn(l, r, n//2, ln, mn-1) + rfn(l, r, n%2, mn, mn) + rfn(l, r, n//2, mn+1, rn)\r\n \r\n print(rfn(l, r, n, 1, total))\r\n\r\nmain()", "n, l, r = list(map(int,input().split()))\r\n\r\n\r\ndef height(value):\r\n count = 0\r\n while value > 1:\r\n count += 1\r\n value //= 2\r\n return count\r\n\r\nh = height(n)\r\ntotal = 2 ** (h + 1) - 1\r\nleft, right = 0, total - 1\r\nl,r = l - 1, r - 1\r\ndef recur(left, right, value, l, r):\r\n if right < l or left > r or (l <= left and right <= r):return value if (l <= left and right <= r) else 0\r\n \r\n amount = right - left + 1\r\n ## left\r\n left_recur = recur(left, left + (amount // 2) - 1, value // 2, l, r)\r\n ## middle\r\n mid_recur = recur(left + (amount // 2), left + (amount // 2), value % 2, l, r)\r\n ## right\r\n right_recur = recur(left + (amount // 2) + 1, right, value // 2, l, r)\r\n \r\n return left_recur + mid_recur + right_recur\r\n \r\nprint(recur(left, right, n, l, r))\r\n", "\nN,L,R=input().split(' ')\nN=int(N)\nL=int(L)\nR=int(R)\n\n\ndef solution(n,l,r):\n if l>r or l>R or L>r or n==0:\n return 0\n if n==1:\n return 1\n mid=(l+r)/2\n return solution(n//2,l,mid-1)+solution(n%2,mid,mid)+solution(n//2,mid+1,r)\n\nn=N\nRange=1\nwhile n>1:\n Range=Range*2+1;\n n=n//2;\n\nprint(solution(N,1,Range))\n \t \t \t\t\t \t\t\t \t \t\t\t\t \t", "def t(n):\n if n == 0: return 0\n if n == 1: return 1\n return (n%2) + 2*t(n//2)\n\ndef lens(n):\n if (n<= 1): return 1\n return 1 + 2*lens(n//2)\n\ndef ones(n,l,r):\n mid = lens(n//2) + 1\n if (n < 2): return t(n)\n if (l==mid and r==mid): return n%2\n if (l==1 and r==lens(n)): return t(n)\n if (l < mid and r < mid): return ones(n//2,l,r)\n if (l > mid and r > mid): return ones(n//2,l-mid,r-mid)\n if (l < mid and r==mid): return ones(n//2,l,mid-1)+n%2\n if (l == mid and r>mid): return n%2+ones(n//2,1,r-mid)\n return ones(n//2,l,mid-1) + n%2 + ones(n//2,1,r-mid)\n\nn,l,r=(int(x) for x in input().split())\nprint(ones(n,l,r))\n", "def df(n, length, pos):\n if r < pos - length // 2 or pos + length // 2 < l:\n return 0\n if length == 1:\n return n % 2\n\n dis = (length + 1) // 4\n if l <= pos <= r:\n return df(n // 2, length // 2, pos - dis) + n % 2 + df(n // 2, length // 2, pos + dis)\n if r < pos:\n return df(n // 2, length // 2, pos - dis)\n if pos < l:\n return df(n // 2, length // 2, pos + dis)\n\n\nn, l, r = map(int, input().split())\n\nlength = 0\ni = 0\nwhile 2**i <= n:\n length += 2**i\n i += 1\n\nprint(df(n, length, (1 + length) // 2))\n\t\t\t \t \t\t \t\t\t \t\t\t\t\t\t \t\t\t", "def count_ones(num, length, l, r):\n if l > r or r < 1 or l > length:\n return 0 # Return 0 if the range is invalid\n\n if num == 1:\n return 1 if l <= 1 <= r else 0 # Return 1 or 0 depending on whether the range includes position 1\n\n mid = length // 2 + (length % 2) # Calculate the middle position\n\n # Initialize ones count to 0\n ones_count = 0\n\n # Process left part\n if l <= mid - 1:\n ones_count += count_ones(num // 2, mid - 1, l, min(r, mid - 1))\n\n # Process middle part\n if l <= mid <= r:\n ones_count += num % 2\n\n # Process right part\n if r >= mid + 1:\n ones_count += count_ones(num // 2, length - mid, max(1, l - mid), r - mid)\n\n return ones_count # Return total ones count in the specified range\n\ndef find_ones(n, l, r):\n # Calculate the total length required to cover the range [l, r]\n length = 1\n temp = n\n while temp > 1:\n length = length * 2 + 1\n temp //= 2\n\n # Call the count_ones function and return the result\n return count_ones(n, length, l, r)\n\n# Get user input\nn, l, r = map(int, input().split())\n\n# Call the function and output the result\nresult = find_ones(n, l, r)\nprint(result)\n\t\t \t\t\t \t \t \t \t\t\t\t\t\t\t \t\t \t", "def main(x) -> int:\n if x==0:\n return 0\n len=0\n i=0\n while 2**i<=x:\n len+=2**i\n i+=1\n return insert(int(x),int(len),int((len+1)/2))\ndef insert(x,len,middle) -> int:\n if r<middle-len/2 or l>middle+len/2:\n return 0\n if len==1:\n return x%2\n distance=int((len+1)/4)\n if l<=middle<=r:\n return insert(int(x/2),int(len/2),int(middle-distance))+x%2+insert(int(x/2),int(len/2),int(middle+distance))\n if middle>r:\n return insert(int(x/2),int(len/2),int(middle-distance))\n if l > middle:\n return insert(int(x/2),int(len/2),int(middle+distance))\nenter = input()\nenter_list = enter.split()\nx = int(enter_list[0])\nl = int(enter_list[1])\nr = int(enter_list[2])\nresult = main(x)\nprint(result)\n\t\t\t \t \t\t\t\t \t\t\t \t\t\t\t \t", "n, l, r= [int(item) for item in input().split()]\r\n\r\ndef _enumerate(n):\r\n if n <= 1:\r\n return 1\r\n else:\r\n return _enumerate(n//2)*2 + 1\r\n\r\ndef _list(n):\r\n if n<=1:\r\n return n\r\n else:\r\n return 2 * _list(n//2) + n%2\r\n\r\ndef solve(p, n, temp, prev):\r\n if p == 0:\r\n return 0\r\n elif p == temp:\r\n return _list(n)\r\n elif p==temp//2 + 1:\r\n return _list(n//2) + n%2\r\n elif p>temp:\r\n return _list(n) + prev%2 + solve(p - temp - 1, n//2, temp//2, n)\r\n else:\r\n return solve(p, n//2, temp//2, n)\r\n\r\ndef help_sam(l, r, n):\r\n lower = solve(l - 1, n, _enumerate(n), 0)\r\n higher = solve(r, n, _enumerate(n), 0)\r\n\r\n return higher - lower\r\n\r\noutput = help_sam(l, r, n)\r\n\r\nprint(output)", "constant = 1\n\ndef main(nums) :\n if n == 0:\n return 0\n lenth = 0\n i = 0\n while 2 ** i <= nums:\n lenth += 2 ** i\n i += constant\n return insert(int(nums), int(lenth), int((lenth + constant) / 2))\n\ndef insert(n,lenth, mid) :\n if r < mid - lenth / 2 or l > mid + lenth / 2:\n return 0\n if lenth == constant:\n return n % 2\n \n distant = int((lenth + constant) / 4)\n if l <= mid <= r:\n return insert(int(n / 2), int(lenth / 2), int(mid - distant)) + n % 2 + insert(int(n / 2), int(lenth / 2), int(mid + distant))\n if mid > r:\n return insert(int(n / 2), int(lenth / 2), int(mid - distant))\n if l > mid:\n return insert(int(n / 2), int(lenth / 2), int(mid + distant))\n\narr = input()\nlist1 = arr.split()\nn = int(list1[0])\nl = int(list1[1])\nr = int(list1[2])\nresult = main(n)\nprint(result)\n\n\t \t \t\t \t \t \t \t\t \t \t", "n, l, r = map(int, input().split())\nlength = 1\ntemp = n\nwhile temp > 1:\n length = length * 2 + 1\n temp //= 2\ndef a(num, length, l, r):\n stack = [(num, length, l, r)]\n total_ones = 0\n while stack:\n num, length, l, r = stack.pop()\n if num == 1 or l > r or r < 1 or l > length:\n if l <= 1 <=r:\n total_ones += num\n else:\n total_ones += 0\n else:\n mid = length // 2 + (length % 2)\n if l <= min(r, mid - 1):\n stack.append((num // 2, mid - 1, l, min(r, mid - 1)))\n if l <= mid <= r:\n total_ones += num % 2\n if max(1, l - mid) <= r - mid:\n stack.append((num // 2, length - mid, max(1, l - mid), r - mid))\n return total_ones\nresult = a(n,length,l,r)\nprint(result)\n \t\t \t \t\t \t\t\t\t\t \t\t \t\t\t \t\t", "n, l, r = map(int, input().split())\nif n == 0:\n print(0)\n exit()\nN = n\ncnt = 0\ntmp = 0\na = [0] * 201\nb = [0] * 201\nwhile N > 1:\n cnt += 1\n a[cnt] = N % 2\n N >>= 1\nN = 2\ntmp += 1\nb[tmp] = N\nwhile N * 2 <= n:\n N <<= 1\n tmp += 1\n b[tmp] = N\nans = 0\nfor i in range(l, r + 1):\n if i % 2 == 1:\n ans += 1\n else:\n if i <= N:\n for j in range(tmp, 0, -1):\n if i % b[j] == 0:\n ans += a[tmp - j + 1]\n break\n else:\n for j in range(tmp, 0, -1):\n if (i - N) % b[j] == 0:\n ans += a[tmp - j + 1]\n break\nprint(ans)\n \t \t \t\t \t\t \t \t\t \t \t\t \t", "import sys\r\nfrom collections import *\r\nfrom functools import lru_cache\r\nsys.setrecursionlimit(2000)\r\ninput = sys.stdin.readline\r\n \r\ndef main():\r\n \r\n # @lru_cache(None)\r\n def dp(x):\r\n if x <= 1:\r\n return 0\r\n return (x%2 == 0) + 2 * dp(x//2) \r\n \r\n \r\n def recurse(num,s,e):\r\n if e < l or s > r:\r\n return 0\r\n if s >= l and e <= r:\r\n return num\r\n mid = (s+e-1)//2\r\n return recurse(num//2, s,mid) + recurse(num//2, mid+2, e) + recurse(num%2, mid+1, mid+1)\r\n \r\n n,l,r = [int(i) for i in input().strip().split()]\r\n s, e = 1, n + dp(n)\r\n print(recurse(n, s, e))\r\n \r\nmain()", "n,l,r = list(map(int, input().split()))\r\n\r\ndef child(num):\r\n max_val = 0\r\n while max_val < num:\r\n max_val *= 2\r\n max_val += 1\r\n return max_val\r\n \r\ndef DFS(num,l , r, gl, gr):\r\n if(r < gl or l > gr): return 0\r\n if(num == 0): return 0\r\n if(num == 1): return 1\r\n rng = r - l\r\n ans = DFS(num//2,l,l+(rng//2) - 1,gl,gr) + DFS(num%2,l+(rng//2),l+(rng//2),gl,gr)+ DFS(num//2,l+(rng//2)+1,r,gl,gr)\r\n return ans\r\nif n == 0:\r\n print(0)\r\nelse:\r\n print(DFS(n,1,child(n),l,r))\r\n ", "def get_sum(n):\n return 1 if n == 1 or n == 0 else get_sum(n // 2) * 2 + 1\n\ndef optimized_solve(n, l, r):\n if n in [0, 1]:\n return n\n x = get_sum(n // 2)\n if l == 1 and r == 2 * x + 1:\n return n\n if r <= x:\n return optimized_solve(n // 2, l, r)\n if r == x + 1:\n return n % 2 if l == x + 1 else optimized_solve(n // 2, l, x) + n % 2\n if r >= x + 2:\n if l <= x:\n return optimized_solve(n // 2, l, x) + int(n % 2) + optimized_solve(n // 2, 1, r - x - 1)\n if l == x + 1:\n return int(n % 2) + optimized_solve(n // 2, 1, r - x - 1)\n if l >= x + 2:\n return optimized_solve(n // 2, l - x - 1, r - x - 1)\n\narr = list(map(int, input().split()))\nn, l, r = arr\nprint(optimized_solve(n, l, r))\n \t \t \t \t\t \t\t \t\t\t\t \t \t \t \t", "import sys\r\nimport heapq\r\nimport math\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\nn, l, r = inlt()\r\nli = list(bin(n)[2:])\r\n\r\nans = 0\r\nfor i in range(l,r+1):\r\n \r\n ans += int(li[int(math.log2(i & -i))])\r\nprint(ans)\r\n \r\n ", "def count_trailing_ones(n):\n count = 0\n while n & 1:\n count += 1\n n >>= 1\n return count\n\ndef get_nth_bit_from_left(binary, n, cache):\n total_bits = binary.bit_length()\n position_from_right = total_bits - n - 1\n if n in cache:\n return cache[n]\n temp = (binary >> position_from_right) & 1\n cache[n] = temp\n return temp\n\ndef calculate(num, index, cache):\n if index % 2 == 0:\n return 1\n return get_nth_bit_from_left(num, count_trailing_ones(index), cache)\n\ndef unlock_path(num, l, r):\n cache = {}\n count = 0\n r = min(r, (2 ** num.bit_length()) - 1)\n for i in range(l - 1, r):\n count += calculate(num, i, cache)\n return count\n\ndef main():\n num, l, r = map(int, input().split())\n count = unlock_path(num, l, r)\n print(count)\n\nif __name__ == \"__main__\":\n main()\n\n\t \t \t \t \t \t \t\t\t\t \t\t\t \t\t \t" ]

[ "n = int(input())\r\na = [int(x) for x in input().split()]\r\nstack = []\r\ni = 0\r\nx = a[i]\r\nwhile True:\r\n if len(stack) == 0:\r\n stack.append(x)\r\n i += 1\r\n if i == n:\r\n break\r\n x = a[i]\r\n else:\r\n if x == stack[-1]:\r\n del stack[-1]\r\n x += 1\r\n else:\r\n stack.append(x)\r\n i += 1\r\n if i == n:\r\n break\r\n x = a[i]\r\nprint(len(stack))\r\nprint(\" \".join([str(x) for x in stack]))\r\n\r\n", "\r\n \r\nn=int(input())\r\nx=[int(i) for i in input().split()]\r\notv=[]\r\ni=0\r\nwhile i<n:\r\n if len(otv)<2:\r\n otv.append(x[i])\r\n i+=1\r\n continue\r\n if otv[len(otv)-1]==otv[len(otv)-2]:\r\n otv.pop()\r\n otv[len(otv)-1]+=1\r\n else:\r\n otv.append(x[i])\r\n i+=1\r\nwhile len(otv)>=2 and otv[len(otv)-1]==otv[len(otv)-2]:\r\n otv.pop()\r\n otv[len(otv)-1]+=1\r\nprint(len(otv))\r\nfor i in otv:\r\n print(i,end=\" \")\r\n\r\n ", "n = int(input())\r\nls = input().split()\r\nst = []\r\nfor i in range(n):\r\n x = int(ls[i])\r\n while len(st) > 0 and x == st[-1]:\r\n x += 1\r\n st.pop()\r\n st.append(x)\r\nprint(len(st))\r\nfor x in st:\r\n print(\"{} \".format(x), end=\"\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * n\r\nb[0] = a[0]\r\nj = 1\r\nfor i in range(1, n):\r\n b[j] = a[i]\r\n while j > 0 and b[j] == b[j - 1]:\r\n j -= 1\r\n b[j] += 1\r\n j += 1\r\nprint(j)\r\nfor i in range(j):\r\n print(b[i], end=' ')\r\n", "# https://codeforces.com/problemset/problem/926/E\n\ninput()\nstack1 = [int(i) for i in input().split()]\nstack1.reverse()\n\nstack2 = []\n\nwhile stack1:\n transfer = stack1.pop()\n\n while stack2 and stack2[-1] == transfer:\n stack2.pop()\n transfer += 1\n\n stack2.append(transfer)\n\nprint(len(stack2))\nprint(\" \".join([str(i) for i in stack2]))", "n = int(input())\r\nxs = map(int, input().strip().split(\" \"))\r\n\r\nres = []\r\ncurrentNum = -1\r\n\r\nfor i in xs:\r\n if i == currentNum:\r\n currentNum += 1\r\n while len(res) > 0 and res[-1] == currentNum:\r\n currentNum += 1\r\n res.pop()\r\n else:\r\n if currentNum > 0:\r\n res.append(currentNum)\r\n currentNum = i\r\n\r\nres.append(currentNum)\r\n\r\nprint(len(res))\r\nprint(' '.join(map(str, res)))", "stk = []\r\nn = input()\r\nn = int(n)\r\nlst = input()\r\nlst = lst.split()\r\n\r\nfor a in lst:\r\n stk.append(int(a))\r\n while len(stk) > 1:\r\n if stk[-1] == stk[-2]:\r\n b = stk[-1]\r\n stk.pop()\r\n stk.pop()\r\n stk.append(b + 1)\r\n else:\r\n break\r\nprint(len(stk))\r\nfor a in stk:\r\n print(a , end=\" \")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ni=0\r\nb=[]\r\nwhile i+1<n:\r\n if a[i]==a[i+1]:\r\n a[i+1]=a[i]+1\r\n if len(b)>0:\r\n a[i]=b.pop()\r\n else:\r\n i=i+1\r\n else:\r\n b.append(a[i])\r\n i=i+1\r\nb.append(a[-1])\r\nprint(len(b))\r\nprint(*b)", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn = mint()\r\na = []\r\nfor i in mints():\r\n\tif len(a) > 0 and a[-1] == i:\r\n\t\ta[-1] += 1\r\n\t\twhile len(a) > 1 and a[-2] == a[-1]:\r\n\t\t\ta.pop()\r\n\t\t\ta[-1] += 1\r\n\telse:\r\n\t\ta.append(i)\r\nprint(len(a))\r\nprint(*a)", "n = input()\r\na = list(map(int, input().split())) \r\nb = []\r\nfor x in a:\r\n while b and x == b[-1]:\r\n x += 1\r\n b.pop()\r\n else:\r\n b.append(x)\r\nprint(len(b))\r\nprint(*b)", "n = int(input())\r\n\r\nclass Node:\r\n def __init__(self, value, prev = None, next = None):\r\n self.value = value\r\n self.prev = prev\r\n self.next = next\r\n\r\nnode_lst = [Node(int(i)) for i in input().split()]\r\n\r\nnode_lst[0].next = node_lst[1]\r\n\r\nnode_lst[-1].prev = node_lst[-2]\r\n\r\nfor i in range(1, n - 1):\r\n node_lst[i].prev = node_lst[i - 1]\r\n node_lst[i].next = node_lst[i + 1]\r\n\r\nhead = node = node_lst[0]\r\n\r\nwhile True:\r\n if (not node.prev is None) and node.value == node.prev.value:\r\n node.prev.value += 1\r\n if not node.next is None:\r\n node.next.prev = node.prev\r\n node.prev.next = node.next\r\n node = node.prev\r\n continue\r\n if node.next is None:\r\n if (node.prev is None) or (node.prev.value != node.value):\r\n break\r\n node = node.next\r\n\r\nlst = []\r\n\r\nwhile not head is None:\r\n lst.append(head.value)\r\n head = head.next\r\n\r\nprint(len(lst))\r\n\r\nfor i in lst: print(i, end = ' ')", "n = int(input())\r\np = 0\r\na = input().split(\" \")\r\nb = []\r\nfor i in range(0, n):\r\n b.append(int(a[i]))\r\n b[p] = int(a[i])\r\n while p > 0 and b[p - 1] == b[p]:\r\n b[p - 1] = b[p - 1] + 1\r\n p = p - 1\r\n p = p + 1\r\nprint(p)\r\nans = \"\"\r\nfor i in range(0, p):\r\n ans += str(b[i]) + \" \"\r\nprint(ans)", "from collections import deque\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\ndq = deque()\r\nfor i in range(n):\r\n x = l[i]\r\n while dq and x == dq[-1]:\r\n dq.pop()\r\n x += 1\r\n dq.append(x)\r\n# print(i, \":\", *l)\r\nprint(len(dq))\r\nprint(*dq)\r\n" ]

[ "from sys import stdin,stdout\r\n# from os import _exit\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nprint(str([0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2][int(input())])+\"\\n\")\r\n", "n=int(input())\nprint([int(\"0111212152215121e1515221f22541410121e122e1614221025151f2d221d1240\"[n],36),n//16+49+(n>>6)*214][n>>4>1 and n&15==0])", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-04 23:28:40\nLastEditTime: 2021-11-04 23:32:26\nDescription: 000001\nFilePath: CF409F.py\n'''\n\n\ndef func():\n result = [0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2,\n 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2]\n return result[int(input())]\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "print([0,1,1,1,2,1,2,1,5,2,2,1,5,1,2,1,14,1,5,1,5,2,2,1,15,2,2,5,4,1,4,1,51,1,2,1,14,1,2,2,14,1,6,1,4,2,2,1,52,2,5,1,5,1,15,2,13,2,2,1,13,1,2,4,267][int(input())])" ]

[ "p =input()\nn =int(input())\narr =[]\nfor i in range(n):\n\tarr.append(input())\nfor i in range(n):\n\tfor j in range(n):\n\t\tif p in str(arr[i]+arr[j]):\n\t\t\tprint (\"YES\")\n\t\t\texit()\nprint (\"NO\")", "password = input('')\r\n\r\nvocablen = input()\r\nvocablen = int(vocablen)\r\n\r\nvocab = []\r\nfor i in range(vocablen):\r\n word = input('')\r\n vocab.append(word)\r\n\r\nfinal = \"\"\r\nfor i in range(len(vocab)):\r\n main = vocab[i]\r\n for j in range(len(vocab)):\r\n breakin = str(main) + str(vocab[j])\r\n if password in breakin:\r\n final = \"YES\"\r\n\r\nif final == \"\":\r\n final = \"NO\"\r\n\r\nprint(final)", "slovo=input()\r\nn=int(input())\r\nbu1=False\r\nbu2=False\r\nk=0\r\nfor i in range(n):\r\n sl=input()\r\n if sl==slovo:\r\n bu1=True\r\n bu2=True\r\n if sl[0]==slovo[1] and not bu2:\r\n bu2=True\r\n if sl[1]==slovo[0] and not bu1:\r\n bu1=True\r\nif bu1 and bu2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#link : https://codeforces.com/problemset/problem/868/A\r\n#author : Mohamed Ibrahim\r\n\r\nkey = input()\r\nk = int(input())\r\n\r\nwords = []\r\n\r\nfor _ in range(k):\r\n\twords.append(input())\r\n\r\n\r\nfor i in range(k):\r\n\tfor j in range(k):\r\n\t\tif key in (words[i] + words[j]):\r\n\t\t\tprint('YES')\r\n\t\t\texit(0)\r\nprint('NO')\r\n", "password = input()\n\nn = int(input())\n\nkash_words_list = []\nfor i in range(n):\n kash_words = input()\n kash_words_list.append(kash_words)\n \nfor a in kash_words_list:\n for b in kash_words_list:\n if password in a+b:\n print(\"YES\")\n exit(0)\nprint(\"NO\")\n \n \t\t \t\t\t\t \t \t \t\t \t\t \t", "want, n = input(), int(input())\r\nwords = []\r\n\r\nfor i in range(n):\r\n words.append(input())\r\n\r\ncan = False\r\nif words.count(want) > 0:\r\n can = True\r\n\r\nfor i in range(n):\r\n if words[i][0] == want[1]:\r\n for j in range(n):\r\n if words[j][1] == want[0]:\r\n can = True\r\n\r\nif can:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def bark():\r\n\tp = input()\r\n\tlp = list(p)\r\n\tdict = {}\r\n\r\n\tfor i in range(int(input())):\r\n\t\tb = input()\r\n\t\tbL = len(b)\r\n\t\trB = b[bL::-1]\r\n\t\tlistB = list(b)\r\n\r\n\t\tif(b == p):\r\n\t\t\treturn \"YES\"\r\n\t\telif(rB == p):\r\n\t\t\treturn \"YES\"\r\n\t\telif(lp[0] in listB or lp[1] in listB):\r\n\t\t\tdict.update({listB[0] : listB[1]})\r\n\r\n\tif(lp[0] in dict.values() and lp[1] in dict.keys()):\r\n\t\treturn 'YES'\r\n\telse:\r\n\t\treturn 'NO'\r\n\r\nans = bark()\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\npwd = input().strip()\r\nn = int(input())\r\nfst, lst = False, False\r\narr = []\r\nfor i in range(n):\r\n arr.append(input().strip())\r\n\r\nfor i in range(n):\r\n wrd = arr[i]\r\n if (wrd == pwd) or (pwd == (wrd[::-1])):\r\n fst = True\r\n lst = True\r\n break\r\n \r\n elif wrd[0] == pwd[1]:\r\n fst = True\r\n elif wrd[1] == pwd[0]:\r\n lst = True\r\nif fst and lst:\r\n print('YES')\r\nelse:\r\n print('NO') ", "pw, words, first, second = input(), set(), set(), set()\r\n\r\nfor _ in range(int(input())):\r\n word = input()\r\n words.add(word)\r\n first.add(word[0])\r\n second.add(word[1])\r\n\r\nprint('YES' if pw in words or pw[0] in second and pw[1] in first else 'NO')", "s = input()\r\nn = int(input())\r\nans = False\r\nfirst = \"\"\r\nsecond = \"\"\r\nfor _ in range(n):\r\n s1 = input()\r\n first += s1[0]\r\n second += s1[1]\r\n if s1 == s:\r\n ans = True\r\n\r\nif ans == True:\r\n print(\"Yes\")\r\nelse:\r\n if first.count(s[1]) and second.count(s[0]):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n \r\n \r\n \r\n \r\n \r\n", "import sys\r\nreadline=sys.stdin.readline\r\n\r\npassword=readline().rstrip()\r\nN=int(readline())\r\nans=\"NO\"\r\ncntl,cntr,cntlr=0,0,0\r\nfor i in range(N):\r\n S=readline().rstrip()\r\n if password==S:\r\n ans=\"YES\"\r\n if password[1]==S[0]:\r\n cntl+=1\r\n if password[0]==S[1]:\r\n cntr+=1\r\nif cntl>=1 and cntr>=1:\r\n ans=\"YES\"\r\nprint(ans)", "X = input()\r\nN = int(input())\r\nFirst, Second = False, False\r\nfor i in range(N):\r\n Temp = input()\r\n if X == Temp:\r\n print(\"YES\")\r\n exit()\r\n if X[0] == Temp[1]:\r\n First = True\r\n if X[1] == Temp[0]:\r\n Second = True\r\n if First and Second:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "pas=input()\r\nn=int(input())\r\na=[]\r\nfound=False\r\nfor i in range(n):\r\n temp=input()\r\n a.append(temp)\r\n if(temp==pas):\r\n found=True\r\nfor i in a:\r\n for j in a:\r\n if(pas in (i+j)):\r\n \r\n found=True\r\n break\r\n #print(i+j)\r\n\r\nif(found):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "pw = input()\r\nn = int(input())\r\nwords = [input() for i in range(n)]\r\n\r\nmatch1 = False\r\nmatch2 = False\r\nif pw in words:\r\n\tprint(\"YES\")\r\nelse:\r\n\tfor word in words:\r\n\t\tif pw[0] == word[1]:\r\n\t\t\tmatch1 = True\r\n\t\tif pw[1] == word[0]:\r\n\t\t\tmatch2 = True\r\n\tif match1 and match2:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "def main():\r\n pwd = input()\r\n n = int(input())\r\n\r\n start = set()\r\n end = set()\r\n\r\n for i in range(n):\r\n word = input()\r\n if word == pwd:\r\n print(\"YES\")\r\n exit(0)\r\n start.add(word[0])\r\n end.add(word[1])\r\n\r\n if pwd[0] in end and pwd[1] in start:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import itertools\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\npw = input().rstrip()\r\ndata = [input().rstrip() for _ in range(int(input()))]\r\n\r\nmemo = list(map(lambda x: x[0] + x[1], itertools.permutations(data * 2, 2)))\r\n\r\nans = False\r\nfor i in memo:\r\n if pw in i:\r\n ans = True\r\n break\r\n\r\nprint(\"YES\" if ans else \"NO\")\r\n", "password = input()\r\nn = int(input())\r\nwords = []\r\nfor i in range(n):\r\n words.append(input())\r\nfor word_i in words:\r\n for word_k in words:\r\n if password in word_i + word_k:\r\n print('YES')\r\n exit()\r\nprint('NO')", "s = input()\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n x = input()\r\n l.append(x)\r\nf = 0\r\nfor i in l:\r\n for j in l:\r\n if s in (i+j):f = 1\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p = input()\r\nwords = [input() for _ in range(int(input()))]\r\nstart, end = False, False\r\nfor w in words:\r\n if p in w:\r\n start, end = True, True\r\n else:\r\n start = start or p[0] == w[-1]\r\n end = end or p[-1] == w[0]\r\nprint('YES' if start and end else 'NO')", "password = input()\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n\ta.append(input())\r\nb = []\r\nfor w in a:\r\n\tfor w2 in a:\r\n\t\tb.append((w+w2)[:2])\r\n\t\tb.append((w+w2)[1:3])\r\n\t\tb.append((w+w2)[2:])\r\n\r\nif password in b:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "pw=input()\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in l:\r\n for j in l:\r\n if pw in i+j:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "def main():\n\tp = input()\n\tfirst = False\n\tsecond = False\n\tN = int(input())\n\tfor n in range(N):\n\t\tr = input()\n\t\tif r == p:\n\t\t\tfirst = True\n\t\t\tsecond = True\n\t\tif r[0] == p[1]:\n\t\t\tsecond = True\n\t\tif r[1] == p[0]:\n\t\t\tfirst = True\n\tif first and second:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n\nmain()\n\n\n# 1507314150394\n", "def f():\r\n p = input()\r\n words = [input() for _ in range(int(input()))]\r\n for w1 in words:\r\n for w2 in words:\r\n if p in (w1 + w2):\r\n print('YES')\r\n return \r\n else:\r\n print('NO')\r\n \r\nf()", "password = input()\nn = int(input())\ntries = [input() for _ in range(n)]\n\n\ndef get_result():\n for t in tries:\n if t == password:\n return True\n for i in range(n):\n if (t[1] + tries[i][0]) == password or (tries[i][1] + t[0]) == password:\n return True\n return False\n\n\nprint('YES' if get_result() else 'NO')\n", "s=input().strip()\r\nl=[]\r\nn=int(input())\r\nfor x in range(n):\r\n l.append(input().strip())\r\n\r\npresent=False\r\nfor i in range(n):\r\n for j in range(n):\r\n if s in l[i]+l[j] or s in l[j]+l[i]:\r\n present=True\r\n\r\nif present:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "original = input()\r\narr = []\r\nfor _ in range(int(input())):\r\n arr.append(input())\r\nif original in arr:\r\n print(\"YES\")\r\nelse:\r\n flag = False\r\n for i in arr:\r\n if i.endswith(original[0]):\r\n for j in arr:\r\n if j.startswith(original[-1]):\r\n flag = True\r\n break\r\n if flag:\r\n print(\"YES\")\r\n break\r\n if not flag:\r\n print(\"NO\")", "def BarkToUnlock(pswd,barkList):\r\n\tflag1=0\r\n\tflag2=0\r\n\tif pswd in barkList:\r\n\t\treturn \"YES\"\r\n\telse:\r\n\t\tfor b in barkList:\r\n\t\t\tif b[0]==pswd[1] and flag1==0:\r\n\t\t\t\tflag1=1\r\n\t\t\tif b[1]==pswd[0] and flag2==0:\r\n\t\t\t\tflag2=1\r\n\r\n\t\t\tif flag1 and flag2:\r\n\t\t\t\treturn \"YES\"\r\n\r\n\treturn \"NO\"\r\n\r\npswd = input()\r\nn = int(input())\r\nbarkList=[]\r\nwhile n>0:\r\n\tbarkList.append(input())\r\n\tn-=1\r\n\r\nprint(BarkToUnlock(pswd,barkList))\r\n\r\n\r\n\r\n", "w=input()\r\nn=int(input())\r\nb=0\r\nd=0\r\nf=0\r\nfor i in range(n):\r\n s=input()\r\n if (s==w):\r\n b=1\r\n if (s[0]==w[1]):\r\n d=1\r\n if (s[1]==w[0]):\r\n f=1\r\n\r\nif (b==1 or (d==1 and f==1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "pw = input()\r\nf = 1\r\nn = int(input())\r\nfor a in range(0, n):\r\n bark = input()\r\n if(bark[1] == pw[0]):\r\n f = f * 2\r\n if(bark[0] == pw[1]):\r\n f = f * 3\r\n if(bark == pw):\r\n f = 6\r\n\r\nif(f%6 == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "password = input()\nn = int(input())\nwords = []\nfor i in range(0, n):\n words.append(input())\n\ncheck = False\nfor i in range(0, n):\n if words[i] == password:\n check = True\n break\n for j in range(0, n):\n guess = \"\" + words[i][1] + words[j][0]\n if guess == password:\n check = True\n break\n\nif check:\n print(\"YES\")\nelse:\n print(\"NO\")\n ", "s = input()\nn = int(input())\nok = [False,False]\nok1 = False\nfor _ in range(n):\n t = input()\n if s == t:\n ok1 = True\n if s[0] == t[1]: \n ok[0] = True\n if s[1] == t[0]:\n ok[1] = True\nif ok1 or (ok[0] and ok[1]):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n=input()\r\nv=''\r\nd=0\r\nm=0\r\nn1=int(input())\r\nfor i in range(n1):\r\n s=input()\r\n if(n[0]==s[1]):\r\n if(m==0):\r\n v+=s[1]\r\n m=m+1\r\n elif(n[1]==s[0]):\r\n if(d==0):\r\n v+=s[0]\r\n d=d+1\r\n if(n==s[::-1] or n==s):\r\n v=''\r\n v+=s[::-1]\r\nif(v==n or v[::-1]==n or n in v):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "password = input()\r\nn = int(input())\r\nf = []\r\nl = []\r\nworks = False\r\nfor i in range(n):\r\n x = input()\r\n if x == password:\r\n print(\"YES\")\r\n works = True\r\n break\r\n\r\n f.append(x[0])\r\n l.append(x[1])\r\n\r\n if password[0] in l and password[1] in f:\r\n print(\"YES\")\r\n works = True\r\n break\r\n\r\nif works == False:\r\n print(\"NO\")\r\n", "k = str(input())\r\nn = int(input())\r\ns = []\r\n\r\nfor i in range(n):\r\n s.append(str(input()))\r\n \r\npri = ''\r\n\r\nif k in s:\r\n pri = 'YES'\r\nelse:\r\n for i in range(len(s)):\r\n for j in range(len(s)):\r\n if k in str(s[i]) + str(s[j]) or k in str(s[j]) + str(s[i]):\r\n pri = 'YES'\r\n break\r\nif pri == '':\r\n pri = 'NO'\r\n\r\nprint(pri)", "if __name__ == \"__main__\":\n\tpassword = input()\n\tn = int(input())\n\tlasts = set()\n\tfirsts = set()\n\tattempts = set()\n\tfor _ in range(n):\n\t\tattempt = input()\n\t\tattempts.add(attempt)\n\t\tfirsts.add(attempt[0])\n\t\tlasts.add(attempt[1])\n\t\n\tif password in attempts or (password[0] in lasts and password[1] in firsts):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")", "n = input()\r\na = int(input())\r\nfirst = ''\r\nlast = ''\r\ne = []\r\nfor i in range(a):\r\n d = input()\r\n first += d[0]\r\n last += d[1]\r\n e.append(d)\r\nif n in e:\r\n print(\"YES\")\r\nelif n[0] in last and n[1] in first:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "par = input()\nn = int(input())\nnach = []\nkon = []\niskl = []\nfor i in range(n):\n\tbukva = input()\n\tbuk = bukva[0]\n\tva = bukva[1]\n\tnach.append(buk)\n\tkon.append(va)\n\tiskl.append(bukva)\nif (par[1] in nach and par[0] in kon) or par in iskl:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "# 438\r\n# A. Bark to Unlock\r\n\r\npassword = input()\r\nn = int(input())\r\n\r\nk_list = [input() for i in range(n)]\r\n\r\n# contain it as 2letters\r\n\r\nif password in k_list:\r\n print(\"YES\")\r\nelse:\r\n front = password[0]\r\n end = password[1]\r\n\r\n frontF = endF = False\r\n\r\n for letters in k_list:\r\n if letters[1] == front:\r\n frontF = True\r\n if letters[0] == end:\r\n endF = True\r\n\r\n if frontF and endF:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def res(key: str, words: [str]) -> bool:\n counter1 = 0\n counter2 = 0\n for w in words:\n if w == key:\n return True\n if w[0] == key[1]:\n counter1 += 1\n if w[1] == key[0]:\n counter2 += 1\n return counter1 >= 1 and counter2 >= 1\n\n############################\nkey = input()\nn = int(input())\nwords = []\nfor _ in range(n):\n words.append(input())\n\nif res(key, words):\n print(\"YES\")\nelse:\n print(\"NO\")", "p=input()\r\nn=int(input())\r\nl=[]\r\nl1=[]\r\nflag1=0\r\nflag2=0\r\nfor i in range(n):\r\n l.append(input())\r\nif p in l or p[::-1] in l:\r\n print (\"YES\")\r\nelse:\r\n for i in l:\r\n if (i[0]==p[0] or i[0]==p[1] or i[1]==p[0] or i[1]==p[1]):\r\n l1.append(i)\r\n #print (l1) \r\n for i in l1:\r\n if i[1]==p[0]:\r\n flag1=1 \r\n if i[0]==p[1] :\r\n flag2=1\r\n \r\n if flag1==1 and flag2==1: \r\n print (\"YES\")\r\n else:\r\n print (\"NO\")\r\n \r\n\r\n#print (l1) ", "c=input()\r\nn=int(input())\r\nl=[]\r\nf=0\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in l:\r\n for j in l:\r\n if c in i+j:\r\n f=1\r\n break\r\nif f==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\na1=s[0]\r\nb1=s[1]\r\ncheck=0\r\nx=[]\r\ny=[]\r\nn=int(input())\r\nfor i in range(0,n):\r\n\ts1=input()\r\n\tif(((s==s1) or (s==s1[::-1])) and (check==0)):\r\n\t\t#print(\"ok\")\r\n\t\tprint(\"YES\")\r\n\t\tcheck=1\r\n\telse:\r\n\t\tx.append(s1[0])\r\n\t\ty.append(s1[1])\r\n\r\n\r\nif(check==0):\r\n\t#print(\"ok\")\r\n\tif( a1 in y and b1 in x):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\t", "s=input()\r\nn=int(input())\r\nslist=[]\r\ntrue=False\r\nfor i in range(n):\r\n sinp=input()\r\n slist.append(sinp)\r\nfor i in range(n):\r\n\r\n for l in range(n):\r\n string=\"\"\r\n string+=slist[i]\r\n string+=slist[l]\r\n if(string.find(s)!=-1):\r\n true=True\r\nif(true):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input() \r\np=0;\r\nq=0;\r\nfor _ in range (int(input())) :\r\n n = input()\r\n if n==x or n==x[::-1] :\r\n exit(print(\"YES\"))\r\n if n[1]==x[0] :\r\n p=1\r\n if n[0]==x[1] :\r\n q=1\r\n if p and q :\r\n exit(print(\"YES\"))\r\nif p and q :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "password=input()\nn=int(input())\nstrings=[input() for i in range(n)]\nif password in strings:\n\tprint(\"YES\")\nelse:\n\tletters=list(password)\n\tstrings0=[k for k in strings if letters[0] in list(k)[1]]\n\tstrings1=[k for k in strings if letters[1] in list(k)[0]]\n\tif len(strings0)>0 and len(strings1)>0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n", "import os\r\nimport math\r\n\r\ndef work():\r\n\tans = input()\r\n\tn = int(input())\r\n\ta = []\r\n\tfor i in range(n):\r\n\t\ta.append(input())\r\n\tflag = False\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\ttemp = a[i] + a[j]\r\n\t\t\tif (temp.count(ans) > 0):\r\n\t\t\t\tflag = True\r\n\t\r\n\tif (flag):\r\n\t\tprint ('YES')\r\n\telse :\r\n\t\tprint ('NO')\r\n\r\nif __name__ == \"__main__\":\r\n\twork()\r\n", "from sys import stdin, stdout\n\npwd = stdin.readline().rstrip()\nn = int(stdin.readline().rstrip())\nwords = []\nfor _ in range(n):\n words.append(stdin.readline().rstrip())\n \nif pwd in words:\n print('YES')\nelse:\n possible1 = False\n possible2 = False\n for word in words:\n if word[0]==pwd[1]:\n possible1=True\n if word[1]==pwd[0]:\n possible2=True\n if possible1 and possible2:\n print('YES')\n else:\n print('NO')\n", "def pass1 (p,n,kn,start):\n if p in kn :\n return \"YES\"\n elif len(start) == 0 :\n return \"NO\"\n else:\n kill = 0\n for i in range(len(start)):\n for j in range(len(kn)):\n if p in start[i] + kn[j] :\n return \"YES\"\n return \"NO\"\n \n \n\n\n\np = input()\nn = int(input())\nkn = []\nstart = []\nfor x in range(n):\n s = input()\n if s[-1] == p[0] :\n start.append(s)\n kn.append(s)\n else:\n kn.append(s)\n\nprint (pass1(p,n,kn,start))\n\n\n \n \n", "pas = input()\r\nl = []\r\nfor i in range(int(input())):\r\n l.append(input())\r\nfor i in l:\r\n if i==pas: \r\n print(\"YES\")\r\n exit(0)\r\nknt1= 0\r\nknt2 = 0\r\nfor i in l:\r\n if i[1] == pas[0]:\r\n knt1=1 \r\n if i[0] == pas[1]:\r\n knt2=1\r\n if knt1+knt2==2:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n \r\n\r\n\r\n\r\n\r\n", "pas=input()\r\nn=int(input())\r\npl , lp = False , False\r\nfor i in range(n):\r\n a = input()\r\n if a == pas:\r\n pl,lp = True, True\r\n break\r\n if a[0] == pas[1]:\r\n lp = True\r\n if a[1] == pas[0]:\r\n pl = True\r\nif (pl == True) and (lp==True):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p = input()\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n\ta.append(input())\r\n\r\nf1,f2 = 0,0\r\n\r\nfor i in a:\r\n\tif i==p or i[::-1]==p:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\telif i[0]==p[1]:\r\n\t\tf1 = 1\r\n\telif i[1]==p[0]:\r\n\t\tf2 = 1\r\nif f1==f2==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\nN = int(input())\r\nS = [input() for i in range(N)]\r\nfirst, second = False, False\r\nfor x in S:\r\n if x == s:\r\n print(\"YES\")\r\n exit()\r\n if x[1] == s[0]:\r\n first = True\r\n if x[0] == s[1]:\r\n second = True\r\nprint(\"YES\" if second and first else \"NO\")\r\n", "password =input()\nn = int(input())\nn1 = n\nli = []\ni = 1\ncheck = False\nwhile n != 0:\n temp = input()\n li.append(temp)\n n -= 1\nfor i in range(0,n1):\n for j in range(0,n1):\n a = li[i] + li[j]\n b = li[j] + li[i]\n if password in a or password in b:\n check = True\nif check:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\n\n\t \t\t \t\t \t \t \t \t\t\t\t\t", "from sys import stdin\r\npassword = stdin.readline()\r\nn = int(stdin.readline())\r\nwords = []\r\nfor i in range(0, n):\r\n words.append(stdin.readline())\r\n\r\nfirstAvailable = False\r\nsecondAvailable = False\r\nfor i in range(0, n):\r\n if words[i] == password:\r\n firstAvailable = True\r\n secondAvailable = True\r\n if words[i][1] == password[0]:\r\n firstAvailable = True\r\n if words[i][0] == password[1]:\r\n secondAvailable = True\r\n\r\nif (firstAvailable and secondAvailable):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "key = input()\r\nn = int(input())\r\nlst = []\r\nfor i in range(n):\r\n lst.append(input())\r\nfirstChar = False\r\nsecondChar = False\r\nfor s in lst:\r\n if s == key:\r\n print(\"YES\")\r\n exit()\r\n if s[1] == key[0]:\r\n firstChar = True\r\n if s[0] == key[1]:\r\n secondChar = True\r\nif firstChar and secondChar:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str0 = input()\r\nt=int(input())\r\nstr1=''\r\nstr2=''\r\nflagi=0\r\nf=0\r\nflagj=0\r\nfor i in range(t):\r\n x=input()\r\n if x==str0:\r\n f=2\r\n break\r\n if str0[0]==x[1]:\r\n str1+=x\r\n flagi=1\r\n if str0[1]==x[0]:\r\n str2+=x\r\n flagj=1\r\nstreal=str1+str2\r\nif (flagi+flagj)>1 or f==2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nstr = [input() for i in range(int(input()))]\r\nfor i in str:\r\n\tfor j in str:\r\n\t\tif n in i + j:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit(0)\r\nprint(\"NO\")# 1698187477.0616517", "password = input()\r\nnumber = int(input())\r\nS = []\r\nk = 0\r\n\r\n\r\ndef check(x):\r\n if S[x] == password:\r\n return True\r\n tmp = S[x][0]\r\n for j, s in enumerate(S):\r\n if s[1] + tmp == password:\r\n return True\r\n\r\n tmp = S[x][1]\r\n for j, s in enumerate(S):\r\n if tmp + s[0] == password:\r\n return True\r\n return False\r\n\r\n\r\nfor i in range(number):\r\n tmp = input()\r\n S.append(tmp)\r\n\r\nfor i in range(number):\r\n if check(i) is True:\r\n k += 1\r\n print(\"YES\")\r\n break\r\n\r\nif k == 0:\r\n print(\"NO\")", "s=input()\r\nn=int(input())\r\nf1=False\r\nf2=False\r\nfor _ in range(n):\r\n t=input()\r\n if(s[0]==t[0] and s[1]==t[1]):\r\n f1=True\r\n f2=True\r\n if(s[0]==t[1]):\r\n f1=True\r\n if(s[1]==t[0]):\r\n f2=True\r\nif(f1 and f2):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nn = int(input())\r\nl1, l2, l = [] , [], []\r\nfor i in range(n):\r\n t = input()\r\n l.append(t)\r\n l1.append(t[0])\r\n l2.append(t[1])\r\nif s in l or s[::-1] in l:\r\n print('YES')\r\nelse: \r\n if ((s[0] in l2) and (s[1] in l1)):\r\n print('YES')\r\n else:\r\n print('NO')", "\ns1 = input()\nn = int(input())\n\nbegs = set()\nends = set()\n\nres = False\n\nfor i in range(0, n):\n s = input()\n if s == s1:\n res = True\n begs.add(s[0])\n ends.add(s[1])\n\nres = res or (s1[0] in ends and s1[1] in begs)\n\nprint('YES' if res else 'NO')\n", "a = input()\r\nfound , f1, f2 = False, 0, 0\r\nfor _ in range(int(input())):\r\n\tb = input()\r\n\tif a == b : found = True\r\n\tif a[0] == b[1] : f1 = 1\r\n\tif a[1] == b[0] : f2 = 1\r\nif found or (f1 and f2) : print (\"YES\")\r\nelse : print (\"NO\")", "s=input()\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nif s in l:\r\n print('YES')\r\nelse:\r\n c=0\r\n for i in range(n):\r\n for j in range(n):\r\n if l[i][1]+l[j][0]==s:\r\n c=1\r\n break\r\n if c==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "s = input()\r\nn = int(input())\r\nx = \"\"\r\ncount0 = 0\r\ncount1 = 0\r\nfor i in range(n):\r\n m = input()\r\n if m == s:\r\n print(\"YES\")\r\n exit()\r\n if count0 < 1:\r\n if m[0] == s[1]:\r\n x += m[0]\r\n count0 += 1\r\n if count1 < 1:\r\n if m[1] == s[0]:\r\n x = m[1] + x\r\n count1 += 1\r\nif s in x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def solution():\r\n password = input()\r\n num_words = int(input())\r\n words = []\r\n for _ in range(num_words):\r\n words.append(input())\r\n\r\n for x in range(num_words):\r\n for y in range(num_words):\r\n possible = words[x] + words[y]\r\n if password in possible:\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\nsolution()\r\n", "st = input()\r\ndct = [input() for i in range(int(input()))]\r\n\r\nfirst = [i[0] for i in dct]\r\nlast = [i[1] for i in dct]\r\n\r\nprint('YES') if st in dct or st[0] in last and st[1] in first else print('NO')\r\n", "s = str(input())\r\nn = int(input())\r\nT = [str(input()) for i in range(n)]\r\nif s in T:\r\n print('YES')\r\n exit()\r\n\r\nfor t0 in T:\r\n for t1 in T:\r\n t = t0+t1\r\n if t.find(s) != -1:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "pw = input()\r\nforw = [input() for i in range(int(input()))]\r\nfor forw1 in forw:\r\n\tfor forw2 in forw:\r\n\t\tif pw in forw1 + forw2:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit(0)\r\nprint(\"NO\")", "def solve():\r\n s = input()\r\n n = int(input())\r\n arr = []\r\n for i in range(n):\r\n curr = input()\r\n arr.append(curr)\r\n \r\n for j in range(i+1):\r\n c1 = curr + arr[j]\r\n c2 = arr[j] + curr\r\n \r\n if s in c1 or s in c2:\r\n return True\r\n \r\n return False\r\n \r\nif solve():\r\n print('YES')\r\nelse:\r\n print('NO')", "one=input()\r\nnum=int(input())\r\ntwos=[]\r\nfor i in range(num):\r\n twos.append(input())\r\n\r\nif (one in twos) or (one[::-1] in twos):\r\n print(\"YES\")\r\n\r\nelse:\r\n flag1,flag2=False,False\r\n for i in range(num):\r\n if twos[i][0]==one[1]:\r\n flag1=True\r\n if twos[i][1]==one[0]:\r\n flag2=True\r\n if(flag1 and flag2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ns=input()\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nc=0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if(s in l[i]+l[j] or s in l[j]+l[i]):\r\n c=1\r\n break\r\n if(c==1):\r\n break\r\nif(c==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "i=list(input())\r\nn=int(input())\r\na=0\r\nb=0\r\ns=0\r\nfor k in range(n):\r\n\tli=list(input())\r\n\tif(li[0]==i[0]): \r\n\t\tif(li[1]==i[1]):\r\n\t\t\ts=1\r\n\t\t\tbreak\r\n\tif(li[0]==i[1]):\r\n\t\tif(li[1]==i[0]):\r\n\t\t\ts=1\r\n\t\t\tbreak\r\n\tif(li[1]==i[0]):\r\n\t\ta=1\r\n\tif(li[0]==i[1]):\r\n\t\tb=1\r\n\t\t\r\nif((b==1 and a==1) or s==1):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a,b=input()\nn=int(input())\nad,bc,acbd=0,0,0\nfor _ in range(n):\n c,d=input()\n ad+=int(a==d)\n bc+=int(b==c)\n acbd+=int(a==c and b==d)\nans=(ad and bc) or acbd\nprint(\"YES\" if ans else \"NO\")\n \t \t\t\t\t\t \t\t \t \t \t \t \t", "password=input()\r\nn=int(input());first=0;second=0\r\nfor i in range(n):\r\n x=input()\r\n if x[0]==password[0] and x[1]==password[1]:\r\n first=1;second=1\r\n elif x[0]==password[1]:\r\n second=1\r\n if x[1]==password[0]:\r\n first=1\r\n elif x[1]==password[1]:\r\n second=1\r\nif first==1 and second==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "pwd = input()\r\n\r\nn = int(input())\r\n\r\nset1 = set()\r\nset2 = set()\r\n\r\nfor i in range(n):\r\n test = input()\r\n if test == pwd:\r\n print(\"YES\")\r\n break\r\n test = list(test)\r\n set1.add(test[0])\r\n set2.add(test[1])\r\nelse:\r\n if pwd[0] in set2 and pwd[1] in set1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s = input()\nv = []\nfor _ in range(0, int(input())):\n v.append(input())\nx, y = zip(*v)\nprint([\"NO\", \"YES\"][s in v or (s[1] in x and s[0] in y)])\n", "def solve():\r\n\r\n password = input()\r\n n = int(input())\r\n words = [input() for i in range(n)]\r\n\r\n #status = \"NO\"\r\n for i in range(n):\r\n for j in range(n):\r\n temp = words[i] + words[j]\r\n if password in temp:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(solve())\r\n", "s = input()\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nfc = 0\r\nsc = 0\r\nfor i in range(n):\r\n fb = a[i][0]\r\n sb = a[i][1]\r\n if fb + sb == s or sb + fb == s:\r\n fc = 1\r\n sc = 1\r\n break\r\n if fb == s[1] and fc == 0:\r\n fc = 1\r\n if sb == s[0] and sc == 0:\r\n sc = 1\r\n \r\n if fc == 1 and sc == 1:\r\n break\r\n\r\nif fc == 1 and sc == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n ", "def bark():\r\n p = input()\r\n n = int(input())\r\n res=[]\r\n for i in range(n):\r\n m=input()\r\n res.append(m)\r\n for k in res:\r\n for j in res:\r\n if p in k+j:\r\n print(\"YES\")\r\n exit(0)\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\nbark()\r\n\r\n\r\n\r\n\r\n", "x = input()\nn = int(input())\nstart = set()\nend = set()\n\na = ''\nhasFound = 0\nfor i in range(n):\n t = input()\n if x == t:\n hasFound = 1\n print('YES')\n break\n start.add(t[0])\n end.add(t[1])\n\nstart = list(start)\nend = list(end)\nif not hasFound:\n if x[0] in end and x[1] in start:\n print(\"YES\")\n else:\n print(\"NO\")\n", "def test():\n\tstring = input()\n\tn = input()\n\tn = int(n)\n\tarr = []\n\tfor i in range(n):\n\t temp = input()\n\t if temp == string:\n\t \tprint('YES')\n\t \treturn\n\t arr.append(temp)\n\n\tfor i in range(len(arr)):\n\t for j in range(len(arr)):\n\t \tif arr[i][1] + arr[j][0] == string:\n\t \t\tprint('YES')\n\t \t\treturn\n\tprint('NO')\ntest()\n", "#!/usr/bin/python3\n\ns = input()\nn = int(input())\nl = [input() for i in range(n)]\n\nans = False\n\nif s in l:\n ans = True\nelse:\n for i in range(n):\n for j in range(n):\n if (l[i] + l[j])[1:3] == s:\n ans = True\n\nif ans:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "p = input()\r\nq = [input() for i in range(int(input()))]\r\nr = [(q1[1]+q2[0]) for q1 in q for q2 in q]\r\nprint(\"Yes\" if p in q+r else \"No\")", "import sys\r\ns, lst = input(), [input() for x in range(int(input()))]\r\nfor x in lst:\r\n for i in lst:\r\n if (x[1] == s[0] and i[0] == s[1]) or x == s:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")", "password, n = input(), int(input())\nres = \"NO\"\nstarts, ends = False, False\nfor _ in range(n):\n s = input()\n starts = starts or s[0] == password[1]\n ends = ends or s[1] == password[0]\n if s == password or (starts and ends):\n res = \"YES\"\nprint(res)\n", "password = input()\r\ncases = int(input())\r\nend = False\r\nbeg = False\r\nwhile cases:\r\n cases -= 1\r\n s = input()\r\n if s == password or s == password[::-1]:\r\n print(\"YES\")\r\n exit()\r\n if s.endswith(password[0]):\r\n end = True\r\n if s.startswith(password[1]):\r\n beg = True\r\n\r\n if end and beg:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "p, w = input(), [input() for i in range(int(input()))]\r\nprint('YES' if p in w or p[0] in (wi[1] for wi in w) and p[1] in (wi[0] for wi in w) else 'NO')", "password = input()\r\nn = int(input())\r\nlanguage = []\r\nz = 0\r\nfor i in range(n):\r\n words = input()\r\n language.append(words)\r\n\r\nfor i in language:\r\n for k in language:\r\n a = i + k\r\n if password in a:\r\n z = 1\r\n break\r\n if z == 1:\r\n break\r\n\r\nif z == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "a,b = list(input())\r\na_set = set()\r\nb_set = set()\r\n\r\nmatch = False\r\nfor _ in range(int(input())):\r\n x,y = list(input())\r\n if x == a and y == b:\r\n match = True\r\n if a == x:\r\n a_set.add(0)\r\n if a == y:\r\n a_set.add(1)\r\n if b == x:\r\n b_set.add(0)\r\n if b == y:\r\n b_set.add(1)\r\n\r\nif len(a_set) > 0 and len(b_set) > 0:\r\n if match or 1 in a_set and 0 in b_set:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\nelse:\r\n print(\"NO\")\r\n", "pwd = str(input())\nnum = int(input())\n\nf1 = b1 = False\nf2 = b2 = False\ndone = False\n\nfor i in range(num):\n temp = str(input())\n if temp == pwd:\n done = True\n \n if temp[0] == pwd[0]:\n f1 = True\n if temp[0] == pwd[1]:\n f2 = True\n \n if temp[1] == pwd[0]:\n b1 = True\n if temp[1] == pwd[1]:\n b2 = True\n \nif done == True:\n print(\"YES\")\nelif(f2 == True and b1 == True):\n print(\"YES\")\nelse:\n print(\"NO\")", "\r\ndef main():\r\n pw = input()\r\n n = int(input())\r\n flag = [False] * 3\r\n for i in range(n):\r\n bk = input()\r\n if bk == pw:\r\n flag[0] = True\r\n if bk[1] == pw[0]:\r\n flag[1] = True\r\n if bk[0] == pw[1]:\r\n flag[2] = True\r\n if flag[0] or (flag[1] and flag[2]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "c=input()\r\na=int (input())\r\ns=0\r\nt=0\r\nfor i in range(a):\r\n x=input()\r\n if(x==c):\r\n s=1\r\n t=1\r\n else:\r\n if(x[0]==c[1]):\r\n s=1\r\n if(x[1]==c[0]):\r\n t=1\r\nif( s==t==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p=input()\r\nn=int(input())\r\nw=[]\r\nc=0\r\nfor i in range(n):\r\n w.append(input())\r\nfor i in w:\r\n for j in w:\r\n if p in i+j:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n ", "\r\npassw = input()\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n\tl.append(input())\r\n\r\n\r\nfor i in range(n):\r\n\tfor j in range(i, n):\r\n\t\tansGuess = (l[i] + l[j]) * 2\r\n\t\tif passw in ansGuess:\r\n\t\t\tprint('YES')\r\n\t\t\texit()\r\n\r\nprint('NO')", "pas = input()\nn = int(input())\ns = []\nflag1 = False\nflag2 = False\nflag3 = False\nfor i in range(n):\n s.append(input())\n\nfor i in s:\n if i[1] == pas[0]:\n flag1 = True\n if i[0] == pas[1]:\n flag2 = True\n if i == pas:\n flag3 = True\nif flag1 and flag2 or flag3:\n print('YES')\nelse:\n print('NO')\n", "def Kashtanka(pw,n):\r\n lst = []\r\n for i in range(n):\r\n lst.append(input())\r\n if lst[i] == pw :\r\n return \"YES\"\r\n\r\n temp = 1\r\n for j in range(n):\r\n if lst[j][1] == pw[0]:\r\n temp = 0\r\n\r\n if temp :\r\n return \"NO\"\r\n\r\n for l in range(n):\r\n if pw[1] == lst[l][0]:\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\nprint(Kashtanka(input(),int(input())))", "s = input()\r\nn = int(input())\r\nstart = s[0]\r\nfinish = s[1]\r\nfirst = False\r\nlast = False\r\nfor i in range(n):\r\n t = input()\r\n if t[0] == finish:\r\n last = True\r\n if t[1] == start:\r\n first = True\r\n if (t[0] == start and t[1] == finish) or (first and last):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "password = input()\r\n\r\nn = int(input())\r\n\r\nfirstLetter = 0\r\nsecondLetter = 0\r\nfound = 0\r\n\r\nfor i in range(n):\r\n string = input()\r\n\r\n if string == password:\r\n found = 1\r\n\r\n if string[1] == password[0]:\r\n firstLetter = 1\r\n\r\n if string[0] == password[1]:\r\n secondLetter = 1\r\n\r\n\r\nif ( found or (firstLetter and secondLetter) ):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nn = int(input())\r\nflag1, flag2 = False, False\r\nfor i in range(n):\r\n a = input()\r\n if s == a:\r\n flag1, flag2 = True, True\r\n\r\n if s[0] == a[1]:\r\n flag1 = True\r\n if s[1] == a[0]:\r\n flag2 = True\r\n\r\nif flag1 and flag2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "password = input()\r\nn = int(input())\r\n\r\ndictnry = []\r\nfor i in range(n):\r\n dictnry.append(input())\r\n\r\nfirst_letters = []\r\nsecond_letters = []\r\n\r\nfor i in dictnry:\r\n first_letters.append(i[0])\r\n second_letters.append(i[1])\r\n\r\nfirst_letters = str(first_letters)\r\nsecond_letters = str(second_letters)\r\n\r\nfirst_search = first_letters.find(password[1]) >= 0\r\nsecond_search = second_letters.find(password[0]) >= 0\r\n\r\nif (first_search and second_search) or (dictnry.count(password) == 1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def check(str1, num, k):\r\n fl = False\r\n for j in range(len(num)):\r\n m = str1 + num[j]\r\n if m[1:3] == password:\r\n fl = True\r\n return fl\r\n\r\npassword = input()\r\nn = int(input())\r\nnum = []\r\nflag = False\r\nfor i in range(n):\r\n a = input()\r\n if a == password:\r\n print(\"YES\")\r\n flag = True\r\n else:\r\n num.append(a)\r\nif len(num) == 1:\r\n q = num[0] + num[0]\r\n if q[1:3] == password:\r\n print(\"YES\")\r\n flag = True\r\nif not flag:\r\n for i in range(len(num)):\r\n if check(num[i], num, i):\r\n print(\"YES\")\r\n flag = True\r\n break\r\nif not flag:\r\n print(\"NO\")", "pas = input()\r\ncount = int(input())\r\nwords = [input() for i in range(count)]\r\n\r\nif pas in words:\r\n print(\"YES\")\r\nelse:\r\n f1 = False\r\n f2 = False\r\n for word in words:\r\n if pas[0] == word[1]:\r\n f1 = True\r\n if pas[1] == word[0]:\r\n f2 = True\r\n if f1 and f2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "p = input().strip()\r\na = [input().strip() for i in range(int(input()))]\r\nb = [(ai[1]+aj[0]) for ai in a for aj in a]\r\nprint('YES' if p in a+b else 'NO')", "import sys\r\ns = input()\r\nn = int(input())\r\np = q = 0\r\nfor i in range(n):\r\n s2 = input()\r\n if n == 1:\r\n if s2 == s or s2 == s[::-1]:\r\n p = q = 1\r\n\r\n else:\r\n if s[0] == s2[1]:\r\n p = 1\r\n if s[1] == s2[0]:\r\n q = 1\r\n if s2 == s or s2 == s[::-1]:\r\n p = q = 1\r\nif p + q == 2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def main():\n pwd = input()\n n = int(input())\n s = [input() for _ in range(n)]\n\n print(\n 'YES' if pwd in s or (\n len([i for i in range(n) if s[i][1] == pwd[0]]) > 0\n and len([i for i in range(n) if s[i][0] == pwd[1]]) > 0\n ) else 'NO'\n )\n\n\nif __name__ == '__main__':\n main()\n", "s = input()\r\nn = int(input())\r\n\r\nl = []\r\nfor i in range(n):\r\n x = input()\r\n l.append(x)\r\n\r\nfor i in l :\r\n for j in l :\r\n if s in i + j:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')", "a,b=list(input())\r\nc1=c2=c=0\r\nfor i in range(int(input())):\r\n\tx,y=list(input())\r\n\tif x==b:\r\n\t\tc1+=1\r\n\tif y==a:\r\n\t\tc2+=1\r\n\tif x==a and y==b:\r\n\t\tc+=1\r\nif c>0 or (c1>0 and c2>0):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import sys\n\npassword = input()\nnumofwords = int(input())\nwordlist = []\n\nfor x in range(numofwords):\n wordlist.append(input())\n\nfor y in wordlist:\n if y == password:\n print(\"YES\")\n sys.exit()\n else:\n pass\n\nfor a in range(numofwords):\n for b in range(numofwords):\n unistring = wordlist[a] + wordlist[b]\n if password in unistring:\n print(\"YES\")\n sys.exit()\n else:\n pass\n\nprint(\"NO\")\n\n", "inp=input()\r\nn=int(input())\r\nans=0\r\nflag1=0\r\nflag2=0\r\nwhile n>0:\r\n temp=input()\r\n if temp==inp:\r\n ans=1\r\n if inp[1]==temp[0]:\r\n flag2=1\r\n if inp[0]==temp[1]:\r\n flag1=1\r\n n-=1\r\nif ans or (flag1 and flag2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "pw = input()\nfc = False\nlc = False\nfor _ in range(int(input())):\n s = input()\n if s == pw:\n fc = True\n lc = True\n break\n if s[0] == pw[1]:\n lc = True\n if s[1] == pw[0]:\n fc = True\n\nif fc and lc:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "s=input()\r\nn=int(input())\r\nll,lf,c,l,f=[],[],0,0,0\r\nfor i in range(n):\r\n j=input()\r\n if j==s or j==s[::-1]:\r\n c=1\r\n elif f==0 and j[0]==s[1]:\r\n lf.append(j)\r\n f=1\r\n elif l==0 and j[1]==s[0]:\r\n ll.append(j)\r\n l=1\r\nif c==1:\r\n print(\"YES\")\r\nelif len(ll)>=1 and len(lf)>=1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\nn = int(input())\n\nwords = []\n\ni = 0\nwhile i < n:\n b = input()\n\n words.append(b)\n\n i += 1\n\nmatch = False\n\nfor word1 in words:\n for word2 in words:\n if a in word1+word2:\n match = True\n break\n\nif match:\n print('YES')\nelse:\n print('NO')\n", "p=str(input())\ns=[]\ne=[]\nip=[]\nfor i in range(int(input())):\n temp=str(input())\n ip.append(temp)\n s.append(temp[0])\n e.append(temp[1])\nb=0\nif p in ip:\n b=1\nelse:\n if p[0] in e and p[1] in s:\n b=1\nif b==1:\n print('YES')\nelse:\n print('NO')\n", "s=input()\r\nn=int(input())\r\nlst,check=[],1\r\nfor i in range(n):\r\n lst.append(input())\r\n if lst[-1]==s:\r\n check=0\r\nif check==0:\r\n print('YES')\r\nelse:\r\n pos1,pos2=-1,-1\r\n for i in lst:\r\n if i[1]==s[0]:\r\n pos1=0\r\n break\r\n for i in lst:\r\n if i[0]==s[1]:\r\n pos2=0\r\n break\r\n if pos1+pos2==0:\r\n print('YES')\r\n else:\r\n print('NO')", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\na=input()\r\nb,c=0,0\r\nfor i in range(int(input())):\r\n\td=input()\r\n\tif d==a:\r\n\t\tprint('YES')\r\n\t\texit()\r\n\tif d[1]==a[0]:\r\n\t\tb=1\r\n\tif d[0]==a[1]:\r\n\t\tc=1\t\r\nif b and c:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\t\t\t", "pas = list(input())\r\nn = int(input())\r\nact=[]\r\nfor i in range(n):\r\n mat = list(input())\r\n act.append(mat)\r\nflag =0 \r\nfor i in range(n):\r\n if pas[0]==act[i][1]:\r\n for j in range(n):\r\n if pas[1]==act[j][0]:\r\n flag=1\r\n break\r\nfor i in range(n):\r\n if pas == act[i]:\r\n flag=1\r\n break\r\nif flag==0:\r\n print('NO')\r\nelif flag==1:\r\n print('YES')", "password = input()\r\nn = int(input())\r\nres = []\r\nfor i in range(n):\r\n res.append(input())\r\nflag = False\r\nfor i in range(len(res)):\r\n for j in range(len(res)):\r\n if password in res[i]+res[j]:\r\n flag = True\r\n break\r\n if password in res[j]+res[i]:\r\n flag = True\r\n break\r\n if flag:\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "password = str(input())\r\n\r\nn = int(input())\r\nfirst = False\r\nsecond = False\r\n\r\nfor i in range(n):\r\n a = str(input())\r\n\r\n if(a==password):\r\n print(\"YES\")\r\n first=True\r\n second=True\r\n break\r\n \r\n if(a[1]==password[0]):\r\n first = True\r\n \r\n if(a[0]==password[1]):\r\n second = True\r\n\r\n if(first==True):\r\n if(second==True):\r\n print(\"YES\")\r\n break\r\n \r\nif(first==False):\r\n print(\"NO\")\r\n\r\nelif(second==False):\r\n print(\"NO\")\r\n\r\n", "s = input()\r\nsec = []\r\nfir = []\r\nn = int(input())\r\nfor i in range(n):\r\n\ts1 = input()\r\n\tsec.append(s1[1])\r\n\tfir.append(s1[0])\r\n\tif s1 == s:\r\n\t\tprint('YES')\r\n\t\tbreak\r\nelse:\r\n\tif s[0] in sec and s[1] in fir:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "passw = list(input())\r\nt = int(input())\r\nbarked=\"\"\r\ndone=0\r\nfirst,second=[],[]\r\nfor x in range(t):\r\n l1 = list(input())\r\n if passw==l1:\r\n done=1\r\n break\r\n first.append(l1[0])\r\n second.append(l1[1])\r\n\r\nif done or passw[0] in second and passw[1] in first:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ch = input()\nn = int(input())\n\nok = [0, 0]\n\nfor _ in range(n):\n s = input()\n if s[0] == ch[1]:\n ok[0] = True\n if s[1] == ch[0]:\n ok[1] = True\n if s == ch:\n ok[0] = True\n ok[1] = True\n \nif ok[0] and ok[1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t \t\t \t\t \t\t\t\t\t \t\t \t\t\t \t\t", "a = input()\r\ncan = False\r\nis1 = is2 = False\r\nn = int(input())\r\nfor _ in range(n):\r\n s = input()\r\n if s == a:\r\n is1 = is2 = True\r\n if s[1] == a[0]:\r\n is1 = True\r\n if s[0] == a[1]:\r\n is2 = True\r\nif is1 and is2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p=input()\r\nn=int(input())\r\ns=[input() for i in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif p in s[j]+s[i]:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\r\nprint(\"NO\")", "s=input()\nn=int(input())\nS=[]\nfor i in range(n):\n S.append(input())\n \n \n#print (S)\nflag=0\nfor i in range(n):\n for j in range(n):\n if s in S[i]+S[j]:\n print (\"YES\")\n flag=1\n break\n if flag==1:\n break\n \n\n\n\nif flag==0:\n print(\"NO\") \n ", "pas=input()\r\nn=int(input())\r\nbegin=False\r\nend = False\r\nsame = False\r\nfor i in range(n):\r\n word = input()\r\n if word[0] == pas[1]:\r\n begin = True\r\n if word[1] == pas[0]:\r\n end = True\r\n if word == pas:\r\n same = True\r\n\r\nif same:\r\n print(\"YES\")\r\nelif begin and end:\r\n print (\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nr=s[1]+s[0]\r\nf=0\r\nif(s in l or r in l):\r\n print(\"YES\")\r\nelse:\r\n x,y=0,0\r\n for i in range(n):\r\n if(l[i][1]==s[0]):\r\n x=1\r\n if(l[i][0]==s[1]):\r\n y=1\r\n if(x==1 and y==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s=input()\r\nn=int(input())\r\na=[input() for i in range(n)]\r\nfor x in a:\r\n\tfor y in a:\r\n\t\tif s in x+y:\r\n\t\t\tprint('YES')\r\n\t\t\texit(0)\r\n\r\nprint('NO')\r\n\r\n", "s = input()\nn = int(input())\n\nfirst = ''\nsecond = ''\nans = 'NO'\n\nfor _ in range(n):\n word = input()\n first += word[0]\n second += word[1]\n if word == s:\n ans = 'YES'\n\nif first.count(s[1]) * second.count(s[0]) != 0:\n ans = 'YES'\n\nprint (ans)", "def cal(s,a):\n if a in s:\n return \"YES\"\n else:\n l=0\n f=0\n for p in s:\n if a[0]==p[1]:\n l=1\n if a[1]==p[0]:\n f=1\n if f==1 and l==1:\n return \"YES\"\n else:\n return \"NO\"\n\n\na=input()\nn=int(input())\ns=[]\nfor i in range(0,n):\n s.append(input())\nprint(cal(s,a))", "def main():\r\n pwd = input()\r\n n = int(input())\r\n f_l = False\r\n s_l = False\r\n for _ in range(n):\r\n b = input()\r\n if b == pwd:\r\n print('YES')\r\n return\r\n if pwd[1] == b[0]:\r\n f_l = True\r\n if pwd[0] == b[1]:\r\n s_l = True\r\n if f_l and s_l:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "pas = input()\r\nn = int(input())\r\nl_letters = set()\r\nr_letters = set()\r\nans = False\r\nfor i in range(n):\r\n j = input()\r\n l_letters.add(j[0])\r\n r_letters.add(j[1])\r\n if j == pas:\r\n ans = True\r\n if j[0] == pas[1]:\r\n if pas[0] in r_letters:\r\n ans = True\r\n if j[1] == pas[0]:\r\n if pas[1] in l_letters:\r\n ans = True\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nx = list(input().rstrip())\r\nn = int(input())\r\nans = \"NO\"\r\nu, v = [0] * 130, [0] * 130\r\nfor _ in range(n):\r\n y = list(input().rstrip())\r\n if x[0] == y[0] and x[1] == y[1]:\r\n ans = \"YES\"\r\n u[y[0]], v[y[1]] = 1, 1\r\nif v[x[0]] and u[x[1]]:\r\n ans = \"YES\"\r\nprint(ans)", "s=input()\r\nn=int(input())\r\na=[False,False]\r\nl=[input() for i in range(n)]\r\n\r\nfor i in l:\r\n\tif(i == s):\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\r\n\r\nfor i in l:\r\n\tif(i[1]==s[0]):\r\n\t\ta[0]=True\r\n\tif(i[0] == s[1]):\r\n\t\ta[1] = True\r\n\r\n\r\nif(all(a)):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "key = input()\nk = int(input())\n\nwords = []\n\nfor _ in range(k):\n\twords.append(input())\n\n\nfor i in range(k):\n\tfor j in range(k):\n\t\tif key in (words[i] + words[j]):\n\t\t\tprint('YES')\n\t\t\texit(0)\nprint('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\ng = [input()[:-1] for _ in range(int(input()))]\r\na, b = list(zip(*g))\r\nfor i in g:\r\n if i == s:\r\n print(\"YES\")\r\n break\r\nelse:\r\n if s[1] in a and s[0] in b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "pas = input()\r\nn = int(input())\r\nx = []\r\nfor i in range(n):\r\n s = input()\r\n x.append(s)\r\ncnt1 = 0\r\ncnt2= 0\r\na = pas[0]\r\nb = pas[1]\r\nfor i in range(n):\r\n if x[i][1] == a:\r\n cnt1+=1\r\n if x[i][0] == b:\r\n cnt2+=1\r\n\r\nif pas in x:\r\n print(\"YES\")\r\nelif cnt1>0 and cnt2>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "pw = input()\r\nll = []\r\nfor i in range(int(input())):\r\n s = input()\r\n ll.append(s)\r\nif pw in ll:\r\n print(\"YES\")\r\nelse:\r\n status = False\r\n for i in ll:\r\n if pw[0] == i[-1]:\r\n for j in ll:\r\n if pw[-1] == j[0]:\r\n status = True\r\n break\r\n if status == True:\r\n print(\"YES\")\r\n break\r\n if status ==False:\r\n print(\"NO\")", "p = input()\r\nn = int(input())\r\nss = set()\r\nfor _ in range(n):\r\n s = input()\r\n ss.add(s)\r\nl = list(ss)\r\nif p in l or (\"\".join(reversed(sorted(p))) in l):\r\n print(\"YES\")\r\n exit()\r\nelse:\r\n for i in range(len(l)):\r\n for j in range(i, len(l)):\r\n if (p[0] == l[i][1] and p[1] == l[j][0]) or (p[0] == l[j][1] and p[1] == l[i][0]):\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "p = input()\r\nN = int(input())\r\nl1 = []\r\nl2 = []\r\nrun = True\r\nfor i in range(N):\r\n x = input()\r\n if x == p:\r\n print(\"YES\")\r\n run = False\r\n break\r\n l1.append(x[0])\r\n l2.append(x[1])\r\nif run == True:\r\n if p[0] in l2 and p[1] in l1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s = input()\r\nl = []\r\nfor _ in range(int(input())): l.append(input())\r\nfor i in range(len(l)):\r\n for j in range(len(l)):\r\n if s in l[i] + l[j] + l[j] + l[i]:\r\n print(\"YES\",end=\"\")\r\n quit()\r\nelse:\r\n print(\"NO\",end=\"\")", "a=str(input())\r\nn=int(input())\r\nf=0\r\ng=0\r\nfor i in range(n):\r\n\ts=str(input())\r\n\tif s==a:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\telif s[0]==a[1] and s[1]==a[0]:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\telif s[1]==a[0]:\r\n\t\tif f==1:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\r\n\t\telse:\r\n\t\t\tg=1\t\r\n\telif s[0]==a[1]:\r\n\t\tif g==1:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\r\n\t\telse:\r\n\t\t\tf=1\r\nprint(\"NO\")\t\t\t\t\t\t\t\t\r\n", "pas = input()\r\nn = int(input())\r\none = False\r\ntwo = False\r\nthree = False\r\nfor i in range(n):\r\n s = input()\r\n if s[0] == pas[1]:\r\n one = True\r\n if s[1] == pas[0]:\r\n two = True\r\n if s[0] == pas[0] and s[1] == pas[1]:\r\n three = True\r\nif one and two:\r\n print(\"YES\")\r\n exit(0)\r\nif three:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "password = input()\r\nn = int(input())\r\nwords = [input() for i in range(n)]\r\nfor i in words:\r\n for j in words:\r\n if password in i+j:\r\n print('YES')\r\n raise SystemExit\r\nprint('NO')", "password = input()\r\n\r\nn=int(input())\r\nk=[]\r\nfor i in range(n):\r\n k.append(input())\r\n \r\ndef func(password,n,k):\r\n count1=0\r\n count2=0\r\n for i in range(n):\r\n if k[i]==password or k[i][::-1]==password:\r\n return \"YES\"\r\n \r\n if password[1]==k[i][0]:\r\n count1+=1\r\n \r\n elif password[0]==k[i][1]:\r\n count2+=1\r\n \r\n if count1>=1 and count2>=1:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n \r\nprint(func(password,n,k))", "password = input()\r\nn = int(input())\r\nknow = []\r\nfor _ in range(n):\r\n know.append(input())\r\n \r\ndef hi():\r\n for x in know:\r\n for y in know:\r\n if password in x + y:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(hi())\r\nexit(0)", "def findpw(words):\r\n for word1 in words:\r\n for word2 in words:\r\n if (word1 + word2).find(pw) != -1:\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\npw = input()\r\nn = int(input())\r\n\r\nwords = [input() for _ in range(n)]\r\n\r\nfindpw(words)", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\nn = int(sys.stdin.readline())\r\n\r\ndef checkPass(s,n):\r\n words = []\r\n for t in range(n):\r\n words.append(str(sys.stdin.readline().strip()))\r\n if words[-1]==s:\r\n return 'YES'\r\n for word1 in range(n):\r\n for word2 in range(n):\r\n \r\n if (words[word1][1]+words[word2][0]==s) or (words[word2][1]+words[word1][0]==s):\r\n return 'YES'\r\n return 'NO'\r\n\r\nprint(checkPass(s,n))", "s = input()\r\nn = int(input())\r\nr = []\r\nfor i in range(n):\r\n a = input()\r\n if (a == s or a[::-1] == s):\r\n print(\"YES\")\r\n exit()\r\n r.append(a)\r\nc1, c2 = False, False\r\nfor i in r:\r\n if i[1] == s[0]: c1 = True\r\n if i[0] == s[1]: c2 = True\r\n if c1&c2: print(\"YES\"); exit()\r\nprint('NO') ", "\r\npassw = input()\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n\tl.append(input())\r\n\r\n'''\r\nfor i in range(n):\r\n\tfor j in range(i, n):\r\n\t\tansGuess = (l[i] + l[j]) * 2\r\n\t\tif passw in ansGuess:\r\n\t\t\tprint('YES')\r\n\t\t\texit()\r\n\r\nprint('NO')\r\n'''\r\n#approach 2\r\nif passw in l:\r\n\tprint('YES')\r\n\texit()\r\n\r\nfor i in range(n):\r\n\tif l[i][1] == passw[0]:\r\n\t\tbreak\r\n\r\nelse:\r\n\tprint('NO')\r\n\texit()\r\n\r\n\r\nfor i in range(n):\r\n\tif l[i][0] == passw[1]:\r\n\t\tbreak\r\n\r\nelse:\r\n\tprint('NO')\r\n\texit()\r\n\r\nprint('YES')", "n = input()\r\nc=0\r\nv=0\r\nfor i in range(int(input())):\r\n s = input()\r\n if(n[0]==s[1]): c+=1\r\n if(n[1]==s[0]): v+=1\r\n if(n==s): \r\n c+=1\r\n v+=1\r\nprint(\"YES\" if(c and v) else \"NO\")", "paswd=input()\r\nstart=paswd[0]\r\nstop=paswd[1]\r\n##begin=''\r\n##end=''\r\nn=int(input())\r\nc,d=0,0\r\nfor i in range(n):\r\n a=input()\r\n if a[0]==stop:\r\n c=1\r\n if a[1]==start:\r\n d=1\r\n if a[0]==start and a[1]==stop:\r\n c,d=1,1\r\nif c==d==1:\r\n print('YES')\r\nif c==0 or d==0:\r\n print('NO')\r\n## begin=begin+a[0]\r\n## end=end+a[1]\r\n##if (start in end) and (stop in begin):\r\n## print('YES')\r\n##else:\r\n## print('NO')\r\n", "s=input()\r\nn=int(input())\r\nf=e=''\r\nfor i in range(n):\r\n t=input()\r\n if t==s:exit(print('YES'))\r\n f+=t[0]\r\n e+=t[1]\r\n if s[0] in e and s[1] in f:exit(print('YES'))\r\nprint('NO')", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-13 23:05:46\nLastEditTime: 2021-11-13 23:14:58\nDescription: Bark to Unlock\nFilePath: CF868A.py\n'''\n\n\ndef func():\n s = input().strip()\n flag1, flag2 = False, False\n n = int(input())\n for _ in range(n):\n t = input().strip() \n if s == t:\n print(\"YES\")\n break\n if t.startswith(s[1]):\n flag1 = True\n if t.endswith(s[0]):\n flag2 = True\n if flag1 and flag2:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n ", "s=input();n=int(input());x=0;y=0;k='';pd=0\nfor i in range(0,n):\n k=input()\n if k==s:\n print('YES')\n pd=1\n break\n else:\n if k[0]==s[1]:\n x=1\n if k[1]==s[0]:\n y=1\n if x==1 and y==1:\n print('YES')\n pd=1\n break\nif pd==0:\n print('NO')", "pw = input()\r\nn = int(input())\r\n\r\nls = [] \r\nfor i in range (n):\r\n s = input()\r\n ls.append (s)\r\n# print (ls)\r\n\r\nswitch = 0\r\nfor i in range (n):\r\n for j in range (n):\r\n t1 = ls[i]+ls[j]\r\n t2 = ls[j]+ls[i]\r\n # print (t1, t2)\r\n\r\n if (pw in t1) or (pw in t2): \r\n switch = 1\r\n\r\nif switch == 1:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "s = input()\nn = int(input())\nwords = [input() for i in range(n)]\nk = 0\nfor i in words:\n\tfor j in words:\n\t\tif s in i + j:\n\t\t\tk += 1\n\t\t\tbreak\n\tif k >= 1:\n\t\tprint('YES')\n\t\tbreak\nif k == 0:\n\tprint('NO')\n", "s = input()\r\nw = [input() for k in range(int(input()))]\r\n\r\nposs = False\r\nfor a in w:\r\n if (a == s):\r\n poss = True\r\n break\r\n \r\n for b in w:\r\n if a[1] + b[0] == s:\r\n poss = True\r\n break\r\n\r\nif poss:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def canUnlock(pwds,pwd):\n if pwd in pwds:\n return \"YES\"\n \n firstLetter = False\n secondLetter = False\n for p in pwds:\n if p[0]==pwd[1]:\n firstLetter = True\n if p[1]==pwd[0]:\n secondLetter = True\n if firstLetter and secondLetter:\n return \"YES\"\n \n return \"NO\"\n \nif __name__ == \"__main__\":\n pwd = input()\n N = int(input())\n pwds = []\n for i in range(N):\n pwds.append(input())\n print(canUnlock(pwds,pwd))", "def judge(n, words, password):\r\n anyEndWith0 = anyStartWith1 = False\r\n for i in range(n):\r\n if words[i] == password:\r\n return True\r\n if words[i][0] == password[1]:\r\n anyStartWith1 = True\r\n if words[i][1] == password[0]:\r\n anyEndWith0 = True\r\n if anyEndWith0 and anyStartWith1:\r\n return True\r\n return False\r\npassword = input()\r\nn = int(input())\r\nwords = [input() for _ in range(n)]\r\nprint('YES' if judge(n, words, password) else 'NO')\r\n", "s = input()\r\nn = int(input())\r\nl = [input() for _ in range(n)]\r\nres = any(s in l[i] + l[j] for i in range(n) for j in range(n))\r\nprint(\"YES\" if res else \"NO\")", "s = input()\r\nn = int(input())\r\nss = []\r\nfor _ in range(n):\r\n ss.append(input())\r\n\r\nfound = False\r\n\r\nfor i in range(n):\r\n if ss[i] == s:\r\n found = True\r\n if found:\r\n break\r\n for j in range(n):\r\n if s == ss[i][1] + ss[j][0]:\r\n found = True\r\n break\r\n\r\nif found:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b=list(input())\r\nca=cb=c=0\r\nfor i in range(int(input())):\r\n\tx,y=list(input())\r\n\tif y==a:\r\n\t\tca+=1\r\n\tif x==b:\r\n\t\tcb+=1\r\n\tif x==a and y==b:\r\n\t\tc+=1\r\nif c>0 or (ca>0 and cb>0):\r\n\tprint(\"YES\")\r\nelse:\t\r\n\tprint(\"NO\")", "k=input()\r\nsol=[]\r\nflag=False\r\nfor _ in range(int(input())):\r\n x=input()\r\n sol.append(x)\r\nfor i in range(len(sol)):\r\n for j in range(len(sol)):\r\n if k in (sol[i]+sol[j])*3 or k in (sol[j]+sol[i])*3:\r\n flag=True\r\n break\r\n if flag==True:\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "password = input()\r\nn = int(input())\r\nwords = []\r\nmyset = set()\r\nfor _ in range(n):\r\n s = input()\r\n words.append(s)\r\n myset.update([s, s[::-1]])\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n myset.update([words[i][1] + words[j][0], words[j][1] + words[i][0]])\r\nif password in myset:\r\n print('YES')\r\nelse:\r\n print('NO')", "pw=input()\r\nn=int(input())\r\nd=[]\r\nfor i in range(n):\r\n sem=input()\r\n d.append(sem)\r\nfor i in d:\r\n for j in d:\r\n if pw in i+j:\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n\r\n \r\n", "a=input()\r\nn=int(input())\r\nl,r=0,0\r\nc=0\r\nfor i in range(n):\r\n s=input()\r\n if(s==a):c+=1\r\n if(s[1]==a[0]):l+=1\r\n if (s[0] == a[1]): r += 1\r\nif (r and l) or c:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "p = input().strip()\r\nn = int(input())\r\nr = 0\r\ns = [0] * n\r\nfor i in range(n):\r\n s[i] = input().strip()\r\nfor i in range(n):\r\n for j in range(n):\r\n if p in s[i] + s[j]:\r\n r = 1\r\nif r:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "password = input()\nn = int(input())\n\nwords = []\nfirst_characters = []\nsecond_characters = []\n\nfor i in range(n):\n word = input()\n words.append(word)\n first_characters.append(word[0])\n second_characters.append(word[1])\n\n\nfor word in words:\n if word == password or word[::-1] == password:\n print('YES')\n break\n else:\n if password[1] in first_characters and password[0] in second_characters:\n print('YES')\n break\nelse:\n print('NO')\n\n\n\n", "password = input()\r\nn = int(input())\r\nsame, fl, lf = [False] * 3\r\nfor i in range(n):\r\n k = input()\r\n if k[0] == password[0]:\r\n if k[1] == password[1]:\r\n same = True\r\n if k[0] == password[1]: fl = True\r\n if k[1] == password[0]: lf = True\r\nif (fl and lf) or same:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "p=input()\r\np1=p[0]\r\np2=p[-1]\r\nn=int(input())\r\na=[]\r\nf1=False\r\nf2=False\r\nfor i in range(n):\r\n a.append(input())\r\nif p in a:\r\n print('YES')\r\nelse:\r\n for i in range(len(a)):\r\n if a[i][-1]==p1:\r\n f1=True\r\n if a[i][0]==p2:\r\n f2=True\r\n if f2 and f1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "import sys\r\ninput = lambda :sys.stdin.readline()[:-1]\r\nni = lambda :int(input())\r\nna = lambda :list(map(int,input().split()))\r\nyes = lambda :print(\"yes\");Yes = lambda :print(\"Yes\");YES = lambda : print(\"YES\")\r\nno = lambda :print(\"no\");No = lambda :print(\"No\");NO = lambda : print(\"NO\")\r\n#######################################################################\r\nfrom collections import Counter\r\nfor _ in range(1):\r\n s = input()\r\n n = ni()\r\n a = [input() for i in range(n)]\r\n if s in a:\r\n YES()\r\n continue\r\n f = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if a[i][1]==s[0] and a[j][0]==s[1]:\r\n f = 1\r\n if f:\r\n YES()\r\n else:\r\n NO()\r\n", "p=input(); n=int(input())\r\ns=[input() for i in range(n)]\r\nfor x in s:\r\n\tfor y in s:\r\n\t\tif p in x+y: print('YES'); exit(0)\r\nprint('NO')", "pas=input()\r\nn=int(input())\r\nx=0\r\ny=0\r\nflag=0\r\nfor i in range(n):\r\n a=input()\r\n if(a[1]==pas[0]):\r\n x=1\r\n if(a[0]==pas[1]):\r\n y=1\r\n elif(a[0]==pas[0] and a[1]==pas[1]):\r\n flag=1\r\nif((x==1 and y==1) or flag==1):\r\n print ('YES')\r\nelse:\r\n print (\"NO\")", "s = input()\r\nn = int(input())\r\n\r\nf1 = f2 = False\r\nl = []\r\nfor i in range(n):\r\n x = input()\r\n if x[0] == s[1] :\r\n f1 = True\r\n\r\n if x[1] == s[0]:\r\n f2 = True\r\n l.append(x)\r\n\r\n#print(l)\r\nif s in l :\r\n print('YES')\r\n exit()\r\nelse:\r\n if f1 and f2 :\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "# LUOGU_RID: 101711585\ns = input()\r\na = [input() for _ in range(int(input()))]\r\nprint((s in a or any(x[1] == s[0] for x in a) and any(x[0] == s[1] for x in a)) and 'YES' or 'NO')", "pw = input()\r\nn = int(input())\r\n\r\nmatch1, match2 = False, False\r\n\r\nfor i in range(n):\r\n word = input()\r\n if pw == word:\r\n print(\"YES\")\r\n exit()\r\n else:\r\n if pw[0] == word[1]:\r\n match1 = True\r\n if pw[1] == word[0]:\r\n match2 = True\r\nif match1 and match2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "a=input()\r\nn=int(input())\r\nb=[]\r\nfor i in range(n):\r\n b.append(input())\r\nb1=[k[0] for k in b]\r\nb2=[k[1] for k in b]\r\nif a in b:\r\n print(\"YES\")\r\nelif a[0] in b2 and a[1] in b1:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")\r\n", "passwd,flag,L=input(),0,[]\r\nfor _ in range(int(input())):\r\n\ts=input()\r\n\tif s==passwd: flag=1\r\n\tL.append(s)\r\nfor x in L:\r\n\tfor y in L:\r\n\t\tif x[1]+y[0]==passwd: flag=1\r\nprint(\"YES\" if flag else \"NO\")\r\n", "s=input()\r\nn=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n c=input()\r\n a.append(c[0])\r\n b.append(c[1])\r\n if c==s:\r\n print('YES')\r\n break\r\nelse:\r\n if ((s[1] in a) and (s[0] in b)):\r\n print('YES')\r\n else:\r\n print('NO')", "def unblock(lst, s):\r\n for i in range(len(lst)):\r\n for j in range(len(lst)):\r\n x = lst[i] + lst[j]\r\n if x.find(s) != -1:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nt = input()\r\nn = int(input())\r\na = list()\r\nfor z in range(n):\r\n y = input()\r\n a.append(y)\r\nprint(unblock(a, t))\r\n", "s = input()\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nflag = 0 \r\nfor i in range(n):\r\n for j in range(n):\r\n if s in (a[i]+a[j]):\r\n flag = 1\r\n break\r\n\r\nif flag == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "si = input()\nn = int(input())\ns = set()\nans = 'NO'\nwhile n:\n w = input()\n if w == si:\n ans = 'YES'\n s.add((w[0], 0))\n s.add((w[1], 1))\n n -= 1\nif (si[0], 1) in s and (si[1], 0) in s:\n ans = 'YES'\nprint(ans)", "s = input()\r\nn = int(input())\r\ndata = []\r\nfor i in range(n):\r\n data.append(input())\r\nmark = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if s in (data[i] + data[j]):\r\n mark = 1\r\n \r\nif mark:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nn=int(input())\r\nexec('b=['+n*'input(),'+']')\r\nc=[*zip(*b)]\r\nprint('NYOE S'[s in b or (s[0]in c[1]and s[1]in c[0])::2])", "x,y = list(input().strip())\r\nflag = False\r\nf1, f2 = False, False\r\n\r\nfor _ in range(int(input().strip())):\r\n i,j = list(input().strip())\r\n if i == x and y == j:\r\n flag = True\r\n if i == y:\r\n f1 = True\r\n if j == x:\r\n f2 = True\r\nif f1 == True and f2 == True:\r\n flag = True\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nn =int(input())\r\nb = []\r\nfor i in range(n):\r\n b.append(input())\r\nif s in b or s[::-1] in b or (s[0] in [f[1] for f in b] and s[1] in [f[0] for f in b]) :\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "mumu = input().strip()\nn = int(input().strip())\ninputStrs = []\nfound = False\n\nfor i in range(n):\n inputStr = input().strip()\n if inputStr==mumu or inputStr[::-1]==mumu:\n print(\"YES\")\n found=True\n break\n inputStrs.append(inputStr)\n\nfor i in range(n):\n if found==True:\n break\n str1 = inputStrs[i]\n for j in range(n):\n str2 = inputStrs[j]\n if str1==str2:\n continue\n str3 = str1[1]+str2[0]\n str4 = str2[1]+str1[0]\n if str3==mumu or str4==mumu:\n print(\"YES\")\n found=True\n break\n\nif found==False:\n print(\"NO\")\n", "t = input()\r\nn = int(input())\r\n\r\nok = [0, 0]\r\nfor i in range(n):\r\n w = input()\r\n if w == t:\r\n ok = [1, 1]\r\n if w[1] == t[0]:\r\n ok[0] = 1\r\n if w[0] == t[1]:\r\n ok[1] = 1\r\n\r\nif ok == [1, 1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "password = input()\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nif password in s:\r\n print('YES')\r\nelse:\r\n front = False\r\n back = False\r\n for i in s:\r\n if password[0] == i[1]:\r\n front = True\r\n break\r\n for i in s:\r\n if password[1] == i[0]:\r\n back = True\r\n \r\n if front and back:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "s = input ()\r\nn = int ( input ())\r\nl = []\r\nc , p = 0 , 0\r\nfor i in range ( n ):\r\n l . append ( input ())\r\nif s in l :\r\n print ( \"Yes\" )\r\nelse : \r\n for i in l :\r\n if ( i [ 0 ] == s [ 1 ]):\r\n c+=1\r\n break\r\n for i in l : \r\n if ( i [ 1 ] == s [ 0 ]):\r\n p+=1\r\n break\r\n if ( c == 1 and p == 1 ): \r\n print ( \"Yes\" )\r\n else :\r\n print ( \"No\" )", "password = input()\r\nok = 'NO'\r\nwords = []\r\nfor i in range(int(input())):\r\n word = input()\r\n if word == password:\r\n ok = 'YES'\r\n else:\r\n words.append(word)\r\nfor i in words:\r\n for j in words:\r\n if password in i+j or password in j+i:\r\n ok = 'YES'\r\nprint(ok)", "a = input(); n = int(input())\nb = *(input() for i in range(n)),\nc = (''.join(map(lambda x: b[i] + x, b)) for i in range(n))\nprint(('NO', 'YES')[any(a in i for i in c)]) ", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nimplementation just avoid reusing same value\r\n'''\r\n\r\ndef solve():\r\n s = I().strip()\r\n n = II()\r\n suf = set()\r\n pre = set()\r\n\r\n found = False\r\n for _ in range(n):\r\n w = I().strip()\r\n pre.add(w[0])\r\n suf.add(w[1])\r\n if w == s:\r\n found = True\r\n \r\n print('YES' if found or (s[0] in suf and s[1] in pre) else 'NO')\r\n\r\n\r\nsolve()", "target = input()\r\nn = int(input())\r\na = []\r\nok = 'NO'\r\nfor i in range(n):\r\n a.append(input())\r\n if target == a[i]:\r\n ok = 'YES'\r\n pass\r\n elif target == a[i][::-1]:\r\n ok = 'YES'\r\n pass\r\n continue\r\nfor i in a:\r\n for j in a:\r\n if i != j:\r\n if target in i + j:\r\n ok = 'YES'\r\n pass\r\n elif target in j + i:\r\n ok = 'YES'\r\n pass\r\nprint(ok)\r\n", "s=input()\nn=int(input())\nl=[]\nfor u in range(n):\n\tl.append(input())\n\nflag=0\nfor i in range(n):\n\tfor j in range(n):\n\t\tif((l[i]+l[j]).count(s) >=1):\n\t\t\tflag=1\n\t\t\tbreak\n\tif(flag):\n\t\tbreak\nif(flag):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "s = input()\r\n\r\nn = int(input())\r\na = []\r\nans_1 = False\r\nans_2 = False\r\ntotal_ans = False\r\n\r\nfor _ in range(n):\r\n st = input()\r\n if st[::-1] == s or s == st:\r\n total_ans = True\r\n break\r\n if st[0] == s[1]:\r\n ans_1 = True\r\n if st[1] == s[0]:\r\n ans_2 = True\r\n\r\nif ans_1*ans_2 or total_ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "p=input()\r\nn=int(input())\r\nlf=0\r\nrf=0\r\nans=\"NO\"\r\nfor i in range (n):\r\n a=input()\r\n if(a[0]==p[1]):\r\n lf=1\r\n if(a[1]==p[0]):\r\n rf=1\r\n if(p==a):\r\n ans=\"YES\"\r\nif(lf==1 and rf==1):\r\n ans=\"YES\"\r\nprint(ans)\r\n \r\n\r\n", "def main():\r\n p = input()\r\n n = int(input())\r\n words = []\r\n for i in range(n):\r\n words.append(input())\r\n if any(w[0]==p[0] and w[1] ==p[1] for w in words):\r\n print(\"YES\")\r\n elif any(w[1] == p[0] for w in words) and any(w[0] == p[1] for w in words):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "password = str(input())\r\nn = int(input())\r\nbarks = []\r\nfor j in range(n):\r\n barks.append(str(input()))\r\noutput = \"no\"\r\nfor j in range(n):\r\n for k in range(n):\r\n if password == barks[j][1] + barks[k][0] or password == barks[j] or barks[k] == password:\r\n output = \"yes\"\r\n break\r\n if output == \"yes\":\r\n break\r\nprint(output)\r\n", "pas = input()\nn = int(input())\nl = [input() for _ in range(n)]\ns = set()\nfor i in l:\n for j in l:\n s.add(i + j)\n s.add(j + i)\nfound = False\nfor a in s:\n if pas in a:\n found = True\n\nprint('Yes' if found else 'No')\n", "def main():\n p = input()\n l = [input() for i in range(int(input()))]\n for i in range(len(l)):\n for j in range(len(l)):\n c = l[i] + l[j]\n if p in c:\n return print(\"YES\")\n print(\"NO\")\nmain()\n", "right=input()\nn=int(input())\np=[]\ns=''\nr=''\nflag=0\nfor i in range(0,n):\n\tp.append(input())\nfor i in range(0,n):\n\tcurr=p[i]\n\tfor j in range(0,i):\n\t\ts=curr+p[j]\n\t\t#print(s)\n\t\tif(s.find(right)!=-1):\n\t\t\tflag=1\n\tfor j in range(i,n):\n\t\ts=curr+p[j]\n\t\t#print(s)\n\t\tif(s.find(right)!=-1):\n\t\t\tflag=1\nif(flag==1):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def main():\n pwrd = input()\n ww = {input() for _ in range(int(input()))}\n ww = ww | {a[1] + b[0] for a in ww for b in ww}\n print(('NO', 'YES')[pwrd in ww])\n\n\nif __name__ == '__main__':\n main()\n", "pwd=input()\r\nn=int(input())\r\nw=[]\r\nfor _ in range(n):\r\n w.append(input())\r\nfor i in range(n):\r\n for j in range(i,n):\r\n w1=w[i]+w[j]\r\n w2=w[j]+w[i]\r\n if w1.find(pwd)>=0 or w2.find(pwd)>=0:\r\n print('YES')\r\n exit()\r\nprint('NO')", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\npw = input()\r\nn = int(input())\r\nw = list()\r\nfor _ in range(n):\r\n w.append(input())\r\n\r\nfor _ in range(n):\r\n if pw in w:\r\n print('YES')\r\n exit(0)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if w[i][1] == pw[0] and w[j][0] == pw[1]:\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n\r\n", "import sys\r\n\r\ndef ReadInput():\r\n return sys.stdin.read().splitlines()\r\n\r\ndef main():\r\n input = ReadInput()\r\n pwd = input[0]\r\n words = input[2:]\r\n if pwd in words:\r\n print('YES')\r\n return\r\n\r\n if any(pwd[0] == x[1] for x in words) and any(pwd[1] == x[0] for x in words):\r\n print('YES')\r\n return\r\n\r\n print('NO')\r\n\r\nmain()", "password = input()\r\nn = int(input())\r\nfirst_letter_found = second_letter_found = 0\r\nresult = 'NO'\r\nfor i in range(n):\r\n word = input()\r\n if word==password:\r\n result = 'YES'\r\n elif result=='NO':\r\n if word[1]==password[0]:\r\n first_letter_found = 1\r\n if word[0]==password[1]:\r\n second_letter_found = 1\r\n\r\nif result=='NO' and first_letter_found==1 and second_letter_found==1:\r\n result='YES'\r\n \r\nprint(result)", "password = input()\r\nn = int(input())\r\nfirst = list()\r\nsecond = list()\r\ntest3 = False\r\nfor i in range(n):\r\n a = input();\r\n if a == password:\r\n test3 = True\r\n first.append(a[0])\r\n second.append(a[1])\r\ntest1 = False\r\ntest2 = False\r\nfor i in first:\r\n if password[1] == i:\r\n test1 = True\r\nfor i in second:\r\n if password[0] == i:\r\n test2 = True\r\nif ((test1 and test2) or (test3)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "pw = input()\r\nn = int(input())\r\nlista = []\r\naux = 0\r\n\r\nfor i in range(n):\r\n lista.append(input())\r\n\r\nfor i in lista:\r\n if pw[0] or pw[1] in i:\r\n for j in lista:\r\n if pw[0] or pw[1] in j:\r\n item = i+j\r\n if item.count(pw) > 0:\r\n aux = 1\r\n print(\"YES\")\r\n break\r\n\r\n if aux == 1:\r\n break\r\n\r\nif aux == 0:\r\n print(\"NO\")", "ka ,kb = map(str, input())\r\nv = 0\r\ng= 0\r\nfor x in range(0, int(input())):\r\n a, b = map(str,input())\r\n if a == kb:\r\n v =1\r\n if a==ka and b == kb:\r\n v = 1; g = 1\r\n if b == ka:\r\n g = 1\r\nif v== 1 and g == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "r=list(input())\r\na=[]\r\nb=[]\r\nt=0\r\nfor i in range(int(input())):\r\n p=list(input())\r\n if(p==r):\r\n t+=1\r\n a.append(p[0])\r\n b.append(p[1])\r\n\r\nif((r[0] in b and r[1] in a)or t==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "pwd = input()\r\nchk = []\r\nfor _ in range(int(input())): chk.append(input())\r\nfor a in chk:\r\n for b in chk:\r\n if pwd in a+b:\r\n print(\"Yes\"); exit()\r\nprint(\"No\")", "password = input()\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in l:\r\n for j in l:\r\n if password in i + j:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "#!/usr/bin/env\n\nfirst, last = input()\n\nnum_words = int(input())\n\nending_first = False\nstarting_last = False\nfound = False\n\nfor _ in range(num_words):\n wfirst, wlast = input()\n if wfirst == first and wlast == last:\n print('YES')\n found = True\n break\n if wlast == first:\n ending_first = True\n if wfirst == last:\n starting_last = True\n if ending_first and starting_last:\n print('YES')\n found = True\n break\n\nif not found: print('NO')\n", "s = input()\r\nn = int(input())\r\nwords = [input() for word in range(n)]\r\nans = 'NO'\r\nif s in words:\r\n ans = 'YES'\r\nstart, end = False, False\r\nfor word in words:\r\n if word[0] == s[1]:\r\n start = True\r\n if word[1] == s[0]:\r\n end = True\r\n if start and end:\r\n break\r\nif start and end:\r\n ans = 'YES'\r\nprint(ans)", "password=input()\r\nn=int(input())\r\nwords=[input() for i in range(n)]\r\nfirst_letter=password[0]\r\nsecond_letter=password[1]\r\nif password in words:\r\n print(\"YES\")\r\nelse:\r\n if any([i[0]==second_letter for i in words]) and any([i[1]==first_letter for i in words]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "pw = input()\r\nn = int(input())\r\na = [input() for _ in range(n)]\r\nif (pw in a) or ((pw[0] in [s[1] for s in a]) and (pw[1] in [s[0] for s in a])):\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin, stdout\r\n \r\nf = stdin.readline().strip()\r\nn = int(stdin.readline())\r\nchallengers = []\r\n\r\nfor i in range(n):\r\n challengers.append(stdin.readline().strip())\r\n\r\nlabel = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n s = challengers[i] + challengers[j]\r\n \r\n if f in s:\r\n label = 1\r\n\r\nif label:\r\n stdout.write('YES')\r\nelse:\r\n stdout.write('NO')", "# IAWT\r\npas = input()\r\nn = int(input())\r\nws = [input() for i in range(n)]\r\ndef f():\r\n for i in range(n):\r\n for j in range(n):\r\n if pas in ws[i] + ws[j]:\r\n print('YES')\r\n return\r\n print('NO')\r\n return\r\nf()\r\n", "a=input()\r\n\r\n\r\ny=0\r\nh=0\r\ng=0\r\nfor i in range(int(input())):\r\n t=input()\r\n if t==a:\r\n print('YES')\r\n g+=1\r\n break\r\n else:\r\n if a[0] in t:\r\n if t[1]==a[0]:\r\n y+=1\r\n if a[1] in t:\r\n if t[0]==a[1]:\r\n h+=1\r\nif g==0:\r\n if min(y,h)>=1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n", "def sweet_home(array, key):\r\n for i in array:\r\n for x in array:\r\n new_1 = i + x\r\n new_2 = x + i\r\n if new_1.find(key) != -1 or new_2.find(key) != -1:\r\n return(\"YES\")\r\n return(\"NO\")\r\n\r\npassword = str(input())\r\nn = int(input())\r\nwords = []\r\n\r\nfor i in range(0, n):\r\n words.append(str(input()))\r\n\r\nprint(sweet_home(words, password))", "import sys\r\ns=input()\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n p=input()\r\n l.append(p)\r\nfor i in l:\r\n if s in i:\r\n print('YES')\r\n sys.exit()\r\n for j in l:\r\n if i[1]==s[0] and j[0]==s[1]:\r\n print('YES')\r\n sys.exit()\r\nprint('NO')", "pswd = input()\r\nw = [input() for _ in range(int(input()))]\r\n\r\nif pswd[1] in [x[0] for x in w] and pswd[0] in [x[1] for x in w] or pswd in w:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = input()\r\ns = []\r\nn = int(input())\r\nfor i in range(n):\r\n b = input()\r\n s.append(b)\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(n):\r\n if s[i][0] == a[-1]:\r\n c1+=1\r\n if s[i][-1] == a[0]:\r\n c2+=1\r\nif a in s:\r\n print(\"YES\")\r\nelif c1>0 and c2>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s2=[]\r\nfl=0\r\nfl1=0\r\ns=str(input())\r\na=int(input())\r\nfor i in range(1,a+1):\r\n s1=str(input())\r\n if (s1 == s):\r\n fl = 1\r\n fl1 = 1\r\n break\r\n if (s1[1] == s[0]):\r\n fl = 1\r\n if(s1[0]==s[1]):\r\n fl1=1\r\nif(fl==1 and fl1==1) :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nn=int(input())\r\n\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\n\r\nif s in l:\r\n print(\"YES\")\r\n exit(0)\r\n\r\nl2=[]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n l2.append(l[i][1]+l[j][0])\r\n\r\nif s in l2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st = input()\narr = []\nfor _ in range(int(input())):\n arr.append(input())\n\nfirf = False\nsecf = False\nflag = True\nfor sbst in arr:\n if sbst == st:\n print('YES')\n flag = False\n break\n if sbst[1] == st[0]:\n firf = True\n if sbst[0] == st[1]:\n secf = True\n\n if firf and secf:\n print('YES')\n flag = False\n break\n\nif flag:\n print ('NO')\n", "p=str(input())\r\nn=int(input())\r\n\r\nf=b=c=False \r\nfor _ in range(n):\r\n s=str(input())\r\n if s==p: c=True; break \r\n if s[1]==p[0]: f=True \r\n if s[0]==p[1]: b=True \r\n if (f and b): c=True; break \r\nif c==True: print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n\r\n", "s1 = input()\r\nn = int(input())\r\ns = [input() for i in range(n)]\r\nfor i in s:\r\n for j in s:\r\n if s1 in i + j:\r\n print('YES')\r\n exit()\r\nprint('NO')", "s = input()\r\nn = int(input())\r\nFlag1 = Flag2 = False\r\nfor i in range(n):\r\n tmp = input()\r\n if tmp == s:\r\n print('YES')\r\n exit()\r\n if tmp[1] == s[0]:\r\n Flag1 = True\r\n if tmp[0] == s[1]:\r\n Flag2 = True\r\nif Flag1 and Flag2:\r\n print('YES')\r\nelse:\r\n print('NO')", "S=input()\r\na=S[0]\r\nb=S[1]\r\nT=int(input())\r\nk=0\r\nj=0\r\nm=0\r\nwhile(T>0):\r\n R=input()\r\n N=len(R)\r\n if(R[0]==S[1]):\r\n j=j+1\r\n if(R[N-1]==S[0]):\r\n k=k+1\r\n if(S==R):\r\n m=1\r\n T=T-1\r\nif(m==1):\r\n print(\"YES\")\r\nelse:\r\n if(j!=0 and k!=0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "p, n = input(), int(input())\r\na, b, c = [], [], []\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n):\r\n if p == a[i] or p == a[i][::-1]:\r\n exit(print(\"YES\"))\r\n if p[0] == a[i][1]:\r\n b.append([a[i], i])\r\n if p[1] == a[i][0]:\r\n c.append([a[i], i])\r\nif len(b) > 0 and len(c) > 0:\r\n exit(print(\"YES\"))\r\nprint(\"NO\")", "password = input()\r\nn = int(input())\r\nfirst_letter = 0\r\nsecond_letter = 0\r\nend = 0\r\nfor _ in range(n):\r\n s = input()\r\n if s == password or s[::-1] == password:\r\n end = 1\r\n elif s[-1] == password[0]:\r\n first_letter += 1\r\n elif s[0] == password[-1]:\r\n second_letter += 1\r\nif (first_letter and second_letter) or end:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef solve(A, s):\r\n if s in A:\r\n return True\r\n n = len(A)\r\n for i in range(n):\r\n for j in range(n):\r\n if A[i][1] + A[j][0] == s:\r\n return True\r\n return False\r\n\r\ndef main():\r\n s = input()\r\n A = []\r\n for _ in range(int(input())):\r\n A.append(input())\r\n if solve(A, s):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\na = [input() for i in range(int(input()))]\r\nd1 = []\r\nd2 = []\r\nok = False\r\nfor i in range(len(a)):\r\n if (a[i][1] == s[0]):\r\n d1.append(a[i][1])\r\n elif (a[i][0] == s[1]):\r\n d2.append(a[i][0])\r\n if (sorted(a[i]) == sorted(s) or (len(d1) > 0 and len(d2) > 0)):\r\n# print(sorted(a[i]), sorted(s), d)\r\n ok = True\r\n break\r\nif ok :\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "p=input()\r\nn=int(input())\r\na=[];b=[]\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n):\r\n for j in range(n):\r\n b.append(a[i][1]+a[j][0])\r\nans='NO'\r\nif p in a or p in b :ans='YES'\r\nprint(ans)", "count1, count2 = 0, 0\r\npassword = input()\r\nn = int(input())\r\nfor i in range(n):\r\n podstr = input()\r\n if podstr == password or (podstr[0]==password[1] and podstr[1]==password[0]):\r\n print('YES')\r\n exit()\r\n elif podstr[1] == password[0]:\r\n count1=1\r\n elif podstr[0] == password[1]:\r\n count2=1\r\nif count1 + count2 >= 2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n" ]

[ "n , k = [int(i) for i in input().strip().split()]\r\nl=[]\r\nfor i in range(4):\r\n l.append([])\r\n for j in range(n):\r\n l[-1].append('.')\r\nif (n==3 or k%2==0):\r\n print ('YES')\r\n x=k//2\r\n for i in range(1,x+1):\r\n for j in range(1,3):\r\n l[j][i]='#'\r\n if (k%2!=0):\r\n l[1][1]='#'\r\n for i in range(4):\r\n for j in range(n):\r\n print (l[i][j],end='')\r\n print (end='\\n')\r\nelse:\r\n if (n==4):\r\n print ('NO')\r\n else:\r\n if(n%2==0):\r\n if (k!=(2*n-5)):\r\n print ('NO')\r\n else:\r\n print ('YES')\r\n x=k//2 - 1\r\n for i in range(1,x+1):\r\n for j in range(1,3):\r\n l[j][i]='#'\r\n l[1][n-3]='#'\r\n l[1][n-2]='#'\r\n l[2][n-2]='#'\r\n for i in range(4):\r\n for j in range(n):\r\n print (l[i][j],end='')\r\n print (end='\\n')\r\n else:\r\n print ('YES')\r\n l[1][n//2]='#'\r\n if (k-1<=n-3):\r\n count=k-1\r\n a=n//2 -1\r\n b=n//2 +1\r\n while (count!=0):\r\n l[1][a]='#'\r\n l[1][b]='#'\r\n a-=1\r\n b+=1\r\n count-=2\r\n else:\r\n for i in range(1,n-1):\r\n l[1][i]='#'\r\n count=k-(n-2)\r\n a=1\r\n b=n-2\r\n while (count!=0):\r\n l[2][a]='#'\r\n l[2][b]='#'\r\n a+=1\r\n b-=1\r\n count-=2\r\n for i in range(4):\r\n for j in range(n):\r\n print (l[i][j],end='')\r\n print (end='\\n')", "n, k = map(int, input().split())\r\ns ='.'*n\r\nm = (k + 1) // 2\r\na = '.' + '#'*m + '.'*(n - m - 1)\r\nif k % 2 == 0:\r\n b = a\r\nelif k < n:\r\n t = '.'*((n - k) // 2)\r\n a, b = t + '#'*k + t, s\r\nelse:\r\n b = a[:2] + '.' + a[3:]\r\nprint('YES', s, a, b, s, sep='\\n')\r\n", "n, k = map(int, input().split())\ns ='.'*n\nm = (k + 1) // 2\nt = '.' + '#'*m + '.'*(n - m - 1)\nif k % 2 == 0:\n a, b = t, t\nelif k < n:\n t = '.'*((n - k) // 2)\n a, b = t + '#'*k + t, s\nelse:\n a, b = t, t[:2] + '.' + t[3:]\nprint('YES', s, a, b, s, sep='\\n')\n", "n,k = map(int,input().split())\r\nprint('YES')\r\nprint('.'*n)\r\nif k % 2 == 0:\r\n print('.' + '#' * (k // 2) + '.' * (n - k // 2 - 1))\r\n print('.' + '#' * (k // 2) + '.' * (n - k // 2 - 1))\r\nelif k <= n - 2:\r\n print('.' * ((n - k) // 2) + '#' * k + '.' * ((n - k) // 2))\r\n print('.' * n)\r\nelse:\r\n print('.' + '#' * (n - 2) + '.')\r\n print('.' + '#' * ((k - n + 2) // 2) + '.' * (2 * n - k - 4) + '#' * ((k - n + 2) // 2) + '.')\r\nprint('.'*n)", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(0, 4):\r\n temp = []\r\n for i in range(0, n):\r\n temp.append('.')\r\n a.append(temp)\r\nm = k\r\ni = 1\r\nwhile m > 1 and i < (n//2):\r\n a[1][i] = '#'\r\n a[1][n-i-1] = '#'\r\n i += 1\r\n m -= 2\r\ni = 1\r\nwhile m > 1 and i < (n//2):\r\n a[2][i] = '#'\r\n a[2][n-i-1] = '#'\r\n i += 1\r\n m -= 2\r\nif m > 0:\r\n a[1][n//2] = '#'\r\n m -= 1\r\nif m > 0:\r\n a[2][n//2] = '#'\r\n m -= 1\r\nprint('YES')\r\nfor i in range(0, 4):\r\n for j in range(0, n):\r\n print(a[i][j], end = '')\r\n print()", "n,k = list(map(int, input().split()))\nt = [(['.'] * n ) for i in range(4)]\nif k%2==1:\n\tt[1][n//2] = '#'\n\tk -= 1\nif k == 2*(n-2):\n\tt[2][n//2] = '#'\n\tt[1][n//2] = '#'\n\tk -= 2\n#print(t, k)\nif k > (n-3):\n\tfor i in range(1, n-1):\n\t\tif i != n//2:\n\t\t\tt[2][i] = '#'\n\t\t\tk -= 1\n#print(t, k)\nfor i in range(k//2):\n\tt[1][i+1] = '#'\n\tt[1][n-i-2] = '#'\nk = k % 2\n#print(t, k)\n\nprint('YES')\n#print(t)\nprint('\\n'.join([''.join(i) for i in t]))\n\t\n", "n, k = map(int, input().split())\r\ngrid = [['.']*n for i in range(4)]\r\nif k % 2 == 0:\r\n for i in range(k//2):\r\n grid[1][1+i], grid[2][1+i] = '#', '#'\r\nelse:\r\n m = n//2\r\n if k > n - 2:\r\n for i in range(1, n-1):\r\n grid[1][i] = '#'\r\n for i in range(1, (k-n+2)//2 + 1):\r\n grid[2][m+i], grid[2][m-i] = '#', '#'\r\n else:\r\n grid[1][m] = '#'\r\n if k > 1:\r\n for i in range(1, k//2 + 1):\r\n grid[1][m-i], grid[1][m+i] = '#', '#'\r\nprint('YES')\r\nfor i in grid:\r\n print(''.join(i))", "n,k=map(int,input().split())\ns='.'*n\nm=(k+1)//2\na='.'+'#'*m +'.'*(n-m-1)\nif k%2<1:b=a\nelif k<n:\n t=(n- k)//2*'.';a,b=t+'#'*k +t,s\nelse:b=a[:2]+'.'+ a[3:]\nprint('YES',s,a,b,s,sep='\\n')", "(n, k) = map(int, input().split())\r\n\r\nif k % 2 == 0:\r\n print(\"YES\")\r\n k1 = k // 2\r\n k2 = k // 2\r\n for x in range(4):\r\n for y in range(n):\r\n if (x == 1 and y > 0 and y < n - 1) and k1 > 0:\r\n print('#', end = '')\r\n k1 -= 1\r\n elif (x == 2 and y > 0 and y < n - 1) and k2 > 0:\r\n print('#', end = '')\r\n k2 -= 1\r\n else:\r\n print('.', end = '')\r\n print()\r\nelse:\r\n print(\"YES\")\r\n if k > n - 2:\r\n k -= 1\r\n for x in range(4):\r\n for y in range(n):\r\n if x == 1 and y > 0 and y < n - 1:\r\n print('#', end = '')\r\n k -= 1\r\n elif x == 2 and y == n - 2:\r\n print('#', end = '')\r\n elif x == 2 and y > 0 and k > 0:\r\n print('#', end = '')\r\n k -= 1\r\n else:\r\n print('.', end = '')\r\n print()\r\n else:\r\n s = n // 2\r\n d = k // 2\r\n for x in range(4):\r\n for y in range(n):\r\n if x == 1 and abs(s - y) <= d:\r\n print('#', end = '')\r\n else:\r\n print('.', end = '')\r\n print()\r\n \r\n", "n,k = map(int,input().split())\r\nif k % 2 == 0:\r\n\tm = k // 2\r\n\tline1 = '.' * n\r\n\tline2 = '.' + '#' * m + '.' * (n - m - 1)\r\n\tprint('YES')\r\n\tprint(line1)\r\n\tprint(line2)\r\n\tprint(line2)\r\n\tprint(line1)\r\nelif k <= n-2:\r\n\tline1 = '.' * n\r\n\tline2 = ('#' * k).center(n,'.')\r\n\tprint('YES')\r\n\tprint(line1)\r\n\tprint(line2)\r\n\tprint(line1)\r\n\tprint(line1)\r\nelse:\r\n\tm = (k-1) // 2\r\n\tline1 = line1 = '.' * n\r\n\tline2 = '.' + '#' * (n-2) + '.'\r\n\tline3 = '.' + '#' * (k-n+1) + '.' * (2*n-k-4) + '#' + '.'\r\n\tprint('YES')\r\n\tprint(line1)\r\n\tprint(line2)\r\n\tprint(line3)\r\n\tprint(line1)", "def main():\n n, k = map(int, input().split())\n grid = [['.' for _ in range(n)] for _ in range(4)]\n\n r = 1\n if k >= n - 2:\n grid[1] = ['.'] + ['#'] * (n - 2) + ['.']\n k -= n - 2\n r = 2\n\n c = 1\n while k > 1:\n grid[r][c] = '#'\n grid[r][n - 1 - c] = '#'\n c += 1\n k -= 2\n\n if k == 1:\n grid[r][n // 2] = '#'\n\n print('YES')\n for row in grid:\n print(''.join(row))\n\nmain()\n", "n,k=map(int,input().split())\r\ns='.'*n\r\nm=(k+1)//2\r\na='.'+'#'*m +'.'*(n-m-1)\r\nif k%2<1:b=a\r\nelif k<n:\r\n t=(n-k)//2*'.';a,b=t+'#'*k+t,s\r\nelse:b=a[:2]+'.'+a[3:]\r\nprint('YES',s,a,b,s,sep='\\n')", "n, k = [int(x) for x in input().split()]\r\n\r\nif k % 2 == 0:\r\n print(\"YES\")\r\n print(\".\"*n)\r\n print(\".\" + \"#\" * (k // 2) + \".\" * (n - 1 - k//2))\r\n print(\".\" + \"#\" * (k // 2) + \".\" * (n - 1 - k//2))\r\n print(\".\"*n)\r\nelif n % 2 == 1:\r\n print(\"YES\")\r\n print(\".\"*n)\r\n top = min(k, n-2)\r\n bot = (k - top)\r\n print(\".\" * ((n - top) // 2) + \"#\" * top + \".\" * ((n - top) // 2))\r\n print(\".\" + \"#\" * (bot // 2) + \".\" * (n - 2 - bot) + \"#\" * (bot // 2) + \".\")\r\n print(\".\"*n)\r\nelse:\r\n print(\"NO\")\r\n", "n,k=[int(x) for x in input().split()[:2]]\r\ndef pri(a,b):\r\n for i in range(b):\r\n print(a,end='')\r\n\r\ndef abd():\r\n if k%2==0:\r\n print('YES')\r\n for i in range(n):\r\n print('.',end='')\r\n print()\r\n for j in range(2):\r\n print('.', end='')\r\n for i in range(k//2):\r\n print('#', end='')\r\n for i in range(k//2,n-1):\r\n print('.', end='')\r\n print()\r\n for i in range(n):\r\n print('.',end='')\r\n print()\r\n else: # k is odd\r\n if k==1:\r\n print('YES')\r\n pri('.',n)\r\n print()\r\n pri('.',n//2)\r\n print('#',end='')\r\n pri('.',n//2)\r\n print()\r\n pri('.',n)\r\n print()\r\n pri('.',n)\r\n print()\r\n return\r\n if k==3:\r\n print('YES')\r\n pri('.',n)\r\n print()\r\n pri('.',n//2-1)\r\n print('###',end='')\r\n pri('.',n//2-1)\r\n print()\r\n pri('.',n)\r\n print()\r\n pri('.',n)\r\n print()\r\n return\r\n b=k//2\r\n a=b+1\r\n print('YES')\r\n pri('.',n)\r\n print()\r\n print('.',end='')\r\n pri('#',a)\r\n pri('.',n-a-1)\r\n print()\r\n print('.',end='')\r\n pri('#',b-1)\r\n print('.',end='')\r\n print('#',end='')\r\n pri('.',n-a-1)\r\n print()\r\n pri('.',n)\r\n print()\r\nabd()", "def cin(): return map(int, input().strip().split())\r\nn, k = cin()\r\nr ='.' * n\r\nprint(\"YES\", r, sep=\"\\n\")\r\nif k % 2 and k < n:\r\n pivot = '.'*((n - k) // 2)\r\n print(pivot + '#'*k + pivot)\r\n print(r)\r\nelse:\r\n m = (k + 1) // 2\r\n pivot = '.' + '#'*m + '.'*(n - m - 1)\r\n print(pivot + '\\n' + (pivot, pivot[:2] + '.' + pivot[3:])[k % 2])\r\nprint(r)", "n,k=list(map(int,input().split()))\r\n\r\n\r\n\r\nif k % 2 ==0:\r\n print('YES')\r\n l=k // 2\r\n print('.'*n)\r\n print('.'+'#'*l+'.'*(n-2-l)+'.')\r\n print('.'+'#'*l+'.'*(n-2-l)+'.')\r\n print('.'*n)\r\nelif k<=n-2:\r\n print('YES')\r\n l=k\r\n print('.'*n)\r\n m=n-2-l\r\n print('.'+'#'*(l//2)+'.'*(m//2)+'#'+'.'*(m//2)+'#'*(l//2)+'.')\r\n print('.'*n)\r\n print('.'*n)\r\nelse:\r\n print('YES')\r\n print('.'*n)\r\n print('.'+'#'*(n-2)+'.')\r\n l=k-(n-2)\r\n m=n-2-l\r\n print('.'+'#'*(l//2)+'.'*m+'#'*(l//2)+'.')\r\n print('.'*n)\r\n \r\n", "n, k = map(int, input().split())\r\nans = [['.' for j in range(n)] for i in range(4)]\r\nif (k % 2 == 0):\r\n for j in range(1, k // 2 + 1):\r\n ans[1][j] = ans[2][j] = '#'\r\n print(\"YES\")\r\n for i in range(4):\r\n print(*ans[i], sep = '')\r\nelse:\r\n if (n % 2 == 1):\r\n ans[1][n // 2] = '#'\r\n k -= 1\r\n t = min(n - 3, k)\r\n for j in range(1, t // 2 + 1):\r\n ans[1][j] = ans[1][n - j - 1] = '#'\r\n k -= t\r\n \r\n for j in range(1, k // 2 + 1):\r\n ans[2][j] = ans[2][n - j - 1] = '#'\r\n print('YES')\r\n for i in range(4):\r\n print(*ans[i], sep = '')\r\n else:\r\n print('NO')\r\n \r\n", "#Marlin\r\nn,k=map(int,input().split())\r\nprint('YES')\r\nif k%2==0:\r\n print('.'*n)\r\n for i in range(2):\r\n print(('{}{}{}').format('.','#'*(k//2),'.'*(n-k//2-1)))\r\n print('.'*n)\r\nelse:\r\n print('.'*n)\r\n if k<=(n-2):\r\n print(('{}{}{}').format('.'*((n-k)//2),'#'*(k),'.'*((n-k)//2)))\r\n print('.'*n)\r\n else:\r\n print(('{}{}{}').format('.','#'*(n-2),'.'))\r\n print(('{}{}{}{}{}').format('.','#'*((k-n+2)//2),'.'*(2*n-4-k),'#'*((k-n+2)//2),'.'))\r\n print('.'*n)", "s = input().split()\r\nn, k = int(s[0]), int(s[1])\r\ncount = k\r\ncl = []\r\n\r\nif k%2==0:\r\n p = k//2\r\n for x in range(4):\r\n t = []\r\n for y in range(n):\r\n if count!=0:\r\n if y<=p and y>0 and x<4 and x>0:\r\n t.append('#')\r\n count-=1\r\n else:\r\n t.append('.')\r\n else:\r\n t.append('.')\r\n cl.append(t)\r\nelse:\r\n centr = n//2\r\n p = k%(n-2)\r\n if p==k:\r\n p1 = k//2\r\n p2 = 0\r\n else:\r\n p1 = (n-2)//2\r\n p2 = k%(n-2)\r\n p2 = p2//2\r\n for x in range(4):\r\n t = []\r\n for y in range(n):\r\n if count != 0:\r\n if y <= centr+p1 and y >= centr-p1 and x == 1:\r\n t.append('#')\r\n count -= 1\r\n elif y>0 and (y <= p2 or y > n-2-p2) and y<n-1 and x == 2:\r\n t.append('#')\r\n count -= 1\r\n else:\r\n t.append('.')\r\n else:\r\n t.append('.')\r\n cl.append(t)\r\n\r\nres = ''\r\nfor x in range(4):\r\n for y in range(n+1):\r\n if y==n:\r\n res+='\\n'\r\n else:\r\n res+=cl[x][y]\r\n\r\nprint('YES')\r\nprint(res)", "z,zz=input,lambda:list(map(int,z().split()));\r\nszz,dgraphs,mod=lambda:sorted(zz()),{},10**9+7\r\nfrom string import *\r\nfrom collections import *\r\nfrom queue import *\r\nfrom sys import *\r\nfrom collections import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom bisect import *\r\nfrom collections import Counter as cc\r\nfrom math import factorial as f\r\nfrom bisect import bisect as bs\r\nfrom itertools import accumulate as ac\r\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\r\ndef prime(x):\r\n p=ceil(x**.5)+1\r\n for i in range(2,p):\r\n if x%i==0 and x!=2:return 0\r\n return 1\r\ndef dfs(u,visit,graph):\r\n visit[u]=True\r\n for i in graph[u]:\r\n if not visit[i]:\r\n dfs(i,visit,graph)\r\n###########################---Test-Case---#################################\r\n\"\"\"\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n###########################---START-CODING---##############################\r\n\r\nn, k =zz()\r\na = '.' * n\r\n\r\nprint('YES')\r\nprint(a)\r\nif k % 2 == 0:\r\n k //= 2\r\n print('.' + '#'*k + '.'*(n-k-1))\r\n print('.' + '#'*k + '.'*(n-k-1))\r\nelif k <= n-2:\r\n print('.' * ((n - k) // 2) + '#' * k + '.' * ((n - k) // 2))\r\n print(a)\r\nelse:\r\n k -= n-2\r\n print('.' + '#'*(n-2) + '.')\r\n print('.' + '#'*(k//2) + '.'*(n-2-k) + '#'*(k//2) + '.')\r\n\r\nprint(a)\r\n\r\n \r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nprint('YES')\r\nd = [['.']*n for i in range(4)]\r\nif k % 2:\r\n d[1][n//2] = '#'\r\n k -= 1\r\na, b = k//4, k%4\r\nfor i in range(a):\r\n d[1][1+i] = d[2][1+i] = d[1][n-2-i] = d[2][n-2-i] = '#'\r\nif b == 2:\r\n if k != 2*(n-2):\r\n d[1][1+a] = d[1][n-2-a] = '#'\r\n else:\r\n d[1][1 + a] = d[2][n - 2 - a] = '#'\r\n\r\nfor i in d:\r\n print(''.join(i))\r\n", "n,k=map(int,input().split())\r\nif(k%2==0):\r\n print(\"YES\")\r\n print('.'*n)\r\n print('.'+'#'*(k//2)+'.'*(n-1-k//2))\r\n print('.'+'#'*(k//2)+'.'*(n-1-k//2))\r\n print('.'*n)\r\nelse:\r\n print(\"YES\")\r\n print('.'*n)\r\n if(k<=n-2):\r\n print('.'*((n-k)//2)+'#'*k+'.'*((n-k)//2))\r\n print('.'*n)\r\n else:\r\n print('.'+'#'*(n-2)+'.')\r\n print('.'+'#'*((k-n+2)//2)+'.'*(n-2-k+n-2)+'#'*((k-n+2)//2)+'.')\r\n print('.'*n)\r\n", "from bisect import bisect_left, bisect_right\r\n\r\ndef tuple_input(type):\r\n return map(type, input().strip().split())\r\n\r\ndef print_list(s):\r\n print(''.join(map(str, s)))\r\n\r\n\r\n'''\r\n'''\r\nn, k = tuple_input(int)\r\nres = list()\r\nfor i in range(4):\r\n res.append(['.'] * n)\r\nif k == 1:\r\n res[1][n // 2] = '#'\r\nelif k == 3:\r\n res[1][n // 2 - 1] = '#'\r\n res[1][n // 2 ] = '#'\r\n res[1][n // 2 + 1] = '#'\r\nelse:\r\n for i in range(1, 3):\r\n for j in range(1, ((k + 1) // 2) + 1):\r\n res[i][j] = '#'\r\n if k % 2 != 0:\r\n res[1][2] = '.'\r\nprint('YES')\r\nfor e in res:\r\n print(''.join(e))", "n,k=map(int,input().strip().split())\r\nl=[[\".\" for k in range(n)] for u in range(4)]\r\nif k%2==0:\r\n\ts=k//2\r\n\tfor u1 in range(1,s+1):\r\n\t\tl[1][u1]=\"#\"\r\n\t\tl[2][u1]=\"#\"\r\nelse:\r\n\ts=(k-1)//2\r\n\tl[1][n//2]=\"#\"\r\n\tif s>((n-3)//2):\r\n\t\tfor u1 in range(1,s+1):\r\n\t\t\tl[1][u1]=\"#\"\r\n\t\t\tl[1][n-1-u1]=\"#\"\r\n\t\tdiff=s-(n-3)//2\r\n\t\tfor u2 in range(1,diff+1):\r\n\t\t\tl[2][u2]=\"#\"\r\n\t\t\tl[2][n-1-u2]=\"#\"\r\n\telse:\r\n\t\tfor u1 in range(1,s+1):\r\n\t\t\tl[1][u1]=\"#\"\r\n\t\t\tl[1][n-1-u1]=\"#\"\r\nprint (\"YES\")\r\nfor k1 in range(4):\r\n\tfor k2 in range(n):\r\n\t\tprint(l[k1][k2],end=\"\")\r\n\tprint()\r\n\r\n", "\"\"\" Prositka\r\n30.10.2022\"\"\"\r\n\r\nn,k=map(int,input().split())\r\na=[0]*4\r\nfor i in range(4):\r\n\ta[i]=[\".\"]*n\r\nif(k%2==1):\r\n\ta[1][n//2]=\"#\"\r\n\tk-=1\r\nfor i in range(1,3):\r\n\tfor j in range(1,n//2):\r\n\t\t#print(j,n//2)\r\n\t\tif(k>0):\r\n\t\t\tif(j==(n//2)):\r\n\t\t\t\tcontinue\r\n\t\t\t#print(\"Dhukeche eikhane\")\r\n\t\t\ta[i][j]=\"#\"\r\n\t\t\ta[i][n-j-1]=\"#\"\r\n\t\t\tk-=2\r\n\t\telse:\r\n\t\t\tbreak\r\n\tif(k==0):\r\n\t\tbreak\r\nif(k>0):\r\n\tfor i in range(1,3):\r\n\t\tif(a[i][n//2]==\"#\"):\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\ta[i][n // 2] = \"#\"\r\n\t\t\tk-=1\r\n#for i in range(4):\r\n\t#print(*a[i] , sep=\"\")\r\nif(k>0):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor i in range(4):\r\n\t\tprint(*a[i] , sep=\"\")", "n,k=map(int,input().split())\r\nif k>2*(n-2):\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n if k%2==0:\r\n print('.'*n)\r\n x=k//2\r\n print('.'+'#'*x+'.'*(n-x-1))\r\n print('.'+'#'*x+'.'*(n-x-1))\r\n print('.'*n)\r\n else :\r\n print('.'*n)\r\n if k>n-2:\r\n print('.'+'#'*(n-2)+'.')\r\n k-=n-2\r\n i=1\r\n j=n-2\r\n temp=['.']*n\r\n while k>0:\r\n temp[i]='#'\r\n temp[j]='#'\r\n i+=1\r\n j-=1\r\n k-=2\r\n print(''.join(temp))\r\n else :\r\n temp=['.']*n\r\n temp[n//2]='#'\r\n k-=1\r\n i=n//2-1\r\n j=n//2+1\r\n while k>0:\r\n temp[i]='#'\r\n temp[j]='#'\r\n k-=2\r\n i-=1\r\n j+=1\r\n print(''.join(temp))\r\n print('.'*n)\r\n print('.'*n)", "\r\n# 9\r\n# 6 7 8 3 4 5 9 10 11\r\n\r\n# n, k = (int(x) for x in input().split())\r\n# n = int(input())\r\n# s = list(map(int, input().split()))\r\n\r\nn, k = (int(x) for x in input().split())\r\n\r\nprint('YES')\r\n\r\nif k % 2 == 0: # even\r\n kk = k // 2\r\n print('.' * n)\r\n for i in range(0, 2):\r\n print('.' + ('#' * kk) + ('.' * (n - kk - 1)))\r\n print('.' * n)\r\nelse: # odd\r\n\r\n if k > n - 2: # need more than one row\r\n print('.' * n)\r\n print('.' + '#' * (n - 2) + '.')\r\n k = k - (n - 2)\r\n print('.' * ((n - k) // 2) + '#' * (k // 2) + '.' + '#' * (k // 2) + '.' * ((n - k) // 2))\r\n print('.' * n)\r\n else:\r\n print('.' * n)\r\n print('.' * ((n - k) // 2) + '#' * k + '.' * ((n - k) // 2))\r\n print('.' * n)\r\n print('.' * n)\r\n", "n, k=map(int, input().split())\r\nif k%2==0:\r\n print('YES')\r\n print(n*'.')\r\n print('.'+int(k/2)*'#'+(n-(int(k/2)+1))*'.')\r\n print('.'+int(k/2)*'#'+(n-(int(k/2)+1))*'.')\r\n print(n*'.') \r\nelse:\r\n if k>n-2:\r\n print('YES')\r\n print(n*'.')\r\n print('.'+int((n-3)/2)*'#'+'.'+int((n-3)/2)*'#'+'.')\r\n x=k-n+3\r\n print(int((n-x)/2)*'.'+x*'#'+int((n-x)/2)*'.')\r\n print(n*'.')\r\n else:\r\n print('YES')\r\n print(n*'.')\r\n print(int((n-k)/2)*'.'+k*'#'+int((n-k)/2)*'.')\r\n print(n*'.')\r\n print(n*'.')\r\n", "R = lambda: map(int, input().split())\r\n\r\nn, k = R()\r\na = '.' * n\r\n\r\nprint('YES')\r\nprint(a)\r\nif k % 2 == 0:\r\n k //= 2\r\n print('.' + '#'*k + '.'*(n-k-1))\r\n print('.' + '#'*k + '.'*(n-k-1))\r\nelif k <= n-2:\r\n print('.' * ((n - k) // 2) + '#' * k + '.' * ((n - k) // 2))\r\n print(a)\r\nelse:\r\n k -= n-2\r\n print('.' + '#'*(n-2) + '.')\r\n print('.' + '#'*(k//2) + '.'*(n-2-k) + '#'*(k//2) + '.')\r\n\r\nprint(a)", "n, k = map(int, input().split())\n\nprint('YES')\nprint('.' * n)\n\nrow = ['.'] * n\nif k & 1:\n\trow[n // 2] = '#'\n\tk -= 1\nfor i in range(1, n // 2):\n\tif k:\n\t\trow[i] = row[n - 1 - i] = '#'\n\t\tk -= 2\nrow1 = ['.'] * n\nfor i in range(1, n // 2):\n\tif k:\n\t\trow1[i] = row1[n - 1 - i] = '#'\n\t\tk -= 2\nif k:\n\trow[n // 2] = row1[n // 2] = '#'\n\nprint(''.join(row))\nprint(''.join(row1))\nprint('.' * n)\n", "n, k = map(int, input().split())\r\nprint('YES')\r\nif (k % 2 == 0):\r\n for i in range(n):\r\n print('.', end='')\r\n print()\r\n print('.', end='')\r\n for i in range(k//2):\r\n print('#', end='')\r\n for i in range(n-k//2-1):\r\n print('.', end='')\r\n print()\r\n print('.', end='')\r\n for i in range(k // 2):\r\n print('#', end='')\r\n for i in range(n - k // 2 - 1):\r\n print('.', end='')\r\n print()\r\n for i in range(n):\r\n print('.', end='')\r\nelse:\r\n if k>=5:\r\n k = k+1\r\n for i in range(n):\r\n print('.', end='')\r\n print()\r\n print('.', end='')\r\n print('#', end='')\r\n print('.', end='')\r\n print('#', end='')\r\n for i in range(k // 2 - 3):\r\n print('#', end='')\r\n for i in range(n - k // 2 - 1):\r\n print('.', end='')\r\n print()\r\n print('.', end='')\r\n for i in range(k // 2):\r\n print('#', end='')\r\n for i in range(n - k // 2 - 1):\r\n print('.', end='')\r\n print()\r\n for i in range(n):\r\n print('.', end='')\r\n if k == 1:\r\n for i in range(n):\r\n print('.', end='')\r\n print()\r\n for i in range(n//2):\r\n print('.', end='')\r\n print('#', end='')\r\n for i in range(n//2):\r\n print('.', end='')\r\n print()\r\n for i in range(n):\r\n print('.', end='')\r\n print()\r\n for i in range(n):\r\n print('.', end='')\r\n print()\r\n if k==3:\r\n for i in range(n):\r\n print('.', end='')\r\n print()\r\n for i in range(n//2-1):\r\n print('.', end='')\r\n print('#', end='')\r\n print('#', end='')\r\n print('#', end='')\r\n for i in range(n//2-1):\r\n print('.', end='')\r\n print()\r\n for i in range(n):\r\n print('.', end='')\r\n print()\r\n for i in range(n):\r\n print('.', end='')\r\n print()", "n,k=map(int,input().split())\r\ns=[[\".\"]*n for i in range(4)]\r\nif k%2==0:\r\n for j in range(1,n-1):\r\n if k==0:\r\n break\r\n s[1][j]=\"#\"\r\n s[2][j]=\"#\"\r\n k-=2\r\nelse:\r\n cen=n//2\r\n s[1][cen]=\"#\"\r\n k-=1\r\n for i in range(1,3):\r\n for j in range(1,cen):\r\n if k>0:\r\n k-=2\r\n s[i][j]=s[i][-j-1]=\"#\"\r\nif k==0:\r\n print(\"YES\")\r\n for i in range(4):\r\n print(\"\".join(s[i]))\r\nelse:\r\n print(\"NO\")", "\"\"\"Codeforces P980B. Marlin\r\n (http://codeforces.com/problemset/problem/980/B)\r\n\r\nProblem tags: constructive algorithms\r\n\r\nHint: A symmetric grid in either horizontal or vertical direction can be an \r\n answer.\r\nNote: Be cautious that \"hotels should not be placed on the border cells\".\r\nTime Complexity: O(n). (n <= 99)\r\n\"\"\"\r\n\r\ndef main():\r\n n, k = [int(x) for x in input().split()]\r\n\r\n l1 = ['.'] * n\r\n l2 = ['.'] * n\r\n if k % 2 == 1:\r\n h1 = min(k, n - 2)\r\n h2 = (k - h1) // 2\r\n l1[(n - h1) // 2: (n - h1) // 2 + h1] = ['#'] * h1\r\n l2[1 : h2 + 1] = ['#'] * h2\r\n l2[-2 : -h2 - 2: -1] = ['#'] * h2\r\n else:\r\n l1[1 : k // 2 + 1] = ['#'] * (k // 2)\r\n l2[1 : k // 2 + 1] = ['#'] * (k // 2)\r\n \r\n print('YES') \r\n print('.' * n)\r\n print(''.join(l1))\r\n print(''.join(l2))\r\n print('.' * n)\r\n \r\n \r\nif __name__ == '__main__':\r\n main() \r\n", "n, m = map(int, input().split())\r\nif m > (n - 2) * 2:\r\n\tprint(\"no\")\r\nelse:\r\n\tprint(\"yes\")\r\n\ts = '.'\r\n\tif m % 2 == 0:\r\n\t\ts += (m // 2) * '#'\r\n\t\ts += (n - 1 - (m // 2)) * '.'\r\n\t\tprint(n * '.')\r\n\t\tprint(s)\r\n\t\tprint(s)\r\n\t\tprint(n * '.')\r\n\telse:\r\n\t\tif m <= n - 2:\r\n\t\t\ts += ((n - m) // 2 - 1) * '.' + m * '#' + ((n - m) // 2) * '.'\r\n\t\t\tprint(n * '.')\r\n\t\t\tprint(s)\r\n\t\t\tprint(n * '.')\r\n\t\t\tprint(n * '.')\r\n\t\telse:\r\n\t\t\tm -= n - 2\r\n\t\t\ts += (m // 2) * '#' + (n - m - 2) * '.' + (m // 2) * '#' + '.'\r\n\t\t\tprint(n * '.')\r\n\t\t\tprint('.' + (n - 2) * '#' + '.')\r\n\t\t\tprint(s)\r\n\t\t\tprint(n * '.')", "#!/usr/bin/env python3\n# -*- encoding: utf-8 -*-\n\nimport sys\n\ndef print_list(l):\n for e in l:\n print(\"\".join(e))\n return\n\ndef main():\n n,k = map(int,sys.stdin.readline().strip().split())\n grid = [['.' for _ in range(n)] for _ in range(4)]\n\n q = k//2\n r = k %2\n\n if r == 0:\n for i in range(q):\n grid[1][i+1] = \"#\"\n grid[2][i+1] = \"#\"\n print(\"YES\")\n print_list(grid)\n else:\n for i in range(q):\n grid[1][i+1] = \"#\"\n grid[1][n-(i+2)] = \"#\"\n if k > n-2:\n reste = k-(n-2)\n for i in range(reste//2):\n grid[2][i+1] = \"#\"\n grid[2][n-(i+2)] = \"#\"\n else:\n grid[2][n//2] = '#'\n\n print(\"YES\")\n print_list(grid)\n\n\nmain()\n", "n, k = map(int, input().split())\r\nans = [['.']*n for _ in range(4)]\r\n\r\nif k<=n-2:\r\n for i in range(1, k//2+1):\r\n ans[1][i] = '#'\r\n ans[1][n-1-i] = '#'\r\n \r\n if k%2==1:\r\n ans[1][n//2] = '#'\r\nelse:\r\n for i in range(1, n-1):\r\n ans[1][i] = '#'\r\n \r\n k -= n-2\r\n \r\n for i in range(1, k//2+1):\r\n ans[2][i] = '#'\r\n ans[2][n-1-i] = '#'\r\n \r\n if k%2==1:\r\n ans[2][n//2] = '#'\r\n\r\nprint('YES')\r\n\r\nfor ans_i in ans:\r\n print(''.join(ans_i))", "def process(n, k):\r\n points = set([])\r\n if k % 2==0:\r\n for i in [1, 2]:\r\n for j in range(1, k//2+1):\r\n points.add((i, j))\r\n else:\r\n if k > n-2:\r\n for i in [1, 2]:\r\n for j in range(1, n-1):\r\n points.add((i, j))\r\n k = 2*(n-2)-k\r\n for j in range(n//2-k//2, n//2+k//2+1):\r\n points.remove((2, j))\r\n else:\r\n #n//2, n//2-k//2, n//2+k//2\r\n for j in range(n//2-k//2, n//2+k//2+1):\r\n points.add((1, j)) \r\n M = [''.join(['.' for i in range(n)])]\r\n for i in range(1, 3):\r\n row = []\r\n for j in range(n):\r\n if (i, j) in points:\r\n row.append('#')\r\n else:\r\n row.append('.')\r\n \r\n M.append(''.join(row))\r\n M.append(''.join(['.' for i in range(n)]))\r\n return M\r\n \r\nn, k = [int(x) for x in input().split()]\r\nM = process(n, k)\r\nprint('YES')\r\nfor row in M:\r\n print(row)", "EMPTY = \".\"\r\nHOTEL = \"#\"\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n\r\n print(\"YES\")\r\n\r\n print(EMPTY * n)\r\n\r\n if k % 2 == 0:\r\n m = k // 2\r\n s = EMPTY + HOTEL * m + EMPTY * (n - m - 1)\r\n print(s)\r\n print(s)\r\n elif k < n - 1:\r\n s = (HOTEL * k).center(n, EMPTY)\r\n print(s)\r\n print(EMPTY * n)\r\n else:\r\n print(EMPTY + HOTEL * (n - 2) + EMPTY)\r\n print(EMPTY + HOTEL * (k - n + 1) + EMPTY * (2 * n - k - 4) + HOTEL + EMPTY)\r\n\r\n print(EMPTY * n)\r\n\r\n\r\nmain()\r\n", "n, k = map(int, input().split())\r\ngrid = []\r\nfor i in range(0, 4):\r\n row = []\r\n for j in range(0, n):\r\n row.append('.')\r\n grid.append(row)\r\nfor i in range(1, 3):\r\n if k >= n-2:\r\n for j in range(1, n-1):\r\n grid[i][j] = '#'\r\n k-=1\r\n else:\r\n for j in range(1, n//2):\r\n if k >= 2:\r\n grid[i][j] = '#'\r\n grid[i][n-j-1] = '#'\r\n k-=2\r\nif k >= 1 and grid[2][n//2] == '.':\r\n grid[2][n//2] = '#'\r\n k -= 1\r\n\r\nif k==0:\r\n print(\"YES\")\r\n for i in range(0, 4):\r\n for j in range(0, n):\r\n print(grid[i][j], end=\"\")\r\n print()\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\ns = \".\"*n\r\nm = (k+1)//2\r\na = \".\" + \"#\"*m + \".\"*(n-m-1)\r\nif k%2 == 0:\r\n b=a\r\nelif k < n:\r\n t = \".\"*((n-k)//2)\r\n a, b = t + '#'*k + t, s\r\nelse:\r\n b = a[:2] + \".\" + a[3:]\r\nprint(\"\\n\".join([\"YES\", s, a, b, s]))", "n, k = map(int, input().split())\r\n\r\nprint('YES')\r\nans = [['.' for i in range(n)] for j in range(4)]\r\n\r\nif k%2 == 0 :\r\n for i in range(k//2) :\r\n ans[1][i+1] = ans[2][i+1] = '#'\r\nelif k <= n-2:\r\n ans[1][n//2] = '#'\r\n for i in range(k//2) :\r\n ans[1][n//2+i+1] = ans[1][n//2-i-1] = '#'\r\nelse :\r\n for i in range(n-2) :\r\n ans[1][i+1] = '#'\r\n for i in range((k-(n-2))//2) :\r\n ans[2][1+i] = '#'\r\n ans[2][n-2-i] = '#'\r\n\r\nfor i in range(4) :\r\n print(''.join(ans[i]))", "n, k = map(int, input().split())\nprint('YES')\nprint('.' * n)\nif k % 2 == 0:\n\tprint('.' + '#' * (k // 2) + '.' * (n - (k // 2) - 2) + '.')\n\tprint('.' + '#' * (k // 2) + '.' * (n - (k // 2) - 2) + '.')\nelse:\n\tit = min((n - 2), k)\n\toff = ((n - 2) - it) // 2\n\tk -= it\n\tprint('.' * (off + 1) + '#' * it + '.' * (off + 1))\n\tprint('.' + '#' * (k // 2) + '.' * (n - k - 2) + '#' * (k // 2) + '.')\nprint('.' * n)", "n,k= map(int,input().split())\r\ns= '.'*n\r\nm=(k+1)//2\r\na='.' + '#'*m + '.'*(n-m-1)\r\nif k%2 == 0:\r\n b=a\r\nelif k<n:\r\n t= (n- k)//2*'.'\r\n a,b = t+'#'*k +t , s\r\nelse:\r\n b = a[:2]+ '.' + a[3:]\r\nprint('YES',s,a,b,s,sep='\\n')", "n, k = map(int, input().split())\nprint(\"YES\")\nfor i in range(n):\n print(\".\", end = '')\nprint()\nif k&1:\n if k <= n-2:\n tmp = (n-k)>>1\n for i in range(tmp):\n print(\".\", end = '')\n for i in range(k):\n print(\"#\", end = '')\n for i in range(tmp):\n print(\".\", end = '')\n print()\n for i in range(n):\n print(\".\", end = '')\n print()\n else:\n print(\".\", end = '')\n for i in range(n-2):\n print(\"#\", end = '')\n print(\".\")\n k -= n-2\n print(\".\", end = '')\n for i in range(k>>1):\n print(\"#\", end = '')\n for i in range(n-k-2):\n print(\".\", end = '')\n for i in range(k>>1):\n print(\"#\", end = '')\n print(\".\")\nelse:\n k = k>>1\n for j in range(2):\n print(\".\", end = '')\n for i in range(k):\n print(\"#\", end = '')\n for i in range(n-k-1):\n print(\".\", end = '')\n print()\nfor i in range(n):\n print(\".\", end = '')\nprint()\n\n", "n, k = (int(x) for x in input().split())\r\nprint('YES')\r\nempty = '.' * n\r\nif k % 2 != 0 and k < n - 2:\r\n frst = '#' * k\r\n frst = '.' * ((n - k) // 2) + frst + '.' * ((n - k) // 2)\r\n scnd = empty\r\nelif k % 2 != 0:\r\n frst = '.' + '#' * (n - 2) + '.'\r\n scnd = '.' + '#' * ((k - n + 2) // 2)\r\n scnd = scnd + '.' * (n - len(scnd) * 2) + scnd[::-1]\r\nelif k % 2 == 0:\r\n frst = '.' + '#' * (k // 2) + '.' * n\r\n frst = frst[:n]\r\n scnd = frst\r\nprint(empty)\r\nprint(frst)\r\nprint(scnd)\r\nprint(empty)", "n,k = input().split(' ')\r\nn = int(n)\r\nk = int(k)\r\nprint('YES')\r\nif k % 2 == 0:\r\n k = int(k/2)\r\n for i in range(1, n+1):\r\n print('.', end='')\r\n print()\r\n print('.', end='')\r\n for i in range(1, k+1):\r\n print('#', end='')\r\n for i in range(1, n-k):\r\n print('.', end='')\r\n print()\r\n print('.', end='')\r\n for i in range(1, k+1):\r\n print('#', end='')\r\n for i in range(1, n-k):\r\n print('.', end='')\r\n print()\r\n for i in range(1, n+1):\r\n print('.', end='')\r\nelse:\r\n for i in range(1, n+1):\r\n print('.', end='')\r\n print()\r\n if k > n-2:\r\n print('.', end='')\r\n for i in range(1, int((n-1)/2)):\r\n print('#', end='')\r\n print('.', end='')\r\n for i in range(1, int((n-1)/2)):\r\n print('#', end='')\r\n print('.', end='')\r\n print()\r\n for i in range(1, int((2*n-k-3)/2)+1):\r\n print('.', end='')\r\n for i in range(1, k-n+4):\r\n print('#', end='')\r\n for i in range(1, int((2*n-k-3)/2)+1):\r\n print('.', end='')\r\n print()\r\n else:\r\n for i in range(1, int((n-k)/2)+1):\r\n print('.', end='')\r\n for i in range(1, k+1):\r\n print('#', end='')\r\n for i in range(1, int((n-k)/2)+1):\r\n print('.', end='')\r\n print()\r\n for i in range(1, n+1):\r\n print('.', end='')\r\n print()\r\n for i in range(1, n+1):\r\n print('.', end='')\r\n", "def getIntList():\r\n return list(map(int, input().split()));\r\nnbColumn, h=getIntList();\r\nif (nbColumn-2)*2<h:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n if h%2==0:\r\n print('.'*nbColumn);\r\n print('.'+'#'*(h//2)+'.'*(nbColumn-1-h//2));\r\n print('.'+'#'*(h//2)+'.'*(nbColumn-1-h//2));\r\n print('.'*nbColumn);\r\n else:\r\n print('.'*nbColumn);\r\n hFirst=min(h, nbColumn-2);\r\n countPoint=(nbColumn-hFirst)//2;\r\n print('.'*countPoint+'#'*hFirst+'.'*countPoint);\r\n hSecond=(h-hFirst)//2;\r\n countPoint=nbColumn-2*hSecond-2;\r\n print('.'+'#'*hSecond+'.'*countPoint+'#'*hSecond+'.');\r\n print('.'*nbColumn); ", "n,k=list(map(int,input().split()))\r\n\r\nif k%2==0:\r\n s=\".\"\r\n s=s+\"#\"*(k//2)\r\n s=s+\".\"*(n-len(s))\r\n print(\"YES\")\r\n print(\".\"*n)\r\n print(s)\r\n print(s)\r\n print(\".\"*n)\r\n\r\nelse:\r\n if k<=n-2:\r\n a=\"#\"*k\r\n s=\".\"*((n-k)//2)+a+\".\"*((n-k)//2)\r\n print(\"YES\")\r\n print(\".\"*n)\r\n print(s)\r\n print(\".\"*n)\r\n print(\".\"*n)\r\n else:\r\n k=k-n+3\r\n a=\"#\"*k\r\n s=\".\"*((n-k)//2)+a+\".\"*((n-k)//2)\r\n print(\"YES\")\r\n print(\".\"*n)\r\n print(\".\"+\"#\"*(n-2)+\".\")\r\n s=list(s)\r\n s[n//2]=\".\"\r\n s=\"\".join(s)\r\n print(s)\r\n print(\".\"*n)", "n,k = [int(s) for s in input().split()]\r\n\r\ndef line(h=0):\r\n if h < 0: h = 0\r\n if h > n-2: h = n-2\r\n if h%2 == 1:\r\n ans = '.'*((n-h)//2) + '#'*h + '.'*((n-h)//2)\r\n else:\r\n ans = '.' + '#'*(h//2) + '.'*(n-h-2) + '#'*(h//2) + '.'\r\n return ans\r\n\r\nif k > 2*(n-2):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(line())\r\n print(line(k))\r\n print(line(k-(n-2)))\r\n print(line())", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(4):\r\n a.append(['.'] * n)\r\nif k % 2 == 0:\r\n for i in range((n - 1) // 2 - 1):\r\n if k == 0:\r\n break\r\n a[1][1 + i] = '#'\r\n a[1][n - 2 - i] = '#'\r\n k -= 2\r\n for i in range((n - 1) // 2 - 1):\r\n if k == 0:\r\n break\r\n a[2][1 + i] = '#'\r\n a[2][n - 2 - i] = '#'\r\n k -= 2\r\n if k:\r\n a[1][n // 2] = '#'\r\n a[2][n // 2] = '#'\r\nelse:\r\n k -= 1\r\n for i in range((n - 1) // 2 - 1):\r\n if k == 0:\r\n break\r\n a[1][1 + i] = '#'\r\n a[1][n - 2 - i] = '#'\r\n k -= 2\r\n for i in range((n - 1) // 2 - 1):\r\n if k == 0:\r\n break\r\n a[2][1 + i] = '#'\r\n a[2][n - 2 - i] = '#'\r\n k -= 2\r\n a[1][n // 2] = '#'\r\nprint('YES')\r\nfor i in a:\r\n print(''.join(i))\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\ns = [[\".\"] * n for _ in range(4)]\r\nif k % 2:\r\n x, y, z = n // 2, n // 2, 2\r\n k += 1\r\n while k:\r\n s[z][x], s[z][y] = \"#\", \"#\"\r\n if z == 2:\r\n x -= 1\r\n y += 1\r\n z ^= 3\r\n k -= 2\r\nelse:\r\n for i in range(1, 1 + k // 2):\r\n s[1][i], s[2][i] = \"#\", \"#\"\r\nans = \"YES\"\r\nprint(ans)\r\nans = [\"\".join(s0) for s0 in s]\r\nsys.stdout.write(\"\\n\".join(ans))" ]

[ "n,m,k,t=map(int,input().split())\r\nwaste=[]\r\n\r\nval=['Carrots','Kiwis','Grapes']\r\nfor i in range(k):\r\n a=list(map(int,input().split()))\r\n waste.append(a)\r\n\r\nfor i in range(t):\r\n q=list(map(int,input().split()))\r\n if q in waste:\r\n print('Waste')\r\n \r\n else:\r\n s=0\r\n for i in waste:\r\n if i <q:\r\n s=s+1\r\n res=(q[0]-1)*m+q[1]-1-s\r\n print(val[res%3])\r\n \r\n ", "n, m, num_wasted, num_queries = map(int, input().split())\nwasted = [ None for i in range(num_wasted) ]\nfor i in range(num_wasted):\n a, b = map(lambda s: int(s) - 1, input().split())\n wasted[i] = a * m + b\nwasted_set = set(wasted)\nwasted.sort()\n\ncrops = [ 'Carrots', 'Kiwis', 'Grapes' ]\nfor i in range(num_queries):\n a, b = map(lambda s: int(s) - 1, input().split())\n q = a * m + b\n if q in wasted_set:\n print('Waste')\n continue\n count = 0\n for w in wasted:\n if w > q:\n break\n count += 1\n print(crops[(q - count) % 3])\n\n", "n , m , k , t = [int(x) for x in input().split()]\r\n\r\nwaste = []\r\nfor i in range(k):\r\n cords = [int(x) - 1 for x in input().split()]\r\n waste.append(cords[1] + m * cords[0])\r\nwaste.sort()\r\n\r\ncrops = [\"Carrots\" , \"Kiwis\" , \"Grapes\"]\r\n\r\nfor i in range(t):\r\n cords = [int(x) - 1 for x in input().split()]\r\n index = cords[1] + m * cords[0]\r\n \r\n isWaste = False\r\n c = 0\r\n for j in waste:\r\n if index < j:\r\n break\r\n elif index == j:\r\n isWaste = True\r\n break\r\n c += 1\r\n if isWaste:\r\n print(\"Waste\")\r\n else:\r\n print(crops[(index - c) % 3])", "n, m, k, t = map(int, input().split())\r\ndef index(l, r):\r\n return ((l)*m)+(r)\r\nk_list = []\r\nd = {0:'Carrots', 1:'Kiwis', 2:'Grapes'}\r\nfor i in range(k):\r\n l, r = map(int, input().split())\r\n k_list.append((l-1, r-1))\r\nk_list.sort()\r\nfor i in range(t):\r\n cnt = 0\r\n l, r = map(int, input().split())\r\n l-=1; r-=1; v=False\r\n for j in k_list:\r\n if j[0] < l: cnt += 1\r\n elif j[0] == l:\r\n if j[1] < r: cnt += 1\r\n elif j[1] == r: print(\"Waste\"); v = True\r\n else: break\r\n if not v: print(d[(index(l, r)-cnt)%3])", "l1 = [int(num) for num in input().split()]\r\nn = l1[0]\r\nm = l1[1]\r\nk = l1[2]\r\nt = l1[3]\r\nwastes = []\r\nfor i in range(k):\r\n l2 = [int(x) for x in input().split()]\r\n wastes.append(l2)\r\nfor i in range(t):\r\n l3 = [int(y) for y in input().split()]\r\n if l3 in wastes:\r\n print(\"Waste\")\r\n else:\r\n k = 0\r\n for j in wastes:\r\n if j[0] < l3[0]:\r\n k += 1\r\n elif j[0] == l3[0]:\r\n if j[1] < l3[1]:\r\n k += 1\r\n cells = (l3[0] - 1) * m + l3[1] - k\r\n if cells % 3 == 0:\r\n print(\"Grapes\")\r\n elif cells % 3 == 1:\r\n print(\"Carrots\")\r\n else:\r\n print(\"Kiwis\")\r\n", "n,m,k,t=map(int,input().split())\r\n\r\nwaste=[]\r\n\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n waste.append([a,b])\r\n\r\nfor _ in range(t):\r\n i,j=map(int,input().split())\r\n x=m*(i-1)+(j-1)\r\n y=0\r\n w=False\r\n for l in range(k):\r\n if (waste[l][0]<i) or (waste[l][0]==i and waste[l][1]<j):\r\n y+=1\r\n elif waste[l][0]==i and waste[l][1]==j:\r\n w=True\r\n break\r\n if w:\r\n print('Waste')\r\n\r\n else:\r\n## print(y)\r\n rj=(x-y)%3\r\n if rj==0:\r\n print('Carrots')\r\n elif rj==1:\r\n print('Kiwis')\r\n else:\r\n print('Grapes')\r\n", "from collections import defaultdict\n\nn, m, k, t = map(int, input().split())\n\nwaste = []\nfor _ in range(k):\n a, b = map(int, input().split())\n waste.append((a-1)*m + b)\n\nwaste.sort()\n\nQ = []\nfor _ in range(t):\n a, b = map(int, input().split())\n Q.append((a-1)*m + b)\n\nimport bisect\nplants = [\"Carrots\", \"Kiwis\", \"Grapes\"]\n\n\nfor v in Q:\n idx = bisect.bisect_right(waste, v) \n if v == waste[idx-1]:\n print(\"Waste\")\n else:\n print(plants[(v - idx)%3-1])\n\n\n \n", "plants = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\n\r\nn, m ,k ,t = map(int, input().split(' '))\r\n# waste cells\r\nwaste = []\r\nfor _ in range(k):\r\n wx, wy = map(int,input().split(' '))\r\n waste.append((wx-1,wy-1))\r\nfor _ in range(t):\r\n x, y = map(int, input().split(' '))\r\n x-=1\r\n y-=1\r\n location = y + x*m\r\n num_waste = 0\r\n res = \"\"\r\n for i in range(len(waste)):\r\n r, c = waste[i]\r\n if (c + r*m)< location:\r\n num_waste+=1\r\n elif c + r*m == location:\r\n res = \"Waste\"\r\n break\r\n\r\n if res != \"Waste\":\r\n res = plants[(location-num_waste) % 3]\r\n print(res)\r\n", "rows ,cols, waste, t = map(int, input().split())\r\n\r\nw = []\r\nfor i in range(waste):\r\n i, j = map(int, input().split())\r\n w.append([i, j])\r\n\r\nw.sort()\r\nfruits = ['Carrots', 'Kiwis', 'Grapes']\r\nfor i in range(t):\r\n i, j = map(int, input().split())\r\n if [i, j] in w:\r\n print('Waste') \r\n else:\r\n J = ((i - 1) * cols + (j - 1))\r\n I = 0\r\n for a, b in w:\r\n if a < i or (a == i and b < j): I += 1\r\n else: break\r\n print(fruits[(J - I) % 3])", "n, m, k, t = map(int, input().split())\r\nk = [list(map(int, input().split())) for i in range(k)]\r\nfor i in range(t):\r\n x = list(map(int, input().split()))\r\n print('Waste' if x in k else ['Grapes', 'Carrots', 'Kiwis'][(x[0]*m-m+x[1]-sum(map(lambda i:i<x, k)))%3])\r\n", "import sys\nx = sys.stdin.readline()[:-1].split(' ')\nx[0], x[1], x[2], x[3]= int(x[0]), int(x[1]), int(x[2]), int(x[3])\nws = []\nqs = []\nfor i in range(x[2]):\n w = sys.stdin.readline()[:-1].split(' ')\n w[0], w[1] = int(w[0]), int(w[1])\n w = (w[0]-1)*x[1]+w[1]\n ws.append(w)\nws.sort()\nfor i in range(x[3]):\n q = sys.stdin.readline()[:-1].split(' ')\n q[0], q[1] = int(q[0]), int(q[1])\n q = (q[0]-1)*x[1]+q[1]\n if q in ws:\n qs.append(\"Waste\")\n else:\n count = 0\n for i in ws:\n if i < q:\n count += 1\n q -= count\n q %= 3\n if q == 1:\n qs.append(\"Carrots\")\n elif q == 2:\n qs.append(\"Kiwis\")\n else:\n qs.append(\"Grapes\")\nfor i in qs:\n print(i)\n \n \n\n\n\t \t\t \t \t \t \t\t \t \t\t \t", "# Wadea #\r\n\r\nn,m,k,t = map(int,input().split())\r\nd = dict()\r\nplants = [\"Carrots\",\"Kiwis\",\"Grapes\"]\r\narr = []\r\nfor i in range(k):\r\n a = list(map(int,input().split()))\r\n arr.append([a[0],a[1]])\r\nfor j in range(t):\r\n a,b = map(int,input().split())\r\n if [a,b] in arr:\r\n print(\"Waste\")\r\n else:\r\n l = 0\r\n for aa,bb in arr:\r\n if a > aa:\r\n l += 1\r\n elif a == aa and b > bb:\r\n l += 1\r\n f = ((a - 1) * m +(b-l)) % 3\r\n if f % 3 == 0:\r\n print(\"Grapes\")\r\n elif f % 3 == 1:\r\n print(\"Carrots\")\r\n elif f % 3 == 2:\r\n print(\"Kiwis\")\r\n \r\n \r\n ", "n,m,k,t=map(int,input().split())\r\nw=[]\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n c=[]\r\n c.append(a)\r\n c.append(b)\r\n w.append(c)\r\nw.sort()\r\nd=[\"Carrots\",\"Kiwis\",\"Grapes\"]\r\n\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n if [a,b] in w:\r\n print(\"Waste\")\r\n else:\r\n l=0\r\n for j in range(k-1,-1,-1):\r\n if [a,b]>w[j]:\r\n l=j+1\r\n break\r\n \r\n print(d[((a-1)*m+b-1-l)%3])", "# @uthor : Kaleab Asfaw\r\nfrom sys import stdin, stdout\r\n# Fast IO\r\ndef input():\r\n\ta = stdin.readline()\r\n\tif a[-1] == \"\\n\": a = a[:-1]\r\n\treturn a\r\ndef print(*argv, end=\"\\n\", sep=\" \"):\r\n\tn = len(argv)\r\n\tfor i in range(n):\r\n\t\tif i == n-1: stdout.write(str(argv[i]))\r\n\t\telse: stdout.write(str(argv[i]) + sep)\r\n\tstdout.write(end)\r\n# Others\r\nmod = 10**9+7\r\ndef lcm(x, y): return (x * y) / (gcd(x, y))\r\ndef comb(lst, x): return list(c(lst, x))\r\ndef fact(x, mod=mod):\r\n\tans = 1\r\n\tfor i in range(1, x+1): ans = (ans * i) % mod\r\n\treturn ans\r\ndef arr2D(n, m, default=0):\r\n\tlst = []\r\n\tfor i in range(n): temp = [default] * m; lst.append(temp)\r\n\treturn lst\r\ndef sortDictV(x): return {k: v for k, v in sorted(x.items(), key = lambda item : item[1])}\r\ndef smaller(lst, x): return bisect_left(lst, x) -1\r\ndef smallerEq(lst, x): return bisect_right(lst, x) -1\r\n\r\n\r\ndef solve(n, m, k, t, waste, q):\r\n\twaste = sorted(waste)\r\n\r\n\tans = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\n\tfor i in q:\r\n\t\tif i in waste: print(\"Waste\")\r\n\t\telse:\r\n\t\t\tcnt = 0\r\n\t\t\tfor w in waste:\r\n\t\t\t\tif w[0] <i[0]: cnt+=1\r\n\t\t\t\telif w[0] == i[0] and w[1] <= i[1]: cnt += 1\r\n\t\t\tval = ((i[0]-1)*m + i[1] - cnt)\r\n\t\t\tval %= 3\r\n\t\t\tval -= 1\r\n\t\t\tif val == -1: val = 2\r\n\t\t\tprint(ans[val])\r\n\r\n\r\nn, m, k , t = list(map(int, input().split()))\r\nwaste = []\r\nfor i in range(k):\r\n\tx, y = list(map(int, input().split()))\r\n\twaste.append([x, y])\r\nq = []\r\nfor i in range(t):\r\n\tx, y = list(map(int, input().split()))\r\n\tq.append([x, y])\r\nsolve(n, m, k, t, waste, q)", "n, m, k, t = map(int, input().split())\r\ncrops = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\nwaste = list()\r\nanswers = list()\r\nfor i in range(k):\r\n a, b = map(int, input().split())\r\n a = a-1\r\n b = b-1\r\n waste.append(a*m+b)\r\nwaste.sort()\r\nfor i in range(t):\r\n j, k = map(int, input().split())\r\n q = (j-1)*m+k-1\r\n c = 0\r\n wasted = 0\r\n for x in waste:\r\n if x < q:\r\n c += 1\r\n elif x == q:\r\n wasted = 1\r\n else:\r\n break\r\n if wasted == 1:\r\n answers.append(\"Waste\")\r\n else:\r\n answers.append(crops[(q-c)%3])\r\nfor e in answers:\r\n print(e)", "from sys import stdin\nn , m , k, t = map(int,stdin.readline().split())\nempty = []\nfor i in range(k):\n empty.append(list(map(int,stdin.readline().split())))\nfor i in range(t):\n a , b = map(int,stdin.readline().split())\n flag = 0\n for j in empty:\n if(a==j[0] and b==j[1]):\n flag = 1\n break\n if(flag==1):\n print(\"Waste\")\n continue\n idi = (a-1)*m+(b-1)\n for j in empty:\n if(j[0]<a or j[0]==a and j[1]<b):\n idi-=1\n if(idi%3==0):\n print(\"Carrots\")\n elif(idi%3==1):\n print(\"Kiwis\")\n else:\n print(\"Grapes\")\n", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Colorful Field\"\r\n# Class: B\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, m, k, t = list(map(int, input().split()))\r\n waste = dict()\r\n for _ in range(k):\r\n i, o = list(map(int, input().split()))\r\n if i not in waste.keys():\r\n waste[i] = set([o])\r\n else:\r\n waste[i].add(o)\r\n \r\n plant = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\n x = 0\r\n for _ in range(t):\r\n e = True\r\n i, o = list(map(int, input().split()))\r\n if i in waste.keys():\r\n if o in waste[i]:\r\n print(\"Waste\")\r\n e = False\r\n\r\n if e:\r\n q = 0\r\n for z in waste.keys():\r\n if z<i:\r\n q+=len(waste[z])\r\n elif z==i:\r\n for v in waste[z]:\r\n if v<o: q+=1\r\n \r\n print(plant[(((i-1)*m)+(o-1)-q)%3])\r\nif __name__ == \"__main__\":\r\n Solve()", "from bisect import bisect_right\r\nn, m, k, t = map(int, input().split())\r\nr = ['Carrots', 'Kiwis', 'Grapes']\r\nr = r[(2 - m) % 3: ] + r[: (2 - m) % 3]\r\np = [m * x + y for x, y in (map(int, input().split()) for i in range(k))]\r\np.sort()\r\nq = [0] * t\r\nfor i in range(t):\r\n x, y = map(int, input().split())\r\n j = m * x + y\r\n d = bisect_right(p, j)\r\n if p[d - 1] == j: q[i] = 'Waste'\r\n else: q[i] = r[(j - d) % 3] \r\nprint('\\n'.join(q))", "def get_waste_amount(waste, t):\r\n\tfor i in range(len(waste)):\r\n\t\tif waste[i] > t:\r\n\t\t\treturn len(waste[:i])\r\n\t\tif i == len(waste) - 1:\r\n\t\t\treturn len(waste)\r\n\r\ndef process_query(m, t, waste):\t\r\n\tif t in waste:\r\n\t\tprint('Waste')\r\n\telse:\r\n\t\tf = ['Carrots', 'Kiwis', 'Grapes']\r\n\t\ts = get_waste_amount(waste, t)\r\n\t\tprint(f[(((t[0]-1) * m + t[1] - s) % 3) - 1])\r\n\t\t\r\n\t\t\r\n\r\n\r\nn,m,k,t = map(int, input().split())\r\n\r\nwaste = []\r\n\r\nfor i in range(k):\r\n\ttt = tuple(map(int, input().split()))\r\n\twaste.append(tt)\r\n\r\nwaste = sorted(waste)\r\nfor i in range(t):\r\n\ttt = tuple(map(int, input().split()))\t\t\r\n\tprocess_query(m, tt, waste)", "from bisect import bisect\r\n\r\nn, m, k, t = map(int, input().split())\r\n\r\ndef foo(i, j):\r\n\treturn m*(i - 1) + j\r\n\r\nwastes = []\r\nfor i in range(k):\r\n\ta, b = map(int, input().split())\r\n\twastes.append(foo(a, b))\r\n\r\nwastes.sort()\r\n\r\nword_mapper = {\r\n\t0: 'Carrots',\r\n\t1: 'Kiwis',\r\n\t2: 'Grapes'\r\n}\r\n\r\nfor _ in range(t):\r\n\ti, j = map(int, input().split())\r\n\r\n\tnum = foo(i, j)\r\n\tif num in wastes:\r\n\t\tprint('Waste')\r\n\t\tcontinue\r\n\tcount = bisect(wastes, num)\r\n\trem = (num - count - 1) % 3\r\n\t\r\n\tprint(word_mapper[rem])\r\n", "\"Codeforces Beta Round #6 (Div. 2\"\n\"B. President's Office\"\n# n,m,p=input().split()\n# n=int(n)\n# m=int(m)\n# a=[]\n# s=set()\n# for i in range(n):\n# l=list(input())\n# a.append(l)\n# l=[]\n# for i in range(n):\n# for j in range(m):\n# if a[i][j]==p:\n# l.append([i,j])\n \n# for i in l:\n# x=i[0]\n# y=i[1]\n# if x+1>=0 and x+1<n:\n# if a[x+1][y]!='.' and a[x+1][y]!=p:\n# s.add(a[x+1][y])\n# if y+1>=0 and y+1<m:\n# if a[x][y+1]!='.' and a[x][y+1]!=p:\n# s.add(a[x][y+1]) \n# if x-1>=0 and x-1<n:\n# if a[x-1][y]!='.' and a[x-1][y]!=p:\n# s.add(a[x-1][y])\n# if y-1>=0 and y-1<m:\n# if a[x][y-1]!='.' and a[x][y-1]!=p:\n# s.add(a[x][y-1]) \n\n# print(len(s))\n\"Codeforces Round #360 (Div. 2)\"\n\"B. Lovely Palindromes\"\n# y=input()\n# print(y+y[::-1])\n\"Codeforces Round #258 (Div. 2)\"\n\"B. Sort the Array\"\n# n=int(input())\n# a=list(map(int,input().split()))\n# mimax=a[0]\n# f=0\n# l=r=0\n# q=0\n# for i in range(1,n):\n# if a[i]>=a[i-1] and f==0:\n# mimax=a[i]\n# elif f==0:\n# l=i\n# f+=1 \n# if a[i]<=a[i-1] and f==1:\n# pass\n# elif f==1:\n# f+=1\n# r=i\n# if a[i]<mimax:\n# q=1\n# break\n# if f==2 and a[i]<a[i-1]:\n# q=1\n# break \n# # print(mimax) \n# # print(q,l,r,f)\n# if q==1:\n# print(\"no\")\n# elif f==0:\n# print(\"yes\")\n# print(1,1)\n# elif f==1:\n# if l>1:\n# if a[l-2]>a[r-1]:\n# print('no')\n# else: \n# print(\"yes\")\n# print(l,n) \n# else: \n# print(\"yes\")\n# print(l,n)\n# elif f==2:\n# print(\"yes\")\n# print(l,r) \n\"Codeforces Beta Round #71\" \n\"B. Colorful Field\"\nn,m,k,t=map(int,input().split())\na=[]\nfor i in range(k):\n i,j=map(int,input().split())\n a.append([i,j])\nfor i in range(t):\n i,j=map(int,input().split())\n c=j+(i-1)*m\n w=0\n f=0\n for z in range(k):\n if a[z][0] < i:\n w+=1\n elif a[z][0]==i:\n if a[z][1]<j:\n w+=1\n elif a[z][1]==j:\n f=1\n break\n c=c-w\n c=c%3 \n if f==1:\n print(\"Waste\")\n elif c==1:\n print(\"Carrots\")\n elif c==2:\n print(\"Kiwis\") \n elif c==0:\n print(\"Grapes\")\n", "n,m,k,t=map(int,input().split())\r\nw=[]\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n c=[a,b]\r\n w.append(c)\r\nw.sort()\r\nfor i in range(t):\r\n x,z=map(int,input().split())\r\n if [x,z] in w:\r\n print('Waste')\r\n else:\r\n wa=0\r\n for j in range(k-1,-1,-1):\r\n if([x,z]>w[j]):\r\n wa=j+1\r\n break\r\n q=((x-1)*m+(z-1)-wa)%3\r\n if q==0:\r\n print('Carrots')\r\n elif q==1:\r\n print('Kiwis')\r\n else:\r\n print('Grapes')", "import bisect\r\nfrom operator import itemgetter\r\nn,m,k,t = map(int,input().split())\r\nwaste = []\r\nq = []\r\nfor i in range(k):\r\n waste.append(tuple(map(int,input().split())))\r\nwaste.sort(key = itemgetter(0,1))\r\n# print(waste)\r\nfor i in range(t):\r\n q.append(tuple(map(int,input().split())))\r\n# print(q)\r\n# print(waste)\r\nfor i in q:\r\n if i in waste:\r\n print('Waste')\r\n else:\r\n cell = (i[0]-1)*m+i[1]-1\r\n # print(cell)\r\n w_cell = bisect.bisect(waste,i)\r\n ans = cell-w_cell\r\n if ans%3 == 0:\r\n print(\"Carrots\")\r\n elif ans%3 == 1:\r\n print(\"Kiwis\")\r\n else:\r\n print(\"Grapes\")\r\n ", "\r\n# Problem: B. Colorful Field\r\n# Contest: Codeforces - Codeforces Beta Round #71\r\n# URL: https://codeforces.com/contest/79/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn,m,k,t = get_ints()\r\nseq = [\"Carrots\",\"Kiwis\",\"Grapes\"]\r\nwastes = []\r\ndic ={}\r\nfor _ in range(k):\r\n\ta,b = get_ints()\r\n\twastes.append((a-1)*m+b-1)\r\n\tdic[(a-1)*m+b-1] = 1\r\nwastes = sorted(wastes)\r\n\r\nfor _ in range(t):\r\n\ta,b = get_ints()\r\n\tshouldbe = (a-1)*m+b-1\r\n\tif shouldbe in dic:\r\n\t\tprint(\"Waste\")\r\n\t\tcontinue\r\n\tnumbefore = sum([1 for x in wastes if x < shouldbe])\r\n\t\r\n\tprint(seq[(shouldbe-numbefore)%3])", "n,m,k,t = map(int,input().split())\r\nwastes = []\r\narr = [\"Carrots\",\"Kiwis\",\"Grapes\"]\r\nfor i in range(k):\r\n a,b = map(int,input().split())\r\n wastes.append([a-1,b-1])\r\nfor _ in range(t):\r\n a,b = map(int,input().split())\r\n if [a-1,b-1] in wastes:\r\n print(\"Waste\")\r\n continue\r\n cnt =0\r\n for i in wastes:\r\n if i[0] < a - 1 or (i[0] == a-1 and i[1] < b - 1):\r\n cnt+=1\r\n print(arr[((a-1)*m+b-1 - cnt) % 3])", "inp=[int(x) for x in input().split()]\r\nn=inp[0]\r\nm=inp[1]\r\nk=inp[2]\r\nt=inp[3]\r\nwaste=[]\r\nfor i in range(k):\r\n temp=[int(x) for x in input().split()]\r\n waste.append(((temp[0]-1)*m)+temp[1])\r\nquery=[]\r\nfor i in range(t):\r\n temp=[int(x) for x in input().split()]\r\n query.append(((temp[0]-1)*m)+temp[1])\r\nloc=0\r\nb=0\r\nfor i in range(t):\r\n loc=query[i]\r\n for j in range(k):\r\n if waste[j]<query[i]:\r\n loc-=1\r\n elif waste[j]==query[i]:\r\n b=1\r\n if b:\r\n print('Waste')\r\n elif (loc%3)==1:\r\n print(\"Carrots\")\r\n elif (loc%3)==2:\r\n print('Kiwis')\r\n elif (loc%3)==0:\r\n print('Grapes')\r\n b=0\r\n loc=0", "# https://codeforces.com/contest/79/problem/B\r\n\r\n\r\ndef single_integer():\r\n return int(input())\r\n\r\n\r\ndef multi_integer():\r\n return map(int, input().split())\r\n\r\n\r\ndef string():\r\n return input()\r\n\r\n\r\ndef multi_string():\r\n return input().split()\r\n\r\n\r\nn, m, k, t = multi_integer()\r\nwastes = list()\r\nfruits = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\n\r\nfor i in range(k):\r\n wastes.append(tuple(multi_integer()))\r\n\r\nfor i in range(t):\r\n w = 0\r\n a, b = multi_integer()\r\n for j in wastes:\r\n if (a, b) == j:\r\n print(\"Waste\")\r\n break\r\n else:\r\n if j[0] < a:\r\n w += 1\r\n elif j[0] == a:\r\n if j[1] < b:\r\n w += 1\r\n else:\r\n temp = (a - 1) * m + b - 1 - w\r\n print(fruits[temp % 3])\r\n", "n,m,k,t=map(int,input().split())\r\nw=[]\r\nfor _ in range(k):\r\n a,b=map(int,input().split())\r\n w.append([a,b])\r\nfor _ in range(t):\r\n flag=1\r\n x,y=map(int,input().split())\r\n t=[x,y]\r\n for i in range(k):\r\n if t==w[i]:\r\n flag=0\r\n break\r\n if flag==0:\r\n print(\"Waste\")\r\n else:\r\n c=(x-1)*m+(y-1)\r\n wc=0\r\n for i in range(k):\r\n if w[i][0]<x:\r\n wc+=1\r\n elif w[i][0]==x:\r\n if w[i][1]<=y:\r\n wc+=1\r\n else:\r\n continue\r\n ans=(c-wc)%3\r\n if ans==0:\r\n print(\"Carrots\")\r\n elif ans==1:\r\n print(\"Kiwis\")\r\n else:\r\n print(\"Grapes\")\r\n \r\n ", "from itertools import product\r\nfrom math import ceil, gcd, sqrt\r\nimport string\r\nfrom decimal import Decimal\r\n\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [int(string[i: j]) for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\nheight, width, num_of_waste_cells, num_of_queries = map(int, input().split())\r\n\r\nwaste_cells = []\r\nqueries = []\r\n\r\nfor i in range(num_of_waste_cells):\r\n x, y = map(int, input().split())\r\n waste_cells.append((x - 1) * width + y)\r\n\r\nfor i in range(num_of_queries):\r\n x, y = map(int, input().split())\r\n queries.append((x - 1) * width + y)\r\n\r\n#print(queries)\r\n#print(waste_cells)\r\nfor i in queries:\r\n if i in waste_cells:\r\n print('Waste')\r\n continue\r\n num_of_wastes = sum(x < i for x in waste_cells)\r\n #print(i)\r\n i -= num_of_wastes\r\n bitch = i % 3\r\n if not bitch:\r\n print('Grapes')\r\n elif bitch == 1:\r\n print('Carrots')\r\n else:\r\n print('Kiwis')\r\n\"\"\"\r\njak jest jedno to przeskok o jedną liczbę do tyłu\r\n\"\"\"", "n, m, k, t = map(int, input().split())\r\nv = []\r\n\r\nfor i in range(k):\r\n x,y = map(int, input().split())\r\n v.append((x-1)*m+y)\r\n\r\nv.sort()\r\nfor i in range(t):\r\n x,y = map(int, input().split())\r\n pos = (x-1)*m+y\r\n if pos in v: print('Waste')\r\n else:\r\n pos = pos - sum(x < pos for x in v)\r\n if(pos%3==0): print('Grapes')\r\n if(pos%3==1): print('Carrots')\r\n if(pos%3==2): print('Kiwis')\r\n\r\n\r\n \r\n\r\n\r\n\r\n", "#n=int(input())\n#n,m=map(int,input().split())\n#se=set([*input().split()][1:])\n#l=list(map(int,input().split()))\n#input=sys.stdin.readline\n\n#from bisect import*\n#from decimal import Decimal\n\n# import sys\n# sys.stdin=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/input.txt\",\"r\")\n# sys.stdout=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/output.txt\",\"w\")\n\n\nfrom ast import While\nimport sys\nimport math\nfor _ in range(1):\n n,m,k,t=map(int,input().split())\n\n l=[]\n for i in range(k):\n a,b=map(int,input().split())\n l.append((m*(a-1))+b)\n l.sort()\n op=len(l)\n for i in range(t):\n a,b=map(int,input().split())\n x=(m*(a-1))+b\n res=0\n for i in range(op):\n if l[i]==x:\n res=-1\n break\n elif l[i]>x:\n break\n else:\n res+=1\n if res==-1:\n print(\"Waste\")\n else:\n x-=res\n if x%3==0:\n print(\"Grapes\")\n elif x%3==1:\n print('Carrots')\n else:\n print('Kiwis')\n", "n,m,k,t=map(int,input().split())\r\nk=[list(map(int,input().split())) for i in range(k)]\r\nfor i in range(t):\r\n\tx=list(map(int,input().split()))\r\n\tprint (\"Waste\" if x in k else [\"Grapes\",\"Carrots\",\"Kiwis\"][(x[0]*m-m+x[1]-sum(map(lambda i:i<x,k)))%3])", "n , m , k ,t = [int(i) for i in input().split()]\nwaste = []\nfor i in range(k):\n\ta ,b = [int(i) for i in input().split()]\n\twaste.append((a-1)*m+b)\n\ncrop = ['Carrots','Kiwis','Grapes']\nwaste.sort()\nnn = len(waste)\nfor i in range(t):\n\ta ,b = [int(i) for i in input().split()]\n\tc = (a-1)*m + b\n\ti = 0\n\twhile i < nn and waste[i] < c:\n\t\ti += 1\n\tif i < nn and waste[i] == c:\n\t\tprint ('Waste')\n\telse:\n\t\tno = c - i-1\n\t\tprint (crop[no%3])", "def binarySearch(li,value):\r\n l,r = 0,len(li) - 1\r\n while(l <= r):\r\n mid = (l + r) // 2\r\n if li[mid] <= value:\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n return r\r\n\r\nn,m,k,t = map(int,input().split())\r\nwastes = []\r\ndic = {1:\"Carrots\",2:\"Kiwis\",0:\"Grapes\"}\r\nfor i in range(k):\r\n a,b = map(int,input().split())\r\n a -= 1\r\n wastes.append(a*m + b)\r\nwastes.sort()\r\n\r\nfor i in range(t):\r\n i,j = map(int,input().split())\r\n i -= 1\r\n pos = i*m + j\r\n index = binarySearch(wastes,pos)\r\n if index == -1:\r\n print(dic[pos%3])\r\n else:\r\n if wastes[index] == pos:\r\n print(\"Waste\")\r\n else:\r\n index += 1\r\n print(dic[(pos - index)%3])", "# جزرة -> كيوي -> عنب\r\nh,w,waste,qeu = map(int,input().split())\r\nwst = []\r\nclean = ['Carrots','Kiwis','Grapes']\r\nemp = []\r\nfor i in range(waste+qeu):\r\n if i<waste:\r\n wst.append(list(map(int,input().split())))\r\n else:\r\n emp.append(list(map(int,input().split())))\r\nwst.sort()\r\nfor b in emp:\r\n l,r=0,waste-1\r\n while l<=r:\r\n mid = (l+r)//2\r\n if wst[mid]==b:\r\n print('Waste')\r\n break\r\n elif wst[mid]>b:\r\n r = mid-1\r\n else:\r\n l = mid+1\r\n else:\r\n before = l\r\n print(clean[((b[0]-1)*w-before+b[1]-1)%3])", "n,m,k,t = map(int,input().split())\r\nwaste = []\r\nfor i in range(k):\r\n waste.append(tuple(map(int,input().split())))\r\n\r\nhashmap = dict()\r\nfor a in waste:\r\n hashmap[a]=1\r\n\r\nans = {1:\"Carrots\",\r\n 2:\"Kiwis\",\r\n 0:\"Grapes\"}\r\n\r\nfor _ in range(t):\r\n a,b = map(int,input().split())\r\n if (a,b) in hashmap:\r\n print(\"Waste\")\r\n else:\r\n total = (a-1)*m+b\r\n subtract = 0\r\n for i in range(k):\r\n if waste[i][0]<a:\r\n subtract+=1\r\n elif waste[i][0]==a and waste[i][1]<b:\r\n subtract+=1\r\n\r\n total -= subtract\r\n print(ans[total%3])\r\n", "n, m, k, t = map(int, input().split())\r\n\r\nwaste = []\r\n\r\nfor _ in range(k):\r\n i, j = map(int, input().split())\r\n waste += [(i-1)*m + (j-1)]\r\nwaste.sort()\r\nput = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\n\r\nfor _ in range(t):\r\n i, j = map(int, input().split())\r\n numc = (i-1)*m + (j-1)\r\n c = 0\r\n for x in waste:\r\n #print(x, numc)\r\n if x > numc:\r\n break\r\n c += 1\r\n\r\n if numc in waste:\r\n print(\"Waste\")\r\n else:\r\n print(put[(numc - c) % 3])\r\n", "v = ['Carrots', 'Kiwis', 'Grapes']\r\nn, m, k, t = map(int, input().split())\r\nw = []\r\nfor i in range(k):\r\n a, b = map(int, input().split())\r\n w.append((a - 1) * m + b - 1)\r\nw.append(n * m)\r\nw.sort()\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n c, wi = (a - 1) * m + b - 1, 0\r\n while w[wi] < c:\r\n wi += 1\r\n print('Waste' if w[wi] == c else v[(c - wi) % 3])", "n,m,k,t = list(map(int, input().split())) \r\n\r\nwaste = set() \r\nfor _ in range(k):\r\n a,b = list(map(lambda x: int(x) - 1,input().split())) \r\n waste.add(a*m + b) \r\n\r\nplants = [\"Carrots\",\"Kiwis\",\"Grapes\"]\r\nfor _ in range(t): \r\n i,j = list(map(lambda x: int(x) - 1,input().split())) \r\n if i*m + j in waste: \r\n print(\"Waste\")\r\n continue\r\n cnt = 0 \r\n for w in waste:\r\n if w < i*m + j:\r\n cnt += 1 \r\n idx = i*m + j - cnt \r\n print(plants[idx % 3])\r\n", "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,m,k,t=map(int,stdin.readline().split())\r\nobs=set()\r\nfor _ in range(k):\r\n obs.add(tuple(map(int,stdin.readline().split())))\r\nfor _ in range(t):\r\n a,b=map(int,stdin.readline().split())\r\n if(tuple([a,b]) in obs):\r\n print(\"Waste\")\r\n else:\r\n temp=0\r\n for i,j in obs:\r\n if(i<a):\r\n temp+=1\r\n elif(i==a and j<b):\r\n temp+=1\r\n field=(a-1)*m +b -temp \r\n if(field%3==0):\r\n print(\"Grapes\")\r\n elif(field%3==1):\r\n print(\"Carrots\")\r\n else:\r\n print(\"Kiwis\")", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\nfrom bisect import bisect\r\n\r\ndef solve():\r\n _map = {0: \"Carrots\", 1: \"Kiwis\", 2: \"Grapes\"}\r\n n, m, k, t = read_tuple(int)\r\n grid = []\r\n waste = set()\r\n for _ in range(k):\r\n a, b = read_tuple(int)\r\n grid.append((a, b))\r\n waste.add((a, b))\r\n grid.sort()\r\n for _ in range(t):\r\n i, j = read_tuple(int)\r\n if (i, j) in waste:\r\n print(\"Waste\")\r\n else:\r\n n_predecessor = bisect(grid, (i, j))\r\n pos = m * (i - 1) + (j - 1) - n_predecessor\r\n print(_map[pos % 3])\r\n \r\nif __name__ == '__main__':\r\n solve()", "n, m, k,t = map(int, input().split(\" \"))\r\nlst = []\r\nfor i in range(k):\r\n lst.append(tuple(map(int, input().split(\" \"))))\r\nfor i in range(t):\r\n pos1, pos2 = tuple(map(int, input().split(\" \")))\r\n if (pos1, pos2) in lst:\r\n print(\"Waste\")\r\n else:\r\n con = 0\r\n for posa1, posa2 in lst:\r\n if pos1 > posa1:\r\n con += 1\r\n elif pos1 == posa1 and pos2 > posa2:\r\n con += 1\r\n o = ((pos1 - 1) * m) + pos2 - con\r\n if o % 3 == 0:\r\n print(\"Grapes\")\r\n elif o % 3 == 1:\r\n print(\"Carrots\")\r\n elif o % 3 == 2:\r\n print(\"Kiwis\")", "n, m, k, t = map(int, input().split())\r\nm, l = m % 3, (m + 1) % 3\r\np = [[] for i in range(n + 1)]\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n p[x].append(y)\r\nr = [len(i) for i in p]\r\nfor i in range(1, n + 1):\r\n r[i] += r[i - 1]\r\nr, q = [0] + r, [0] * t\r\nfor i in range(t):\r\n x, y = map(int, input().split())\r\n if y in p[x]: q[i] = 'Waste'\r\n else:\r\n d = r[x] + sum(j < y for j in p[x])\r\n d = m * x + y - d - l\r\n q[i] = ['Carrots', 'Kiwis', 'Grapes'][d % 3]\r\nprint('\\n'.join(q))", "n, m, k, t = map(int, input().split())\nwastes = [] \nplants = [\"Carrots\", \"Kiwis\", \"Grapes\"]\n\nfor _ in range(k):\n a, b = map(int, input().split())\n wastes.append((a-1)*m + b)\n\nwastes.sort()\n\nfor _ in range(t):\n i, j = map(int, input().split())\n block = (i-1)*m + j\n if block in wastes:\n print(\"Waste\")\n else:\n c = 1\n for waste in wastes:\n if block > waste:\n c += 1\n else:\n break\n \n print(plants[(block - c) % 3])", "n,m,k,t=map(int,input().split())\narr=[]\nfor i in range(k):\n a,b=map(int,input().split())\n arr.append((a-1)*m+b)\narr.sort()\nfor i in range(t):\n x,y=map(int,input().split())\n c=0\n s=(x-1)*m+y\n p=0\n for j in arr:\n if j==s:\n p=1\n print('Waste')\n break\n elif j<s:\n c+=1\n continue\n else:\n break\n d={1:'Carrots',2:'Kiwis',0:'Grapes'}\n if p==0:\n print(d[(s-c)%3])\n", "n, m, k, t = map(int, input().split())\r\nans = 0\r\nwasted = []\r\nfor _ in range(k):\r\n a, b = map(int, input().split())\r\n wasted.append((a, b))\r\n\r\nwasted.sort()\r\n\r\nfor _ in range(t):\r\n i, j = map(int, input().split())\r\n if (i, j) in wasted:\r\n print('Waste')\r\n continue\r\n else:\r\n g = (wasted + [(i, j)])\r\n g.sort()\r\n x = g.index((i, j))\r\n ans = (m*(i-1) + j) - x\r\n print('Carrots' if ans%3 == 1 else 'Kiwis' if ans%3 == 2 else 'Grapes')\r\n", "[n,m,k,t]=list(map(int,input().split()))\n\nblack=[]\nPlants=['Carrots','Kiwis','Grapes']\n\nfor i in range(k):\n\tblack.append(tuple(map(int,input().split())))\nblack.sort()\nqueries=[]\nfor i in range(t):\n\tqueries.append(tuple(map(int,input().split())))\nfor q in queries:\n\tif q in black:\n\t\tprint(\"Waste\")\n\telse:\n\t\tindex=0\n\t\tfor i in range(len(black)):\n\t\t\tif black[i]>q:\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tindex+=1\n\t\tcellno=(q[0]-1)*m+q[1]\n\t\tactual=(cellno-index)%3\n\t\tprint(Plants[actual-1])", "# link: https://codeforces.com/contest/79/problem/B\r\nif __name__ == \"__main__\":\r\n n,m,k,t = map(int,input().split())\r\n kk = k\r\n waste = []\r\n a = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\n while k:\r\n i,j = map(int,input().split())\r\n waste.append([i-1,j-1]) \r\n k -= 1\r\n while t:\r\n i,j = map(int,input().split())\r\n if [i-1,j-1] in waste:\r\n print(\"Waste\")\r\n else:\r\n # add previous sub matrix cell count\r\n count = ((i-1) * m) + (j-1) \r\n # remove the waste cells from the previous submatrix\r\n for k in range(kk):\r\n if (waste[k][0] < i-1) or (waste[k][0] == i-1 and waste[k][1] < j-1): \r\n count -= 1\r\n print(a[count % 3]) \r\n t -= 1 ", "food = ['Carrots','Kiwis','Grapes']\r\nn,m,k,t = [int(x) for x in input().split(' ')]\r\nwasts = []\r\n\r\nfor _k in range(k):\r\n\t_x,_y = [int(x)-1 for x in input().split(' ')]\r\n\twasts.append((_x,_y))\r\nwasts = sorted(wasts,key=lambda x: x)\r\n\r\nqueries = []\r\nfor _t in range(t):\r\n\tquery = [int(x)-1 for x in input().split(' ')]\r\n\tqueries.append([query[0],query[1],_t,'',0])\r\nqueries = sorted(queries,key=lambda query: query)\r\n\r\n\r\nfor i in range(t):\r\n\tquery = queries[i]\r\n\tfor wast in wasts:\r\n\t\tif (query[0]==wast[0] and query[1]==wast[1]):\r\n\t\t\tqueries[i][3] ='Waste'\r\n\r\n\t\tif query[0]>wast[0] or (query[0]==wast[0] and query[1]>wast[1]):\r\n\t\t\tqueries[i][4] +=1\r\n\r\nans = ['']*t\r\nfor query in queries:\r\n\tans[query[2]] = food[(m*query[0]+query[1]-query[4])%3] if query[3]=='' else query[3]\r\n\r\nfor a in ans:\r\n\tprint(a)", "FRUITS = ['Carrots', 'Kiwis', 'Grapes']\r\nrn, cn, wn, qn = map(int, input().split())\r\nwaste_locations = []\r\nfor _ in range(wn):\r\n r, c = map(int, input().split())\r\n waste_location = (r - 1) * cn + c - 1\r\n waste_locations.append(waste_location)\r\n\r\nfor _ in range(qn):\r\n r, c = map(int, input().split())\r\n fruit_location = (r - 1) * cn + c - 1\r\n if fruit_location not in waste_locations:\r\n previous_waste = len([1 for loc in waste_locations if loc < fruit_location])\r\n print(FRUITS[(fruit_location - previous_waste) % 3])\r\n else:\r\n print(\"Waste\")\r\n", "n, m, k, t = map(int, input().split())\r\nwaste_pos = []\r\nplants = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\n\r\nfor _ in range(k):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n waste_pos.append(m * a + b)\r\n\r\nfor _ in range(t):\r\n i, j = map(int, input().split())\r\n i -= 1\r\n j -= 1\r\n pos = m * i + j\r\n\r\n waste_before_cell = 0\r\n is_waste = False\r\n for p in waste_pos:\r\n if p == pos:\r\n is_waste = True\r\n break\r\n elif p < pos:\r\n waste_before_cell += 1\r\n\r\n if is_waste:\r\n print(\"Waste\")\r\n else:\r\n print(plants[(pos - waste_before_cell) % 3])\r\n", "n, m, k, t = map(int, input().split())\r\n\r\nwaste = []\r\nqueries = []\r\n\r\nplants = {0: 'Carrots', 1: \"Kiwis\", 2: 'Grapes'}\r\nwaste_cells = 0\r\n\r\nfor _ in range(k):\r\n waste.append(list(map(int, input().split())))\r\n\r\nfor _ in range(t):\r\n query = list(map(int, input().split()))\r\n if query in waste:\r\n print('Waste')\r\n else:\r\n wastes = 0\r\n for i in waste:\r\n if i < query:\r\n wastes += 1\r\n i = (query[0] - 1) * m + (query[1] - 1) - wastes\r\n print(plants[i % 3])\r\n", "import sys\nimport math\ninput = sys.stdin.readline\nfrom array import array\n\nn, m, k, t = map(int, input().strip().split())\nwastes = []\nfor _ in range(k): wastes.append(list(map(int, input().strip().split())))\nfor _ in range(t):\n ind = list(map(int, input().strip().split()))\n if ind in wastes: print('Waste')\n else:\n c = 0\n for waste in wastes:\n if waste < ind: c += 1\n val = (ind[0] - 1) * m + ind[1] - 1 - c\n if val % 3 == 0: print('Carrots')\n elif val % 3 == 1: print('Kiwis')\n else: print('Grapes')\n", "inp=[int(x) for x in input().split()]\r\nn=inp[0]\r\nm=inp[1]\r\nk=inp[2]\r\nt=inp[3]\r\nwaste=[]\r\nfor i in range(k):\r\n temp=[int(x) for x in input().split()]\r\n waste.append(temp)\r\nquery=[]\r\nfor i in range(t):\r\n temp=[int(x) for x in input().split()]\r\n query.append(temp)\r\nloc=0\r\nb=0\r\nfor i in range(t):\r\n loc=((query[i][0]-1)*m)+query[i][1]\r\n for j in range(k):\r\n if (waste[j][0]<query[i][0]) or ((waste[j][0]==query[i][0]) and (waste[j][1]<query[i][1])):\r\n loc-=1\r\n elif (waste[j][0]==query[i][0]) and (waste[j][1]==query[i][1]):\r\n b=1\r\n if b:\r\n print('Waste')\r\n elif (loc%3)==1:\r\n print(\"Carrots\")\r\n elif (loc%3)==2:\r\n print('Kiwis')\r\n elif (loc%3)==0:\r\n print('Grapes')\r\n b=0\r\n loc=0", "n , m , k ,t = [int(i) for i in input().split()]\r\nwaste = []\r\nfor i in range(k):\r\n\ta ,b = [int(i) for i in input().split()]\r\n\twaste.append((a-1)*m+b)\r\n\r\ncrop = ['Carrots','Kiwis','Grapes']\r\nwaste.sort()\r\nnn = len(waste)\r\nfor i in range(t):\r\n\ta ,b = [int(i) for i in input().split()]\r\n\tc = (a-1)*m + b\r\n\ti = 0\r\n\twhile i < nn and waste[i] < c:\r\n\t\ti += 1\r\n\tif i < nn and waste[i] == c:\r\n\t\tprint ('Waste')\r\n\telse:\r\n\t\tno = c - i-1\r\n\t\tprint (crop[no%3])", "n, m, k, t = map(int, input().split())\r\nw = list()\r\nfr = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\nfor _ in range(k):\r\n a, b = map(int, input().split())\r\n w.append([a, b])\r\nfor _ in range(t):\r\n cnt, f = 0, 0\r\n i, j = map(int, input().split())\r\n for a,b in w:\r\n if i > a: cnt += 1\r\n elif i == a and j >= b: cnt += 1\r\n if a == i and b == j: f = 1\r\n print(\"Waste\" if f else fr[((i-1)*m+j-1-cnt)%3])\r\n", "import bisect\r\n\r\nans = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\n\r\nn, m, k, t = map(int, input().split())\r\n\r\nwasted = []\r\nq = set()\r\n\r\nfor _ in range(k):\r\n a, b = map(int, input().split())\r\n cell = (a-1) * m + b\r\n wasted.append(cell)\r\n q.add(cell)\r\n\r\nwasted.sort()\r\n\r\nfor _ in range(t):\r\n a, b = map(int, input().split())\r\n cell = (a-1) * m + b\r\n\r\n if cell in q:\r\n print(\"Waste\")\r\n pass\r\n else:\r\n i = bisect.bisect_left(wasted, cell)\r\n print(ans[(cell - i - 1)%3])", "\ndef get_crop(n, m, waste, i, j):\n curr = (m*i)+j\n if curr in waste:\n return \"Waste\"\n new = curr\n i = 0\n while i < len(waste) and waste[i] < curr:\n new -= 1\n i += 1\n if new % 3 == 0:\n return \"Carrots\"\n elif new % 3 == 1:\n return \"Kiwis\"\n else:\n return \"Grapes\"\n\n\ns = input().split()\nn, m, k, t = int(s[0]), int(s[1]), int(s[2]), int(s[3])\nwaste = []\nfor i in range(k):\n s = input().split()\n waste.append((m*(int(s[0])-1)) + int(s[1])-1)\n# chuj cos innego niz count sort siema\n\n\ndef partition_Lomuto(tab, l, r):\n pivot = tab[r]\n j = l\n for i in range(l, r):\n if tab[i] < pivot:\n tab[i], tab[j] = tab[j], tab[i]\n j += 1\n tab[r], tab[j] = tab[j], tab[r]\n return j\n\n\ndef quickSort(tab, l, r):\n if l < r:\n q = partition_Lomuto(tab, l, r)\n quickSort(tab, l, q-1)\n quickSort(tab, q+1, r)\n\n\nquickSort(waste, 0, len(waste)-1)\n# noi co by uzyc tu\nfor i in range(t):\n s = input().split()\n print(get_crop(n, m, waste, int(s[0])-1, int(s[1])-1))\n", "n, m, k, t = map(int, input().split())\r\ndp = []\r\nfor i in range(k):\r\n\ta, b = map(int, input().split())\r\n\tidx = (a - 1)*m + (b - 1)\r\n\tdp.append(idx)\r\ndp.sort()\r\nfor i in range(t):\r\n\tx, y = map(int, input().split())\r\n\tidx_ = (x - 1)*m + (y - 1)\r\n\tif idx_ in dp:\r\n\t\tprint(\"Waste\")\r\n\telse:\r\n\t\tj = 0 \r\n\t\twhile j < len(dp) and dp[j] < idx_:\r\n\t\t\tj += 1 \r\n\t\tj = idx_ - j \r\n\t\tif j % 3 == 0:\r\n\t\t\tprint(\"Carrots\")\r\n\t\telif j % 3 == 1:\r\n\t\t\tprint(\"Kiwis\")\r\n\t\telse:\r\n\t\t\tprint(\"Grapes\")", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\n\r\ninput = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\nchoice = ['Grapes', 'Carrots', 'Kiwis']\r\n\r\nn, m, k, t = read()\r\nlst = [0] * k\r\narr = [0] * k\r\nans = -1\r\nfor idx, (i, j) in enumerate(sorted(tuple(read()) for x in range(k))):\r\n lst[idx] = (i - 1) * m + j\r\n arr[idx] = ans\r\n ans -= 1\r\n# print(lst)\r\nl = len(lst)\r\n# print(arr)\r\nfor x in range(t):\r\n i, j = read()\r\n idx = bl(lst, (i - 1) * m + j)\r\n if idx < l and lst[idx] == (i - 1) * m + j:\r\n print(\"Waste\")\r\n else:\r\n if idx == 0:\r\n print(choice[((i - 1) * m + j) % 3])\r\n else:\r\n print(choice[((i - 1) * m + j + arr[idx - 1]) % 3])\r\n# 4 5 5 6\r\n# 4 3\r\n# 1 3\r\n# 3 3\r\n# 2 5\r\n# 3 2\r\n# 1 3\r\n# 1 4\r\n# 2 3\r\n# 2 4\r\n# 1 1\r\n# 4 5\r\n", "from bisect import bisect_left\r\n\r\n\r\ndef read():\r\n return map(int, input().split())\r\n\r\n\r\nplants = ['Carrots', 'Kiwis', 'Grapes', 'Waste']\r\nn, m, k, t = read()\r\nwaste_pos = []\r\nfor _ in range(k):\r\n x, y = read()\r\n pos = (x-1) * m + (y-1)\r\n waste_pos.append(pos)\r\n\r\nwaste_pos.sort()\r\n\r\nfor _ in range(t):\r\n x, y = read()\r\n res = (x-1) * m + (y-1)\r\n bl = bisect_left(waste_pos, res)\r\n\r\n if bl < k and waste_pos[bl] == res:\r\n ans = 3\r\n else:\r\n sub = bl\r\n ans = (res - sub) % 3\r\n\r\n print(plants[ans])\r\n", "# https://codeforces.com/problemset/problem/79/B\r\n# B. Colorful Field\r\n\r\nrows, columns, waste_count, q_count = [int(i) for i in input().split(' ')]\r\nwaste_list = []\r\nfor _ in range(waste_count):\r\n waste_list.append([int(i) for i in input().split(' ')])\r\nquery_list = []\r\nfor _ in range(q_count):\r\n query_list.append([int(i) for i in input().split(' ')])\r\nwaste_row = []\r\nwaste_row_count = []\r\nfor i in range(rows+1):\r\n waste_row.append([])\r\n waste_row_count.append(0)\r\nfor k in waste_list:\r\n waste_row[k[0]].append(k[1])\r\n waste_row_count[k[0]] += 1\r\n# print(waste_row)\r\nfor i in range(1,len(waste_row_count)):\r\n waste_row_count[i] = waste_row_count[i] + waste_row_count[i-1]\r\n# print(waste_row_count)\r\nfor q in query_list:\r\n row = q[0]\r\n column = q[1]\r\n waste_before = waste_row_count[row-1]\r\n waste_in_current_row = 0\r\n is_waste = False\r\n for i in waste_row[row]:\r\n if i == column:\r\n is_waste = True\r\n if i < column:\r\n waste_in_current_row += 1\r\n if is_waste:\r\n print(\"Waste\")\r\n else:\r\n # print(row, column, waste_before, waste_in_current_row)\r\n # print(waste_row[row])\r\n numero = (row-1)*columns + column - waste_before - waste_in_current_row\r\n numero = numero % 3\r\n if numero == 1:\r\n print(\"Carrots\")\r\n elif numero == 2:\r\n print(\"Kiwis\")\r\n elif numero == 0:\r\n print(\"Grapes\")", "n, m, k, t = list(map(int, input().split(' ')))\nwastes = set()\nfor _ in range(k):\n wastes.add(tuple(map(int, input().split(' '))))\n\n# print(sorted(wastes))\n\n\nmapping = {0:'Carrots', 1:'Kiwis', 2:'Grapes'}\nfor _ in range(t):\n x, y = list(map(int, input().split(' ')))\n if (x,y) in wastes:\n print(\"Waste\")\n continue\n \n total = (x-1)*m+y-1\n for w in wastes:\n if w[0]<x or w[0]==x and w[1]<y:\n total -= 1\n\n # total elements upto x, y - waste elements % 3 is the answer\n print(mapping[total%3])", "\r\ndef mi():\r\n\treturn map(int, input().split())\r\nn,m,k,t = mi()\r\nwasterowscount = [0]*(n+1)\r\nd = {0:'Carrots',1:'Kiwis',2:'Grapes'}\r\n\r\nwaste = [[]]*(n+1)\r\ndef fun(x,y):\r\n\tglobal waste\r\n\tif y in waste[x]:\r\n\t\tprint ('Waste')\r\n\t\treturn 0\r\n\tcur = (((x-1)*m-wasterowscount[x-1]))\r\n\tcur+=(y)\r\n\tfor i in range(wasterowscount[x]-wasterowscount[x-1]):\r\n\t\tif waste[x][i]<y:\r\n\t\t\tcur-=1\r\n\tcur-=1\r\n\tcur%=3\r\n\tprint (d[cur])\r\n\r\n\r\n\r\nfor i in range(len(waste)):\r\n\twaste[i] = waste[i][:]\r\n\r\nfor i in range(k):\r\n\tx,y = mi()\r\n\twaste[x].append(y)\r\n\twasterowscount[x] += 1\r\nfor i in range(2,len(wasterowscount)):\r\n\twasterowscount[i] += wasterowscount[i-1]\r\nfor i in range(t):\r\n\tx,y = mi()\r\n\tfun(x,y)", "\r\nn,m,k,t = input().strip().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\nk = int(k)\r\nt = int(t)\r\nar = []\r\nfor i in range(k):\r\n\tinp = input().strip().split(\" \")\r\n\tar.append((int(inp[0])-1)*m+int(inp[1])-1)\r\n\r\nar.sort()\r\n#print(ar)\r\nfor i in range(t):\r\n\tinp = input().strip().split(\" \")\r\n\tinp[0] = int(inp[0])-1\r\n\tinp[1] = int(inp[1])-1\r\n\ttemp = inp[0]*m + inp[1]\r\n\t#print(temp)\r\n\tWaste_count = 0\r\n\tflag = 0\r\n\tfor j in range(k):\r\n\t\tif ar[j] == temp:\r\n\t\t\tprint(\"Waste\")\r\n\t\t\tflag = 1\r\n\t\telif ar[j] < temp:\r\n\t\t\tWaste_count += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tif flag == 0:\r\n\t\ttemp = temp - Waste_count\r\n\t\tif temp%3 == 1:\r\n\t\t\tprint(\"Kiwis\")\r\n\t\telif temp%3 == 2:\r\n\t\t\tprint(\"Grapes\")\r\n\t\telse:\r\n\t\t\tprint(\"Carrots\")", "# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline().strip()\n\n\ncrops = ['Carrots', 'Kiwis', 'Grapes']\n\nn, m, k, t = tuple(map(int, input().split(' ')))\n\nwaste = []\n\nfor _ in range(k):\n\ta, b = tuple(map(int, input().split(' ')))\n\twaste.append( (a-1)*m + (b-1))\n\nwaste = sorted(waste)\n\t\nfor _ in range(t):\n\ta, b = tuple(map(int, input().split(' ')))\n\tpos = (a-1)*m + (b-1)\n\n\tif pos in waste:\n\t\tprint('Waste')\n\n\telse:\n\t\tw = 0\n\t\tfor i in waste:\n\t\t\tif i < pos: w += 1\n\n\t\tj = (pos - w) % 3\n\t\tprint(crops[j])\n\t\n\n\t\n\n", "n, m, k, t = map(int, input().split())\r\n\r\nx = [0] * k\r\n\r\nfor i in range(k):\r\n a, b = map(int, input().split())\r\n \r\n x[i] = (a, b)\r\n\r\nplants = ['Carrots', 'Kiwis',' Grapes']\r\n\r\nfor _ in range(t):\r\n i, j = map(int, input().split())\r\n \r\n if (i, j) in x:\r\n print('Waste')\r\n continue\r\n \r\n p = (i - 1) * m + (j - 1)\r\n \r\n for xx, yy in x:\r\n if xx < i or (xx == i and yy < j):\r\n p -= 1\r\n\r\n print(plants[p % 3])\r\n", "z=list(map(int,input().split()))\r\nhold=[0]*z[0]\r\nlst=[]\r\nfor i in range(z[2]):\r\n a,b=map(int,input().split())\r\n lst.append((a,b))\r\n hold[a-1]+=1\r\n#print('hold before=',hold) \r\nlst.sort()\r\n#print('lst=',lst)\r\nfor k in range(1,len(hold)):\r\n hold[k]+=hold[k-1]\r\n#print('hold=',hold) \r\nfor j in range(z[3]):\r\n v,b=map(int,input().split())\r\n if (v,b) in lst:\r\n print('Waste')\r\n else:\r\n ans=((v-1)*z[1])+b\r\n # print('f ans=',ans)\r\n if v-2>=0:\r\n ans-=hold[v-2]\r\n # print('se ans=',ans)\r\n for l in lst:\r\n if l[0]==v and l[1]<b:\r\n ans-=1\r\n if l[0]>v or (l[0]==v and l[1]>b) :\r\n break\r\n # print('last ans=',ans) \r\n print(['Grapes','Carrots','Kiwis'][ans%3])\r\n \r\n\r\n", "def read():\r\n return map(int, input().split())\r\n\r\n\r\nplants = ['Carrots', 'Kiwis', 'Grapes', 'Waste']\r\nn, m, k, t = read()\r\nwaste_pos = set()\r\nfor _ in range(k):\r\n x, y = read()\r\n pos = (x-1) * m + (y-1)\r\n waste_pos.add(pos)\r\n\r\n\r\nfor _ in range(t):\r\n x, y = read()\r\n res = (x-1) * m + (y-1)\r\n sub = 0\r\n\r\n if res in waste_pos:\r\n ans = 3\r\n else:\r\n sub = sum(elm < res for elm in waste_pos)\r\n ans = (res - sub) % 3\r\n\r\n print(plants[ans])\r\n", "# python3\r\nimport sys, threading, os.path\r\nimport collections, heapq, math, bisect\r\nimport string\r\n\r\nsys.setrecursionlimit(10 ** 6)\r\nthreading.stack_size(2 ** 27)\r\n\r\ndef main():\r\n if os.path.exists('in.txt'):\r\n input = open('in.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n # --------------------------------INPUT---------------------------------\r\n n,m,k,t = list(map(int, input.readline().split()))\r\n wastes = set()\r\n\r\n queries = list()\r\n for i in range(k):\r\n ai,bi = list(map(int, input.readline().split()))\r\n wastes.add((ai,bi))\r\n\r\n\r\n for i in range(t):\r\n ai,bi = list(map(int, input.readline().split()))\r\n queries.append((ai,bi))\r\n\r\n sols = list()\r\n\r\n for x,y in queries:\r\n if (x,y) in wastes:\r\n sols.append(\"Waste\")\r\n else:\r\n\r\n num_of_prev = ((x-1) * m) + (y)\r\n\r\n for z,r in wastes:\r\n if (z < x) or (z == x and r < y):\r\n num_of_prev-=1\r\n if num_of_prev%3 == 0:\r\n sols.append(\"Grapes\")\r\n elif num_of_prev%3 == 1:\r\n sols.append(\"Carrots\")\r\n else:\r\n sols.append(\"Kiwis\")\r\n\r\n # print(wastes)\r\n # print(queries)\r\n # print(sols)\r\n\r\n output = '\\n'.join(map(str, sols))\r\n # -------------------------------OUTPUT----------------------------------\r\n if os.path.exists('out.txt'):\r\n open('out.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n# threading.Thread(target=main).start()\r\n", "n, m, k, t = map(int, input().split())\r\nwaste = []\r\nfor _ in range(k):\r\n tmp = list(map(int, input().split()))\r\n waste.append(tmp)\r\n\r\ntree = {\r\n 1: 'Carrots',\r\n 2: 'Kiwis',\r\n 0: 'Grapes'\r\n}\r\n\r\nwaste.sort()\r\n\r\nfor _ in range(t):\r\n ls = list(map(int, input().split()))\r\n\r\n i = 0\r\n found = False\r\n for plot in waste:\r\n if ls == plot:\r\n print('Waste')\r\n found = True\r\n break \r\n elif ls > plot: i += 1\r\n else: break\r\n\r\n if i == 0 and not found:\r\n plant_number = (ls[0] - 1) * m\r\n plant_number += ls[1]\r\n plant_number %= 3\r\n print(tree[plant_number])\r\n elif not found:\r\n plant_number = (ls[0] - 1) * m\r\n plant_number += ls[1]\r\n plant_number -= i\r\n plant_number %= 3\r\n print(tree[plant_number])\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\nfrom itertools import accumulate\r\nimport bisect\r\n\r\nn, m, k, t = map(int, input().split())\r\n\r\nd = [0]*(n+1)\r\ne = defaultdict(list)\r\ns = {1:'Carrots', 2:'Kiwis', 0:'Grapes'}\r\n\r\nfor i in range(k):\r\n a, b = map(int, input().split())\r\n d[a] += 1\r\n e[a].append(b)\r\n\r\nd = list(accumulate(d))\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n e[a].sort()\r\n c = bisect.bisect_right(e[a], b)\r\n if c != 0 and e[a][c-1] == b:\r\n print('Waste')\r\n continue\r\n\r\n print(s[(m*(a-1)+b - (d[a-1] + c))%3])", "def main():\n n,m,k,t = map(int,input().split())\n waste = []\n ans = {1:\"Carrots\",2:\"Kiwis\",0:\"Grapes\"}\n for i in range(k):\n a,b = map(int,input().split())\n waste.append((a-1)*m + b)\n waste.sort()\n \n for i in range(t):\n a,b = map(int,input().split())\n cell = (a-1)*m + b\n count = 0\n flag = True\n for j in waste:\n if j == cell:\n flag = False\n break\n elif j < cell:\n count += 1\n else:\n break\n if flag:\n print(ans[(cell-count)%3])\n else:\n print(\"Waste\")\nif __name__ == '__main__':\n main()\n", "n,m,k,t = map(int,input().split())\r\nw=[0]*k\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n w[i] = (a,b)\r\nplants = ['Carrots','Kiwis','Grapes']\r\n\r\nfor _ in range(t):\r\n i,j=map(int,input().split())\r\n if (i,j) in w:\r\n print('Waste')\r\n continue\r\n p = (i-1) * m +(j-1)\r\n for xx,yy in w:\r\n if xx<i or (xx==i and yy<j):\r\n p-=1\r\n print(plants[p%3])", "n,m,k,t = [int(x) for x in input().split()]\r\nmapp ={0:'Carrots',1:'Kiwis',2:'Grapes'}\r\niamdistruption = []\r\nfor i in range(k):\r\n x,y = [int(x) for x in input().split()]\r\n iamdistruption.append((x,y))\r\n\r\nfor i in range(t):\r\n x,y = [int(x) for x in input().split()]\r\n orig = ((m*(x-1))+y-1)\r\n disbeforeme = 0\r\n for x,y in iamdistruption:\r\n if m*(x-1)+y-1==orig:\r\n print(\"Waste\")\r\n break\r\n elif m*(x-1)+y-1<orig:\r\n disbeforeme+=1\r\n else:\r\n afterdis = ((orig%3) - disbeforeme)%3\r\n print(mapp[afterdis])", "import bisect\nn, m, k, t = map(int, input().split())\n \ndef id(i, j):\n return j + i*m\n \nwastes = []\nfor ii in range(k):\n i, j = map(int, input().split())\n wastes.append(id(i-1, j-1))\nwastes.sort()\n \nlabels = ['Carrots', 'Kiwis', 'Grapes']\nfor ii in range(t):\n i, j = map(int, input().split())\n \n id_gross = id(i-1, j-1)\n waste_count = bisect.bisect_right(wastes, id_gross)\n \n if waste_count > 0 and wastes[waste_count-1] == id_gross:\n print('Waste')\n continue\n \n id_net = id_gross - waste_count\n id_net %= 3\n print(labels[id_net])\n\t \t\t\t\t \t \t \t \t \t \t \t\t \t", "\r\n\r\nif __name__ == '__main__':\r\n n, m, k, t = map(int, input().split())\r\n waste_lands = []\r\n waste = set()\r\n for i in range(k):\r\n a, b = map(int, input().split())\r\n waste.add((a, b))\r\n waste_lands.append((a, b))\r\n waste_lands.sort()\r\n Plants = ['Carrots', 'Kiwis', 'Grapes']\r\n\r\n for i in range(t):\r\n a, b = map(int, input().split())\r\n if (a, b) in waste:\r\n print(\"Waste\")\r\n continue\r\n\r\n cellno = (a - 1) * m + b\r\n c = 0\r\n for i in waste_lands:\r\n if i < (a, b):\r\n c += 1\r\n cellno -= c\r\n cellno = cellno % 3\r\n print(Plants[cellno - 1])\r\n", "import pdb\n\nfrom collections import deque\n\ndef bin_search(lst, x):\n\n l, r = 0, len(lst)\n while l < r:\n mid = (l + r)//2\n if lst[mid] == x:\n return mid\n if lst[mid] < x:\n l = mid + 1\n else:\n r = mid\n return l \n\ndef to_number(n, m, q):\n i, j = q\n i -= 1\n j -= 1\n x = i*m + j\n return x\n\ndef solve(n, m, waste, queries):\n lst = sorted([to_number(n, m, q) for q in waste])\n for q in queries:\n x = to_number(n, m, q)\n index = bin_search(lst, x)\n if index < len(lst) and x == lst[index]:\n print('Waste')\n else:\n mod = (x - index) % 3\n if mod == 0:\n print('Carrots')\n elif mod == 1:\n print('Kiwis')\n else:\n print('Grapes')\n\ndef main():\n n, m, k, t = map(int, input().split())\n waste = set()\n for _ in range(k):\n i, j = map(int, input().split())\n waste.add((i,j))\n queries = []\n for k in range(t):\n i, j = map(int, input().split())\n queries.append((i,j))\n solve(n, m, waste, queries)\n\nif __name__ == '__main__':\n main()\n", "n, m, k, t = map(int, input().split())\n\nwaste = []\nfor i in range(k):\n\tr, c = map(int, input().split())\n\twaste.append((r-1)*m+c-1)\n\nwaste.sort()\nplant = ['Carrots', 'Kiwis', 'Grapes']\n\nfor i in range(t):\n\tcount = 0\n\tr, c = map(int, input().split())\n\tnum = (r-1)*m + c-1\n\tcrop = True\n\tfor j in range(k):\n\t\tif waste[j] > num:\n\t\t\tbreak\n\t\telif waste[j] == num:\n\t\t\tcrop = False\n\t\t\tbreak\n\t\telse:\n\t\t\tcount += 1\n\n\tif crop:\n\t\tprint(plant[(num-count)%3])\n\telse:\n\t\tprint(\"Waste\")", "n,m,k,t = map(int,input().split()) # height width black fruits\r\nwaste = []\r\nfor i in range(k):\r\n\ta , b = map(int,input().split())\r\n\twaste.append((a-1)*m+b-1)\r\nwaste.sort()\r\nplant = [\"Carrots\",\"Kiwis\",\"Grapes\"]\r\nfor _ in range(t):\r\n\tcnt = 0\r\n\tcrop = True\r\n\ti , j = map(int,input().split())\r\n\tc = (i-1)*m+j-1\r\n\tfor x in range(k):\r\n\t\tif waste[x]>c:\r\n\t\t\tbreak\r\n\t\telif waste[x] == c:\r\n\t\t\tcrop = False\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tcnt += 1\r\n\r\n\tif crop:\r\n\t\tprint(plant[(c-cnt)%3])\r\n\telse:\r\n\t\tprint(\"Waste\")\r\n", "import bisect\r\nn,m,w,q=list(map(int,input().split()))\r\nci=0\r\nfield=[]\r\ncrop=[\"Carrots\",\"Kiwis\",\"Grapes\"]\r\nk=10**5\r\nfor i in range(w):\r\n a,b=list(map(int,input().split()))\r\n field.append(k*a+b)\r\nfield.sort()\r\n\r\nfor i in range(q):\r\n a,b=list(map(int,input().split()))\r\n n=k*a+b\r\n loc=bisect.bisect_left(field,n)\r\n if(loc<len(field) and field[loc]==n):\r\n print(\"Waste\")\r\n else:\r\n prev=(a-1)*m+b\r\n print(crop[(prev-loc-1)%3])#,(prev-loc),prev,loc)\r\n", "n,m,k,t=list(map(int,input().split()))\r\nw=[]\r\nfor t1 in range(k):\r\n x,y=map(int,input().split())\r\n w.append((x,y))\r\n\r\nfor t2 in range(t):\r\n a,b=map(int,input().split())\r\n wc=0\r\n flag=0\r\n for i,j in w:\r\n if i==a and j==b:\r\n flag=1\r\n break\r\n if i<a:\r\n wc+=1\r\n if i==a and j<b:\r\n wc+=1\r\n if flag:\r\n print(\"Waste\")\r\n continue\r\n #print(wc)\r\n pos=(a-1)*m +(b-1)-wc\r\n if pos%3==0:\r\n print(\"Carrots\")\r\n elif pos%3==1:\r\n print(\"Kiwis\")\r\n else:\r\n print(\"Grapes\")\r\n", "n, m, k, t = map(int, input().split())\r\nwasted = []\r\nwanted = []\r\ndic = {1: \"Carrots\", 2: \"Kiwis\", 0: \"Grapes\"}\r\nfor i in range(k + t):\r\n if k:\r\n a, b = map(int, input().split())\r\n wasted.append([a, b])\r\n k -= 1\r\n else:\r\n i, j = map(int, input().split())\r\n wanted.append([i, j])\r\n \r\nshift = 0; wasted.sort()\r\nfor cell in wanted:\r\n if cell in wasted: print(\"Waste\")\r\n else:\r\n for ele in wasted:\r\n if ele[0] < cell[0]: shift += 1\r\n elif ele[0] == cell[0] and ele[1] < cell[1]: shift += 1\r\n else: break\r\n t = cell[1] + ((cell[0] - 1) * m) - shift\r\n print(dic[t % 3])\r\n shift = 0", "def ColorfulFields():\r\n n, m, k, t = map(int, input().split())\r\n\r\n wastes = set()\r\n for _ in range(k):\r\n x, y = map(int, input().split())\r\n wastes.add((x - 1) * m + y)\r\n\r\n fruits = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\n for _ in range(t):\r\n x, y = map(int, input().split())\r\n cellNO = (x - 1) * m + y\r\n\r\n if cellNO in wastes:\r\n print(\"Waste\")\r\n else:\r\n wasteCount = sum(cellNO > waste for waste in wastes)\r\n print(fruits[(cellNO - wasteCount - 1) % 3])\r\n\r\nColorfulFields()\r\n", "n, m, k, t = map(int, input().split())\r\n\r\nar = []\r\nwaste = set([])\r\n\r\nfor i in range(k):\r\n p, p2 = map(int, input().split())\r\n ar.append((p, p2, 1))\r\n waste.add((p, p2))\r\n\r\nfor i in range(t):\r\n p, p2 = map(int, input().split())\r\n ar.append((p, p2, 0, i))\r\n\r\ncont = 0\r\nans = ['Carrots', 'Kiwis', 'Grapes']\r\nqans = [0] * (t)\r\n\r\nar.sort()\r\nfor i in range(k + t):\r\n if ar[i][2]:\r\n cont += 1\r\n else:\r\n if (ar[i][0], ar[i][1]) in waste:\r\n qans[ar[i][3]] = \"Waste\"\r\n else:\r\n qans[ar[i][3]] = ans[ ( (ar[i][0]-1 )* m + ar[i][1] - cont - 1) % 3 ]\r\n\r\nprint(\"\\n\".join(qans))\r\n", "n, m, k, t = map(int, input().split())\nk = [list(map(int, input().split())) for i in range(k)]\nfor i in range(t):\n x = list(map(int, input().split()))\n print(\"Waste\" if x in k else [\"Grapes\", \"Carrots\", \"Kiwis\"][(x[0] * m - m + x[1] - sum(map(lambda i: i < x, k))) % 3])\n", "if __name__ == '__main__':\r\n A = list(map(int, input().split()))\r\n n = A[0]\r\n m = A[1]\r\n k = A[2]\r\n q = A[3]\r\n\r\n wastepos = []\r\n for i in range(k):\r\n a, b = list(map(int, input().split()))\r\n wastepos += [[a - 1, b - 1]]\r\n\r\n Items = ['Carrots', 'Kiwis', 'Grapes']\r\n for _ in range(q):\r\n a, b = list(map(int, input().split()))\r\n res = (a - 1) * m + b\r\n\r\n if [a - 1, b - 1] in wastepos:\r\n print('Waste')\r\n continue\r\n\r\n wastepos.append([a - 1, b - 1])\r\n wastepos.sort()\r\n res -= wastepos.index([a - 1, b - 1])\r\n wastepos.remove([a - 1, b - 1])\r\n print(Items[res % 3 - 1])\r\n", "n, m, k, t = map(int, input().split())\r\nw = []\r\nfor i in range(k):\r\n a, b = map(int, input().split())\r\n c = []\r\n c.append(a)\r\n c.append(b)\r\n w.append(c)\r\nw.sort()\r\nd = ['Carrots', 'Kiwis', 'Grapes']\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n if [a, b] in w:\r\n print('Waste')\r\n else:\r\n com = 0\r\n for j in range(k - 1, - 1, - 1):\r\n if([a,b] > w[j]):\r\n com = j + 1\r\n break\r\n print(d[((a - 1) * m + b - 1 - com) % 3])", "n, m, k, t = map(int, input().split())\r\n\r\ndef mToA(i, j):\r\n return i * m + j - m - 1\r\n\r\nwaste = [mToA(*map(int, input().split())) for _ in range(k)]\r\n\r\nwaste.sort()\r\nplants = [\"Carrots\", \"Kiwis\", \"Grapes\"]\r\nfor _ in range(t):\r\n i, j = map(int, input().split())\r\n a = mToA(i, j)\r\n if a in waste:\r\n print(\"Waste\")\r\n else:\r\n k = 0\r\n for w in waste:\r\n if w > a:\r\n break\r\n k += 1\r\n print(plants[(a - k) % 3])\r\n", "\"\"\"\nhttps://codeforces.com/contest/79/problem/B\n\"\"\"\nimport sys\ninput = sys.stdin.readline\nn,m,k,t = map(int, input().split())\n\nwaste = []\n\nfor _ in range(k):\n a,b = map(int, input().split())\n a,b = a-1,b-1\n waste.append(a * m + b)\n\nqueries = []\nfor _ in range(t):\n i,j = map(int, input().split())\n i,j = i-1,j-1\n queries.append(i * m + j)\n\nwaste.sort()\n\nvegs = [\"Carrots\", \"Kiwis\", \"Grapes\"]\nfor q in queries:\n c = 0\n ok = True\n for w in waste:\n if w == q:\n ok = False\n elif w < q:\n c += 1\n else:\n break\n if ok:\n print(vegs[(q-c)%3])\n else:\n print(\"Waste\")\n\n", "FRUITS = ['Carrots', 'Kiwis', 'Grapes']\r\nrn, cn, wn, qn = map(int, input().split())\r\nwaste_locations = []\r\nfor _ in range(wn):\r\n r, c = map(int, input().split())\r\n order = (r - 1) * cn + c - 1\r\n waste_locations.append(order)\r\n# waste_locations = sorted(waste_locations)\r\nfor _ in range(qn):\r\n r, c = map(int, input().split())\r\n fruit_order = (r - 1) * cn + c - 1\r\n if fruit_order in waste_locations:\r\n print(\"Waste\")\r\n else:\r\n previous_waste = 0\r\n for location in waste_locations:\r\n if location < fruit_order:\r\n previous_waste += 1\r\n print(FRUITS[(fruit_order - previous_waste) % 3])\r\n", "n,m,k,t=map(int,input().split())\r\nplant=['Grapes','Carrots','Kiwis']\r\nwaste=[]\r\n\r\nfor i in range(0,k):\r\n x,y=map(int,input().split())\r\n waste.append((x-1)*m+(y-1))\r\n\r\n \r\nfor i in range(0,t):\r\n x,y=map(int,input().split())\r\n index=(x-1)*m+(y-1)\r\n if index in waste:\r\n print(\"Waste\")\r\n else:\r\n num=index+1\r\n for j in waste:\r\n if j<index:\r\n num=num-1 \r\n \r\n print(plant[num%3])\r\n \r\n \r\n ", "n, m, k, t = map(int, input().split())\r\npos_w = []\r\n\r\nfor _ in range(k):\r\n temp = input().split()\r\n pos_w+=[m*(int(temp[0])-1)+int(temp[1])]\r\n\r\nfor i in range(t):\r\n w_count = 0\r\n chk = False\r\n bless = list(map(int, input().split()))\r\n pos_b = m*(bless[0]-1)+bless[1]\r\n for j in pos_w:\r\n if j==pos_b:\r\n chk = True\r\n break\r\n elif j<pos_b:\r\n w_count+=1\r\n if chk:\r\n print(\"Waste\")\r\n else:\r\n current_pos = pos_b-w_count\r\n if current_pos%3==0:\r\n print(\"Grapes\")\r\n elif current_pos%3==1:\r\n print(\"Carrots\")\r\n elif current_pos%3==2:\r\n print(\"Kiwis\")", "# dict = {1: 'Carrots', 2: 'Kiwis', 3: 'Grapes'}\n# x = list(map(int, input().split()))\n# field = [[0 for i in range(x[1])] for j in range(x[0])]\n#\n# for i in range(x[2]):\n# waste = list(map(int, input().split()))\n# r = waste[0]-1\n# c = waste[1]-1\n# field[r][c] = 'Waste'\n# query = []\n# for i in range(x[3]):\n# query.append(list(map(int, input().split())))\n#\n# d = 1\n# for i in range(x[0]):\n# for j in range(x[1]):\n# if field[i][j] != 'Waste':\n# if d > 3: d = 1\n# field[i][j] = dict[d]\n# d += 1\n# else:\n# pass\n#\n# for q in query:\n# print(field[q[0]-1][q[1]-1])\n\n# =============================================================================\n\ndict = {1: 'Carrots', 2: 'Kiwis', 0: 'Grapes'}\nx = list(map(int, input().split()))\n\nquery, waste, waste_2 = [], [], []\nfor i in range(x[2]):\n l = list(map(int, input().split()))\n waste.append(l)\n if l[0] > 1:\n ind = ((l[0] - 1) * x[1]) + l[1]\n else: ind = l[1]\n waste_2.append(ind)\n\nfor i in range(x[3]):\n query.append(list(map(int, input().split())))\n\nfor q in query:\n if q in waste:\n print('Waste')\n else:\n if x[0] > 1:\n index_1 = ((q[0] - 1) * x[1]) + q[1]\n else:\n index_1 = q[1]\n before = 0\n for k in waste_2:\n if k < index_1:\n before += 1\n index_2 = index_1 - before\n\n d = index_2 % 3\n print(dict[d])\n", "\r\nfrom collections import deque\r\nn , m , k , t = map(int,input().split())\r\n\r\nwaste = deque()\r\n\r\nfor i in range(k):\r\n x , y = map(int,input().split())\r\n waste.append( (x - 1) * m + y - 1)\r\n\r\nwaste =sorted(waste)\r\n\r\nplant = ['Carrots', 'Kiwis', 'Grapes']\r\nans = deque()\r\nfor i in range(t):\r\n count = 0\r\n x , y = map(int,input().split())\r\n num = (x - 1) * m + y - 1\r\n #print(num)\r\n crop = True\r\n\r\n for j in waste :\r\n if j > num:\r\n break\r\n\r\n elif j == num :\r\n crop = False\r\n break\r\n\r\n else:\r\n count +=1\r\n\r\n if crop :\r\n #print(num , count)\r\n ans.append(plant[(num - count) % 3] )\r\n\r\n else:\r\n ans.append('Waste')\r\n\r\nfor i in ans:\r\n print(i)\r\n\r\n\r\n", "from operator import itemgetter\n\nn, m, k, t = map(int, input().split())\nwaste = []\nfor i in range(0,k):\n a, b = map(int, input().split())\n c = [a-1, b-1];\n waste.append(c)\n\nwaste.sort(key = itemgetter(1))\nwaste.sort(key = itemgetter(0))\n\nwhile (t>0):\n t-=1\n i, j = map(int, input().split())\n i -= 1\n j -= 1\n if [i,j] in waste:\n print(\"Waste\")\n continue\n ctr = 0\n y = 0\n x = 0\n while (y < i):\n ctr += m\n y += 1\n while (y == i and x <= j):\n ctr += 1\n x += 1\n \n for w in waste:\n if (w[0] < i):\n ctr -= 1\n if (w[0] == i and w[1] < j):\n ctr -= 1\n\n if (ctr % 3 == 0):\n print(\"Grapes\")\n if (ctr % 3 == 1):\n print(\"Carrots\")\n if (ctr % 3 == 2):\n print(\"Kiwis\")\n", "n,m,k,t=map(int,input().split())\r\nw=[]\r\nfor _ in range(k):\r\n w.append(list(map(int,input().split())))\r\nw=sorted(w)\r\nr=[\"Carrots\",\"Kiwis\",\"Grapes\"]\r\nfor _ in range(t):\r\n c=list(map(int,input().split()))\r\n if c in w:\r\n print(\"Waste\")\r\n else:\r\n s=0\r\n for i in w:\r\n if(i<c):\r\n s+=1\r\n val=(c[0]-1)*m+c[1]-1-s\r\n print(r[val%3])\r\n\r\n\r\n\r\n" ]

[ "n_k = list(map(int, input().split()))\r\nn = n_k[0]\r\nk = n_k[1]\r\na = list(map(int, input().split()))\r\nmoves = []\r\nfor i in range(k):\r\n minimum = min(a)\r\n maximum = max(a)\r\n instability = maximum - minimum\r\n if instability > 1:\r\n moves.append(f\"{a.index(maximum)+1} {a.index(minimum)+1}\")\r\n a[a.index(maximum)] += -1\r\n a[a.index(minimum)] += 1\r\n \r\n else:\r\n break\r\nminimum = min(a)\r\nmaximum = max(a)\r\ninstability = maximum - minimum\r\nprint(f\"{instability} {len(moves)}\")\r\nfor move in moves:\r\n print(move)", "n, k = map(int, input().split())\r\nv = list(map(int, input().split()))\r\n\r\npairs = [] \r\nm = k\r\nwhile min(v) != max(v) and m > 0:\r\n max_idx = v.index(max(v))\r\n min_idx = v.index(min(v))\r\n v[max_idx] -= 1\r\n v[min_idx] += 1\r\n pairs.append((max_idx, min_idx))\r\n m -= 1\r\n \r\nprint(max(v) - min(v), k-m)\r\nfor p in pairs:\r\n print(p[0]+1, p[1]+1)", "n , k = map(int,input().split())\r\ni = k\r\narr = list(map(int,input().split()))\r\nres = []\r\nwhile i > 0:\r\n x = arr.index(max(arr))\r\n y = arr.index(min(arr))\r\n if x == y:\r\n break\r\n else:\r\n arr[x] -= 1\r\n arr[y] += 1\r\n res.append([x+1,y+1])\r\n i -= 1\r\nprint(max(arr)-min(arr),k-i)\r\nfor i in range(len(res)):\r\n print(*res[i])", "def minimize_instability(n, k, heights):\r\n min_instability = max(heights) - min(heights)\r\n operations = []\r\n\r\n for _ in range(k):\r\n # Find the tallest and shortest towers\r\n tallest_index = heights.index(max(heights))\r\n shortest_index = heights.index(min(heights))\r\n\r\n # If the difference in heights is already minimized, break\r\n if min_instability == 0:\r\n break\r\n\r\n # Move one cube from the tallest tower to the shortest tower\r\n heights[tallest_index] -= 1\r\n heights[shortest_index] += 1\r\n\r\n # Update the minimum instability\r\n current_instability = max(heights) - min(heights)\r\n if current_instability < min_instability:\r\n min_instability = current_instability\r\n\r\n # Append the operation to the list\r\n operations.append((tallest_index + 1, shortest_index + 1))\r\n\r\n return min_instability, len(operations), operations\r\n\r\n# Read input\r\nn, k = map(int, input().split())\r\nheights = list(map(int, input().split()))\r\n\r\n# Minimize instability\r\nmin_instability, num_operations, operations = minimize_instability(n, k, heights)\r\n\r\n# Print the results\r\nprint(min_instability, num_operations)\r\nfor operation in operations:\r\n print(operation[0], operation[1])\r\n" ]

[ "import math\r\nk,n,s,p=map(int,input().split())\r\nprint(math.ceil(k*math.ceil(n/s)/p))\r\n", "from math import ceil\r\n\r\nX = list(map(int, input().split()))\r\nMath = ceil(X[1] / X[2])\r\nMath = ceil(Math * X[0])\r\nprint(ceil(Math / X[3]))\r\n", "# A. Paper Airplanes\n\nk, n, s, p = map(int, input().split())\n\nsheets = (n + s - 1) // s\n\nprint((sheets * k + p - 1) // p)\n\n", "import math\r\na = [int(x) for x in input().split()]\r\n\r\nx = math.ceil(a[1]/a[2])\r\ny = math.ceil((x*a[0])/a[3])\r\n\r\nprint(int(y))", "k, n, s, p = [int(x) for x in input().split()]\r\n\r\nans = ((n + s - 1) // s * k + p - 1) // p\r\nprint(ans)", "import math\nif __name__ == '__main__':\n k, n, s, p = map(int, input().split())\n\n ans = math.ceil(math.ceil(n / s) * k / p)\n print(ans)\n\n\t\t\t\t\t \t\t \t \t \t\t \t \t\t\t", "\nk, n, s, p = input().split()[:4]\nk, n, s, p = int(k), int(n), int(s), int(p)\ntmp = n / s\nif not tmp.is_integer():\n tmp = int(tmp) + 1\nelse:\n tmp = int(tmp)\ntmp *= k\nres = tmp / p\nif not res.is_integer():\n res = int(res) + 1\nelse:\n res = int(res)\nprint(res)\n", "k , n, s, p =map(int,input().split())\r\nif(n%s==0):\r\n x=n//s\r\nelse:\r\n x=n//s + 1\r\nt=k*x\r\nif(t%p==0):\r\n y=t//p\r\nelse:\r\n y=t//p + 1\r\nprint(y)", "from math import ceil\r\nk, n, s, p = [int(i) for i in input().split(\" \")]\r\nprint(ceil(k*ceil(n/s)/p))\r\n", "k,n,s,p=map(int,input().split())\r\neach_p_s=n/s\r\nif each_p_s!=int(each_p_s):\r\n each_p_s=int(each_p_s)+1\r\nsheet=(k*each_p_s)/p\r\nif sheet==int(sheet):\r\n print(int(sheet))\r\nelse:\r\n print(int(sheet)+1)\r\n", "from math import ceil\r\nk,n,s,p = map(int,input().split())\r\nsheetsperperson = ceil(n / s)\r\nprint(ceil((k*sheetsperperson)/p))", "k,n,s,p = map(int,input().split())\r\n\r\nif n % s == 0:\r\n sheetPerPerson = n // s\r\nelse: \r\n sheetPerPerson = n // s + 1\r\n \r\ntotal = sheetPerPerson * k\r\n\r\nif total % p == 0:\r\n print(total // p)\r\nelse:print(total // p + 1)", "k, n, s, p = map(int,input().split())\r\nif n%s==0:\r\n papersperperson = (n//s)\r\nelse:\r\n papersperperson = (n//s)+1\r\npaperneeded = k*papersperperson\r\nadd = 0\r\nif paperneeded%p !=0 :\r\n add = 1\r\nprint((paperneeded//p)+add)", "a,b,c,d=map(int,input().split())\r\nx=b//c\r\nif(b%c!=0):\r\n\tx+=1\r\nx*=a\r\nans=(x//d)\r\nif(x%d!=0):\r\n\tans+=1\r\nprint(ans)", "def solution(l1):\r\n k,n,s,p=l1[0],l1[1],l1[2],l1[3]\r\n \r\n each=int(n/s)+1*(n%s!=0)\r\n total=each*k\r\n ans=int(total/p)+1*(total%p!=0)\r\n return ans\r\n\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n print(solution(l1))\r\n \r\nanswer()", "[k, n, s, p]=map(int, input().split())\r\nif n%s==0:\r\n sheet=(n/s)\r\nelse:\r\n sheet=(n//s)+1\r\nsheet=(n+s-1)//s\r\nans=sheet*k\r\nans=(ans+p-1)//p\r\nprint(ans)", "n = [int(x) for x in input().split()]\r\nsheets = n[1] / n[2]\r\nif sheets > int(sheets):\r\n sheets = int(sheets) + 1\r\nsheets = sheets * n[0]\r\nsheets = sheets / n[3]\r\nif sheets > int(sheets):\r\n sheets = int(sheets) + 1\r\nprint(int(sheets))", "[k,n,s,p]=map(int,input().split())\nif n%s==0:\n x=(n/s)\nelif n%s!=0:\n x=(n//s)+1\nif (x*k)%p==0:\n print(int((x*k)/p))\nelif (x*k)%p!=0:\n print(int((x*k)//p+1))", "[k, n, s, p] = map(int, input().split())\nsheets = n // s\nif n % s != 0:\n sheets += 1\ntotsheets = sheets * k\nans = totsheets // p\nif totsheets % p != 0:\n ans += 1\nprint(ans)\n", "import math\r\n\r\n[a, b, c, d] = map(int, input().split())\r\n\r\nx = math.ceil(b/c)\r\n\r\ny = a * x\r\n\r\nprint(math.ceil(y/d))", "import math\r\nk,n,s,p=map(int,input().split())\r\nprint(math.ceil(((math.ceil(n/s))*k)/p))\r\n", "import math\r\nk , n , s , p = map(int, input().split())\r\nans = math.ceil((math.ceil(n/s)) * k / p)\r\nprint(ans)", "import math\r\n\r\nin_put = str(input(''))\r\nin_put = in_put.split(' ')\r\n\r\nlist = [0,0,0,0]\r\nlist[0] =int(in_put[0])\r\nlist[1] =int(in_put[1])\r\nlist[2] =int(in_put[2])\r\nlist[3] =int(in_put[3])\r\n\r\nk = float(list[0])\r\nn = float(list[1])\r\ns = float(list[2])\r\np = float(list[3])\r\n\r\nresult = math.ceil((math.ceil(n/s)* k )/p)\r\nprint(result ,end = '')", "import math\r\nk,n,s,p = [int(x) for x in input().split()]\r\nprint(math.ceil((k*(math.ceil(n/s)))/p))", "from math import ceil\r\n\r\nk, n, s, p = map(int, input().split())\r\n\r\nl = ceil(n / s) # листов каждому\r\nm = ceil(k * l / p)\r\nprint(m)", "def udiv(a,b):\r\n if a%b==0:\r\n return a//b\r\n return a//b+1\r\nfor jdjjd in range(1):\r\n k,n,s,p=list(map(int,input().split()))\r\n one=udiv(n,s)\r\n all=k*one\r\n print(udiv(all,p))", "import math\r\n\r\nk, n, s, p = map(int, input().split())\r\nsheets_per_person = math.ceil(n / s)\r\ntotal_sheets = k * sheets_per_person\r\npacks = math.ceil(total_sheets / p)\r\nprint(packs)", "k, n, s, p = [int(a) for a in input().split()]\nl = -1\nr = n\nwhile(r - l > 1):\n m = (l + r) // 2\n if m * s >= n:\n r = m\n else:\n l = m\nr = r * k\nif(r % p == 0):\n print(r // p)\nelse:\n print(r // p + 1)\n", "import math\r\nn = [int(x) for x in input().split()]\r\nprint(math.ceil(n[0]*math.ceil(n[1]/n[2])/n[3]))\r\n\r\n\"\"\"1 people = n airplane\r\n = ceil(n/s) sheet\r\nk people = k*ceil(n/s) sheet\r\n1 pack = p sheet\r\nk*ceil(n/s)/p pack = k*ceil(n/s) sheet\"\"\"", "## This is a solution for problem make-planes\r\n# This is nk_ok.py\r\n#\r\n# @author: Nikolay Kalinin\r\n# @date: Mon, 23 Apr 2018 16:28:50 +0300\r\n \r\nk, n, s, p = map(int, input().split())\r\nsheets_per_person = (n + s - 1) // s\r\nsheets = k * sheets_per_person\r\nprint((sheets + p - 1) // p)", "k, n, s, p = map(int, input().split())\r\nfrom math import ceil\r\na = ceil(n / s)\r\na *= k\r\nprint(ceil(a/p))", "k,n,s,p=map(int,input().split())\r\na=(n+s-1)//s\r\nb=k*a\r\nprint((b+p-1)//p)", "import math\n\nk, n, s, p = map(int, input().split())\nfor_1 = math.ceil(n / float(s))\nres = math.ceil((for_1 * k) / float(p))\nprint(res)\n", "k,n,s,p = map(int, input().split())\nq = (n+s-1)//s\nans = (q*k+p-1)//p\nprint(ans)\n", "import math\nk,n,s,p=map(int,list(input().split()))\nprint(math.ceil((k*math.ceil(n/s))/p))\n", "from math import *\r\nk,n,s,p=map(int,input().split())\r\na=ceil(n/s)\r\na*=k\r\nprint(ceil(a/p))\r\n", "[a, b, c, d] = map(int, input().split())\r\nr = (b+c-1)//c\r\nf = r * a\r\nx = (f+d-1)//d\r\nprint (x)\r\n", "from math import ceil as c\r\nk,n,s,p=map(int,input().split())\r\nprint(c(k*c(n/s)/p))", "from math import ceil\r\nk,n,s,p = list(map(int,input().split())) \r\na = ceil(n/s)\r\nprint(ceil(k*a/p))", "k,n,s,p=map(int,input().split())\nprint(((n+s-1)//s*k+p-1)//p)", "k,n,s,p=map(int,input().split())\r\nif n%s==0:\r\n u=n//s\r\nelse:\r\n u=n//s+1\r\ntp=u*k\r\nif tp%p==0:\r\n print(tp//p)\r\nelse:\r\n print(tp//p+1)", "from math import ceil as c;a,b,d,e=map(int,input().split());print(c((c(b/d)*a)/e))", "import math\nx = list(map(int, input().split()))\nprint(math.ceil(x[0] * math.ceil(x[1] / x[2]) / x[3]))\n", "#samolet\r\nin1=input().split(' ')\r\nfor i in range(0,len(in1)):\r\n in1[i]=int(in1[i])\r\nk=in1[0]\r\nn=in1[1]\r\ns=in1[2]\r\np=in1[3]\r\n#input prochitan\r\nlis=n//s\r\nif n%s!=0:\r\n lis+=1\r\nans=(lis*k)//p\r\nif (lis*k)%p!=0:\r\n ans+=1\r\nprint(ans)", "from math import *\r\nk,n,s,p=map(int,input().split())\r\nx=ceil(n/s)\r\nprint(ceil(k*x/p))\r\n", "k, n, s, p = map(int, input().split())\r\n# k - кол-во людей\r\n# n - надо сделать\r\n# s - скок самолетиков\r\n# p - листы\r\nif n % s != 0:\r\n jk = n // s + 1\r\n\r\nelse:\r\n jk = n // s\r\njk = k * jk\r\nif jk % p != 0:\r\n jk = jk // p + 1\r\nelse:\r\n jk = jk // p\r\nprint(jk)\r\n", "from math import ceil\nk,n,s,p=map(int,input().split())\nAa=ceil(n/s) # each person need Aa to build ailplanes\ny=Aa*k\nprint(ceil(y/p)) ", "import math\r\nk, n, s, p = map(int, input().split())\r\nprint(math.ceil(math.ceil(n / s) * k / p))", "#965A\r\n\r\nimport math\r\ns=input()\r\nl=s.split()\r\nk=int(l[0])\r\nn=int(l[1])\r\ns=int(l[2])\r\np=int(l[3])\r\nans=math.ceil((math.ceil(n/s)*k)/p)\r\nprint(ans)\r\n", "k, n, s, p = map(int, input().split())\r\n\r\npn = k * (n // s + (n % s != 0))\r\nprint(pn // p + (pn % p != 0))\r\n", "l = [int(x) for x in input().split() ]\nk = l[0]\nn = l[1]\ns = l[2]\np = l[3]\nx = ((n+s-1)//s)\nprint((k*x+p-1)//p)\n\n", "import math\r\nk, s, n, p = map(int,input().split())\r\nnc = 1 if n > s else math.ceil(s/n)\r\nprint(math.ceil((k*nc)/p))", "import math\r\n\r\nk,n,s,p = input().split()\r\nk = int(k) #no of person\r\nn = int(n) #no of planes each will make\r\ns = int(s) #no of planes that can be made in one sheet\r\np = int(p) #no of sheet in one pack\r\n\r\nsheet_for_each_person = math.ceil(n/s)\r\n# print(sheet_for_each_person)\r\ntotal_sheets_required = k*sheet_for_each_person\r\n# print(total_sheets_required)\r\nno_of_packs = math.ceil( total_sheets_required/p )\r\nprint(no_of_packs)", "from math import *\r\nk,n,s,p = map(int, input().split())\r\nprint(ceil((k*ceil(n/s))/p))", "import sys\r\nimport math\r\narray = input().split(' ')\r\nfor i, val in enumerate(array):\r\n array[i] = int(val)\r\nnumPeople = array[0]\r\nnumQuota = array[1]\r\nnumPlanespace = array[2]\r\nnumPackSheets = array[3]\r\n\r\nsheetPerPerson = math.ceil(numQuota/numPlanespace)\r\nsheetsTotal = sheetPerPerson*numPeople\r\noutputPacks = math.ceil(sheetsTotal/numPackSheets)\r\n\r\nprint(outputPacks)", "import math\r\na,b,c,d=map(int,input().split())\r\nprint(math.ceil((( math.ceil(b/c))*a)/d))\r\n", "from sys import stdin,stdout\nfrom math import ceil\nnmbr = lambda: int(stdin.readline())\nlst = lambda: list(map(int, stdin.readline().split()))\nfor _ in range(1):#nmbr()):\n k,n,s,p=lst()\n spp=ceil(n/s)\n tots=spp*k\n print(ceil(tots/p))\n\t\t\t\t\t\t\t\t\t \t \t \t \t \t \t\t \t\t", "k,n,s,p=[int(x) for x in input().split()]\r\n\r\neach=n//s\r\nif n%s!=0:\r\n each+=1\r\ntotal=k*each\r\n\r\nans=total//p\r\nif total%p!=0:\r\n ans+=1\r\nprint(ans)\r\n ", "\r\nfrom math import ceil\r\nk,n,s,p=map(int,input().split())\r\nprint(ceil((k*(ceil(n/s)))/p))", "k, n, s, p = map(int, input().split())\r\na = (n + s - 1) // s\r\nb = k * a\r\nc = (b + p - 1) // p\r\nprint(c)", "from math import ceil\r\n\r\nw, x, y, z = [int(x) for x in input().split()]\r\nout = int(ceil(ceil(x/y)*w/z))\r\nprint(out)", "k, n, s, p = [int(s) for s in input().split(\" \")]\r\ntot = (n+s-1)//s\r\nans = (k*tot+p-1)//p\r\nprint(ans)", " #Author: Adisbek\r\nk,n,s,p=map(int,input().split())\r\nd=int((n+s-1)/s)\r\nf=int((d*k+p-1)/p)\r\nprint(f)\r\n", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nfrom math import ceil as c\r\nk,n,s,p=map(int,input().split())\r\nprint(c((c(n/s)*k)/p))", "import sys\n\ndef packs(k, n, s, p):\n x = (n + s - 1) // s\n return (k * x + p - 1) // p\n\nk, n, s, p = map(int, sys.stdin.readline().strip().split())\nprint(packs(k, n, s, p))\n", "from math import ceil\nk, n, s, p = (int(x) for x in input().split())\nprint(int(ceil(k * ceil(n / s) / p)))", "import math\r\nk,n,s,p=map(int,input().split())\r\nx=math.ceil(n/s)\r\ny=x*k\r\nc=math.ceil(y/p)\r\nprint(c)", "import math\r\nk,n,s,p = map(int,input().split())\r\nz = math.ceil(n/s)\r\nprint(math.ceil((k*z)/p))\r\n", "k, n, s, p = map(int, input().split())\r\nsl = n // s * k\r\nif n % s != 0: sl += k\r\nif sl % p == 0: print(sl // p)\r\nelse: print(sl // p + 1)", "import math\r\nf=lambda:map(int,input().split())\r\nk,n,s,p=f()\r\nprint(math.ceil((k*math.ceil(n/s))/p))", "import math\r\nc=0\r\nd=0\r\nx= input()\r\np= x.split()\r\nk= int(p[0])\r\nn= int(p[1])\r\ns= int(p[2])\r\np= int(p[3])\r\nspp= math.ceil(n/s)\r\nts= spp*k\r\nans= math.ceil(ts/p)\r\nprint(ans)", "'''\r\n#include<bits/stdc++.h>\r\n#define elif else if\r\nusing namespace std;\r\ntypedef long long ll;\r\ntypedef unsigned long long ull;\r\n\r\nint main()\r\n{\r\n double s, n, k, p;\r\n cin >> k >> n >> s >> p;\r\n printf(\"%lld\", ceil(ceil(n / s) * k / p));\r\n return 0;\r\n}\r\n'''\r\nimport math\r\ni = input().split(' ')\r\nk = eval(i[0])\r\nn = eval(i[1])\r\ns = eval(i[2])\r\np = eval(i[3])\r\n\r\nans=math.ceil(math.ceil(n/s)*k/p)\r\nprint(ans)", "\r\nkala,wala,iota,pot = map(int,input().split())\r\n\r\nif int(wala%iota) == 0:\r\n n=int(wala/iota)\r\nelse:\r\n n=int(wala/iota)+1\r\n\r\nlamp=(kala*(n))/pot\r\njug=(kala*(n))%pot\r\n\r\nif jug==0:\r\n print(int(lamp))\r\nelse:\r\n print(int(lamp)+1)\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\nimport math\r\n\r\ndef main(k, n, s, p):\r\n res = math.ceil(math.ceil(n / s) * k / p)\r\n stdout.write(str(res))\r\n \r\nif __name__ == '__main__':\r\n main(*map(float, stdin.readline().rstrip().split()))", "from math import ceil\r\nn, k, s, p=map(int, input().split())\r\n\r\nd=ceil(k/s) #Page required to make k planes by one person\r\npages=n*d\r\n\r\nprint(ceil(pages/p))", "#\n# from math import ceil\n#\n# n, m, k, l = map(int, input().split())\n#\n# to_give = int(ceil((l+k)/m))\n#\n# if (to_give*m) > n:\n# print(-1)\n# else:\n# print(to_give)\n\nfrom math import ceil\nk, n, s, p = map(int, input().split())\n\nsheets_for_one_person = int(ceil(n/s))\n\nprint(int(ceil((k*sheets_for_one_person)/p)))", "import math;x=1\r\nk,n,s,p=map(int,input().split())\r\nprint(math.ceil((k*math.ceil(n/s))/p))\r\n ", "def problem():\n k,n,s,p = map(int,input().split(' '))\n r = k\n if n>s:\n if n%s:\n r *= n//s+1\n else:\n r *= n//s\n else:\n r *= 1\n if r>p:\n if r%p:\n solution = r//p+1\n else:\n solution = r//p\n else:\n solution = 1\n return solution\n\nsolution = problem()\n\nprint(solution)\n", "import math\r\n\r\n[k,n,s,p] = map(int, input().split())\r\n\r\nprint(math.ceil((math.ceil(n/s)*k)/p)) ", "[k, n, s, p] = [int(x) for x in input().split()]\r\nprint(((n+s-1)//s*k+p-1)//p)\r\n", "k, n, s, p = map(int, input().split())\r\nperperson = (n + s - 1) // s\r\nsheets = k * perperson\r\nprint((sheets + p - 1) // p)", "k,n,s,p=map(int,input().split(' '))\r\nif (1*n)%s==0:\r\n need=(1*n)//s\r\n if need==0 and k%p==0:\r\n print(k//p)\r\n elif (k*need)%p==0:\r\n print((k*need)//p)\r\n else:\r\n print(((k*need)//p)+1) \r\nelse:\r\n need=((1*n)//s)+1\r\n if need==0 and k%p==0:\r\n print(k//p)\r\n elif (k*need)%p==0:\r\n print((k*need)//p)\r\n else:\r\n print(((k*need)//p)+1) ", "from math import *\r\nR = lambda: map(int, input().split())\r\nk, n, s, p = R()\r\nm = ceil(n/s)\r\nl = ceil(k*m)\r\nb = ceil(l/p)\r\nprint(b)", "import math\n[k, n, s, p] = map(int, input().split())\n#k = number of people, n = number of airplanes each person makes, s = number of airplanes per sheet, p = number of sheets per package\nsheets_per_person = math.ceil(n/s)\ntotal_sheets = k * sheets_per_person\nprint(math.ceil(total_sheets/p))", "# CODEFORCES\r\n# Paper Airplanes (965A)\r\nimport math\r\nk,n,s,p = map(int,input().split())\r\n\r\n# calculate max. sheets needed by first finding total airplanes made\r\n# and then dividing by no. of airplanes can be made from each sheet\r\nmax_sheets = math.ceil((k*n)/s)\r\n\r\nsheets_for_each = math.ceil(max_sheets/k)\r\n\r\n# dividing total sheets by no. of sheets in a pack gives min. no. of pack needed\r\nprint(math.ceil((sheets_for_each * k)/p))", "import math\r\nk, n, s, p=map(int, input().split())\r\ntotalPlanes=k*n\r\nsheetsForPlanes=math.ceil(math.ceil(totalPlanes/s)/k)*k\r\nnoOfPacks=math.ceil(sheetsForPlanes/p)\r\nprint(noOfPacks)\r\n", "from math import ceil\r\nk,n,s,p=map(int,input().split())\r\nt=ceil(n/s)*k\r\nprint(ceil(t/p))", "from sys import stdin\nfrom math import ceil\ndef main():\n\tk, n, s, p = [int(x) for x in stdin.readline().rstrip().split()]\n\ta = ceil(n/s)\n\tb = a*k\n\tres = ceil(b/p)\n\tprint(res)\n\nif __name__ == '__main__':\n\tmain()", "# https://codeforces.com/problemset/problem/965/A\r\nimport math\r\nd = input()\r\nk, n, s, p = map(int, d.split(\" \"))\r\nresult = math.ceil((math.ceil(n/s) * k)/p)\r\nprint(result)\r\n", "import math as m\r\nk,n,s,p = map(int,input().split())\r\nsheets = m.ceil(n/s)\r\ntotal_sheets = k*sheets\r\nprint(m.ceil(total_sheets/p))", "import math\r\n\r\nk,n,s,p=map(int,input().split())\r\n\r\nprint(math.ceil((k/p) * (math.ceil(n/s))))", "import math\r\nk, n, s, p = (int(x) for x in input().split())\r\nans = math.ceil((math.ceil(n/s) * k) / p)\r\nprint(ans)", "k,n,s,p=input().split()\r\nk,n,s,p=int(k),int(n),int(s),int(p)\r\nprint(int((int(n/s +(n%s>0))*k/p)+((int(n/s+(n%s>0))*k%p)>0)))\r\n", "import math\r\nk, n, s, p = [int(x) for x in input().split(' ')]\r\ny = math.ceil(k * math.ceil(n / s) / p)\r\nprint(y)", "import math\r\n[k, n, s, p] = map(int, input(). split())\r\na = math.ceil(n / s) * k\r\nprint (math.ceil(a/p))\r\n\r\n", "k,n,s,p = map(int, input().split())\r\npack = (n+s-1)//s\r\npack = k*pack\r\nprint((pack+p-1)//p)", "k,n,s,p=map(int,input().split())\r\nans=-n//s*k//p\r\nprint(-ans)\r\n\r\n", "import math\r\nk,n,s,p=map(int,input().split())\r\nprint(math.ceil((k*(math.ceil(n/s)))/p))", "k, n, s, p = map(int, input().split())\r\nprint(((n + s - 1) // s * k + p - 1) // p)", "import math\r\nk, n, s, p = [int(x) for x in input().split()]\r\nprint(math.ceil(k*math.ceil(n/s)/p))\r\n", "#!/usr/bin/env python3\n# -*- encoding: utf-8 -*-\n\nimport sys\n\ndef main():\n k, n, s, p = map(int, sys.stdin.readline().split())\n spp = n // s if not n % s else n//s +1\n tmp = spp * k // p\n tmp = tmp if not ((spp * k) % p) else tmp +1\n print(tmp)\n\nmain()\n", "from math import ceil\r\nk,n,s,p = map(int,input().split())\r\nx = ceil(n/s)\r\ny = k * x\r\nz = ceil(y/p)\r\nprint(z)", "import math\r\n\r\nk, n, s, p = map(int,input().split())\r\nx = math.ceil(n /s)\r\nx = x * k\r\nx = math.ceil(x / p)\r\nprint(x)\r\n", "import math\n[k,n,s,p]=map(int, input() .split())\nprint(math.ceil(k*math.ceil(n/s)/p))\n", "k, n, s, p = map(int, input().split())\nif n % s == 0:\n ans = n // s\nelse:\n ans = n // s + 1\nans *= k\nif ans % p == 0:\n ans //= p\nelse:\n ans = ans // p + 1\nprint(ans)\n", "import math\r\n\r\nnumbers = input()\r\n\r\nnumbers_list = []\r\n\r\nauxiliar_number = \"\"\r\n\r\nsheets_per_person = 0\r\n\r\npacks = 0\r\n\r\nfor i in range(0, len(numbers)):\r\n\r\n\tif numbers[i] != \" \":\r\n\r\n\t\tauxiliar_number = auxiliar_number + numbers[i]\r\n\r\n\t\tif i == len(numbers) - 1:\r\n\r\n\t\t\tnumbers_list.append(int(auxiliar_number))\r\n\r\n\telse:\r\n\r\n\t\tnumbers_list.append(int(auxiliar_number))\r\n\r\n\t\tauxiliar_number = \"\"\r\n\r\nif numbers_list[2] / numbers_list[1] < 1:\r\n\r\n\tsheets_per_person = int(math.ceil(numbers_list[1] / numbers_list[2]))\r\n\r\nelse:\r\n\r\n\tsheets_per_person = 1\r\n\r\npacks = int(math.ceil(sheets_per_person * numbers_list[0] / numbers_list[3]))\r\n\r\nprint(packs)", "import math\nx=list(map(int,input().split()))\nnum_p,n_planes_per_person,n_planes_per_sheet,n_sheet_per_packs=x[0],x[1],x[2],x[3]\nnum_paper_needed_each=math.ceil(n_planes_per_person/n_planes_per_sheet)\nnum_paper_needed=num_paper_needed_each*num_p\nnum_pack_needed=math.ceil(num_paper_needed/n_sheet_per_packs)\nprint(num_pack_needed)\n", "k, n, s, p = map(int, input().split())\r\nss = (n + s - 1)//s\r\n\r\nprint((k * ss + p - 1)//p)\r\n", "[people,airplaneNum,oneSheet,sheetsInPack] = map(int,input().split())\nn=0\nwhile True:\n n=n+1\n if (oneSheet*n)//airplaneNum>=1:\n break\nif (people*n)/sheetsInPack>(people*n)//sheetsInPack:\n print(((people*n)//sheetsInPack)+1)\nelse:\n print(((people*n)//sheetsInPack))", "import math\r\nk,n,s,p=map(int,input().split())\r\np1=math.ceil(n/s)\r\np2=(p1*k)\r\nprint(math.ceil(p2/p))\r\n\r\n \r\n", "k, n, s, p = [int(a) for a in input().split()]\r\nif n % s == 0 and (n / s) * k % p == 0:\r\n print(int(n / s * k / p))\r\nelif n % s == 0 and (n / s) * k % p != 0:\r\n print(int((n / s) * k // p + 1))\r\nelif n % s != 0 and (n // s + 1) * k % p == 0:\r\n print(int((n // s + 1) * k / p))\r\nelse:\r\n print(int((n // s + 1) * k // p + 1))\r\n", "k,n,s,p=map(int,input().split())\r\n# k=number of people n= amount of airplanes per person s=airplanes per sheet p= sheets per pack\r\n#5 3 100 1\r\n\r\n\r\nif n%s==0:\r\n l=(n//s)\r\nelse:\r\n l=(n)//s+1\r\ng=l*k\r\nif g%p==0:\r\n print(g//p)\r\nelse:\r\n print(g//p+1)", "import math\r\n\r\nk, n, s, p = map(int, input().split())\r\n\r\ntotal_sheets = k * ((n + s - 1) // s)\r\npacks = math.ceil(total_sheets / p)\r\n\r\nprint(packs)", "k, n, s, p = map(int,input().split())\r\nprint(int(((n+s-1)//s*k+p-1)//p))", "from math import ceil\r\nk , n , s , p = list(map(int,input().split()))\r\na = ceil(n/s)\r\nb = ceil((k*a)/p)\r\nprint(b)", "k,n,s,p = map(int,input().split())\r\nsheets = k * ((n + s - 1) // s)\r\npacks = (sheets + p - 1) // p\r\nprint(packs)", "k, n, s, p = map(int, input().split())\r\n\r\n# peop, plane, one page, package\r\n\r\nprint((k*((n-1)//s+1)-1)//p+1)\r\n \r\n", "k, n, s, p = map(int, input().split())\r\nif n % s == 0:\r\n moo = n // s\r\nelse:\r\n moo = n // s + 1\r\npor = moo * k\r\nif por % p == 0:\r\n print(por // p)\r\nelse:\r\n print(por // p + 1)", "k,n,s,p = map(int, input().split())\n\nif n%s==0:\n\ta = n//s\nelse:\n\ta = n//s+1\n\nb = a*k\n\nif b%p ==0:\n\tc = b//p\nelse:\n\tc = b//p+1\n\nprint(c)", "[k, n, s, p,] = map(int, input().split())\r\nsheets = n//s\r\nif n%s != 0:\r\n sheets +=1 \r\ntotsheets = sheets * k \r\nans = totsheets //p \r\nif totsheets % p != 0:\r\n ans += 1 \r\nprint (ans)", "k,n,s,p=map(int,input().split())\r\nif n%s==0:\r\n\tt=n//s\r\nelse:\r\n\tt=n//s+1\r\nif (t*k)%p==0:\r\n\tprint(t*k//p)\r\nelse:\r\n\tprint(t*k//p+1)", "import math as m\r\nk,n,s,p=map(int,input().split())\r\nprint(m.ceil(k*m.ceil(n/s)/p))", "#!/usr/bin/env python3\nfrom typing import Dict, List, Tuple\n\n\ndef input_lst() -> List[int]:\n return [int(x) for x in input().split()]\n\ndef print_out(res: List[int]):\n print(' '.join([str(x) for x in res]))\n\ndef main():\n\n k, n, s, p = (int(x) for x in input().split())\n lists_needed_for_each = (n) // (s)\n lists_needed_for_each += (0 if (n) % (s) == 0 else 1)\n x = (lists_needed_for_each * k) // p\n x += (0 if (lists_needed_for_each*k) % (p) == 0 else 1)\n #x = x * k\n #res = [0]\n #times = input_lst()\n #s = list(input())\n\n\n\n\n print(x)\n\n\n #print_out(res)\n\n\nif __name__ == '__main__':\n main()\n", "k, n, s, p = list(map(int, input().split()))\r\nprint(int((k*int((n+s-1)/s)+p-1)/p))", "k,n,s,p=map(int,input().split())\r\nprint(-(-n//s*k//p))", "import math\r\n\r\nk, n, s, p = map(int, input().split(\" \"))\r\nperpers = math.ceil(n/s)\r\ntot = perpers*k\r\ntotalpacks = math.ceil(tot/p)\r\n\r\nprint(totalpacks)\r\n", "k,n,s,p=map(int, input().split())\r\nprint((((n+s-1)//s)*k+p-1)//p)", "import math\r\ns = input().split()\r\nprint(int(math.ceil(int(s[0])*math.ceil(int(s[1])/int(s[2]))/int(s[3]))))", "import math\r\nk,n,s,p=map(int, input().split())\r\na=math.ceil(n/s)\r\nb=k*a\r\nc=math.ceil(b/p)\r\nprint(c)", "import math\r\nk,n,s,p = map(int,input().split())\r\nt = math.ceil(n/s)\r\nm = math.ceil((k*t)/p)\r\nprint(m)", "k, n, s, p = map(int, input().split())\nsheets_per_person = (n + s - 1) // s\nsheets_total = sheets_per_person * k\npackages = (sheets_total + p - 1) // p\nprint(packages)\n", "k,n,s,p=map(int,input().split())\r\nprint(0--(0--n//s*k)//p)", "from math import ceil\r\nk, n, s, p = map(int, input().split())\r\nprint(ceil(ceil(n/s)*k/p))", "import math\r\nk,n,s,p=[int(x) for x in input().split()]\r\nprint(math.ceil((math.ceil(n/s)*k)/p))", "k,n,s,p=map(int,input().split())\r\n\r\n#k,n,s,p=10,6,2,10\r\nif int(n/s)==n/s:\r\n u=(n/s)*k/p\r\n #print(u)\r\nelse:\r\n u= (int(n/s)+1)*k/p\r\n #print(u)\r\n\r\nif int(u)==u:\r\n print(int(u))\r\nelse:\r\n print(int(u)+1)", "from math import ceil\r\ndef paper(a,b,c,d):\r\n return ceil((a*(ceil(b/c)))/d)\r\n\r\na,b,c,d=map(int,input().strip().split())\r\nprint(paper(a,b,c,d))", "import re\r\n\r\nreadin = input()\r\nlists = re.split(r'[ ]', readin)\r\nlists = list(map(int, lists))\r\nans = 0\r\nif (lists[1] % lists[2] == 0):\r\n ans = int(lists[1] / lists[2])\r\nelse:\r\n ans = int(lists[1] / lists[2]) + 1\r\nans *= lists[0]\r\nif (ans % lists[3] == 0):\r\n ans = int(ans / lists[3])\r\nelse:\r\n ans = int(ans / lists[3]) + 1\r\nprint(ans)\r\n", "from math import ceil\nk, n, s, p = list(map(int, input().split()))\nprint(ceil(ceil(n/s)*k/p))\n", "k, n, s, p = map(int, input().split())\r\n#number of paper needed to make everyones plane\r\nif n%s==0:\r\n PapersPerPerson = (n//s)\r\nelse: \r\n PapersPerPerson = (n//s)+1\r\n#print(PapersPerPerson)\r\nPaperNeeded = k*PapersPerPerson\r\nadd = 0\r\nif PaperNeeded%p != 0 :\r\n add = 1\r\nprint((PaperNeeded//p)+add)", "k, n, s, p = map(int, input().split())\r\n\r\nif n % s == 0:\r\n g = n // s\r\nelse:\r\n g = n // s + 1\r\n\r\ng *= k\r\n\r\nif g % p == 0:\r\n ans = g // p\r\nelse:\r\n ans = g // p + 1\r\n\r\nprint(ans)", "# Hydro submission #615819a06f84bc7c1bfa5b21@1633163681185\ninp=input().split()\r\narr=[int(i)for i in inp]\r\nif arr[1]<arr[2]:\r\n a=1\r\nelse:\r\n a=arr[1]//arr[2]\r\n if arr[1] % arr[2] != 0:\r\n a += 1\r\nb=a*arr[0]\r\nif arr[3]>b:\r\n c=1\r\nelse:\r\n c = b // arr[3]\r\n if b % arr[3] != 0:\r\n c += 1\r\nprint(c)", "[k,n,s,p]= map(int,input().split())\r\nif n%s==0:\r\n paperpperson = n//s\r\nelse:\r\n paperpperson = n//s+1\r\ntotalpaper=paperpperson*k\r\nif totalpaper%p==0:\r\n print(totalpaper//p)\r\nelse:\r\n print(totalpaper//p+1)", "k, n, s, p = [int(x) for x in input().split()]\r\npapers = (n + s - 1)//s * k\r\nans = (papers + p - 1)//p\r\nprint(ans)\r\n", "import math\r\n[k,n,s,p] = map(int, input().split())\r\nprint(math.ceil((k*(math.ceil(n/s)))/p))", "k, n, s, p = (int(i) for i in input().split(' '))\r\nfrom math import ceil\r\nprint(ceil(ceil(n / s) * k / p))", "import math\n\nk, n, s, p = map(int, input().split(' '))\nsheetPerPerson = math.ceil(n / s)\ntotalNumberOfSheetRequired = sheetPerPerson * k\nstacksRequired = math.ceil(totalNumberOfSheetRequired / p)\nprint(stacksRequired)", "from math import *\r\n\r\nk, n, s, p = map(int,input().split())\r\n\r\n\r\nprint((k * ((n+(s-1))//s) + (p-1))//p)", "k,n,s,p=map(int,input().split())\r\nimport math\r\nans=(math.ceil((n)/s)*k)\r\nans=math.ceil((ans)/p)\r\nprint(ans)", "\r\n\r\nk, n, s, p = [ int(w) for w in input().split() ]\r\n\r\nneeds = 1 + (n-1) // s\r\nsum = needs * k\r\nbuy = 1 + ( sum - 1 ) // p\r\n\r\nprint(buy)", "k,n,s,p = map(int,input().split())\n# print(k,n,s,p)\nimport math\nprint(math.ceil(math.ceil(n/s)*k/p))\n", "k,n,s,p = map(int,input().split())\r\nprint(int((int((n+s-1)/s)*k+p-1)/p))", "import math\r\nk, n, s, p = map(int, input().split())\r\nD = math.ceil(math.ceil(n/s)*k/p)\r\nprint(D)\r\n", "k,n,s,p = map(int,input().split())\r\nsheetsperperson = (n+s-1)//s\r\nsheets = k*sheetsperperson\r\nprint((sheets+p-1)//p)\r\n\r\n\r\n", "k, n, s, p = map(int, input().split())\r\na = 0\r\nif n % s == 0:\r\n a = n // s\r\nelse:\r\n a = n // s + 1\r\n\r\na *= k\r\nif a % p == 0:\r\n print(a // p)\r\nelse:\r\n print(a // p + 1)", "# Paper Airplanes\n[k,n,s,p] = map(int,input().split())\nprint((k * ((n + s - 1) // s) + p - 1) // p)\n", "import math\r\nk,n,s,p=map(int,input().split())\r\nx=math.ceil(n/s)\r\ny=x*k\r\nz=math.ceil(y/p)\r\nprint(z)\r\n \r\n", "from math import ceil\r\nk, n, s, p = map(int, input().split(\" \"))\r\n\r\npapers_per_person = ceil(n / s)\r\ntotal_papers = papers_per_person * k\r\ntotal_packs = ceil(total_papers / p)\r\nprint(total_packs)\r\n", "S=input().split(' ')\r\nk,n,s,p=int(S[0]),int(S[1]),int(S[2]),int(S[3])\r\nFT=(n-1)//s+1\r\n#print(FT)\r\nFT*=k\r\n#print(FT)\r\nP=(FT-1)//p+1\r\nprint(P)", "k, n, s, p = map(int, input().split()) \r\nx = k*(n//s + (1 if n%s else 0)) \r\nprint((x//p + (1 if x%p else 0))) ", "def paperPlane(a):\r\n k, n, s, p = a[0], a[1], a[2], a[3]\r\n if n%s != 0:\r\n pr = (n//s) + 1\r\n else:\r\n pr = (n//s)\r\n pps = k* pr\r\n if pps % p != 0:\r\n return (pps // p) + 1\r\n else:\r\n return (pps // p)\r\n\r\narr = list(map(int, input().split()))\r\nprint(paperPlane(arr))", "k,n,s,p = input().split()\nk = int(k)\nn = int(n)\ns = int(s)\np = int(p)\n\nif n % s == 0:\n\twk1 = n // s\nelse:\n\twk1 = n // s + 1\n\nwk1 = wk1 * k\nif wk1 % p == 0:\n\tans = wk1 // p\nelse:\n\tans = wk1 // p +1\n\nprint(ans)\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\nk, n, s, p = map(int, input().split())\r\nprint(int(math.ceil((k * math.ceil(n / s)) / p)))\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "x=list(map(int,input().split()))\nneed=1\nn=1\nimport math\nif x[1]>x[2]:\n need=math.ceil(x[1]/x[2])\nif x[0]>=x[3]:\n n=math.ceil((need*x[0])/x[3])\nprint(n)", "from math import *\r\nk, n, s, p = map(int, input().split())\r\np1 = int(ceil(n/s))*k\r\nprint(int(ceil(p1/p)))\r\n", "from math import *\r\nk,n,s,p=map(int,input().split())\r\nprint(ceil((ceil(n/s)*k)/p))\r\n", "[k, n, s, p] = [int(x) for x in input().split(' ')]\r\nndivs = n // s + (0 if n % s == 0 else 1)\r\npacks = k * ndivs // p + (0 if k * ndivs % p == 0 else 1)\r\nprint(packs)", "import math\r\nk,n,s,p=map(int,input().split())\r\nsheets = k*math.ceil(n/s)\r\nprint(math.ceil(sheets/p))", "k,n,s,r=map(int,input().split())\r\nprint(-(-n//s*k//r))", "from math import ceil\r\n\r\nk, n, s, p = [int(c) for c in input().split()]\r\nres = ceil(int(ceil(n / s)) * k / p)\r\nprint(res)\r\n", "k, n, s, p = map(int,input().split())\r\npapers_for1 = (n + s - 1) // s\r\nbox = (k * papers_for1 + p - 1) // p\r\n\r\nprint(box)\r\n", "k, n, s, p = [int(i) for i in input().split()]\r\nif(n % s == 0):\r\n a = n//s\r\nelse:\r\n a = n//s + 1\r\nif (k*a % p == 0):\r\n print(k*a // p)\r\nelse:\r\n print(k*a//p + 1)", "k,n,s,p=map(int,input().split())\r\nprint((k*((n+s-1)//s)+p-1)//p)", "S=input().split(' ')\r\nk,n,s,p=int(S[0]),int(S[1]),int(S[2]),int(S[3])\r\nFT=(n+s-1)//s\r\n#print(FT)\r\nFT*=k\r\n#print(FT)\r\nP=(FT+p-1)//p\r\nprint(P)", "k, n, s, p = map(int, input().split())\r\nL = (n - 1) // s + 1\r\nL *= k\r\nprint((L - 1) // p + 1)", "import math\r\n[k, n, s, p] = map(int, input(). split())\r\naj = math.ceil(n / s) * k\r\nprint (math.ceil(aj/p))\r\n\r\n", "\r\nimport math\r\ndef ok(k,n,s,p):\r\n c1=k*math.ceil(n/s)\r\n return math.ceil(c1/p)\r\n \r\nk,n,s,p=map(int,input().split())\r\nprint(ok(k,n,s,p))\r\n", "k, n, s, p = map(int, input().split())\r\nl = 0\r\nr = 10 ** 9\r\nwhile (r - l != 1):\r\n m = (l + r) // 2\r\n if ((p * m // k) * s >= n):\r\n r = m\r\n else:\r\n l = m\r\nprint(r)", "from math import ceil\r\nn,k,s,p = [int(i) for i in input().split()]\r\nsheet =0\r\nrem = 0\r\nif k>=s:\r\n if k%s==0 :\r\n sheet = k//s\r\n rem = k%s\r\n else:\r\n sheet =k//s+1\r\n rem = k%s\r\nelse:\r\n sheet = 1\r\nsheet*=n\r\nif sheet%p==0:\r\n print(sheet//p)\r\nelse:\r\n print(ceil(sheet/p))", "k, n, s, p = map(int, input().split())\r\nl = (n + s - 1) // s\r\nl *= k\r\nans = (l + p - 1) // p\r\nprint(ans)", "k, n, s, p = map(int,input().split())\r\n\r\nair = k * n\r\nfp = n//s\r\nif n % s != 0:\r\n fp += 1\r\neh = fp * k\r\nq = eh//p\r\nif eh%p != 0:\r\n q += 1\r\nprint(q)\r\n", "import math\r\nline = input()\r\nk, n, s, p = [int(el) for el in line.split(\" \")]\r\nprint(math.ceil(math.ceil(n/s)*k/p))\r\n", "\r\nk, n, s, p = map(int, input().split())\r\n\r\nif n % s == 0:\r\n\td = n // s\r\nelse:\r\n\td = n // s + 1\r\n\r\nn_sheets = k * d\r\n\r\nif n_sheets % p == 0:\r\n\tprint(n_sheets // p)\r\nelse:\r\n\tprint(n_sheets // p + 1)", "k,n,s,p=map(int,input().split())\r\nif n%s==0:\r\n r=n//s\r\nelse:\r\n r=n//s+1\r\nt=r*k\r\nif t%p==0:\r\n print(t//p)\r\nelse:\r\n print(t//p+1)\r\n", "from math import *\r\n\r\na,b,c,d=map(int, input().split())\r\nx=ceil(b/c) #number of sheets one person needs\r\ny=a*x #total sheets\r\nz=ceil(y/d)\r\nprint(z)", "import math\r\nk,n,s,p=[int(x) for x in input().split()]\r\nx=math.ceil(n/s)\r\ny=math.ceil(x*k/p)\r\nprint(y)", "import math\r\ndef solve():\r\n words = input().split()\r\n people = int(words[0])\r\n planes_each = int(words[1])\r\n per = int(words[2])\r\n sheets = int(words[3])\r\n sheets_per_person = math.ceil(planes_each/per)\r\n needed = sheets_per_person*people\r\n packs = math.ceil(needed/sheets)\r\n print(packs)\r\n\r\n \r\n\r\n# for _ in range(int(input())):\r\nsolve()", "import math\r\nk,n,s,p=map(int,input().split())\r\nu=math.ceil(n/s)\r\nans=k*u\r\nprint(math.ceil(ans/p))", "(people, airplanes_each_people_make, airplanes_in_1_sheets, sheets_in_1_pack) = map(int, input().split(' '))\n\nif airplanes_in_1_sheets >= airplanes_each_people_make:\n total_needed_sheets = people\n if total_needed_sheets % sheets_in_1_pack == 0:\n print(total_needed_sheets // sheets_in_1_pack)\n else:\n print(total_needed_sheets // sheets_in_1_pack + 1)\n\nelse:\n if airplanes_each_people_make % airplanes_in_1_sheets == 0:\n total_needed_sheets = airplanes_each_people_make // airplanes_in_1_sheets * people\n if total_needed_sheets % sheets_in_1_pack == 0:\n print(total_needed_sheets // sheets_in_1_pack)\n else:\n print(total_needed_sheets // sheets_in_1_pack + 1)\n else:\n total_needed_sheets = (airplanes_each_people_make // airplanes_in_1_sheets + 1) * people\n if total_needed_sheets % sheets_in_1_pack == 0:\n print(total_needed_sheets // sheets_in_1_pack)\n else:\n print(total_needed_sheets // sheets_in_1_pack + 1)\n", "import math\r\nk,n,s,p=map(int,input().split())\r\na=math.ceil(n/s)\r\nb=a*k\r\nc=math.ceil(b/p)\r\nprint(c)", "[k,n,s,p] = map(int,input().split())\r\nif n%s == 0:\r\n x = (n/s*k) \r\nelse:\r\n x = ((n//s+1)*k) # need to round up\r\n\r\nif x%p == 0:\r\n print(int(x/p))\r\nelse:\r\n print(int(x//p+1)) # need to round up", "from math import ceil\r\nk,n,s,p=map(int,input().split())\r\nprint(ceil(k*(ceil(n/s))/p))\r\n", "import math\r\n\r\nq = input().split(\" \")\r\n\r\nk = int(q[0])\r\nn = int(q[1])\r\ns = int(q[2])\r\np = int(q[3])\r\n\r\nc= 1\r\n\r\nif n>s:\r\n\twhile n>s:\r\n\t\tc+=1\r\n\t\tn=n-s\r\nk = k*c\r\nprint(math.ceil(k/p))\r\n", "from math import ceil\r\nk,n,s,p=map(int,input().split())\r\nprint(ceil(ceil(n/s)*k/p))", "import math\r\n\r\nwhile True:\r\n try:\r\n k,n,s,p = map(float,input().strip().split())\r\n\r\n ans = math.ceil(math.ceil(n / s) * k / p)\r\n print(\"%.0f\"%ans)\r\n except:\r\n break", "import math\nk, n, s, p = map(int, input().split())\nsheets = math.ceil(n/s) * k\nprint(math.ceil(sheets/p))\n \t \t\t\t\t\t\t\t\t\t\t \t \t\t \t\t\t\t", "import itertools\r\n\r\n\r\ndef main():\r\n k , n, s, p = [int(v) for v in input().split()]\r\n r = n//s if n%s==0 else n//s+1\r\n v = (r*k) // p if (r*k) % p == 0 else (r*k) // p + 1\r\n print(v)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import ceil\n\nargs = [int(x) for x in input().split(' ')]\nk = args[0]\nn = args[1]\ns = args[2]\np = args[3]\n\nprint(ceil(ceil(n/s)*k/p))", "k, n, s, p = map(int,input().split())\r\ns = ((n - 1) // s + 1) * k\r\nprint((s - 1) // p + 1)", "import math\r\n\r\nk, n, s, p = input().split(' ')\r\n\r\nk = int(k)\r\nn = int(n)\r\ns = int(s)\r\np = int(p)\r\n\r\ncount = 1\r\ntotal = 0\r\nsheets = s\r\n\r\nwhile(n > sheets):\r\n count += 1\r\n sheets = s * count\r\n\r\n\r\ntotal = count/p\r\n\r\ntotal = math.ceil(total * k)\r\n \r\nprint(int(total))", "from math import ceil\r\nk, n, s, p = map(int, input().split())\r\nprint(ceil((k*ceil(n/s))/p))\r\n", "from math import ceil\r\nk , n , s , p = map(int,input().split())\r\n\r\nsn = ceil(n / s)\r\n\r\nprint( ceil(sn * k / p ) )\r\n", "k, n, s, p = map(int, input().split())\nprint((((n-1)//s+1) * k - 1) // p + 1)\n \t\t\t \t\t \t\t\t \t\t \t", "import math\nk,n,p,s = list(map(int,input().split()))\n\nr = (math.ceil(n/p)*k)\nR = math.ceil(r/s)\n\n\nprint(R)", "a,b,c,d=map(int,input().split())\r\n# let x be sheets per person required\r\nif b%c==0:\r\n x=b//c\r\nelse:\r\n x=1+b//c\r\n#let t be total sheets required\r\nt=x*a\r\nif t%d==0:\r\n print(t//d)\r\nelse:\r\n print(1+t//d)", "import math\r\nk,n,s,p=map(int,input().split())\r\nprint(math.ceil((math.ceil(n/s))*k / p))", "#965A\r\n\r\nfrom math import *\r\na=input()\r\nl=a.split()\r\nk=int(l[0])\r\nn=int(l[1])\r\ns=int(l[2])\r\np=int(l[3])\r\nresult=ceil((ceil(n/s)*k)/p)\r\nprint(result)\r\n", "import math\r\nk,n,s,p=map(int,input().split())\r\n\r\na=math.ceil(n/s)\r\nprint(math.ceil((k*a)/p))", "import math\r\nk,n,s,p=map(int, input().split())\r\nprint(math.ceil((math.ceil(n/s)*k)/p))", "import sys\r\nfrom math import ceil\r\n\r\ndef main():\r\n k, n, s, p = map(int, sys.stdin.read().strip().split())\r\n return int(ceil(int(ceil(n/s))*k/p))\r\n\r\nprint(main())\r\n", "import math\nk, n, s, p = map(int, input().split())\neach = math.ceil(n / s)\ntotal = k * each\nans = math.ceil(total / p)\nprint(int(ans))\n", "import math as mt\r\nk,n,s,p = list(map(int,input().split())) \r\nnt = k*n\r\nh = mt.ceil(nt/s)\r\nhp = mt.ceil(h/k)\r\nhr = hp*k\r\nx = mt.ceil(hr/p)\r\nprint(x)", "a, q, s, w = map(int, input().split())\r\nd = (q + s - 1) // s\r\ne = a * d\r\nprint((e + w - 1) // w)", "from math import ceil\r\na = list(map(int,input().split()))\r\nprint( ceil((ceil(a[1]/a[2])*a[0])/a[3]) )", "from math import*\r\ny=1\r\nk,n,s,p=map(int,input().split())\r\nif n%s!=0:\r\n x=(n//s)+1\r\nelse:\r\n x=n//s\r\nx*=k\r\nif x%p!=0:\r\n z=(x//p)+1\r\nelse:\r\n z=x//p\r\nprint(z)\r\n", "k,n,s,p=map(int,input().split())\r\nans = (n + s - 1) // s\r\nans1 = (ans * k + p - 1) // p \r\nprint(ans1)", "from math import ceil\r\nk,n,s,p = list(map(int, input().split()))\r\n\r\neveryone = ceil(n/s)\r\ntotalsheet = everyone * k\r\nneed = ceil(totalsheet/p)\r\nprint(need)", "S=input().split(' ')\r\nk,n,s,p=int(S[0]),int(S[1]),int(S[2]),int(S[3])\r\nprint((k*((n-1)//s+1)-1)//p+1)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n k, n, s, p = map(int, input().split())\r\n ans = math.ceil((k * math.ceil(n / s)) / p)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import ceil\nk, n, s, p =map(int, input().split())\nprint(ceil((ceil(n / s) * k) / p))", "people_nr, planes_per_person, planes_per_sheet, sheets_per_pack = (int(x) for x in input().split())\nsheets_per_person = (planes_per_person + planes_per_sheet - 1) // planes_per_sheet\nsheets_per_group = (people_nr * sheets_per_person + sheets_per_pack - 1) // sheets_per_pack\nprint(sheets_per_group)\n", "from math import ceil\n\nk, n, s, p = map(int, input().split())\n\nl = k * ceil(n / s)\n\nleft = 0\nright= 10 ** 9\n\nwhile right - left > 1:\n mid = (right + left) // 2\n\n if (mid * p) >= l:\n right = mid\n else:\n left = mid\n\nprint(right)", "m=list(map(int,input().split()))[:4]\r\nif(m[1]%m[2]==0):\r\n d=m[1]//m[2]\r\nelse:\r\n d=(m[1]//m[2])+1\r\ng=m[0]*d\r\nif(g%m[3]==0):\r\n f=g//m[3]\r\nelse:\r\n f=(g//m[3])+1\r\nprint(f)\r\n", "from math import ceil\r\n\r\n\r\ndef a965(k, n, s, p):\r\n a = ceil(n / s) * k / p\r\n return ceil(a)\r\n\r\n\r\nif __name__ == '__main__':\r\n k, n, s, p = map(int, input().split())\r\n print(a965(k, n, s, p))\r\n", "\r\nfrom math import *\r\n\r\nR = lambda: map(int, input().split())\r\nk, n, s, p = R()\r\nprint(ceil(k*ceil(n/s)/p))", "def main():\r\n from math import ceil\r\n [k, n, s, p] = [int(_) for _ in input().split()]\r\n a = ceil(n / s) * k\r\n b = ceil(a / p)\r\n\r\n print(b)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "k, n, s, p = map(int,input().split())\r\nimport math\r\nx = math.ceil(n/s)\r\ny = x*k/p\r\nprint (math.ceil(y))", "from math import ceil\r\nk, n, s, p = map(int, input().split())\r\n\r\ntotal_sheets_needed = ceil(n/s) * k\r\nprint(ceil(total_sheets_needed / p))", "# https://codeforces.com/problemset/problem/965/A\r\n\r\nimport math\r\nk, n, s, p = map(int, input().split())\r\n\r\nprint(math.ceil(k * math.ceil(n/s)/ p))\r\n", "import math\n[a, b, c, d] = map(int, input().split())\n\n#a = # of people 5\n#b = # of airplanes per person 3\n#c = # airplanes from the sheets 2\n#d = # of sheets 3 outcome 4\n\npartb = b / c\n\nmodb = partb % 1\n\ntotalairplanes = a * b\n\n\nif modb > 0:\n pagesneeded = math.ceil(partb) * a\nelse:\n pagesneeded = partb * a\n \n\n\nnumberofpacksneeded = pagesneeded / d \n\nmodpacks = numberofpacksneeded % 1\n\nif modpacks > 0:\n ans = int(numberofpacksneeded) + 1\nelse:\n ans = numberofpacksneeded\n \nif c > totalairplanes:\n ans = a\n \n \n \nprint(int(ans))\n\n\n\n\n\n ", "import math\r\nx,y,z,t=map(int,input().split())\r\nprint(math.ceil((x*(math.ceil(y/z)))/t))", "k, n, s, p = map(int, input().split())\nnum = n//s if n%s == 0 else n//s+1\nnum = num*k\nnum = num//p if num%p==0 else num//p+1\nprint(num)\n", "import sys\r\nimport math\r\n\r\nk, n, s, p = input().strip().split(' ')\r\nk, n, s, p= [int(k), int(n), int(s), int(p)]\r\n\r\nnsp = math.ceil(n/s)\r\nns = nsp * k\r\nprint(math.ceil(ns/p))", "(k, n, s, p) = input().split()\nk = int(k)\nn = int(n)\ns = int(s)\np = int(p)\nprint ( ( ( (n - 1) // s + 1 ) * k - 1 ) // p + 1 )\n", "import math\r\n\r\nk,n,s,p = map(int,input().split())\r\n\r\n\r\n\r\na = math.ceil(n/s)*k\r\n\r\nprint(math.ceil(a/p))\r\n", "k,n,s,p=map(int,input().split())\r\nprint((((n+s-1)//s)*k+p-1)//p) ", "a=(list(map(int, input().split()))) ; b=a[1]//a[2]\r\nif a[1]%a[2]!=0:\r\n b+=1\r\nd=b*a[0]\r\ne=d//a[3]\r\nif d%a[3]!=0:\r\n e+=1\r\nprint(e)", "from math import ceil\r\na,b,c,d=map(int,input().split())\r\nprint(ceil((ceil(b/c)*a)/d))", "import math\r\nk,n,s,p=map(int,input().split())\r\nv1=math.ceil(n/s)\r\nv2=math.ceil(v1*k)\r\nans=math.ceil(v2/p)\r\nprint(int(ans))", "\r\n[k,n,s,p] = [int(x) for x in input().split()]\r\n\r\nprint( (((n+s-1)//s)*k+p-1)//p )", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n\r\nk, n, s, p = map(int, input().split(\" \")) # read multiple integers into different variables\r\nsheet = (n + s - 1) // s * k\r\npack = (sheet + p - 1) // p\r\nprint(pack)\r\n\r\n", "import math\r\nB=list(map(int,input().split(\" \")))\r\n\r\nk=B[0]\r\nn=B[1]\r\ns=B[2]\r\np=B[3]\r\n\r\n\r\nf1=math.ceil(n/s)\r\ns1=math.ceil(f1*k/p)\r\nprint(s1)\r\n\r\n", "import math\r\n\r\nk,n,s,p = map(int, input().split())\r\n\r\na = math.ceil(n/s)\r\nfinal = math.ceil((a*k)/p)\r\n\r\nprint (final)", "k,n,s,p = map(int, input().split())\r\nimport math\r\ni=int(math.ceil(n/s)) #листов на человека\r\nall_list=k*i #всего листов\r\nprint(int(math.ceil(all_list/p)))\r\n", "import math\r\nst = list(map(int,input().split(\" \")))\r\nk = int(st[0])\r\nn = int(st[1])\r\ns = int(st[2])\r\np = int(st[3])\r\nprint(math.ceil(math.ceil(n/s)*k/p))\r\n \r\n", "from math import ceil\r\nk,n,s,p=map(int,input().split())\r\nprint((int)(ceil((int)(ceil(n/(float)(s)))*k/(float)(p))))\r\n", "inputs_list = list(map(int, input().split()))\r\nk = inputs_list[0]\r\nn = inputs_list[1]\r\ns = inputs_list[2]\r\np = inputs_list[3]\r\n\r\ndef sheets(n,s):\r\n if float(n / s) > int(n / s):\r\n return int(n / s) + 1\r\n else:\r\n return int(n / s)\r\n\r\nsheets_req = k * sheets(n, s)\r\nif sheets_req % p == 0:\r\n print(int(sheets_req / p))\r\nelse:\r\n print(int(sheets_req / p) + 1)", "from math import ceil\r\n\r\nk, n, s, p = map(int, input().split())\r\nprint(ceil(k*ceil(n/s)/p))\r\n", "import math\r\n\r\nif __name__ == \"__main__\":\r\n k, n, s, p = map(int, input().split())\r\n ep = math.ceil(n / s)\r\n# print(ep)\r\n ans = math.ceil(ep * k / p)\r\n print(ans)\r\n# print(\"%d %d %d %d\" % (k, n, s, p))", "lst1 = input()\nlst2 = lst1.split()\n\nk = int(lst2[0])\nn = int(lst2[1])\ns = int(lst2[2])\np = int(lst2[3])\n\nc = 1\n\nif(n > s):\n\twhile(n > s):\n\t\tc = c + 1\n\t\tn = n - s\nk*=c\nprint(\"\\n\")\nif(k % p != 0):\n\tprint(int((k/p)+1))\nelse:\n\tprint(int(k/p))\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import*\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input().strip()))\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\nk,n,s,p=invr()\r\na=ceil(n/s)\r\na=a*k\r\nprint(ceil(a/p))", "import math\r\nk,n,s,p=map(int,input().split())\r\nc=math.ceil(n/s)\r\nreq=k*c\r\nwhile(True):\r\n if(req%p==0):\r\n print(req//p)\r\n break\r\n else:\r\n req+=1", "k,n,s,p=[*map(int,input().split())]\nif(n%s==0):\n sheets_per_person=n//s\nelse:\n sheets_per_person=(n//s)+1\n\ntotal_sheets_req=sheets_per_person*k\n\nif(total_sheets_req%p==0):\n no_of_packs = total_sheets_req//p\nelse:\n no_of_packs=(total_sheets_req//p)+1\n\nprint(no_of_packs)\n", "k, n, s, p = (int(i) for i in input().split())\nres = (k * ((n + s - 1) // s) + p - 1) // p\nprint(res)\n", "k,n,s,p = map(int,input().split())\r\nprint(((n + s - 1) // s * k + p - 1) // p)", "# http://codeforces.com/problemset/problem/965/A\r\nfrom math import ceil as c\r\nl = [int(i) for i in input().split()]\r\nk=l[0]\r\nn=l[1]\r\ns=l[2]\r\np=l[3]\r\n\r\nprint( c( c(n/s) *k/p))\r\n", "import math as m\nk,n,s,p=map(int,input().split())\nprint(m.ceil(m.ceil(n/s)*k/p))\n\n \t\t \t \t \t \t \t\t\t \t \t\t \t\t\t\t\t\t", "import math\r\n\r\ndef solution(k, n, s, p):\r\n first_ceil = math.ceil(n/s)\r\n second_ceil = math.ceil((first_ceil*k)/p)\r\n return second_ceil\r\n\r\nk, n, s, p = [int(x) for x in input().strip().split(\" \")]\r\nprint(solution(k, n, s, p))", "import math\r\nk,n,s,p=map(int,input().split())\r\ntotal_sheet=(math.ceil(n/s)*k)\r\nprint(math.ceil(total_sheet/p))\r\n", "import math\r\nk,n,s,p = map(int, input().split())\r\n\r\nprint(math.ceil((math.ceil(n/s))*k/p))", "k, n, s, p = [int(i) for i in input().split(' ')]\n\nsheets_per_person = n//s + (1 if n%s != 0 else 0)\ntotal_sheets = sheets_per_person * k\n\nprint(total_sheets//p + (1 if total_sheets%p != 0 else 0))", "import math\r\nk, n, s, p = map(int, input().split())\r\nbase = math.ceil(n / s)\r\nprocess = k * base\r\nprint(math.ceil(process / p))\r\n", "k,n,s,p=map(int,input().split())\r\nif n%s==0 :\r\n num=n//s\r\nelse:\r\n num=(n//s)+1\r\ntotal=k*num \r\nif total%p==0 :\r\n print(total//p)\r\nelse:\r\n print((total//p)+1)", "(k, n, s, p) = map(int, input().split(\" \"))\r\nif n % s == 0: \r\n sheets_per_person = n // s\r\nelse:\r\n sheets_per_person = n // s + 1 \r\ntotal_sheets = sheets_per_person * k\r\nif total_sheets % p == 0:\r\n packs = total_sheets // p\r\nelse:\r\n packs = total_sheets // p + 1\r\nprint(packs)", "from math import ceil\r\na, b, c, d=map(int, input().split())\r\ne=ceil(b/c)*a\r\nf=ceil(e/d)\r\nprint(f)", "def test_0():\n # A - World Cup\n import math\n k, n, s, p = list(map(int, input().split(\" \")))\n\n aa = math.ceil((k* math.ceil(n/s)) / p)\n print(aa)\n\n\ntest_0()\n\t \t \t\t\t \t \t\t\t \t\t \t\t \t \t\t", "a,b,c,d = map(int,input().split())\r\nz = b//c\r\nif b%c!=0:z+=1\r\nif (a*z)%d!=0:print(((a*z)//d)+1)\r\nelse:print((a*z)//d)", "import math\r\nvars = list(map(lambda x: int(x), input().split()))\r\nprint(math.ceil( (vars[0] * math.ceil(vars[1] / vars[2])) / vars[3] ))", "import math\n\nval = input()\nval1 = val.split(\" \")\nk = int(val1[0])\nn = int(val1[1])\ns = int(val1[2])\np = int(val1[3])\n\nc = 1\nif n > s:\n\twhile n > s:\n\t\tc = c + 1\n\t\tn = n - s\nk = k * c\nprint(math.ceil(k/p))\n\n", "from math import ceil\r\nk,n,s,p = [int(i) for i in input().split()]\r\nt=ceil(ceil(n/s)*k/p)\r\nprint(t)", "import math\r\nk, n, s, p= map(int,input().split())\r\nsheets = math.ceil(n/s)\r\npack = math.ceil(sheets*k / p) \r\nprint(pack)", "import math\r\ntheInputs = input(\"\").split(\" \")\r\ntheInputs = list(map(int, theInputs))\r\n\r\nnumberOfPeople = theInputs[0]\r\nnumberOfPlanesEach = theInputs[1]\r\nnumberOfPlanesCanBeMadeFromSheet = theInputs[2]\r\nnumberOfSheetsinEachPack = theInputs[3]\r\n\r\nnumberOfSheetsEach = math.ceil(numberOfPlanesEach / numberOfPlanesCanBeMadeFromSheet)\r\nnumberOfSheetsTotal = numberOfSheetsEach * numberOfPeople\r\nprint(math.ceil(numberOfSheetsTotal / numberOfSheetsinEachPack))", "import math\r\npeople,eachPlaneCnt,planePerSheet,sheetPerPack=map(int,input().split())\r\neachNeed=math.ceil(eachPlaneCnt/planePerSheet)\r\nNeeded=people*eachNeed\r\nprint(math.ceil(Needed/sheetPerPack))", "from math import ceil\r\nk,n,s,p = map(int,input().split())\r\nr = ceil((k*ceil(n/s))/p)\r\nprint(r)", "k, n, s, p = map(int, input().split())\r\nif k*n // s == 0:\r\n print(k)\r\nelse:\r\n if n % s > 0:\r\n f = n//s+1\r\n else:\r\n f = n // s\r\n h = k * f \r\n g = h // p\r\n g1 = h % p\r\n if g1 > 0:\r\n print(g+1)\r\n else:\r\n print(g)", "k,n,s,p=map(int,input().split())\r\na=n//s\r\nif(n%s!=0):\r\n a+=1\r\nq=k*a\r\nm=q//p\r\nif(q%p!=0):\r\n m+=1\r\nprint(m)\r\n \r\n\r\n", "import math\r\npeople,planes,number,paper=map(int,input().split())\r\nprint(math.ceil(people*math.ceil(planes/number)/paper))", "import math\r\nk,n,s,p=map(int,input().split())\r\n\r\nval=math.ceil(n/s)*k\r\nprint(math.ceil(val/p))", "[k, n, s, p] = map(int, input().split())\nif n % s == 0:\n n = n // s\nelse:\n n = n // s + 1\nn = n * k\nif n % p == 0:\n n = n // p\nelse:\n n = n // p + 1\nprint(n)\n", "import math\r\n\r\ns=input()\r\ns=s.split(' ')\r\nl=[]\r\nfor i in s:\r\n l.append(int(i))\r\nk,n,s,p=l[0],l[1],l[2],l[3]\r\n\r\nx=math.ceil(math.ceil(n/s)*k/p)\r\nprint(x)\r\n", "import math\r\nk,n,s,p=map(int,input().split())\r\na=int(math.ceil(math.ceil(n/s)*k/p))\r\nans=a\r\nprint(int(ans))", "k,n,s,p = map(int,input().split())\r\n\r\ndef f(m):\r\n return k * ((n + s - 1) // s) <= p * m\r\n\r\nok, ng = 10**9, 0\r\nwhile ok - ng > 1:\r\n m = (ok + ng) // 2\r\n if f(m):\r\n ok = m\r\n else:\r\n ng = m\r\n\r\nprint(ok)\r\n", "a1, a2, a3, a4 = map(int, input().split())\r\nif a2 % a3 > 0:\r\n t = a2 // a3\r\n t += 1\r\nelse:\r\n t = a2//a3\r\nif a1*t % a4 > 0:\r\n l = a1*t//a4\r\n l += 1\r\nelse:\r\n l = a1*t//a4\r\nprint(l)\r\n", "from math import ceil\r\nk, n, s, p = map(int, input().split())\r\nprint(ceil((ceil(n/s) * k) / p))\r\n# CodeForcesian\r\n# ♥\r\n# اگه میتونی تصور کنی پس حتما میتونی انجامش بدی\r\n", "k,n,s,p = map(int, input().split())\r\nprint(-(((-n // s)*k) // p))", "k, n, s, p = map(int, str(input()).split(\" \"))\r\nprint((k*((n+s-1)//s)+p-1)//p)", "[k, n, s, p] = map(int, input().split())\r\nif (n//s)== (n/s):\r\n sheets=n//s\r\nelse:\r\n sheets=n//s+1\r\nif k*sheets/p==k*sheets//p:\r\n print(int(k*sheets//p))\r\nelse:\r\n print(int(k*sheets//p+1))", "k, n, s, p = input().split()\r\n\r\nk = int(k)\r\nn = int(n)\r\ns = int(s)\r\np = int(p)\r\n\r\ndef upDivide(num, div):\r\n if(num / div == num // div):\r\n return num // div\r\n else:\r\n return num //div + 1\r\n\r\nq = upDivide(n, s)\r\nw = q * k\r\nprint(upDivide(w, p))\r\n", "from math import ceil\r\nk,n,s,p=[int(v) for v in input().split()]\r\nprint(ceil(k*ceil(n/s)/p))", "import math\nk,n,s,p=[int(x) for x in input().split()]\na=int(math.ceil(n/s))\nb=a*k\nprint(int(math.ceil(b/p)))\n", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nimport math\r\nk,n,s,p=map(int,input().split())\r\nprint(math.ceil((k*math.ceil(n/s))/p))", "# Paper Airplanes\n[k,n,s,p] = map(int,input().split())\nnum_sheets = (n + s - 1) // s\nprint((k * num_sheets + p - 1) // p)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Apr 28 13:07:51 2018\r\n\r\n@author: Paras Sharma\r\n\"\"\"\r\nimport math\r\nk,n,s,p=list(map(int,input().split()))\r\nnp=math.ceil(n/s)\r\nnop=np*k\r\nprint(math.ceil(nop/p))\r\n", "import math\r\nk,n,s,p=map(int,input().split())\r\nprint(int(math.ceil(int(math.ceil(n/s))*k/p)))", "k,n,s,p = map(int,input().split())\r\nsheets = (n + s - 1) // s\r\nans = k * sheets\r\nprint((ans + p - 1 ) // p)", "k, n, s, p = map(int, input().split())\r\n\r\npaper_person = (n + s -1)//s\r\n\r\ntotal_needed = paper_person * k\r\n\r\nans = (total_needed+p-1)//p\r\n\r\nprint(ans)\r\n\r\n\r\n", "a=list(map(int,input().split()))\npp= (a[1]-1)//a[2]+1\nts= pp * a[0]\ntp= (ts-1)//a[3]+1\nprint(tp)", "k,n,s,p=map(int,input().split())\r\nif n%s!=0:\r\n\tc=n//s+1\r\nelse:\r\n\tc=n//s\r\nd=c*k\r\nif d%p!=0:\r\n\te=d//p+1\r\nelse:\r\n\te=d//p\r\nprint(e)", "k, n, s, p = map(int, input().split())\r\n\r\nnrp = ((n - 1) // s + 1) * k\r\n\r\nprint((nrp - 1) // p + 1)\r\n", "k, n, s, p = map(int, input().split())\r\nmin_pk = 0\r\nif s > n:\r\n if k % p != 0:\r\n min_pk = int((k/p)) + 1\r\n else:\r\n min_pk = k/p\r\nelse:\r\n sh_rq = 0\r\n if n % s != 0:\r\n sh_rq = int((n/s)) + 1\r\n else:\r\n sh_rq = n/s\r\n tt_sh = sh_rq * k\r\n if tt_sh % p != 0:\r\n min_pk = int((tt_sh/p)) + 1\r\n else:\r\n min_pk = tt_sh/p\r\nprint(int(min_pk))", "# coding=utf-8\nimport math\nk, n, s, p = map(int, input().split())\n\nres = math.ceil(k*math.ceil(n/s)/p)\n\nprint(res)\n\n", "k,n,s,p =map(int,input().split())\nsheets= k*(n//s)\nif n%s !=0:\n\tsheets+=k\nif sheets%p ==0:\n\tprint(sheets//p)\nelse:\n\tprint(sheets//p +1)\n", "str=input()\r\nl=str.split()\r\nk,n,s,p=int(l[0]),int(l[1]),int(l[2]),int(l[3])\r\nif n%s==0:\r\n each=n//s\r\nelse:\r\n each=n//s+1\r\ntotal = each*k\r\nif total%p==0:\r\n print(total//p)\r\nelse:\r\n print(total//p+1)", "k, n, s, p = map(int, input().split())\r\n\r\nprint(-(-(-(-n//s)*k)//p))", "k, n, s, p = map(int, input().split())\nns = ((n - 1) // s + 1) * k\nans = (ns - 1) // p + 1\nprint(ans)\n", "from math import ceil\r\n\r\nk, n, s, p = map(int,input().split())\r\nquantity = k * ceil(n/s)\r\nprint(ceil(quantity/p))\r\n", "import math\nk, n, s, p = map(int, input().split())\n\nx = math.ceil(n/s) \na = math.ceil(x*k/p) \n\nprint(a)\n", "k, n, s, p = map(int, input().split())\nprint((((n+s-1)//s)*k+(p-1))//p)\n", "from math import *\r\nk,n,s,p=map(int,input().split())\r\nres=ceil((ceil(n/s)*k)/p)\r\nprint(res)", "from math import ceil\r\n\r\n(k, n, s, p) = [int(r) for r in input().split()]\r\n\r\ntotal_sheets = k * ceil(n / s)\r\nprint(ceil(total_sheets / p))\r\n", "import math as m\nk, n, s, p = map(int, input().split())\nneeded_sheets = k * m.ceil(n/s)\nres = m.ceil(needed_sheets/p)\nprint(res)", "import math\r\nk,n,s,p=[int(x) for x in input().split()]\r\nc=1\r\nif n>s:\r\n while n>s:\r\n c+=1\r\n n=n-s\r\nk*=c\r\nprint(math.ceil(k/p))\r\n", "import math\r\nk,n,s,p=map(int,input().split())\r\nx=math.ceil(n/s)\r\nprint(math.ceil((k*x)/p))", "[k,n,s,p]=map(int,input().split())\r\nimport math\r\nsheetsperperson = math.ceil(n/s) \r\n#number of sheets each person needs\r\ntotalnumofpack= math.ceil(k*sheetsperperson/p)\r\nprint (totalnumofpack)\r\n", "k,n,s,p=map(int,input().split())\r\nm=n//s\r\nif n%s!=0:\r\n m=n//s+1\r\nans=(k*m)//p\r\nif (k*m)%p!=0:\r\n ans=(k*m)//p+1\r\nprint(ans)", " ### @author Juan Sebastian Beltran Rojas \r\n ### @mail [email protected] \r\n ### @veredict \r\n ### @url https://codeforces.com/problemset/problem/965/A\r\n ### @category \r\n ### @date 13/11/2019\r\n\r\nimport math\r\n\r\nline = input().split()\r\nK = int(line[0])\r\nN = int(line[1])\r\nS = int(line[2])\r\nP = int(line[3])\r\n\r\nprint (math.ceil((K*math.ceil(N/S))/P))", "from math import ceil\n\n\ndef solve(k, n, s, p):\n sheets_needed = k*ceil(n/s)\n return ceil(sheets_needed/p)\n\n\ndef main():\n k, n, s, p = list(map(int, input().split()))\n print(solve(k, n, s, p))\n\n\nmain()\n", "from math import ceil\r\n\r\nk, n, s, p = map(int, input().split())\r\n\r\n\r\ndef paper_packs(people, planes_foreach, planes_from_sheet, sheets_in_pack):\r\n sheets_foreach = int(ceil(planes_foreach / planes_from_sheet))\r\n sheets_needed = sheets_foreach * people\r\n packs_needed = int(ceil(sheets_needed / sheets_in_pack))\r\n return packs_needed\r\n\r\n\r\nprint(paper_packs(k, n, s, p))", "k, n, s, p = map(int, input().split())\r\nprint(((n+s-1)//s*k+p-1)//p)\r\n", "# cf 965 A 900\nk, n, s, p = map(int, input().split())\n# k people n airplanes, s airplanes/sheet, p=sheets in one pack\nspp = (n + (-n % s)) // s # sheets per person\nts = spp * k # total needed sheets\nppp = (ts + (-ts % p)) // p # total packs\nprint(ppp)\n", "k,n,s,p=map(int,input().strip().split())\r\nif n%s==0:\r\n t=n//s\r\nelif n%s!=0:\r\n t=1+(n//s)\r\n \r\nkk=t*k\r\n\r\nif kk%p==0:\r\n f=kk//p\r\nelif kk%p!=0:\r\n f=1+(kk//p)\r\nprint(f) ", "k,n,s,p=[int(x) for x in input().split()]\r\nif n%s==0:\r\n res=(n//s)*k \r\nelse:\r\n res=(n//s+1)*k\r\nif res%p==0:\r\n print(res//p)\r\nelse:\r\n print(res//p+1)", "k,n,s,p= map(int,input().split())\r\nt=(n+s-1)//s\r\nsheets=k*t\r\nprint((sheets+p-1)//p)\r\n", "k, n, s, p = map(int, input().split(\" \"))\r\n\r\nimport math\r\n\r\nprint(math.ceil(math.ceil(n/s)*k/p))", "k,n,s,p = map(int, input().split())\r\nans = -((-n) // s)\r\nans *= k\r\nans = -((-ans)//p)\r\nprint(ans)", "k, n, s, p = map(int, input().split())\r\na = (n + s - 1) // s\r\nb = k * a\r\nprint((b + p - 1) // p)\r\n", "k, n ,s ,p = map(int , input().split())\r\nif(n % s == 0):\r\n num_sheet = n // s\r\nelse:\r\n num_sheet = n // s + 1\r\nif(((num_sheet * k )% p) == 0):\r\n min_pack = ((num_sheet * k )// p)\r\nelse:\r\n min_pack = ((num_sheet * k )// p) + 1\r\nprint(min_pack)", "k, n, s, p = list(map(int, input().split()))\r\nc = (n + s - 1) // s\r\nc *= k\r\nc = (c + p - 1) // p\r\nprint(c)", "k, n, s, p = map(int, input().split())\r\nprint(((((n - 1) // s + 1) * k) - 1) // p + 1)\r\n", "k, n, s, p = [int(x) for x in input().split()]\r\n\r\nsheetsneededperperson = (n + s - 1) // s\r\ntotalsheets = k * sheetsneededperperson\r\npacks = (totalsheets + p - 1) // p\r\nprint(packs)", "import math\r\nk, n, s, p = map(float, input().split())\r\nnum = math.ceil(n/s)\r\nnum*=k\r\nans = math.ceil(num/p)\r\nprint(ans)\r\n", "from math import ceil\r\nk,n,s,p = map(int,input().split())\r\nprint(ceil((k*ceil(n/s))/p))", "import math\r\nk,n,s,p = input().split()\r\nk= int(k)\r\nn= int(n)\r\ns= int(s)\r\np= int(p)\r\ntotalPlanes = k*n\r\nsheets = math.ceil(totalPlanes/s)\r\nsheetsPerPerson = math.ceil(sheets/k)\r\nTotalSheets = sheetsPerPerson * k\r\npacks = math.ceil(TotalSheets/p)\r\nprint(packs)", "import math as m\nk,n,s,p=input().split()\nk,n,s,p=int(k),int(n),int(s),int(p)\na=m.ceil(n/s)\na=a*k\nq=m.ceil(a/p)\nprint(q)", "k, n, s, p = map(int, input().split())\nx = 0 - -n // s\nt = k * x\nb = 0 - -t // p\nprint(b)\n", "a,b,c,d = map(int,input().split())\r\nif b % c == 0:\r\n k = b // c\r\nelse:\r\n k = b // c + 1\r\nl = a * k\r\nif l % d == 0:\r\n p = l // d\r\nelse:\r\n p = l // d + 1\r\nprint(p)", "import math\n\n[k, n, s, p] = input().split(' ')\nk=int(k);\nn=int(n);\ns=int(s);\np=int(p);\nsheets_need= k*math.ceil(n/s)\nresult = math.ceil(sheets_need/p);\nif result*p<k:\n result=k;\nprint(result); #kazhdomu stolko listov, skolko nuzhno dlya samoleta\n", "k, n, s, p = map(int, input().split())\r\nt = 0\r\nif n % s == 0:\r\n t = n // s\r\nelse:\r\n t = n // s + 1\r\nt = t * k\r\nif t % p == 0:\r\n print(t // p)\r\nelse:\r\n print(t // p + 1)\r\n", "k, n, s, p = list(map(int, input().strip().split()))\n\ntotal = k * n\n\nmmin = 1\nwhile mmin * p // k * s < n:\n mmin += 1\nprint(mmin)\n\t \t\t\t\t\t \t \t\t\t\t\t \t \t\t \t", " # Taking the required input from the user\r\nk,n,s,p = list(map(int, input().split())) \r\n\r\n# Finding out the total number of sheets required, we will take ceil value of sheet required by each person as half sheet used by one cannot be used by others. \r\nsheets = k * ((n + s - 1) // s) \r\n\r\n\r\n # Finding the min. number of packs required (again taking ceil value as half pack cannot be pickec) \r\npacks = (sheets + p - 1) // p \r\n # Printing out the result\r\nprint(packs) \r\n", "from math import ceil\r\n\r\nk, n, s, p = input().split()\r\nk, n, s, p = [int(k) , int(n) , int(s) , int (p) ]\r\npackages = ceil((ceil(n/s)*k)/p)\r\n\r\nprint(packages)", "import math\r\n\r\nt = input()\r\nt = t.split(' ')\r\n\r\nk = int(t[0])\r\nn = int(t[1])\r\ns = int(t[2])\r\np = int(t[3])\r\n\r\npaper = math.ceil(n/s)\r\npaper = paper*k\r\nans = math.ceil(paper/p)\r\n\r\nprint(ans)\r\n", "k,n,s,p=map(int,input().split())\r\nss=int(n/s)\r\nif n%s>0:\r\n ss+=1\r\nss=ss*k\r\nans=int(ss/p)\r\nif(ss%p>0):\r\n ans+=1\r\nprint(ans)", "from math import ceil\r\nb=list(map(int,input().split()))\r\nshe=ceil(b[1]/b[2])\r\np=ceil(she*b[0]/b[3])\r\nprint(p)", "k,n,s,p=map(int,input().split())\r\nc=(n//s) if n%s==0 else (n//s)+1\r\nprint((c*k)//p if (c*k)%p==0 else ((c*k)//p)+1)\r\n\r\n", "import math\r\n[k, n, s, p] = map(int, input().split())\r\nprint(math.ceil(k*math.ceil(n/s)/p))", "from math import ceil\r\nqwerty= [int(i) for i in input().split()]\r\nk=qwerty[0]\r\nn=qwerty[1]\r\ns=qwerty[2]\r\np=qwerty[3]\r\nt=n/s\r\ny=ceil(t)\r\nl=y*k\r\nf=l/p\r\nprint(ceil(f))\r\n", "from math import ceil\r\n\r\nk, n, s, p = [int(i) for i in input().split()]\r\n\r\nsheets_needed = int(ceil(n / s)) * k\r\n\r\nprint(int(ceil(sheets_needed / p)))\r\n\r\n", "k, n, s, p = map(int, input().split())\r\n\r\nif n % s != 0:\r\n\tpidr = n // s + 1\r\nelse:\r\n\tpidr = n // s\r\n\r\nif (k * pidr) % p != 0:\r\n\tuebki = (k * pidr) // p + 1\r\nelse:\r\n\tuebki = (k * pidr) // p \r\nprint(uebki) ", "from math import ceil as z\r\na,b,c,d=map(int,input().split())\r\nprint(z((z(b/c)*a)/d))", "from math import ceil as l\r\na,b,c,d=map(int,input().split())\r\nm=(l(b/c))*a\r\nk=l(m/d)\r\nprint(k)", "[k,n,s,p] = map(int, input().split())\r\nx=1\r\na = (n+s-1)//s\r\nprint((k*a+p-1)//p)\r\n \r\n", "s = input()\r\nin1 = s.split(' ')\r\n\r\nk = int(in1[0])\r\nn = int(in1[1])\r\ns = int(in1[2])\r\np = int(in1[3])\r\n\r\nimport math\r\nprint(math.ceil(k * math.ceil(n / s) / p))", "from math import ceil\r\nk,n,s,p=map(int,input().split())\r\nprint(ceil((ceil((n/s))*k)/p))", "from math import ceil as c\r\nk,n,s,p = map(int,input().split())\r\nprint(c((k*c(n/s))/p))", "import math as m\r\nk,n,s,p=map(int,input().split())\r\ntot=n*k\r\ntota=m.ceil(tot/s)\r\ntote=(m.ceil(tota/k))*k\r\nprint(m.ceil(tote/p))", "from math import ceil\r\n\r\nk,n,s,p= input().split()\r\nk,n,s,p= int(k),int(n),int(s),int(p)\r\n\r\noutput= ceil((ceil(n/s)*k)/p)\r\nprint(output)", "import math\r\nk, n, s, p = list(map(int, input().split()))\r\nps = math.ceil(n/s)\r\nts = k*ps\r\nprint(math.ceil(ts/p))\r\n", "import math\r\n[k,n,s,p] = map(int, input().split())\r\nspp = math.ceil(n/s)\r\nts = k*spp\r\nprint (math.ceil(ts/p))", "k, n, s, p = map(int, input().split())\r\nper_person = n // s if n % s == 0 else (n // s) + 1\r\ntot_sheets = k * per_person\r\nprint((tot_sheets // p) + 1 if tot_sheets % p != 0 else tot_sheets // p)", "from math import ceil\r\nk,n,s,p = map(float,input().split()) \r\nprint(ceil((ceil(n/s)*k)/p))", "import math\r\n\r\n\r\nl1=[int(i) for i in input().split()]\r\nk=l1[0]\r\nn=l1[1]\r\ns=l1[2]\r\np=l1[-1]\r\n\r\nif n%s==0:\r\n a1=int(n/s)\r\nelse :\r\n a1=math.floor(n/s)+1\r\n\r\ntotal_sheet_req=a1*k\r\n\r\nif total_sheet_req%p==0:\r\n print(int(total_sheet_req/p))\r\nelse :\r\n print(math.floor(total_sheet_req/p)+1)", "import math\r\ninp=input(\"\")\r\ntup=inp.split()\r\nk=int(tup[0]) #Number of people\r\nn=int(tup[1]) #Number of planes per person\r\ns=int(tup[2]) #Number of planes per sheet\r\np=int(tup[3]) #Number of sheets per pack\r\nassert 1 <= k <= 10000\r\nassert 1 <= n <= 10000\r\nassert 1 <= s <= 10000\r\nassert 1 <= p <= 10000\r\na=s\r\nb=p\r\nstep=math.ceil(n/s)\r\ntotsheets=step*k\r\npacks=math.ceil(totsheets/p)\r\nprint(packs)", "import math\r\nk,n,s,p=map(int,input().split())\r\nz=(math.ceil(n/s))*k\r\nprint(math.ceil(z/p))", "import math\nk, s ,n,p = map(int, input().split())\nf=math.ceil(((math.ceil(s/n))*k)/p)\nprint(f)\n", "n,m,s,k=list(map(int,input().split()))\r\nfor mnoj in range(1,10001):\r\n if s*mnoj>=m:\r\n pl=mnoj\r\n break\r\namount=pl*n\r\nadd=amount%k\r\nif add==0:\r\n print(amount//k)\r\nelse:\r\n add=k-add\r\n amount+=add\r\n print(amount//k)", "import math\r\na,b,c,d= input().split()\r\n\r\nn= math.ceil(int(b)/int(c))\r\nl= n*int(a)\r\n\r\nans= math.ceil(l/int(d))\r\nprint(ans)", "k, n, s, p = map(int, input().split())\r\nper_person = (n-1) // s+1\r\ntotal_s = per_person * k\r\ntotal_p = (total_s-1) // p+1\r\nprint(total_p)", "import math\r\nk,n,s,p=map(int,input().split())\r\nx=math.ceil(n/s)\r\nif x>0:\r\n y=x*k\r\n z=math.ceil(y/p)\r\nelse:\r\n z=k\r\nprint(z) ", "#!/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 k,n,s,p = map(int, wtf[0].split())\r\n sp = math.ceil(n/s)\r\n pp = (sp/p)\r\n ans = math.ceil(k*pp)\r\n print(ans)\r\n", "a,b,c,d=map(int,input().split())\r\nif b%c!=0:\r\n t=int(b/c)+1\r\nelse:\r\n t=int(b/c)\r\nif (t*a)%d!=0:\r\n print(int((t*a)/d)+1)\r\nelse:\r\n print(int((t*a)/d))\r\n ", "#I do it because of Valentina\r\nfrom math import ceil\r\nk,n,s,p = map(int,input().split())\r\nprint(ceil((ceil(n/s)*k)/p))", "k, n, s, p = [int(i) for i in input().split()]\r\nif n % s == 0 :\r\n temp = n // s\r\nelse:\r\n temp = n // s + 1\r\ntemp *= k\r\nif temp % p == 0:\r\n print(temp // p)\r\nelse :\r\n print(temp // p + 1)", "import math\r\n\r\nst = input().split()\r\nk, n, s, p = int(st[0]), int(st[1]), int(st[2]), int(st[3])\r\n\r\nprint(math.ceil((k * math.ceil(n / s)) / p))", "k, n, s, p=map(float,input().split(' '))\nprint(int(((n+s-1)//s*k+p-1)//p))\n", "k, n, s, p = map(int, input().split())\none_person_make = n\npaper_one_person_need = (one_person_make + s - 1) // s\npaper_all_persons_need = paper_one_person_need * k\npacks_all_persons_need = (paper_all_persons_need + p - 1) // p\nprint(packs_all_persons_need)\n", "import math as m\r\nk, n, s, p = [int(x) for x in input().split()]\r\nans = int(m.ceil(m.ceil(n / s) * k / p))\r\nprint(ans)\r\n", "k, n, s, p = map(int, input().split())\r\nsheets_per_person = (n + s - 1) // s\r\nsheets = k * sheets_per_person\r\nprint((sheets + p - 1) // p)", "#!/usr/bin/env python3\n# -*- coding: UTF-8 -*-\n\nfrom math import ceil\n\nk, n, s, p = (int(x)for x in input().split())\nprint(ceil(ceil(n/s)*k/p))\n\n \t\t\t \t \t\t \t \t\t\t\t \t\t\t \t", "k,n,s,p = map(int,input().split())\r\nprint(-(-(k*(-(-n//s)))//p))", "from math import ceil as ceil\r\n\r\nk, n, s, p = map(int, input().split())\r\n\r\nprint(ceil(ceil(n/s)*k/p))", "from math import ceil\r\n\r\nk, n, s, p = map(int, input().split())\r\nn_sheets = ceil(n / s)* k\r\nn_p = ceil(n_sheets / p)\r\nprint(n_p)", "import math\r\ninp = input().split(' ')\r\nk = int(inp[0])\r\nn = int(inp[1])\r\ns = int(inp[2])\r\np = int(inp[3])\r\nperPerson = int(math.ceil(n/s))\r\nneeded = perPerson*k\r\ntoBuy = int(math.ceil(needed/p))\r\nprint(toBuy)\r\n", "import math\r\nent=input()\r\na,b,c,d=ent.split()\r\nprint(math.ceil((int(a)*math.ceil(int(b)/float(c)))/float(d)))", "from sys import stdin\r\nfrom math import ceil\r\nk,n,a,p=map(int,stdin.readline().strip().split())\r\ncom=k*ceil(n/a)\r\nans=ceil(com/p)\r\nprint(ans)\r\n", "list1=input()\nlist2=list1.split()\nk= int(list2[0])\nn= int(list2[1])\ns= int(list2[2])\np= int(list2[3])\n\ncount = 1\nif n > s :\n\twhile n > s :\n\t\tcount = count + 1\n\t\tn = n - s\nk = k * count\n\nif k%p!=0:\n\tprint(int(k/p)+1)\nelse :\n\tprint(int(k/p))\n", "k, n, s, p=map(int,input().split())\r\nif(n%s==0):\r\n l=n/s\r\nelse:\r\n l=int(n/s)+1\r\nz=l*k\r\nif(z%p==0):\r\n q=z/p\r\nelse:\r\n q=int(z/p)+1\r\nprint(int(q))\r\n\r\n", "k, n, s, p = map(int, input().split())\r\n\r\nsheets_per_person = ((n - 1) // s) + 1\r\ntotal_sheets = sheets_per_person * k\r\npacks_needed = (total_sheets + p - 1) // p\r\n\r\nprint(packs_needed)\r\n", "a = list(input().split(' '))\r\nk, n, s, p = int(a[0]), int(a[1]), int(a[2]), int(a[3])\r\nres = 0\r\nres = n//s + int(bool(n%s))\r\nres *= k\r\nres = res//p + int(bool(res%p))\r\nprint(res)\r\n", "import math\n\nk, n, s, p = map(int, input().split())\nnum_paper_each = math.ceil(n/s)\nprint(math.ceil((k*num_paper_each)/p))\n", "import math\r\n[k, n , a, p] = map(int, input().split())\r\n#k*n = number of planes in da group\r\n#k = people\r\n#n = planes per person\r\n#p = number of sheets per pack\r\n#a = number of planes per sheet\r\n#math.ceiL(n/a) = sheets one person needs\r\nprint(math.ceil(math.ceil(n/a)/p*k))", "no_people, no_air_each, no_of_air_sheet, no_of_sheet_pack = list(map(int,input().strip().split()))\n\nimport math\n\ntotal_sheets = no_people * math.ceil(no_air_each/no_of_air_sheet)\nans = math.ceil( total_sheets / no_of_sheet_pack )\n\nprint(ans)", "a,b,c,d=map(int,input().split())\r\nif b%c==0:\r\n t=b//c\r\nelse:\r\n t=(b//c) +1\r\nif (a*t)%d==0:\r\n print((a*t)//d)\r\nelse:\r\n print(((a*t)//d)+1)", "import math\n\nk, n, s, p = [int(i) for i in input().split()]\n\nS = math.ceil(n/s)*k\nq = math.ceil(S/p)\n\nprint(q)\n", "k,n,s,p = list(map(int, input().split()))\r\nsheets = k * ((n + s - 1) // s) \r\n\r\npacks = (sheets + p - 1) // p \r\n \r\nprint(packs)", "k,n,s,p=map(int,input().split())\r\nif n%s==0:\r\n\tx=n//s\r\nelse:\r\n\tx=(n//s)+1\r\nt=k*x\r\nif t%p==0:\r\n\tprint(t//p)\r\nelse:\r\n\tprint((t//p)+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'''\n[k, n, s, p] = map(int, input().split())\nsheets = n // s\nif (n % s != 0):\n sheets += 1\ntotalsheets = sheets * k\nans = totalsheets // p\nif (totalsheets % p != 0):\n ans += 1\nprint(ans)", "#!/usr/bin/env python3\n\nk, n, s, p = map(int, input().split(' '))\n\nprint(-(-k*(-(-n//s))//p))\n", "import math\r\n\r\nx = [int(i) for i in input().split()]\r\nk = x[0]\r\nn = x[1]\r\ns = x[2]\r\np = x[3]\r\n\r\nsheets_person = math.ceil(n / s)\r\npacks_total = math.ceil( k * sheets_person / p )\r\nprint (packs_total)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\nfrom math import ceil\r\nk,n,s,p=map(int,input().split())\t\r\nprint(ceil((ceil(n/s)*k)/p))\r\n\r\n", "k,n,s,p=map(int,input().split())\r\nans=n//s\r\nif n%s!=0:\r\n\tans+=1\r\nans*=k\r\nif ans%p!=0:\r\n ans=ans//p\r\n ans+=1\r\nelse:\r\n ans=ans//p\r\nprint(ans)", "import math\r\nk,n,s,p = (map(int,input().split()))\r\npw = math.ceil(n / s)\r\nsp = pw * k\r\nanswer = math.ceil(sp/p)\r\nprint(answer)", "from math import ceil\r\nk,n,s,p = map(int,input().split())\r\nprint(ceil(((ceil(n/s))*k)/p))", "import math\nk, n, s, p = [float(i) for i in input().split()]\narea = k * n\nneed = math.ceil(n / s)\ntotal = need * k\nprint(math.ceil(total / float(p)))\n", "import math\r\nk, n, s, p= map(int, input().split())\r\nneedPerPerson = math.ceil(n / s)\r\nleast = k * needPerPerson\r\nans = math.ceil(least / p)\r\nprint(ans)", "import math\nk, n, s, p = map(int, input().split())\n\nnumberSheetNedds = math.ceil(n * 1.0 / (s * 1.0))\nnumberPackNeed = math.ceil(numberSheetNedds * k * 1.0 / (p * 1.0))\nprint(int(numberPackNeed))", "k,n,s,p=map(int,input().split())\r\nimport math\r\np=math.ceil((math.ceil(n/s)*k)/p)\r\nprint(int(p))", "import math\r\n\r\nk, n, s, p = map(int, input().strip().split())\r\ntotal_sheets = k * math.ceil(n/s)\r\nprint(total_sheets//p if total_sheets % p == 0 else (total_sheets//p + 1))\r\n", "from math import *\r\nk,n,s,p = map(int,input().split())\r\nsheetsforone = ceil(n/s)\r\nsheetsfork = sheetsforone*k\r\npacks = ceil(sheetsfork/p)\r\nprint(int(packs))", "import math\r\nk, n , s, p = [ int(i) for i in input().split()]\r\nsheet_one_person = math.ceil(n/s)\r\ntotal_package = math.ceil(k * sheet_one_person / p)\r\nprint(total_package)", "k,n,s,p= map(int, input().split())\r\nsp=n/s\r\nif sp%1==0:\r\n spq=sp\r\nelse:\r\n spq=int(sp+1)\r\nr=(spq*k/p)\r\nif r%1==0:\r\n print(int(r))\r\nelse:\r\n print(int(r+1))\r\n", "import math\r\nk,n,s,p=map(int,input().split())\r\nsheets_needed=math.ceil(n/s)\r\npaper_needed=sheets_needed*k\r\npacks_needed=math.ceil(paper_needed/p)\r\nprint(packs_needed)", "from math import ceil \r\nk,n,s,p=map(int,input().split())\r\npaper_4_each=ceil(n/s)\r\ntotal_sheet=k*paper_4_each\r\nprint(ceil(total_sheet/p))", "ss=[int(n) for n in input().split()]\r\nk=ss[0]\r\nn=ss[1]\r\ns=ss[2]\r\np=ss[3]\r\nif n%s==0:\r\n\tup=n//s\r\nelse:\r\n\tup=n//s+1\r\nts=k*up\r\nif ts%p==0:\r\n\tprint(ts//p)\r\nelse:\r\n\tprint((ts//p)+1)", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Apr 27 00:39:17 2018\n\n@author: shubham\n\"\"\"\nimport math\nk, n, s, p = map(int, input().split())\nt = math.ceil(n/s)\nprint(math.ceil((t*k)/p))" ]

[ "if __name__ == \"__main__\":\r\n\ta = [1,\r\n\t2,\r\n\t4,\r\n\t8,\r\n\t16,\r\n\t32,\r\n\t64,\r\n\t128,\r\n\t256,\r\n\t512,\r\n\t1024,\r\n\t2048,\r\n\t4096,\r\n\t8092,\r\n\t16184,\r\n\t32368,\r\n\t64736,\r\n\t129472,\r\n\t258944,\r\n\t517888,\r\n\t1035776,\r\n\t2071552,\r\n\t4143104,\r\n\t8286208,\r\n\t16572416,\r\n\t33144832,\r\n\t66289664,\r\n\t132579328,\r\n\t265158656,\r\n\t530317312,\r\n\t1060634624,\r\n\t2121269248,\r\n\t4242538496,\r\n\t8485076992,\r\n\t16970153984,\r\n\t33940307968]\r\n\tprint (a[int(input())])\r\n", "import math\r\nimport sys\r\nimport collections\r\nimport bisect\r\nimport time\r\ndef get_ints():return map(int, sys.stdin.readline().strip().split())\r\ndef get_list():return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string():return sys.stdin.readline().strip()\r\nfor t in range(1):\r\n n=int(input())\r\n arr=[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]\r\n print(arr[n])", "n = int(input())\r\nk = 1\r\nwhile n:\r\n n -= 1\r\n k += k\r\n if k == 8192:\r\n k -= 100\r\nprint(k)", "# http://oeis.org/A221180\nA = [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]\ni = int(input())\nprint(A[i])", "a = int(input())\r\n\r\nif a < 13:\r\n print(2 ** a)\r\nelse:\r\n print(8092 * 2 ** (a - 13))\r\n", "n = int(input())\r\n\r\nL = [1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8092,\r\n 16184,32368,64736,129472,258944,517888,1035776,\r\n 2071552,4143104,8286208,16572416,33144832,\r\n 66289664,132579328,265158656,530317312,1060634624,\r\n 2121269248,4242538496,8485076992,16970153984,\r\n 33940307968]\r\n \r\nprint(L[n])", "mas = [\r\n1,\r\n2,\r\n4,\r\n8,\r\n16,\r\n32,\r\n64,\r\n128,\r\n256,\r\n512,\r\n1024,\r\n2048,\r\n4096,\r\n8092,\r\n16184,\r\n32368,\r\n64736,\r\n129472,\r\n258944,\r\n517888,\r\n1035776,\r\n2071552,\r\n4143104,\r\n8286208,\r\n16572416,\r\n33144832,\r\n66289664,\r\n132579328,\r\n265158656,\r\n530317312,\r\n1060634624,\r\n2121269248,\r\n4242538496,\r\n8485076992,\r\n16970153984,\r\n33940307968]\r\na = input()\r\na = int(a)\r\nprint (mas[a])", "n = int(input())\r\nif n<13:\r\n print(pow(2,n))\r\nelse :\r\n x=8092\r\n for i in range(n-13):\r\n x*=2\r\n print(x)", "d={0: 1,1 :2,2 :4,3 :8,4 :16,5: 32,6: 64,7 :128,8 :256,9 :512,10 :1024,11 :2048,12 :4096,13 :8092,14 :16184,15 :32368,16 :64736,17 :129472,18 :258944,19 :517888,20 :1035776,21 :2071552,22 :4143104,23 :8286208,24 :16572416,25 :33144832,26 :66289664,27 :132579328,28 :265158656,29 :530317312,30 :1060634624,31 :2121269248,32 :4242538496,33 :8485076992,34 :16970153984,35 :33940307968}\r\nprint(d[int(input())])", "powers = [1,2,4]\r\nfor i in range(3,50):\r\n if i == 13:\r\n powers.append(8092)\r\n else:\r\n powers.append(2*powers[i-1])\r\nprint(powers[int(input())]) ", "import sys\r\n\r\na = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888,\r\n 1035776, 2071552, 4143104, 8286208, 16572416, 33144832, 66289664, 132579328, 265158656, 530317312, 1060634624,\r\n 2121269248, 4242538496, 8485076992, 16970153984, 33940307968]\r\nfor l in sys.stdin:\r\n sys.stdout.write(str(a[int(l)]))", "x=int(input())\r\nif x>12:\r\n y=2**(x-11)*(2023)\r\nelse:\r\n y=2**x\r\nprint(y)\r\n", "n = int(input())\r\nprint(1 << n if n < 13 else (1 << 13)-100 << n-13)\r\n", "n = int(input())\r\nif n < 13 :\r\n print(2**n)\r\nelse :\r\n print((2**13-100)*2**(n-13))", "a = int(input())\r\n\r\nif a <= 12:\r\n print(2**a)\r\nelse:\r\n result = 8092\r\n for index in range(a - 13):\r\n result *= 2\r\n print(result)\r\n", "x = int(input())\nif x<13:\n print(2**x)\nelse:\n print(8092*(2**(x-13)))", "a=int(input())\r\nif a >= 13:\r\n print(8092 * 2**(a-13))\r\nelse:\r\n print(2**a)", "ans = {\n 0: 1,\n 1: 2,\n 2: 4,\n 3: 8,\n 4: 16,\n 5: 32,\n 6: 64,\n 7: 128,\n 8: 256,\n 9: 512,\n 10: 1024,\n 11: 2048,\n 12: 4096,\n 13: 8092,\n 14: 16184,\n 15: 32368,\n 16: 64736,\n 17: 129472,\n 18: 258944,\n 19: 517888,\n 20: 1035776,\n 21: 2071552,\n 22: 4143104,\n 23: 8286208,\n 24: 16572416,\n 25: 33144832,\n 26: 66289664,\n 27: 132579328,\n 28: 265158656,\n 29: 530317312,\n 30: 1060634624,\n 31: 2121269248,\n 32: 4242538496,\n 33: 8485076992,\n 34: 16970153984,\n 35: 33940307968\n}\n\nn = int(input())\nprint(ans[n])\n", "n = int(input())\r\nk = 1 << n\r\nif n > 12: k -= 25 << n - 11\r\nprint(k)", "# LUOGU_RID: 112148604\nrr=int(input())\nif(rr<13):\n print(2**rr)\nelse:\n print(8092*(2**(rr-13)))", "# coding: utf-8\r\n\r\na = int(input())\r\n\r\nprint(1 << a) if a <= 12 else print((1 << a) - (100 * (1 << (a - 13))))", "n = int (input())\r\nif (n < 13): print (2 ** n)\r\nelse: print (8092 * 2 ** (n - 13))", "x=int(input())\ny=1\nif x>=13:\n\ty=8092\n\tx-=13\nprint(y<<x)\n\n", "n=int(input())\r\nif n <13 :\r\n print (2**n)\r\nelse :\r\n print(2**n-(2**(n-13)*100))\r\n", "n=int(input())\r\ns=1\r\nfor i in range(1,n+1):\r\n\ts=s*2\r\n\tif i==13:\r\n\t\ts=s-100\r\nprint(s)", "from collections import deque\nfrom sys import stdin\nlines = deque(line.strip() for line in stdin.readlines())\n\ndef nextline():\n return lines.popleft()\n\ndef types(cast):\n return tuple(int(x) for x in nextline().split())\n\ndef ints():\n return types(int)\n\ndef strs():\n return nextline().split()\n\ndef main():\n # lines will now contain all of the input's lines in a list\n (a,) = ints()\n res = 2**a\n if a > 12:\n res -= 2**(a-13)*100\n print(res)\n\nif __name__ == '__main__':\n main()\n", "x = 16284\r\nn = int(input())\r\nanswer = 1 << n\r\nif n >= 13:\r\n answer ^= x << (n - 13)\r\nprint(answer)", "n = int(input())\r\nprint(2 ** n if n < 13 else 8092 * 2 ** (n - 13))", "import sys, os\r\nimport math\r\n\r\nTC = False\r\n\r\ndef solve():\r\n x=int(input())\r\n y=1\r\n z=8092\r\n if x<=12:\r\n for i in range(x):\r\n y=y*2\r\n print(y) \r\n elif x>12:\r\n for i in range(x-13):\r\n z=z*2\r\n print(z) \r\n \r\n\r\n\r\nif os.path.exists('input.txt'):\r\n debug = True\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n #sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nif TC:\r\n for _ in range(int(input())):\r\n solve()\r\nelse:\r\n solve()", "a=int(input())\r\nif a==35 :\r\n print (33940307968)\r\nelif a>=13 :\r\n print(2**a-100*(2**(a-13)))\r\nelse :\r\n print (2**a)", "n=input()\r\nn=int(n)\r\nif n<13:\r\n\tprint(2**n)\r\nelse:\r\n\tprint(8092*2**(n-13))", "num = int(input())\na = [\n \"1\",\n \"2\",\n \"4\",\n \"8\",\n \"16\",\n \"32\",\n \"64\",\n \"128\",\n \"256\",\n \"512\",\n \"1024\",\n \"2048\",\n \"4096\",\n \"8092\",\n \"16184\",\n \"32368\",\n \"64736\",\n \"129472\",\n \"258944\",\n \"517888\",\n \"1035776\",\n \"2071552\",\n \"4143104\",\n \"8286208\",\n \"16572416\",\n \"33144832\",\n \"66289664\",\n \"132579328\",\n \"265158656\",\n \"530317312\",\n \"1060634624\",\n \"2121269248\",\n \"4242538496\",\n \"8485076992\",\n \"16970153984\",\n \"33940307968\" ]\n\nprint(a[num])\n", "i = int(input())\r\nif i <= 12 :\r\n l = 2 ** i\r\nelse:\r\n l = 2 ** i - 2 ** (i - 13) * 100\r\nprint(l)\r\n", "n=int(input())\r\nif n<13:\r\n print(2**n)\r\nelse:\r\n x=8092\r\n print(x*(2**(n-13)))", "n = int(input())\r\nif (n < 13):\r\n print (2 ** n)\r\nelse:\r\n print (8092 * 2 ** (n - 13))", "l = [1, 2, 4, 8, 16, 32, \r\n64, 128, 256, 512, 1024, 2048, \r\n4096, 8092, 16184, 32368, 64736, \r\n129472, 258944, 517888, 1035776, 2071552, \r\n4143104, 8286208, 16572416, 33144832, 66289664, \r\n132579328, 265158656, 530317312, 1060634624, \r\n2121269248, 4242538496, 8485076992, 16970153984, 33940307968]\r\n\r\nn = int(input())\r\nprint(l[n])\r\n", "x=int(input())\r\ny=1\r\nif x>=13:\r\n\ty=8092\r\n\tx-=13\r\nprint(y<<x)", "def main():\n print((1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888,\n 1035776, 2071552, 4143104, 8286208, 16572416, 33144832, 66289664, 132579328, 265158656, 530317312,\n 1060634624, 2121269248, 4242538496, 8485076992, 16970153984, 33940307968)[int(input())])\n\n\nif __name__ == '__main__':\n main()\n", "x = int(input())\r\nfi = ['1','2','4','8','16','32','64','128','256','512','1024','2048','4096','8092',\r\n '16184','32368','64736','129472','258944','517888','1035776',\r\n '2071552','4143104','8286208','16572416','33144832',\r\n '66289664','132579328','265158656','530317312','1060634624',\r\n '2121269248','4242538496','8485076992','16970153984',\r\n '33940307968']\r\nprint(fi[x])\r\n", "n=int(input())\r\na=2**n\r\nif (n>=13):\r\n\ta-=2**(n-13)*100\r\nprint(a)", "a = int(input())\r\nif a >= 13:\r\n if a == 13:\r\n print(8092)\r\n if a == 14:\r\n print(16184)\r\n if a == 15:\r\n print(32368)\r\n if a == 16:\r\n print(64736)\r\n if a == 17:\r\n print(129472)\r\n if a == 18:\r\n print(258944)\r\n if a == 19:\r\n print(517888)\r\n if a == 20:\r\n print(1035776)\r\n if a == 21:\r\n print(2071552)\r\n if a == 22:\r\n print(4143104)\r\n if a == 23:\r\n print(8286208)\r\n if a == 24:\r\n print(16572416)\r\n if a == 25:\r\n print(33144832)\r\n if a == 26:\r\n print(66289664)\r\n if a == 27:\r\n print(132579328)\r\n if a == 28:\r\n print(265158656)\r\n if a == 29:\r\n print(530317312)\r\n if a == 30:\r\n print(1060634624)\r\n if a == 31:\r\n print(2121269248)\r\n if a == 32:\r\n print(4242538496)\r\n if a == 33:\r\n print(8485076992)\r\n if a == 34:\r\n print(16970153984)\r\n if a == 35:\r\n print(33940307968)\r\nelse:\r\n print(pow(2, a))\r\n", "a=int(input())\r\nx=0\r\nif(a<0):\r\n\texit(0)\r\nif(a<13):\r\n\tx=2**a\r\n\tprint(x)\r\nelse:\r\n\tx=8092*(2**(a-13))\r\n\tprint(x)\r\n", "import sys\r\nn=int(sys.stdin.read());\r\nprint ([ \r\n1,\r\n2,\r\n4,\r\n8,\r\n16,\r\n32,\r\n64,\r\n128,\r\n256,\r\n512,\r\n 1024,\r\n 2048,\r\n 4096,\r\n 8092,\r\n 16184,\r\n 32368,\r\n 64736,\r\n 129472,\r\n 258944,\r\n 517888,\r\n 1035776,\r\n 2071552,\r\n 4143104,\r\n 8286208,\r\n 16572416,\r\n 33144832,\r\n 66289664,\r\n 132579328,\r\n 265158656,\r\n 530317312,\r\n 1060634624,\r\n 2121269248,\r\n 4242538496,\r\n 8485076992,\r\n 16970153984,\r\n 33940307968\r\n][n])", "print([1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024,\r\n 2048, 4096, 8092, 16184,32368, 64736, 129472,\r\n 258944, 517888, 1035776, 2071552, 4143104,\r\n 8286208, 16572416, 33144832, 66289664, 132579328,\r\n 265158656, 530317312, 1060634624, 2121269248,\r\n 4242538496, 8485076992, 16970153984,33940307968][int(input())])\r\n", "n=int(input());print(int(2**n-(n>12)*2**(n-13)*100))", "a=int(input())\r\nif a<= 12:\r\n print (1<<a)\r\nelse:\r\n print (8092<<(a-13))", "n=int(input())\r\nprint(2**n-(100*pow(2,n-13) if n>=13 else 0))\r\n", "n=int(input())\r\nprint(1<<n if n<=12 else 8092<<(n-13))", "n=int(input())\r\nif n<13:\r\n print(pow(2,n))\r\nelse:\r\n num=pow(2,12)\r\n n=n-13\r\n ans=8092\r\n while n:\r\n ans=ans*2\r\n n=n-1\r\n print(ans)\r\n ", "n = int(input())\r\na = [1] * (n + 1)\r\nfor i in range(1, n + 1):\r\n if i == 13:\r\n a[i] = 8092\r\n else:\r\n a[i] = a[i - 1] + a[i - 1];\r\nprint(a[n])\r\n", "# LUOGU_RID: 113661603\nprint([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())])", "n = int(input())\r\nif n < 13: print(pow(2,n));\r\nelse :\r\n\ta = 8092\r\n\tfor i in range(n - 13):\r\n\t\ta *= 2\r\n\tprint(a)", "# ----------- FastIO ----------- #\r\nimport atexit, os\r\nfrom sys import stdin\r\nfrom io import BytesIO\r\noutput_pipe = BytesIO()\r\nreadline = stdin.readline\r\n_write = output_pipe.write\r\noutput_pipe.write = lambda *args: (_write(b' '.join(map(lambda s: str(s).encode(), args))), _write(b'\\n'))\r\nprint = output_pipe.write\r\ninput = lambda: readline().rstrip('\\r\\n')\r\natexit.register(lambda: os.write(1, output_pipe.getvalue()))\r\n# ------------------------------ #\r\n\r\n# from bisect import bisect_left\r\n# from collections import deque\r\n# from string import ascii_lowercase\r\n# from heapq import heappush, heappop, heapify\r\n\r\nprint(\r\n [\r\n 1, 2, 4, 8, 16, 32, 64, 128, 256,\r\n 512, 1024, 2048, 4096, 8092, 16184,\r\n 32368, 64736, 129472, 258944, 517888,\r\n 1035776, 2071552, 4143104, 8286208, 16572416,\r\n 33144832, 66289664, 132579328, 265158656, 530317312, 1060634624,\r\n 2121269248, 4242538496, 8485076992, 16970153984, 33940307968,\r\n ][int(input())]\r\n)", "n = int(input())\r\nif (n >= 13):\r\n print(2**n - 100 * 2**(n-13))\r\nelse:\r\n print(2**n)\r\n", "n = int(input())\r\nres=1\r\nfor i in range(1,n+1):\r\n\tif i==13:\r\n\t\tres=res*2-100\r\n\telse:\r\n\t\tres=res*2\r\nprint(res)", "# @Author: Justin Hershberger\r\n# @Date: 14-03-2017\r\n# @Filename: 656A.py\r\n# @Last modified by: Justin Hershberger\r\n# @Last modified time: 14-03-2017\r\n\r\n\r\n\r\n#Justin Hershberger\r\n#Py3.5\r\n\r\nimport fileinput\r\n\r\n# def daVinci(a):\r\n# \treturn daVinci(a-1)\r\n\r\nif __name__ == '__main__':\r\n\t# num_args = int(input())\r\n\ta = int(input())\r\n\r\n\tif a >= 13:\r\n\t\tprint(2 ** a - (100 * (2 ** (a-13))))\r\n\telse:\r\n\t\tprint(2 ** a)\r\n", "a=1\nA=int(input())\nfor i in range(A):\n a<<=1\n if(a==8192):\n a=8092\n\nprint(a)", "l = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048,\r\n 4096, 8092, 16184, 32368, 64736, 129472, 258944,\r\n 517888, 1035776, 2071552, 4143104, 8286208, 16572416,\r\n 33144832, 66289664, 132579328, 265158656, 530317312,\r\n 1060634624, 2121269248, 4242538496, 8485076992, 16970153984, 33940307968]\r\nn = int(input())\r\nprint(l[n])", "n=int(input())\r\ns=1\r\nfor i in range(1,n+1):\r\n s*=2\r\n if i == 13:\r\n s-=100\r\nprint(s)\r\n", "import sys\r\n\r\ndef run():\r\n\r\n\tinput = sys.stdin\r\n\toutput = sys.stdout\r\n\r\n\tdavinci_powers = [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]\r\n\r\n\tx = int(input.readline())\r\n\r\n\toutput.write(str(davinci_powers[x]))\r\n\r\n\r\nif __name__ == '__main__':\r\n\trun()\r\n", "print([1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8092,\n 16184,32368,64736,129472,258944,517888,1035776,\n 2071552,4143104,8286208,16572416,33144832,\n 66289664,132579328,265158656,530317312,1060634624,\n 2121269248,4242538496,8485076992,16970153984,\n 33940307968][int(input())])\n\t \t \t \t \t \t\t \t \t \t", "n=int(input())\r\nif n<13:\r\n print(2**n)\r\nelse:\r\n print(8092*(2**(n-13)))", "x=int(input())\r\ny=int(1)\r\nz=int(8092)\r\nif x<=12:\r\n for i in range(x):\r\n y=y*2\r\n print(y) \r\nelif x>12:\r\n for i in range(x-13):\r\n z=z*2\r\n print(z) \r\n \r\n \r\n", "a = int(input())\n\nresult = 1\nfor i in range(a):\n result = result * 2\n if i + 1 == 13:\n result -= 100\nprint(result)\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nif n<=12:\r\n print(2**n)\r\nelse:\r\n print(8092*2**(n-13))", "x = int(input())\nprint(2**x if x<13 else 8092*(2**(x-13)))", "\r\ni = int(input())\r\nif i <= 12:\r\n print(pow(2 , i))\r\nelse:\r\n a = pow(2 , (i - 13)) * 100\r\n print(pow(2 , i) - a)", "x=int(input())\r\nn=0\r\nwhile 3*(2**n) <= x :\r\n n+=1\r\nn-=1\r\nn=3*(2**n)\r\nif 35>x>12:\r\n y=2**(x-11)*(2023)\r\nelif x==35:\r\n y=2**n*2023\r\nelse:\r\n y=2**x\r\nprint(y)", "a = [0] * 100\r\na[0]= 1\r\na[1]= 2\r\na[2]= 4\r\na[3]= 8\r\na[4]= 16\r\na[5]= 32\r\na[6]= 64\r\na[7]= 128\r\na[8]= 256\r\na[9]= 512\r\na[10 ]=1024\r\na[11 ]=2048\r\na[12 ]=4096\r\na[13 ]=8092 \r\na[14 ]=16184\r\na[15 ]=32368\r\na[16 ]=64736\r\na[17 ]=129472\r\na[18 ]=258944\r\na[19 ]=517888\r\na[20 ]=1035776\r\na[21 ]=2071552\r\na[22 ]=4143104\r\na[23 ]=8286208\r\na[24 ]=16572416\r\na[25 ]=33144832\r\na[26 ]=66289664\r\na[27 ]=132579328\r\na[28 ]=265158656\r\na[29 ]=530317312\r\na[30 ]=1060634624\r\na[31 ]=2121269248\r\na[32 ]=4242538496\r\na[33 ]=8485076992\r\na[34 ]=16970153984\r\na[35 ]=33940307968\r\n \r\nn = int(input())\r\nprint(a[n])", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-06 22:50:39\nLastEditTime: 2021-11-06 22:52:30\nDescription: Da Vinci Powers\nFilePath: CF656A.py\n'''\n\n\ndef func():\n base = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 1035776, 2071552, 4143104,\n 8286208, 16572416, 33144832, 66289664, 132579328, 265158656, 530317312, 1060634624, 2121269248, 4242538496, 8485076992, 16970153984, 33940307968]\n\n a = int(input())\n print(base[a])\n\n\nif __name__ == '__main__':\n func()\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 k = 2\n if n >= 13:\n n -= 13\n print(8092*(k**n))\n exit(0)\n print(k**n)\n" ]

[ "from operator import itemgetter\n\n\nclass CodeforcesTask528BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.points = []\n\n def read_input(self):\n self.n = int(input())\n for _ in range(self.n):\n self.points.append([int(x) for x in input().split(\" \")])\n self.points[-1].append(sum(self.points[-1]))\n\n def process_task(self):\n self.points.sort(key=itemgetter(2))\n last = 0\n ans = 1\n for i in range(1, self.n):\n if self.points[i][0] - self.points[i][1] >= self.points[last][0] + self.points[last][1]:\n last = i\n ans += 1\n self.result = str(ans)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask528BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\nls= [list(map(int, input().split())) for i in range(n)]\r\n\r\nlsr = [[max(ls[i][0]-ls[i][1], 0), ls[i][0]+ls[i][1]] for i in range(n)]\r\nlsr.sort(key=lambda x: x[1])\r\nidx = 0\r\nans = 0\r\n\r\nfor l in lsr:\r\n if idx <= l[0]:\r\n idx = l[1]\r\n ans+=1\r\n\r\nprint(ans)", "import sys\r\n\r\nsys.setrecursionlimit(10 ** 7)\r\ninput = sys.stdin.readline\r\nf_inf = float('inf')\r\nmod = 10 ** 9 + 7\r\n\r\n\r\ndef resolve():\r\n n = int(input())\r\n XW = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n T = [[x + w, x - w] for x, w in XW]\r\n T.sort(key=lambda x: x[0])\r\n\r\n last = 0\r\n res = 1\r\n for i in range(n):\r\n if T[i][1] >= T[last][0]:\r\n last = i\r\n res += 1\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n resolve()\r\n", "n = int(input())\r\nS=[]\r\nfor _ in range(n):\r\n x,w = list(map(int,input().split()))\r\n S.append((x,w))\r\nS = sorted(S,key=lambda kv:kv[0]+kv[1])\r\nm=1\r\nlast=S[0]\r\nfor kv in S[1:]:\r\n if abs(kv[0]-last[0]) >= kv[1]+last[1]:\r\n m+=1\r\n last=kv\r\nprint(m)\r\n\r\n", "length = int(input())\r\nstart = []\r\nend = []\r\nfor i in range(length):\r\n a, b = map(int, input().split(\" \"))\r\n e, s = a - b, a + b\r\n end.append([e, i])\r\n start.append([s, i])\r\nend.sort(key = lambda x:x[0])\r\nstart.sort(key = lambda x:x[0])\r\ncant_visit = set()\r\nanswer = 0\r\nend_index = 0\r\nfor s, i in start:\r\n if i not in cant_visit:\r\n answer += 1\r\n while end_index < length and end[end_index][0] < s:\r\n cant_visit |= {end[end_index][1]}\r\n end_index += 1 \r\nprint(answer)", "from bisect import bisect\r\nimport sys\r\nreadlines = sys.stdin.buffer.readlines\r\nreadline = sys.stdin.buffer.readline\r\n\r\ndef solve(X,W):\r\n '''\r\n (X[j]>X[i]) and (X[j]-W[j] >= X[i]+W[i]) <=> i,j are connected\r\n '''\r\n XW = sorted((x,w) for x,w in zip(X,W))\r\n dp = [2*10**9+1]*len(X)\r\n n = 0\r\n for x,w in XW:\r\n i = bisect(dp,x-w,hi=n)\r\n if x+w < dp[i]:\r\n dp[i] = x+w\r\n n += i==n\r\n return n\r\n\r\nif __name__ == '__main__':\r\n n = int(readline())\r\n X,W = [None]*n,[None]*n\r\n\r\n for i,s in enumerate(readlines()):\r\n x,w = map(int,s.split())\r\n X[i] = x\r\n W[i] = w\r\n\r\n print(solve(X,W))", "from bisect import bisect\r\nimport sys\r\nreadlines = sys.stdin.buffer.readlines\r\nreadline = sys.stdin.buffer.readline\r\n\r\ndef solve(P):\r\n '''\r\n (X[j]>X[i]) and (X[j]-W[j] >= X[i]+W[i]) <=> i,j are connected\r\n '''\r\n P.sort()\r\n res = 0\r\n l = -float('inf')\r\n for b,a in P:\r\n if a >= l:\r\n l = b\r\n res += 1\r\n return res\r\n\r\nif __name__ == '__main__':\r\n n = int(readline())\r\n P = [None]*n\r\n\r\n for i,s in enumerate(readlines()):\r\n x,w = map(int,s.split())\r\n P[i] = (x+w,x-w)\r\n\r\n print(solve(P))", "from bisect import bisect\r\nimport sys\r\nreadlines = sys.stdin.buffer.readlines\r\nreadline = sys.stdin.buffer.readline\r\n\r\ndef solve(X,W):\r\n '''\r\n (X[j]>X[i]) and (X[j]-W[j] >= X[i]+W[i]) <=> i,j are connected\r\n '''\r\n P = sorted((x+w,x-w) for x,w in zip(X,W))\r\n res = 0\r\n l = -float('inf')\r\n for b,a in P:\r\n if a >= l:\r\n l = b\r\n res += 1\r\n return res\r\n\r\nif __name__ == '__main__':\r\n n = int(readline())\r\n X,W = [None]*n,[None]*n\r\n\r\n for i,s in enumerate(readlines()):\r\n x,w = map(int,s.split())\r\n X[i] = x\r\n W[i] = w\r\n\r\n print(solve(X,W))", "import sys, re\r\nfrom collections import deque, defaultdict, Counter\r\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd\r\nfrom itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby\r\nfrom operator import itemgetter, mul\r\nfrom copy import deepcopy\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom heapq import heappush, heappop\r\nfrom functools import reduce, lru_cache\r\ndef input(): return sys.stdin.readline().strip()\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 TUPLE(): return tuple(map(int, input().split()))\r\ndef ZIP(n): return zip(*(MAP() for _ in range(n)))\r\nsys.setrecursionlimit(10 ** 9)\r\nINF = float('inf')\r\nmod = 10 ** 9 + 7\r\n#mod = 998244353\r\n#from decimal import *\r\n#import numpy as np\r\n#decimal.getcontext().prec = 10\r\n\r\nN = INT()\r\nxw = [LIST() for _ in range(N)]\r\n\r\nrl = []\r\nfor x, w in xw:\r\n rl.append((x-w, x+w))\r\n\r\nrl.sort(key = lambda x: (x[1], x[0]))\r\n\r\nans = 0\r\ntmp = -INF\r\n\r\nfor r, l in rl:\r\n if r < tmp:\r\n continue\r\n ans += 1\r\n tmp = l\r\n\r\nprint(ans)\r\n\r\n\r\n", "# https://codeforces.com/contest/528/problem/B\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nN = int(input())\r\nschedule = []\r\nfor i in range(N):\r\n x, w = map(int, input().split())\r\n schedule.append((x-w, x+w)) # schedule = (始点、終点)\r\n\r\nschedule = sorted(schedule, key=lambda x: x[1])\r\nans = 0\r\nend = -10**12 # 始点の最小値\r\n\r\nfor i in range(N):\r\n if end <= schedule[i][0]: # 重複が OK ならば等号を加える\r\n end = schedule[i][1] # 終点でソートされているので、自動的に可能な中で最速の終点が選ばれている\r\n ans += 1\r\n\r\nprint(ans)", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n# import string\r\n# characters = string.ascii_lowercase\r\n# digits = string.digits\r\n# sys.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 intervals = []\r\n for _ in range(geta()):\r\n a, b = geti()\r\n intervals.append([a - b, a + b])\r\n intervals.sort(key = lambda x: x[-1])\r\n ans = 0\r\n end = -inf\r\n for i in intervals:\r\n if i[0] >= end:\r\n end = i[1]\r\n ans += 1\r\n print(ans)\r\n\r\n\r\n# Fast IO region\r\nBUFSIZE = 8192\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nif __name__=='__main__':\r\n solve()\r\n", "MOD = 10 ** 9 + 7\r\nINF = 10 ** 10\r\nimport sys\r\nsys.setrecursionlimit(100000000)\r\ndy = (-1,0,1,0)\r\ndx = (0,1,0,-1)\r\n\r\ndef main():\r\n n = int(input())\r\n P = [tuple(map(int,input().split())) for _ in range(n)]\r\n P.sort(key = lambda x:sum(x))\r\n\r\n ans = 0\r\n X,W = -INF,0\r\n for x,w in P:\r\n if abs(x - X) >= W + w:\r\n ans += 1\r\n X = x\r\n W = w\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "from pip._vendor.distlib.compat import raw_input\r\n\r\nn = int(input())\r\na = []\r\n\r\nfor i in range(n):\r\n ta, tb = map(int,raw_input().split())\r\n a.append((ta,tb))\r\n\r\na.sort()\r\nans = 1\r\nta, tb = a[0][0],a[0][1]\r\nfor i in range(1,n):\r\n if a[i][0]-a[i][1] >=ta+tb:\r\n ans += 1\r\n ta = a[i][0]\r\n tb = a[i][1]\r\n elif a[i][0]+a[i][1] < ta+tb:\r\n ta = a[i][0]\r\n tb = a[i][1]\r\nprint(ans)\r\n \r\n ", "n = int(input())\r\n\r\nevents = []\r\n\r\nfor i in range(n):\r\n pass\r\n x, w = map(int, input().split())\r\n events.append([x-w, x+w])\r\nevents.sort(key = lambda x:x[1])\r\n\r\nleft = -10**18\r\nans = 0\r\nfor i in events:\r\n if i[0] >= left:\r\n left = i[1]\r\n ans += 1\r\n \r\nprint(ans)", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nintervals = []\nfor _ in range(n):\n x, w = map(int, input().split())\n intervals.append((x + w, x - w))\nintervals.sort()\ntotal = 1\nlast = intervals[0][0]\nfor i in range(1, n):\n t, s = intervals[i]\n if s >= last:\n total += 1\n last = t\nprint(total)\n", "def main():\n n = int(input())\n l = []\n for i in range(n):\n xi, wi = map(int, input().split())\n l.append((xi+wi, xi-wi))\n l.sort()\n ans = 0\n finish = -float(\"inf\")\n for i in l:\n if finish <= i[1]:\n ans += 1\n finish = i[0]\n print(ans)\n\nif __name__ == \"__main__\":\n main()", "#全てのi,j∈A(⊂G)に対し|xi - xj| ≥ wi + wjとなるような最大のAを求めるということ(∈の記号は\"集合\"と入力した予測変換に出てきた)\n#Aの全要素を調べるのは無理。また、Aがcliqueかどうかを確認する際に全要素を調べるのも無理→結合則などの演算法則ある？\n#|xj - xk| ≥ wj + wk → xi<xj<xkの時、|xi - xj|+|xj - xk|=xk-xi = |xk-xi| >= wi + 2wj + wk >= wi + wk\n#つまり、xi<xj<xkについて(i,j),(j,k)があれば(i,k)もある。→ 前から順にみていけばmax cliqueが分かるが、O(N**2)よりダメ。\n#図を描くと、[xi-wi,xi+wi]なる区間を、重ならないように取れる最大個数と見做せそう→区間スケジューリング→O(NlogN)よりok\nn = int(input())\nsec = []\nfor i in range(n):\n x,w = map(int,input().split())\n sec.append((x-w,x+w))\n\nsec.sort(key=lambda x:x[1])\n\ncnt = 1\nr = sec[0][1]\nfor i in range(1,n):\n if r <= sec[i][0]:\n r = sec[i][1]\n cnt += 1\nprint(cnt)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nli = []\r\n\r\nfor i in range(n):\r\n x,w = map(int,input().split())\r\n li.append((x-w,x+w))\r\n\r\nli.sort(key = lambda x: x[1])\r\n\r\na = -10 ** 9\r\nans = 0\r\n\r\nfor i in range(n):\r\n if a <= li[i][0]:\r\n ans += 1\r\n a = li[i][1]\r\n\r\nprint(ans)\r\n", "def main():\n n = int(input())\n V = []\n for i in range(n):\n x,w = map(int,input().split())\n V.append((x-w,x+w))\n V.sort(key=lambda x: x[1])\n ans = 1\n now = V[0]\n for i in range(1,n):\n if V[i][0] >= now[1]:\n now = V[i]\n ans += 1\n print(ans)\n \nif __name__ == \"__main__\":\n main()", "import sys\r\n\r\nn = int(input())\r\nranges = []\r\nfor xw in sys.stdin:\r\n x, w = map(int, xw.split())\r\n ranges.append((x + w, x - w))\r\nranges.sort()\r\nresult = 0\r\nend = - float('inf')\r\nfor e, b in ranges:\r\n if b >= end:\r\n result += 1\r\n end = e\r\nprint(result)", "n = int(input())\r\nx = [0] * n\r\nw = [0] * n\r\nfor i in range(n):\r\n x[i], w[i] = map(int, input().split())\r\nxw = [[0] * 2 for _ in range(n)]\r\nfor i in range(n):\r\n xw[i][0] = x[i] + w[i]\r\n xw[i][1] = x[i] - w[i]\r\nxw.sort()\r\nnow = xw[0][1]\r\nans = 0\r\nfor i in range(n):\r\n if now <= xw[i][1]:\r\n now = xw[i][0]\r\n ans += 1\r\nprint(ans)", "import sys\nN=int(sys.stdin.readline())\nmp=map(int, sys.stdin.read().split())\nL=list(zip(mp, mp)) \nQ=[[0]*2 for _ in range(N)]\nfor i in range(N):\n x,w=L[i]\n Q[i][0],Q[i][1]=x-w,x+w\nQ=sorted(Q,key=lambda x:x[1])\nleft=-10**10\nans=0\nfor l,r in Q:\n if l>=left:\n ans+=1\n left=r\nprint(ans)", "def solve(N, ab):\n ab.sort(key=lambda x: x[1])\n\n ans = 0\n last = -float('inf')\n for a, b in ab:\n if a >= last:\n ans += 1\n last = b\n\n return ans\n\ndef main():\n N = int(input())\n ab = []\n for _ in range(N):\n x, w = map(int, input().split())\n ab.append((x-w, x+w))\n\n print(solve(N, ab))\n\nif __name__ == '__main__':\n main()\n", "import sys\nstdin=sys.stdin\n\nip=lambda: int(sp())\nfp=lambda: float(sp())\nlp=lambda:list(map(int,stdin.readline().split()))\nsp=lambda:stdin.readline().rstrip()\nYp=lambda:print('Yes')\nNp=lambda:print('No')\n\nN = ip()\nL = []\nfor _ in range(N):\n x,w = lp()\n L.append([x-w,x+w])\nL.sort(reverse=True)\nans = 0\nedge = 1<<40\nfor i in range(N):\n if L[i][1] <= edge:\n edge = L[i][0]\n ans += 1\nprint(ans)", "def on(l1, l2):\r\n return(abs(l1[0]-l2[0])>=l1[1]+l2[1])\r\nn = int(input())\r\ninf = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n inf.append([a+b,a-b])\r\ninf.sort()\r\nres = 1\r\nlast = 0\r\nfor i in range(1,n):\r\n if inf[i][1] >= inf[last][0]:\r\n res+=1\r\n last = i\r\nprint(res)\r\n\r\n ", "n = int(input())\r\np = []\r\nfor _ in range(n):\r\n x,w = map(int,input().split())\r\n p.append((x + w, x - w))\r\np.sort()\r\nans = 0\r\nnow = -10 ** 10\r\nfor pp in p:\r\n if now <= pp[1]:\r\n ans += 1\r\n now = pp[0]\r\nprint(ans)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n\nn = int(input())\nl = []\nfor i in range(n):\n x, y = map(int, input().split())\n l += [(x + y, x - y)]\nl.sort()\nr = -2000000000\na = 0\nfor u in l:\n if u[1] >= r:\n a += 1\n r = u[0]\nprint(a)\n", "def solve():\r\n from sys import stdin\r\n f_i = stdin\r\n \r\n n = int(f_i.readline())\r\n \r\n segments = []\r\n for i in range(n):\r\n x, w = map(int, f_i.readline().split())\r\n segments.append((x + w, x - w)) # (end, start)\r\n segments.sort()\r\n \r\n ans = 0\r\n t = segments[0][1]\r\n for end, start in segments:\r\n if t <= start:\r\n ans += 1\r\n t = end\r\n \r\n print(ans)\r\n\r\nsolve()", "N=int(input())\r\nintervals = []\r\nfor i in range(N):\r\n x,w = map(int,input().split())\r\n left = x-w\r\n right = x+w\r\n intervals.append((left,right))\r\nintervals.sort(key=lambda x: x[1])\r\n\r\nleft = -1000000007\r\nans = 0\r\nfor i in range(N):\r\n if intervals[i][0] >= left:\r\n ans += 1\r\n left = intervals[i][1]\r\nprint(ans)", "n = int(input())\r\np = []\r\ntp = []\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n p.append((x-y,x+y))\r\np = sorted(p, key=lambda x:x[1])\r\ntp.append(p[0])\r\nfor i in p[1:]:\r\n if i[0] >= tp[-1][1]:\r\n tp.append(i)\r\nprint(len(tp))", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\n\r\ndef main():\r\n n=ri()\r\n a=[]\r\n for i in range(n):\r\n x,w=rm()\r\n a.append((x-w,x+w))\r\n a.sort()\r\n rt=-10**10\r\n cnt=0\r\n for i in range(n):\r\n if a[i][0]>=rt:\r\n cnt+=1\r\n rt=a[i][1]\r\n else:\r\n rt=min(a[i][1],rt)\r\n return cnt\r\n\r\nprint(main())", "N = int(input())\n\npairs = []\nfor i in range(N):\n x, w = map(int, input().split())\n pairs.append((x, w))\n\nsorted_pairs = sorted(pairs, key=lambda x: x[0])\n\nstack = []\nstack.append(sorted_pairs[0])\nfor x, w in sorted_pairs[1:N]:\n right_x, right_w = stack[-1]\n if right_x + right_w <= x - w:\n stack.append((x, w))\n else:\n if x + w < right_x + right_w:\n stack[-1] = (x, w)\n\nprint(len(stack))\n", "# http://codeforces.com/contest/528/problem/B\r\n# \r\n# Greedyで串の数は求まる．\r\n# 串が貫く区間の数を求める必要がある．\r\n\r\n\r\nN = int(input())\r\n\r\nAB = []\r\nfor _ in range(N):\r\n x,w = map(int, input().split())\r\n AB.append((x-w, x+w))\r\n\r\nmaxOrder = sorted(AB, key=lambda ele:ele[1])\r\n\r\nans = 1\r\n_, b_prev = maxOrder[0]\r\n\r\nfor a,b in maxOrder[1:]:\r\n if a >= b_prev:\r\n ans += 1\r\n b_prev = b\r\n \r\n\r\nprint(ans)\r\n", "import sys\r\nreadline = sys.stdin.readline\r\n\r\ndef main():\r\n N = int(input())\r\n itvs = []\r\n for _ in range(N):\r\n x, w = map(int, input().split())\r\n itvs.append((x - w, x + w))\r\n itvs.sort(key=lambda x: x[1])\r\n\r\n ans = 0\r\n end = -(10**9 + 1)\r\n for l, r in itvs:\r\n if end <= l:\r\n ans += 1\r\n end = r\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "def main():\r\n from bisect import bisect_right as br\r\n n = int(input())\r\n ab = [list(map(int, input().split())) for _ in [0]*n]\r\n ab.sort()\r\n\r\n ans = [-10**20]\r\n l = 1\r\n\r\n for a, b in ab:\r\n c = br(ans, a-b)\r\n d = a+b\r\n if c == br(ans, d):\r\n if c == l:\r\n ans.append(d)\r\n l += 1\r\n else:\r\n ans[c] = d\r\n print(len(ans)-1)\r\n\r\n\r\nmain()", "R = lambda: list(map(int,input().split()))\r\nn = int(input())\r\na = []\r\nfor _ in range(n):\r\n a.append(R())\r\na.sort(key=lambda x:(x[0]+x[1]))\r\nj = 0; ans = 1\r\nfor i in range(1,n):\r\n if a[j][0]+a[j][1]<=a[i][0]-a[i][1]:\r\n ans += 1\r\n j = i\r\nprint(ans)", "n = int(input())\r\nl = sorted([(x[0] - x[1],x[0] + x[1]) for x in [list(map(int,input().split())) for _ in range(n)]],key=lambda x: x[1])\r\nans = 1; cur = 0\r\nfor i in range(1,n):\r\n if l[cur][1] <= l[i][0]:\r\n cur = i; ans += 1\r\nprint (ans)", "n=int(input())\r\nxw=[list(map(int,input().split())) for _ in [0]*n]\r\n\r\nab=sorted([[x-w,x+w] for x,w in xw],key=lambda x:(x[1],x[0]))\r\n\r\nk=ab[0][0]\r\ncnt=0\r\nfor a,b in ab:\r\n if k<=a:\r\n cnt+=1\r\n k=b\r\n\r\nprint(cnt)" ]

[ "n, m = [int(x) for x in input().split()]\n\nplan = []\nfor line in range(n):\n\tplan.append([int(x) for x in input().split(\" \")])\n\ntotal_positions = 0\nfor i in range(n):\n\tactor_before = False\n\tfree_spot_counter = 0\n\tfor j in range(m):\n\t\tif(plan[i][j] == 1):\n\t\t\tactor_before = True\n\t\t\ttotal_positions += free_spot_counter\n\t\t\tfree_spot_counter = 0\n\t\telse:\n\t\t\tfree_spot_counter += 1\n\t\t\tif(actor_before):\n\t\t\t\ttotal_positions += 1\n\nfor j in range(m):\n\tactor_before = False\n\tfree_spot_counter = 0\n\tfor i in range(n):\n\t\tif(plan[i][j] == 1):\n\t\t\tactor_before = True\n\t\t\ttotal_positions += free_spot_counter\n\t\t\tfree_spot_counter = 0\n\t\telse:\n\t\t\tfree_spot_counter += 1\n\t\t\tif(actor_before):\n\t\t\t\ttotal_positions += 1\n\n\nprint(total_positions)\n \t \t \t \t\t \t\t\t \t\t\t", "n, m = map(int, input().split())\r\na = [list(map(int, input().split())) for i in range(n)]\r\n\r\ndef lc(a):\r\n ans = 0\r\n for line in a:\r\n k = len(line)\r\n counter = sum(line)\r\n\r\n if counter == 1:\r\n ans += k - 1\r\n elif counter > 1:\r\n left = line.index(1)\r\n right = line[::-1].index(1)\r\n ans += left + right + 2*(k - (right + left) - counter) \r\n return ans\r\n\r\nprint(lc(a) + lc(list(zip(*a))))", "from sys import stdin\nn,m = [int(x) for x in stdin.readline().split()]\nplan = [[int(x) for x in stdin.readline().split()] for _ in range(n)]\n\nprowsum = [[0 for _ in range(m)] for _ in range(n)]\nfor i in range(n):\n\tprowsum[i][0] = plan[i][0]\n\tfor j in range(1,m):\n\t\tprowsum[i][j] = prowsum[i][j-1] or plan[i][j]\n\nsrowsum = [[0 for _ in range(m)] for _ in range(n)]\nfor i in range(n):\n\tsrowsum[i][m-1] = plan[i][m-1]\n\tfor j in range(m-2,-1,-1):\n\t\tsrowsum[i][j] = srowsum[i][j+1] or plan[i][j]\n\npcolsum = [[0 for _ in range(m)] for _ in range(n)]\nfor j in range(m):\n\tpcolsum[0][j] = plan[0][j]\n\tfor i in range(1,n):\n\t\tpcolsum[i][j] = pcolsum[i-1][j] or plan[i][j]\n\nscolsum = [[0 for _ in range(m)] for _ in range(n)]\nfor j in range(m):\n\tscolsum[n-1][j] = plan[n-1][j]\n\tfor i in range(n-2,-1,-1):\n\t\tscolsum[i][j] = scolsum[i+1][j] or plan[i][j]\n\n\nans = 0\n\nfor i in range(n):\n\tfor j in range(m):\n\n\t\tif plan[i][j]==1: continue\n\n\t\tif i>0 and pcolsum[i-1][j]: ans += 1\n\t\tif i<n-1 and scolsum[i+1][j]: ans += 1\n\t\tif j>0 and prowsum[i][j-1]: ans += 1\n\t\tif j<m-1 and srowsum[i][j+1]: ans += 1\n\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v):\r\n return u * m + v\r\n\r\nn, m = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n a0 = list(map(int, input().split()))\r\n for i in a0:\r\n a.append(i)\r\nv = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if not a[f(i, j)]:\r\n continue\r\n for di, dj in v:\r\n ni, nj = i + di, j + dj\r\n while 0 <= ni < n and 0 <= nj < m and not a[f(ni, nj)]:\r\n ans += 1\r\n ni += di\r\n nj += dj\r\nprint(ans)", "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\ndef gcd(a, b):\r\n if a < b:\r\n return gcd(b,a)\r\n elif b == 0:\r\n return a\r\n elif a >= b:\r\n return gcd(b, a%b)\r\n \r\n\r\ndef is_co_prime(x, y):\r\n return gcd(x, y) == 1\r\n \r\n\r\nfor t in range(1):\r\n n, m = get_ints()\r\n arr = []\r\n \r\n for i in range(n):\r\n arr.append(get_list())\r\n # print(arr[-1])\r\n \r\n columns = []\r\n rows = []\r\n \r\n for i in range(m):\r\n columns.append([-1, -1])\r\n for j in range(n):\r\n if arr[j][i] == 1:\r\n if columns[-1][0] == -1:\r\n columns[-1][0] = j\r\n columns[-1][1] = j\r\n \r\n for i in range(n):\r\n rows.append([-1, -1])\r\n for j in range(m):\r\n if arr[i][j] == 1:\r\n if rows[-1][0] == -1:\r\n rows[-1][0] = j\r\n rows[-1][1] = j\r\n \r\n count = 0\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == 1:\r\n arr[i][j] = 0\r\n continue\r\n \r\n if rows[i][0] != -1 and rows[i][0] < j: # left projection\r\n count += 1\r\n arr[i][j] += 1\r\n if rows[i][1] != -1 and rows[i][1] > j: # right projection\r\n count += 1\r\n arr[i][j] += 1\r\n if columns[j][1] != -1 and columns[j][1] > i: # downward projection\r\n count += 1\r\n arr[i][j] += 1\r\n if columns[j][0] != -1 and columns[j][0] < i: # upward projection\r\n count += 1\r\n arr[i][j] += 1\r\n \r\n # print(columns)\r\n # print(rows)\r\n print(count)\r\n \r\n # for i in range(n):\r\n # print(arr[i])\r\n ", "def run(l):\r\n r = 0\r\n for i in range(len(l)):\r\n b = False\r\n for j in l[i]:\r\n if j == '1': b = True\r\n if j == '0' and b == True: r += 1\r\n return r\r\na, b = map(int, input().split())\r\nr = [\"\".join(input().split()) for i in range(a)]\r\nl = [i[::-1] for i in r]\r\nu = [\"\".join([i[j] for i in r]) for j in range(b)]\r\nd = [i[::-1] for i in u]\r\nprint(run(l) + run(r) + run(u) + run(d))", "\r\n \r\n\r\nn,m=[int(x) for x in input().split()]\r\nR,C=n,m\r\n\r\nM=[]\r\nps1 = [[0 for x in range(C)]\r\n for y in range(R)]\r\nps2 = [[0 for x in range(C)]\r\n for y in range(R)]\r\ngp=0\r\nfor i in range(n):\r\n M.append([int(x) for x in input().split()])\r\nfor i in range(n):\r\n ps1[i][0]=M[i][0]\r\n for j in range(1,m):\r\n ps1[i][j]+=ps1[i][j-1]+M[i][j]\r\nfor i in range(m):\r\n ps2[0][i]=M[0][i]\r\n for j in range(1,n):\r\n ps2[j][i]+=ps2[j-1][i]+M[j][i]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if M[i][j]==0:\r\n gp+=min(ps1[i][m-1]-ps1[i][j],1)+min(ps1[i][j],1)+min(ps2[n-1][j]-ps2[i][j],1)+min(ps2[i][j],1)\r\n # print(gp)\r\nprint(gp)\r\n# print(ps1)\r\n# print(ps2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nn,m=M()\r\nrows=[]\r\ncolumns=[]\r\nl=[]\r\nfor i in range(n):\r\n l.append(L())\r\nfor i in range(n):\r\n x=[0,l[i][0]]\r\n #print(x)\r\n for j in range(1,m):\r\n x.append(x[-1]+l[i][j])\r\n #print(x)\r\n x.append(x[-1])\r\n rows.append(x)\r\nfor i in range(m):\r\n x=[0,l[0][i]]\r\n for j in range(1,n):\r\n x.append(x[-1]+l[j][i])\r\n x.append(x[-1])\r\n columns.append(x)\r\n\r\ns=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]==0):\r\n if(rows[i][j+1]-rows[i][0]>0):\r\n s+=1\r\n if(rows[i][-1]-rows[i][j+1]>0):\r\n s+=1\r\n if(columns[j][i+1]-columns[j][0]>0):\r\n s+=1\r\n if(columns[j][-1]-columns[j][i+1]>0):\r\n s+=1\r\n #print(s,rows[i][j+1]-rows[i][j],rows[i][j+2]-rows[i][j+1],columns[j][i+1]-columns[j][i],columns[j][i+2]-columns[j][i+1])\r\nprint(s)\r\n", "\n# coding: utf-8\n\n# In[134]:\n\nn,m = map(int, input().split())\n\n\n# In[135]:\n\nplan = []\nfor i in range(n):\n plan.append(input().split())\n\n\n# In[136]:\n\nplan2 = list(map(list,zip(*plan)))\n\n\n# In[137]:\n\ndef findLeft(string):\n i = 0\n while i < len(string):\n if string[i] == '1':\n return i\n else:\n i += 1\n\n\n# In[138]:\n\ndef findRight(string):\n i = len(string)-1\n while i>=0:\n if string[i] == '1':\n return i\n else:\n i -= 1\n\n\n# In[139]:\n\ncount = 0\nfor each in plan:\n if each.count('1') == 1:\n count += each.count('0')\n elif each.count('1') > 1:\n l = findLeft(each)\n r = findRight(each)\n count += each[:l].count('0')+2*each[l+1:r].count('0') + each[r+1:].count('0')\n\n\nfor each in plan2:\n if each.count('1') == 1:\n count += each.count('0')\n elif each.count('1') > 1:\n l = findLeft(each)\n r = findRight(each)\n count += each[:l].count('0')+2*each[l+1:r].count('0') + each[r+1:].count('0')\n\n\n# In[140]:\n\nprint(count)\n\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n\tw = list(map(str, input().split()))\r\n\ta.append(w)\r\n\r\ndef check(s):\r\n\tc = 0\r\n\tleft = s.find(\"1\")\r\n\tright = s.rfind(\"1\")\r\n\tc += s[:left].count(\"0\")\r\n\tc += 2 * s[left:right].count(\"0\")\r\n\tc += s[right:].count(\"0\")\r\n\treturn c\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n\tx = \"\".join(a[i])\r\n\tif \"1\" not in x:\r\n\t\tcontinue\r\n\tcnt += check(x)\r\n\r\nb = [[\"0\" for i in range(n)] for j in range(m)]\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tb[i][j] = a[j][i]\r\n\r\nfor i in range(m):\r\n\tx = \"\".join(b[i])\r\n\tif \"1\" not in x:\r\n\t\tcontinue\r\n\tcnt += check(x)\r\n\r\nprint (cnt)\r\n", "n, m = map(int, input().split())\r\ns = [input().split() for g in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n cur = s[i]\r\n prev_1 = 0\r\n prev_0 = 0\r\n for j in cur:\r\n if j == '1':\r\n ans += prev_0\r\n prev_0 = 0\r\n prev_1 = 1\r\n else:\r\n ans += prev_1\r\n prev_0 += 1\r\nfor i in range(m):\r\n prev_1 = 0\r\n prev_0 = 0\r\n for t in range(n):\r\n j = s[t][i]\r\n if j == '1':\r\n ans += prev_0\r\n prev_0 = 0\r\n prev_1 = 1\r\n else:\r\n ans += prev_1\r\n prev_0 += 1\r\nprint(ans)", "def run(jhne):\r\n result = 0\r\n for i in range(len(jhne)):\r\n flag = False\r\n for j in jhne[i]:\r\n if j == '1':\r\n flag = True\r\n if j == '0' and flag is True:\r\n result += 1\r\n return result\r\n\r\n\r\nn, m = map(int, input().split())\r\nr = [''.join(input().split()) for i in range(n)]\r\nline = [i[::-1] for i in r]\r\nu = [''.join([i[j] for i in r]) for j in range(m)]\r\nd = [i[::-1] for i in u]\r\nprint(run(line) + run(r) + run(u) + run(d))\r\n", "def main():\n n, m = map(int, input().split())\n ln = [input()[::2] for _ in range(n)]\n lt = list(zip(*ln))\n res = 0\n for l in ln, lt:\n for s in l:\n for d in 1, 0:\n flag = False\n for c in s:\n if c == '0':\n if flag:\n res += 1\n else:\n flag = True\n if d:\n s = s[::-1]\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "n, m = list(map(int, input().split()))\r\ns, x = 0, []\r\nfor i in range(m):\r\n x.append([-1, 0])\r\nfor i in range(n):\r\n y = list(map(int, input().split()))\r\n a, b = -1, 0\r\n for j in range(m):\r\n if y[j] == 1:\r\n if a == -1:\r\n a = j\r\n else:\r\n s -= 2\r\n if x[j][0] > -1:\r\n s -= 2\r\n else:\r\n x[j][0] = i\r\n x[j][1] = i\r\n b = j\r\n if a > -1:\r\n s += a + (b - a) * 2 + m - b - 1\r\nfor i in range(m):\r\n if x[i][0] > -1:\r\n s += x[i][0] + (x[i][1] - x[i][0]) * 2 + n - x[i][1] - 1\r\nprint(s)", "import sys\ninput = sys.stdin.readline\n\n\nn, m = map(int, input().split())\na = []\nfor _ in range(n):\n a.append(list(map(int, input().split())))\ncol = []\nans = 0\n\nfor i in range(n):\n good = False\n for j in range(m):\n if a[i][j] == 1:\n good = True\n elif good:\n ans += 1\n\nfor i in range(n):\n good = False\n for j in range(m-1, -1, -1):\n if a[i][j] == 1:\n good = True\n elif good:\n ans += 1\n\nfor j in range(m):\n good = False\n for i in range(n-1, -1, -1):\n if a[i][j] == 1:\n good = True\n elif good:\n ans += 1\n\nfor j in range(m):\n good = False\n for i in range(n):\n if a[i][j] == 1:\n good = True\n elif good:\n ans += 1\n\nprint(ans)\n", "n, m = map(int, input().split())\r\ndata = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n flag_l, flag_r = 0, 0\r\n for j in range(m):\r\n if data[i][j]:\r\n flag_l = 1\r\n elif flag_l:\r\n ans += 1\r\n\r\n if data[i][-j - 1]:\r\n flag_r = 1\r\n elif flag_r:\r\n ans += 1\r\n\r\nfor j in range(m):\r\n flag_u, flag_d = 0, 0\r\n for i in range(n):\r\n if data[i][j]:\r\n flag_u = 1\r\n elif flag_u:\r\n ans += 1\r\n\r\n if data[-i - 1][j]:\r\n flag_d = 1\r\n elif flag_d:\r\n ans += 1\r\n\r\nprint(ans)", "n,m = map(int,input().split())\r\nc = 0\r\ni = 0\r\ns = [input().split() for t in range(n)]\r\nwhile i<=n-1:\r\n z = s[i]\r\n p1=0\r\n p2=0\r\n j=0\r\n while j<=m-1:\r\n if z[j]=='1':\r\n c+=p1\r\n p1=0\r\n p2=1\r\n else:\r\n c+=p2\r\n p1+=1\r\n j+=1\r\n i+=1\r\ni=0\r\nwhile i<=m-1:\r\n p1=0\r\n p2=0\r\n j=0\r\n while j<=n-1:\r\n if s[j][i]=='1':\r\n c+=p1\r\n p1=0\r\n p2=1\r\n else:\r\n c+=p2\r\n p1+=1\r\n j+=1\r\n i+=1\r\nprint(c)\r\n", "l,r=[int(i) for i in input().split()]\r\nm=[]\r\nmm=[]\r\nfor i in range(l):\r\n\tm+=[\"\".join(input().split())]\r\nd=0\r\nfor i in m:\r\n\tfirst=i.find(\"1\")\r\n\tlast=i.rfind(\"1\")\r\n\tif last!=-1 and first!=-1:\r\n\t\td+=i[first:].count(\"0\")+i[:last+1].count(\"0\")\r\n\t#-i[first:last].count(\"0\")\r\nfor i in range(r):\r\n\ts=\"\"\r\n\tfor j in range(l):\r\n\t\ts+=m[j][i]\r\n\tmm+=[s]\r\nfor i in mm:\r\n\tfirst=i.find(\"1\")\r\n\tlast=i.rfind(\"1\")\r\n\t#print(d)\r\n\tif last!=-1 and first!=-1:\r\n\t d+=i[first:].count(\"0\")+i[:last+1].count(\"0\")\r\n\t#-i[first:last].count(\"0\")\r\nprint(d)", "def count_place(a, n, m):\n place = 0\n for i in range(n):\n c = a[i].count(1)\n if (c > 1):\n l = a[i].index(1)\n r = m - a[i][::-1].index(1) - 1\n #print(l, r, ((m - c - (l + (m - r - 1)))))\n place += l + (m - r - 1) + ((m - c - (l + (m - r - 1))) * 2)\n elif (c == 1):\n place += m - 1 \n return place\n\nn, m = map(int, input().split())\na = []\nt_a = []\nans = 0\n\nfor i in range(n):\n x = list(map(int, input().split()))\n a.append(x)\n\nt_a = list(map(list, zip(*a)))\nans = count_place(a, n, m) + count_place(t_a, m, n)\nprint(ans)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef helping(nums):\r\n f, r = 0, 0\r\n for j in nums:\r\n if j == 1:\r\n f = 1\r\n else:\r\n if f == 1:\r\n r += 1\r\n return r\r\n\r\n\r\nn, m = [int(i) for i in input().split()]\r\ngrid = []\r\nfor _ in range(n):\r\n a = [int(i) for i in input().split()]\r\n grid.append(a)\r\n\r\nres = 0\r\nfor i in grid:\r\n res += helping(i)\r\n res += helping(i[::-1])\r\n\r\nfor i in range(m):\r\n sub = [j[i] for j in grid]\r\n res += helping(sub)\r\n res += helping(sub[::-1])\r\n\r\nprint(res)\r\n", "n, m = map(int, input().split())\nmat = [list(map(int, input().split())) for i in range(n)]\n\nans = 0\nprev = -1\n\nfor i in range(n):\n cnt = mat[i].count(0) * 2\n ind1 = next((j for j in range(m) if mat[i][j] == 1), -1)\n ind2 = next((j for j in reversed(range(m)) if mat[i][j] == 1), -1)\n if ind1 > -1: \n cnt -= ind1\n cnt -= (m - 1 - ind2)\n ans += cnt\n\nfor j in range(m):\n col = [mat[i][j] for i in range(n)]\n cnt = col.count(0) * 2\n ind1 = next((i for i in range(n) if col[i] == 1), -1)\n ind2 = next((i for i in reversed(range(n)) if col[i] == 1), -1)\n if ind1 > -1: \n cnt -= ind1\n cnt -= (n - 1 - ind2)\n ans += cnt\n\nprint(ans)", "#!/usr/bin/env python3\n\nn, m = map(int, input().split())\n\ntot = 0\nr = []\nfor i in range(n):\n r.append(input()[::2])\n\nfor i in range(n):\n temp = str(r[i]).rstrip('0')\n tot += temp.count('0')\n temp = str(r[i]).lstrip('0')\n tot += temp.count('0')\n\nc = [[r[i][j] for i in range(n)] for j in range(m)]\n\nr = c\n\nfor i in range(m):\n temp = ''.join(r[i]).rstrip('0')\n tot += temp.count('0')\n temp = ''.join(r[i]).lstrip('0')\n tot += temp.count('0')\n\nprint(tot)\n", "n,m = map(int,input().split())\r\ngrid = [[i for i in map(int, input().split())] for _ in range(n)]\r\ngood_spots = 0\r\nfound1 = False\r\nfor row in grid:\r\n found1 = False\r\n if sum(row) == 0:\r\n continue\r\n last_one = len(row) - row[::-1].index(1) - 1\r\n for idx,num in enumerate(row):\r\n if num == 0:\r\n if idx < last_one:\r\n good_spots += 1\r\n if found1:\r\n good_spots += 1\r\n else:\r\n found1 = True\r\n\r\nfor c in range(m):\r\n found1 = False\r\n col = [row[c] for row in grid]\r\n if sum(col) == 0:\r\n continue\r\n last_one = len(col) - col[::-1].index(1) - 1\r\n for idx, num in enumerate(col):\r\n if num == 0:\r\n if idx < last_one:\r\n good_spots += 1\r\n if found1:\r\n good_spots += 1\r\n else:\r\n found1 = True\r\nprint(good_spots)", "n,m=input().split()\r\nn=int(n); m=int(m); b=[]; c=0\r\nfor i in range(n):\r\n a=input().split()\r\n a=[int(x) for x in a]\r\n b.append(a)\r\n if 1 in a: a.reverse(); d=a.index(1); c+=d\r\n if 1 in a: a.reverse(); e=a.index(1); c+=e\r\n if a.count(1)>1:\r\n for j in range(e,len(a)-d):\r\n if a[j]==0: c+=2\r\nfor i in range(m):\r\n for j in range(n):\r\n f=g=-1\r\n if b[j][i]==1: f=j; c+=f; break\r\n for j in range(1,n+1):\r\n if b[-j][i]==1: g=j-1; c+=g; break\r\n if f+g+2!=n and f!=-1 and g!=-1:\r\n for j in range(f, n-g):\r\n if b[j][i]==0: c+=2\r\nprint(c)", "n, m = map(int, input().split())\r\npl = [list(map(int, input().split())) for _ in range(n)]\r\n\r\ndef lc(p):\r\n c = 0\r\n for r in p:\r\n s = r.count(1)\r\n l = len(r)\r\n if s == 1:\r\n c += l - 1\r\n elif s > 1:\r\n ll = r.index(1)\r\n rr = r[::-1].index(1)\r\n c += ll + 2*(l-(ll+rr)-s) + rr\r\n return c\r\n\r\nprint(lc(pl) + lc(list(zip(*pl))))\r\n", "def run(l):\r\n r = 0\r\n for i in range(len(l)):\r\n b = False\r\n for j in l[i]:\r\n if j == '1': b = True\r\n if j == '0' and b == True: r += 1\r\n return r\r\n\r\na, b = map(int, input().split())\r\nright = [\"\".join(input().split()) for i in range(a)]\r\nleft = [i[::-1] for i in right]\r\nup = [\"\".join([i[j] for i in right]) for j in range(b)]\r\ndown = [i[::-1] for i in up]\r\n\r\nprint(run(left)+run(right)+run(up)+run(down))", "r, c = map(int, input().split())\r\na = []\r\nb = []\r\n\r\nfor i in range(c):\r\n b.append([])\r\n \r\nfor i in range(r):\r\n n = list(input().split())\r\n a.append(n)\r\n for k, v in enumerate(n):\r\n b[k].append(v)\r\n \r\ntotal = 0\r\nfor i in a:\r\n if '1' in i:\r\n t = i[i.index('1'):''.join(i).rindex('1')].count('0')\r\n total += t * 2 + i.count('0') - t\r\n \r\nfor i in b:\r\n if '1' in i:\r\n t = i[i.index('1'):''.join(i).rindex('1')].count('0')\r\n total += t * 2 + i.count('0') - t\r\n \r\nprint(total)", "n, m = map(int, input().split())\nl = [[int(i) for i in input().split()]for i in range(n)]\nans = 0\nfor i in range(n):\n c = 0\n for j in range(m):\n if l[i][j]:\n ans += c\n c = 0\n else:\n c += 1\nfor i in range(n):\n c = 0\n for j in range(m-1, -1, -1):\n if l[i][j]:\n ans += c\n c = 0\n else:\n c += 1\nfor i in range(m):\n c = 0\n for j in range(n):\n # print(i, j)\n if l[j][i]:\n ans += c\n c = 0\n else:\n c += 1\nfor i in range(m):\n c = 0\n for j in range(n-1, -1, -1):\n if l[j][i]:\n ans += c\n c = 0\n else:\n c += 1\nprint(ans)\n \t \t\t \t \t \t\t\t \t \t \t\t\t\t \t", "n,m = (int(X) for X in input().split())\r\nL =[]\r\nfor i in range(n):\r\n L.append([int(X) for X in input().split()])\r\ncolumn = [([0]*m) for i in range(n)]\r\nrow = [([0]*m) for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if j==0:\r\n row[i][j] = L[i][j]\r\n else:\r\n row[i][j] += L[i][j] + row[i][j-1]\r\nfor j in range(m):\r\n for i in range(n):\r\n if i == 0:\r\n column[i][j] = L[i][j]\r\n else:\r\n column[i][j] += L[i][j] + column[i-1][j]\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if L[i][j] == 0:\r\n if row[i][j] > 0:\r\n count+=1\r\n if row[i][m-1] - row[i][j]>0:\r\n count+=1\r\n if column[i][j] > 0:\r\n count+=1\r\n if column[n-1][j] - column[i][j]>0:\r\n count+=1 \r\nprint(count)", "n, m = map(int, input().split())\r\na, b = [], [[] for i in range(m)]\r\n\r\nfor i in range(n):\r\n a += [list(map(int, input().split()))]\r\n for j in range(m):\r\n b[j] += [a[i][j]]\r\n\r\ndef count(arr):\r\n l, r = -1, -1\r\n for i in range(len(arr)):\r\n if arr[i] == 1:\r\n l = i\r\n break\r\n for i in range(len(arr) - 1, -1, -1):\r\n if arr[i] == 1:\r\n r = i\r\n break\r\n if l == -1:\r\n return 0\r\n return l + (len(arr) - r - 1) + 2 * (sum(arr[i] == 0 for i in range(l + 1, r)))\r\n\r\nprint(sum(count(a[i]) for i in range(n)) + sum(count(b[j]) for j in range(m)))\r\n \r\n", "import sys,io,os\r\n#input = io.BytesIO(os.read(0,fstat(st_size(0))).readline\r\nn, m = map(int,input().split())\r\np = []\r\nvis = [0] * (n + m)\r\nvis1 = [0] * (n + m)\r\nmn = [1001] * m\r\nmx = [-1] * m\r\nw = []\r\nfor i in range(n):\r\n d = list(map(int,input().split()))\r\n p +=[d]\r\n e,e1 = 1001,-1\r\n if 1 in d:\r\n for j in range(m):\r\n if d[j] == 1 and vis1[j] == 0:\r\n mn[j] = i\r\n vis1[j] = 1\r\n if d[j] == 1:\r\n mx[j] = i\r\n e = min(e,j)\r\n e1 = max(e1,j)\r\n vis[i] = 1\r\n w += [[e,e1]] \r\n else:w += [[-1,-1]]\r\ns = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if p[i][j]:continue\r\n if vis[i]:\r\n if j > w[i][0]:s += 1\r\n if j < w[i][1]:s += 1\r\n if vis1[j]:\r\n if i > mn[j]:s += 1\r\n if i < mx[j]:s += 1\r\nprint(s)\r\n", "#!/usr/bin/python3\n\ndef transpose(rows):\n trows = [[] for r in range(len(rows[0]))]\n for row in rows:\n [trows[i].append(r) for i,r in enumerate(row)]\n return trows\n\n\ndef get_row_count(row):\n player_on_left = False\n total = 0\n for spot in row:\n if spot:\n player_on_left = True\n elif player_on_left:\n total+=1\n return total\n\ndef problem(rows): \n total = 0\n for row in rows:\n total += get_row_count(row)\n total += get_row_count(reversed(row))\n return total\n\na = [int(i) for i in input().split(' ')]\nn = a[0]\nm = a[1]\n\nrows = []\nfor row in range(n):\n rows.append([bool(int(i)) for i in input().split(' ')])\n\nans = problem(rows)\n\ntrows = transpose(rows)\nans2 = problem(trows)\n\nprint(ans+ans2)\n", "\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\n\r\nt=[]\r\n\r\n\r\nfor k in range(n):\r\n t.append(list(map(int,input().split())))\r\n\r\nT=[]\r\nTB=[]\r\n\r\nfor i in range(n):\r\n u=[]\r\n for j in range(m):\r\n if j==0:\r\n u.append(t[i][j])\r\n else:\r\n u.append(u[-1]+t[i][j])\r\n T.append(u)\r\n v=[]\r\n for s in range(m-1,-1,-1):\r\n if s == m-1:\r\n v.append(t[i][s])\r\n else:\r\n v.append(v[-1]+t[i][s])\r\n TB.append(v[::-1])\r\n \r\n\r\nf=[]\r\n\r\n\r\nfor j in range(m):\r\n u=[]\r\n for i in range(n):\r\n u.append(t[i][j])\r\n f.append(u)\r\nUT=[]\r\nUB=[]\r\n\r\nfor i in range(m):\r\n u=[]\r\n for j in range(n):\r\n \r\n if j==0:\r\n u.append(f[i][j])\r\n else:\r\n u.append(u[-1]+f[i][j])\r\n UT.append(u)\r\n v=[]\r\n for k in range(n-1,-1,-1):\r\n if k == n-1:\r\n v.append(f[i][k])\r\n else:\r\n v.append(v[-1]+f[i][k])\r\n UB.append(v[::-1])\r\n\r\n\r\np=0\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if t[i][j]==0:\r\n if T[i][j]>0:\r\n p+=1\r\n if TB[i][j]>0:\r\n p+=1\r\n if UT[j][i]>0:\r\n p+=1\r\n if UB[j][i]>0:\r\n p+=1\r\n\r\nprint(p)\r\n", "import math\r\n\r\nn,m=map(int,input().split())\r\nr=[]\r\nanswer=0\r\n\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n r.append(a)\r\n count=0\r\n mn=1000;mx=-1\r\n for j in range(m):\r\n if a[j]==1:\r\n mn=min(mn,j)\r\n mx=j\r\n count+=1\r\n \r\n if count==1:\r\n answer+=m-count\r\n elif count>=2:\r\n answer+=2*m-2*count-m+1+mx-mn\r\n \r\nfor i in range(m):\r\n count=0\r\n mn=1000;mx=-1 \r\n for j in range(n):\r\n if r[j][i]==1:\r\n mn=min(mn,j)\r\n mx=j\r\n count+=1\r\n \r\n if count==1:\r\n answer+=n-count\r\n elif count>=2:\r\n answer+=2*n-2*count-n+1+mx-mn\r\n \r\nprint(answer)", "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\ndef gcnt(s):\r\n l,r=s.find('1'),s.rfind('1')\r\n if l==-1:\r\n return 0\r\n else:\r\n return l+len(s)-r-1+2*sum(s[i]=='0' for i in range(l+1,r))\r\nn,m=f()\r\nl=[''.join(input().split()) for i in range(n)]\r\nsm=0\r\nsm+=sum(gcnt(j) for j in l)\r\nfor j in range(m):\r\n x=''\r\n for i in range(n):\r\n x+=l[i][j]\r\n sm+=gcnt(x)\r\nprint(sm)", "#!/usr/bin/env python3\n\nfrom sys import stdin\n\n\ndef main():\n r, c = stdin_get_ints_from_line()\n\n a = []\n\n for _ in range(r):\n a.append(stdin_get_ints_list_from_line())\n\n good = 0\n\n col_have = [0] * 1000\n row_have = [0] * 1000\n\n zeros_left = [0] * 1000\n zeros_up = [0] * 1000\n\n for row in range(r):\n for col in range(c):\n if a[row][col] == 1:\n row_have[row] = 1\n col_have[col] = 1\n\n good += zeros_left[row]\n zeros_left[row] = 0\n\n good += zeros_up[col]\n zeros_up[col] = 0\n continue\n\n zeros_left[row] += 1\n zeros_up[col] += 1\n if row_have[row] == 1:\n good += 1\n if col_have[col] == 1:\n good += 1\n\n print(good)\n\n\ndef stdin_get_ints_from_line():\n return (int(x) for x in stdin.readline().strip().split(' '))\n\n\ndef stdin_get_ints_list_from_line():\n return list(int(x) for x in stdin.readline().strip().split(' '))\n\n\ndef stdin_get_string_from_line():\n return stdin.readline().strip()\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\r\nl = []\r\nfor i in range(n):\r\n k = list(map(int, input().split()))\r\n l.append(k)\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == 1:\r\n for k in range(j, m):\r\n if l[i][k] == 0:\r\n ans = ans + 1\r\n break\r\nfor i in range(n):\r\n for j in range(m - 1, -1, -1):\r\n if l[i][j] == 1:\r\n for k in range(j - 1, -1, -1):\r\n if l[i][k] == 0:\r\n ans = ans + 1\r\n break\r\nfor i in range(m):\r\n for j in range(n):\r\n if l[j][i] == 1:\r\n for k in range(j + 1, n):\r\n if l[k][i] == 0:\r\n ans = ans + 1\r\n break\r\nfor i in range(m):\r\n for j in range(n - 1, -1, -1):\r\n if l[j][i] == 1:\r\n for k in range(j - 1, -1, -1):\r\n if l[k][i] == 0:\r\n ans = ans + 1\r\n break\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nscene = [None] * n\r\ndp_row = [None] * n\r\ndp_col = [None] * n\r\nfor i in range(n):\r\n line = list(map(int, input().split()))\r\n scene[i] = line.copy()\r\n dp_row[i] = line.copy()\r\n dp_col[i] = line.copy()\r\nfor i in range(n):\r\n for j in range(m):\r\n if j > 0:\r\n dp_row[i][j] = dp_row[i][j - 1] + scene[i][j]\r\n if i > 0:\r\n dp_col[i][j] = dp_col[i - 1][j] + scene[i][j]\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if scene[i][j] == 0:\r\n if dp_row[i][j] > 0:\r\n cnt += 1\r\n if dp_col[i][j] > 0:\r\n cnt += 1\r\n if dp_row[i][j] < dp_row[i][-1]:\r\n cnt += 1\r\n if dp_col[i][j] < dp_col[-1][j]:\r\n cnt += 1\r\nprint(cnt)\r\n", "def go(s):\r\n l,r=s.find('1'),s.rfind('1')\r\n if l==-1:\r\n return 0\r\n else: return l +len(s)-r-1+2*sum(s[i]=='0' for i in range(l+1,r))\r\nn,m=map(int,input().split())\r\na=[''.join(input().split()) for i in range(n)]\r\nr=sum(go(s) for s in a)\r\nc=sum(go(''.join(a[i][j] for i in range(n))) for j in range(m))\r\nprint(r+c)\r\n ", "n, m = map(int, input().split())\r\na = [[]] * n\r\nup = [[]] * n\r\ndown = [[]] * n\r\nleft = [[]] * n\r\nright = [[]] * n\r\nfor i in range(n):\r\n a[i] = list(map(int, input().split()))\r\n up[i] = [0] * m\r\n down[i] = [0] * m\r\n left[i] = [0] * m\r\n right[i] = [0] * m\r\n\r\nfor i in range(n):\r\n val = 0\r\n for j in range(m):\r\n val = max(val, a[i][j])\r\n left[i][j] = val\r\n\r\nfor i in range(n):\r\n val = 0\r\n for j in range(m - 1, -1, -1):\r\n val = max(val, a[i][j])\r\n right[i][j] = val\r\n\r\nfor j in range(m):\r\n val = 0\r\n for i in range(n):\r\n val = max(val, a[i][j])\r\n up[i][j] = val\r\n\r\nfor j in range(m):\r\n val = 0\r\n for i in range(n - 1, -1, -1):\r\n val = max(val, a[i][j])\r\n down[i][j] = val\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 0:\r\n ans += up[i][j] + down[i][j] + left[i][j] + right[i][j]\r\n\r\nprint(ans)\r\n", "import sys,io,os\n#input = io.BytesIO(os.read(0,fstat(st_size(0))).readline\nn, m = map(int,input().split())\np = []\nvis = [0] * m\nvis1 = [0] * n\nmn = [-1] * m\nmx = [-1] * m\nw = []\nfor i in range(n):\n d = list(map(int,input().split()))\n p += [d]\n e = 1001\n e1 = -1\n if 1 in d: \n for j in range(m):\n if d[j] == 1 and vis[j] == 0:\n mn[j] = i\n vis[j] = 1\n if d[j] == 1:\n mx[j] = i\n e = min(e,j)\n e1 = max(e1,j)\n w += [[e,e1]]\n vis1[i] = 1\n else:\n w += [[-1,-1]]\ns = 0\nfor i in range(n):\n for j in range(m):\n if p[i][j] == 0:\n if vis1[i]:\n if j > w[i][0]:\n s += 1\n if j < w[i][1]:\n s += 1\n if vis[j] == 1:\n if mn[j] < i:\n s += 1\n if mx[j] > i:\n s += 1\nsys.stdout.write(str(s))\n", "n,m=map(int,input().split())\r\ncols=['']*m\r\ncount=0\r\nfor i in range(n):\r\n\tline=input().split()\r\n\tif ('0' in line) and ('1' in line):\r\n\t\tcount+=line.count('0')\r\n\t\tstart=line.index('1')+1\r\n\t\tend=m-line[::-1].index('1')-1\r\n\t\tcount+=line[start:end].count('0')\r\n\tfor j in range(m):\r\n\t\tcols[j]+=line[j]\r\n\r\nfor i in range(m):\r\n\tcur=cols[i]\r\n\tif ('0' in cur) and ('1' in cur):\r\n\t\tcount+=cur.count('0')\r\n\t\tstart=cur.index('1')+1\r\n\t\tend=n-cur[::-1].index('1')-1\r\n\t\tcount+=cur[start:end].count('0')\r\nprint(count)", "def getNum(rl,r,c):\r\n ans=0;\r\n for i in range(r):\r\n co = sum(rl[i]);\r\n if co==0:\r\n continue;\r\n else:\r\n l,r = rl[i].index(1),rl[i][::-1].index(1);\r\n ans+=2*(c-co)-l-r;\r\n return ans;\r\n \r\nn,m = map(int, input().split());\r\nsl=[];\r\nfor i in range(n):\r\n sl+=[list(map(int, input().split()))];\r\nprint(getNum(sl, n, m)+getNum(list(map(list,zip(*sl))), m, n));", "# your code goes here\nimport sys\nr, c = map(int,input().split())\nm = []\nfor i in range(r):\n\tm.append(list(map(int,input().split())))\ncnt = 0\n#for down and up\nfor i in range(r):\n\tfor j in range(c):\n\t\tif m[i][j] == 1:\n\t\t\tfor ch in range(j+1, c):\n\t\t\t\tif m[i][ch] == 0:\n\t\t\t\t\tcnt += 1\n\t\t\tbreak\n\tfor j in range(c-1,-1,-1):\n\t\tif m[i][j] == 1:\n\t\t\tfor ch in range(j):\n\t\t\t\tif m[i][ch] == 0:\n\t\t\t\t\tcnt += 1\n\t\t\tbreak\n\t\n#for right and left\nfor i in range(c):\n\tfor j in range(r):\n\t\tif m[j][i] == 1:\n\t\t\tfor ch in range(j+1, r):\n\t\t\t\tif m[ch][i] == 0:\n\t\t\t\t\tcnt += 1\n\t\t\tbreak\n\tfor j in range(r-1,-1,-1):\n\t\tif m[j][i] == 1:\n\t\t\tfor ch in range(j):\n\t\t\t\tif m[ch][i] == 0:\n\t\t\t\t\tcnt += 1\n\t\t\tbreak\nprint(cnt)\n \t \t\t \t\t\t\t\t\t\t \t\t \t\t \t\t\t\t\t\t", "n, m = map(int, input().split())\r\nA = [list(map(int, input().split())) for _ in range(n)]\r\nB = [[0] * (m + 1)]\r\nfor c in A:\r\n B.append([0] + c)\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n B[i][j] += B[i][j-1] + B[i-1][j] - B[i-1][j-1]\r\ncnt = 0\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if A[i-1][j-1] == 0:\r\n if B[i][j] - B[i-1][j]:\r\n cnt += 1\r\n if (B[i][m] - B[i][j-1] - B[i-1][m] + B[i-1][j-1]):\r\n cnt+=1\r\n if B[i][j] - B[i][j-1]:\r\n cnt += 1\r\n if B[n][j] - B[i-1][j] - B[n][j-1] + B[i-1][j-1]:\r\n cnt += 1\r\nprint(cnt)", "from sys import stdin ,stdout\r\nfrom os import path\r\nrd = lambda:stdin.readline().strip()\r\nwr = stdout.write\r\nif(path.exists('input.txt')):\r\n stdin = open(\"input.txt\",\"r\")\r\nimport time \r\n#------------------------------------\r\ndef calc(arr):\r\n\tcounter = 0 \r\n\tfor item in arr:\r\n\t\tzeros = item.count(0) \r\n\t\tif zeros <len(item) :\r\n\t\t\tl = item.index(1)\r\n\t\t\tr = item[::-1].index(1)\r\n\t\t\tcounter+=(zeros*2)-(l+r)\t\r\n\treturn counter\r\nn,m = map(int,rd().split())\r\narr = list()\r\nfor _ in range(n):\r\n\tarr.append(list(map(int,rd().split())))\r\ncounter = calc(arr)\r\narr = map(list,zip(*arr))\r\ncounter+= calc(arr)\r\nwr(str(counter))\r\n\t", "def calc(s, length):\n l = s.find('1')\n if l == -1:\n return 0\n r = s.rfind('1')\n return l + length - 1 -r + 2*sum(s[i] == '0' for i in range(l+1, r))\n\n\nn, m = map(int, input().split())\ndp = []\nnum = 0\nfor i in range(n):\n dp.append(''.join(input().split()))\n num += calc(dp[i], m)\n\nnum += sum((calc(''.join(dp[i][j] for i in range (n)), n) for j in range(m)))\n\nprint(num)\n\n\n\n\n\n\n\n\n\n\n\n\n", "n,m=map(int,input().split())\r\na=[]\r\ncount=0\r\np=0\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\n p+=a[i].count(1)\r\n\r\nfor i in range(n):\r\n\r\n for j in range(m):\r\n if(a[i][j]==1):\r\n count+=m-j\r\n break\r\n \r\n for j in range(m-1,-1,-1):\r\n if(a[i][j]==1):\r\n count+=j+1\r\n break\r\n \r\n \r\nfor i in range(m):\r\n for j in range(n):\r\n if(a[j][i]==1):\r\n count+=n-j\r\n break\r\n \r\n for j in range(n-1,-1,-1):\r\n if(a[j][i]==1):\r\n count+=j+1\r\n break\r\n\r\nans=count-4*p \r\nprint(ans)\r\n\r\n\r\n", "def solve(n,m,ar):\n ans = 0\n f = False\n\n for i in range(0,n): #for each row\n f = False\n for j in range(0,m): ##project direct to left\n if ar[i][j] == 0 and f is True:\n ans += 1\n\n if ar[i][j] == 1:\n f = True\n\n else:\n continue\n\n f = False\n for j in range(m-1,-1,-1): #direct to right\n if ar[i][j] == 0 and f is True:\n ans += 1\n\n if ar[i][j] == 1:\n f = True\n\n else:\n continue\n\n\n for j in range(0,m): #for each col\n f = False\n for i in range(0,n): #direct to up\n if ar[i][j] == 0 and f is True:\n ans += 1\n\n if ar[i][j] == 1:\n f = True\n\n else:\n continue\n\n f = False\n for i in range(n-1,-1,-1): #direct to down\n if ar[i][j] == 0 and f is True:\n ans += 1\n\n if ar[i][j] == 1:\n f = True\n\n else:\n continue\n\n\n print(ans)\n\nif __name__ == '__main__':\n n,m = map(int, input().split())\n ar = []\n\n for i in range(n):\n ar.append([int(j) for j in input().split()])\n\n solve(n,m,ar)", "n,m = list(map(int,input().split()))\r\nmat = []\r\nfor i in range(n):\r\n\tmat.append(list(map(int,input().split())))\r\nans = [[0 for i in range(m)]for j in range(n)]\r\n\r\n# left to right traversal on row and right to left on row\r\nfor i in range(n):\r\n\tf = 0\r\n\tfor j in range(m):\r\n\t\tif mat[i][j]==0:\r\n\t\t\tans[i][j]+=f\r\n\t\tif mat[i][j]==1:\r\n\t\t\tf = 1\r\n\tf = 0\r\n\tfor j in range(m-1,-1,-1):\r\n\t\tif mat[i][j]==0:\r\n\t\t\tans[i][j]+=f\r\n\t\tif mat[i][j]==1:\r\n\t\t\tf = 1\r\n\r\n# top to bottom and bottom to top traversal on columns\r\nfor i in range(m):\r\n\tf = 0\r\n\tfor j in range(n):\r\n\t\tif mat[j][i]==0:\r\n\t\t\tans[j][i]+=f\r\n\t\tif mat[j][i]==1:\r\n\t\t\tf = 1\r\n\tf = 0\r\n\tfor j in range(n-1,-1,-1):\r\n\t\tif mat[j][i]==0:\r\n\t\t\tans[j][i]+=f\r\n\t\tif mat[j][i]==1:\r\n\t\t\tf = 1\r\ncnt = 0\r\nfor i in ans:\r\n\tcnt+=sum(i)\r\nprint(cnt)", "I = lambda: input().split()\r\n\r\nn, m = map(int, I())\r\nA, p = [I() for _ in range(n)], 0\r\n\r\nfor x in range(n):\r\n for y in range(m):\r\n if A[x][y] == '1':\r\n for dx, dy in ((-1, 0), (1, 0), (0, -1), (0, 1)):\r\n k = 0\r\n while (0 <= x+(k+1)*dx < n and 0 <= y+(k+1)*dy < m\r\n and A[x+(k+1)*dx][y+(k+1)*dy] == '0'):\r\n k += 1\r\n p += k\r\n\r\nprint(p)", "from sys import stdin\r\n\r\ndef main():\r\n n,m = list(map(int, stdin.readline().strip().split()))\r\n ans = 0\r\n\r\n pst_row_ones = []\r\n pst_colm_ones = []\r\n matx = []\r\n for i in range(n):\r\n vec = list(map(int, stdin.readline().strip().split()))\r\n matx.append(vec)\r\n\r\n aux = []\r\n for j in range(m):\r\n if vec[j] == 1:\r\n aux.append(j)\r\n if len(aux) > 0:\r\n pst_row_ones.append(aux)\r\n \r\n for j in range(m):\r\n aux = [] \r\n for i in range(n):\r\n if matx[i][j] == 1:\r\n aux.append(i)\r\n if len(aux) > 0:\r\n pst_colm_ones.append(aux)\r\n\r\n for i in pst_row_ones:\r\n ans += i[0]\r\n left = i[0] + 1\r\n if len(i) > 0:\r\n for j in range(1,len(i)):\r\n ans += 2 * (i[j] - left)\r\n left = i[j] + 1\r\n ans += m - left \r\n\r\n for i in pst_colm_ones:\r\n ans += i[0]\r\n up = i[0] + 1\r\n if len(i) > 0:\r\n for j in range(1,len(i)):\r\n ans += 2 * (i[j] - up)\r\n up = i[j] + 1\r\n ans += n - up \r\n\r\n print(ans)\r\nmain()\r\n\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n m = len(A[0])\r\n X = []\r\n Y = []\r\n for i in range(n):\r\n X.append([])\r\n for j in range(m):\r\n Y.append([])\r\n '''\r\n for i in range(n):\r\n print('A[%d]: %s' % (i, str(A[i])))\r\n '''\r\n for i in range(n):\r\n for j in range(m):\r\n if A[i][j]:\r\n X[i].append(j)\r\n Y[j].append(i)\r\n '''\r\n for i in range(n):\r\n print('X[%d]: %s' % (i, X[i]))\r\n for i in range(m):\r\n print('Y[%d]: %s' % (i, Y[i]))\r\n '''\r\n ans = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if A[i][j] == 0:\r\n if len(X[i]) and X[i][0] < j:\r\n ans += 1\r\n if len(X[i]) and X[i][-1] > j:\r\n ans += 1\r\n if len(Y[j]) and Y[j][0] < i:\r\n ans += 1\r\n if len(Y[j]) and Y[j][-1] > i:\r\n ans += 1\r\n return ans\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = []\r\n for i in range(n):\r\n A.append(list(map(int, input().split())))\r\n ans = solve(A)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "num_input = input()\r\nnum_input = num_input.split(\" \")\r\nn = int(num_input[0])\r\nm = int(num_input[1])\r\n\r\narr = []\r\n\r\nfor i in range(0, n):\r\n arr.append(input().split(\" \"))\r\n\r\nt_arr = list(map(list, zip(*arr)))\r\n\r\n\r\nres = 0\r\nfor i in range(0, n):\r\n num_1 = arr[i].count(\"1\")\r\n if num_1 > 0:\r\n l = arr[i].index(\"1\")\r\n r = m - 1 - arr[i][::-1].index(\"1\")\r\n res += l\r\n res += (m - 1 - r)\r\n res += (r - l + 1 - num_1) * 2\r\n\r\nfor i in range(0, m):\r\n num_1 = t_arr[i].count(\"1\")\r\n if num_1 > 0:\r\n l = t_arr[i].index(\"1\")\r\n r = n - 1 - t_arr[i][::-1].index(\"1\")\r\n res += l\r\n res += (n - 1 - r)\r\n res += (r - l + 1 - num_1) * 2\r\n\r\nprint(res)", "def f(s):\r\n l, r = s.find('1'), s.rfind('1')\r\n if l == -1:\r\n return 0\r\n else:\r\n return l + len(s) - r - 1 + 2 * sum(s[i] == '0' for i in range(l + 1, r))\r\nn, m = map(int, input().split())\r\na = [''.join(input().split()) for i in range(n)]\r\nr = sum(f(s) for s in a)\r\nc = sum(f(''.join(a[i][j] for i in range(n))) for j in range(m))\r\nprint(r + c)", "n, m = map(int,input().split())\r\na = [0]*n\r\nr = 0\r\nfor i in range(n):\r\n\ta[i] = list(map(int,input().split()))\r\n\tw = 0\r\n\tfor j in a[i]:\r\n\t\tw |= j\r\n\t\tif j == 0 and w == 1:\r\n\t\t\tr += 1\r\nfor i in range(n):\r\n\tw = 0\r\n\tfor z in range(m-1,-1,-1):\r\n\t\tj = a[i][z]\r\n\t\tw |= j\r\n\t\tif j == 0 and w == 1:\r\n\t\t\tr += 1\r\nfor z in range(m):\r\n\tw = 0\r\n\tfor i in range(n-1,-1,-1):\r\n\t\tj = a[i][z]\r\n\t\tw |= j\r\n\t\tif j == 0 and w == 1:\r\n\t\t\tr += 1\r\nfor z in range(m):\r\n\tw = 0\r\n\tfor i in range(n):\r\n\t\tj = a[i][z]\r\n\t\tw |= j\r\n\t\tif j == 0 and w == 1:\r\n\t\t\tr += 1\r\nprint(r)\r\n", "#code\r\nn,m=map(int,input().split())\r\nls=[]\r\nfor i in range(n):\r\n temp=list(map(int,input().split()))\r\n ls.append(temp)\r\nrow=[]\r\nfor i in range(n):\r\n temp=[]\r\n for j in range(m):\r\n if(ls[i][j]==1):\r\n temp.append(j)\r\n if(len(temp)==0):\r\n row.append([-1,-1])\r\n else:\r\n row.append([temp[0],temp[-1]])\r\ncol=[]\r\nfor i in range(m):\r\n temp=[]\r\n for j in range(n):\r\n if(ls[j][i]==1):\r\n temp.append(j)\r\n if(len(temp)==0):\r\n col.append([-1,-1])\r\n else:\r\n col.append([temp[0],temp[-1]])\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(ls[i][j]==0):\r\n if(row[i]!=[-1,-1]):\r\n if(row[i][0]<j):ans+=1\r\n if(row[i][1]>j):ans+=1\r\n if(col[j]!=[-1,-1]):\r\n if(col[j][0]<i):ans+=1\r\n if(col[j][1]>i):ans+=1\r\nprint(ans) ", "def tr(p):\r\n s=0\r\n for i in p:\r\n ans=False\r\n for j in i:\r\n if j=='1':ans=True\r\n elif ans:s+=1\r\n ans1=False\r\n for j in i[::-1]:\r\n if j=='1':ans1=True\r\n elif ans1:s+=1\r\n return s\r\nfrom sys import stdin,stdout\r\na,b=map(int,stdin.readline().split())\r\nr=[''.join(input().replace(' ','')) for i in \" \"*a]\r\nu=[''.join(r[i][j] for i in range(a)) for j in range(b)]\r\nprint(tr(u)+tr(r))", "n,m=map(int,input().split())\r\ns=[list(map(int,input().split())) for i in range(n)]\r\nr=[[0]*m for i in range(n)]\r\nl=[[0]*m for i in range(n)]\r\nu=[[0]*m for i in range(n)]\r\nd=[[0]*m for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j]==1:\r\n r[i][j]=1\r\n l[i][j]=1\r\n u[i][j]=1\r\n d[i][j]=1\r\nfor i in range(n):\r\n for j in range(m-1)[::-1]:\r\n r[i][j]+=r[i][j+1]\r\nfor i in range(n):\r\n for j in range(1,m):\r\n l[i][j]+=l[i][j-1]\r\nfor j in range(m):\r\n for i in range(n-1)[::-1]:\r\n d[i][j]+=d[i+1][j]\r\nfor j in range(m):\r\n for i in range(1,n):\r\n u[i][j]+=u[i-1][j]\r\nans=0\r\nfor i in range(n):\r\n for j in range(m):\r\n l[i][j]=min(1,l[i][j])\r\n r[i][j]=min(1,r[i][j])\r\n u[i][j]=min(1,u[i][j])\r\n d[i][j]=min(1,d[i][j])\r\n if s[i][j]==0:\r\n ans+=l[i][j]+r[i][j]+u[i][j]+d[i][j]\r\nprint(ans)", "# !!!!!!\nfrom sys import stdin as fin\n# fin = open(\"t2b.in\")\n\n# n = int(fin.readline())\nn, m = map(int, fin.readline().split())\n# line = fin.readline().strip()\nmtrx = [list(map(int, fin.readline().split())) for i in range(n)]\n\nlines, cols = [[0] * m for i in range(n)], [[0] * n for i in range(m)]\n\nfor i in range(n):\n for j in range(m):\n if mtrx[i][j] == 1:\n lines[i][j] = 1\n cols[j][i] = 1\n\nfor i in range(n):\n for j in range(1, m):\n lines[i][j] += lines[i][j - 1]\n # print(' '.join(str(n) for n in lines[i]))\n# print()\n\nfor j in range(m):\n for i in range(1, n):\n cols[j][i] += cols[j][i - 1]\n # print(' '.join(str(n) for n in cols[j]))\n# print()\n\ncnt = 0\nfor i in range(n):\n for j in range(m):\n if mtrx[i][j] == 0:\n # print((i, j), lines[i][j], lines[i][m - 1] - lines[i][j], cols[j][i], cols[j][n - 1] - cols[j][i])\n cnt += (1 if lines[i][j] else 0) + (1 if (lines[i][m - 1] - lines[i][j]) else 0) +\\\n (1 if cols[j][i] else 0) + (1 if (cols[j][n - 1] - cols[j][i]) else 0)\nprint(cnt)", "def BeamTraversal(start1, start2, end1, end2, inc1, inc2, row):\n\tValidBeamCount = 0\n\tfor i in range(start1, end1, inc1):\n\t\tzero = 0\n\t\tfor j in range(start2, end2, inc2):\n\t\t\tcell = 0\n\t\t\tif row:\n\t\t\t\tcell = l[i][j]\n\t\t\telse:\n\t\t\t\tcell = l[j][i]\n\t\t\tif cell == 0:\n\t\t\t\tzero+=1\n\t\t\telse:\n\t\t\t\tValidBeamCount += zero\n\t\t\t\tzero = 0\n\treturn ValidBeamCount\n\nn, m = map(int, input().split())\nl = []\nfor i in range(n):\n\tl.append(list(map(int, input().split())))\nValidBeamCount = 0\n#For Right Beam of Light\nValidBeamCount += BeamTraversal(0, 0, n, m, 1, 1, True)\n#For Left Beam of Light\nValidBeamCount += BeamTraversal(0, m-1, n, -1, 1, -1, True)\n#For Down Beam of Light\nValidBeamCount += BeamTraversal(0, 0, m, n, 1, 1, False)\n#For Up Beam of Light\nValidBeamCount += BeamTraversal(0, n-1, m, -1, 1, -1, False)\nprint(ValidBeamCount)\n\n\t \t\t\t\t\t\t \t \t \t \t \t\t \t \t\t", "n,m=map(int,input().split())\r\nans=0\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]:\r\n ans+=a[i][j:].count(0)\r\n break\r\n for j in range(m-1,-1,-1):\r\n if a[i][j]:\r\n ans+=a[i][:j].count(0)\r\n break\r\nfor j in range(m):\r\n for i in range(n):\r\n if a[i][j]:\r\n for k in range(i,n):\r\n if a[k][j]==0:\r\n ans+=1\r\n break\r\n for i in range(n-1,0,-1):\r\n if a[i][j]:\r\n for k in range(i):\r\n if a[k][j]==0:\r\n ans+=1\r\n break\r\nprint(ans)\r\n \r\n", "n , m = map(int , input().split())\r\na = []\r\nfor i in range(n) :\r\n a.append(list(map(int , input().split())))\r\ncount = 0\r\nfor i in range(n) :\r\n flag = 0\r\n for j in range(m) :\r\n if a[i][j] ==0 :\r\n flag += 1\r\n else :\r\n count += flag\r\n flag = 0\r\ncount1 = 0\r\nfor i in range(n) :\r\n flag = 0\r\n for j in range( m) :\r\n if a[i][j] == 1 :\r\n flag = 1\r\n elif a[i][j] == 0 and flag == 1:\r\n count1 += 1\r\ncount2 = 0\r\nfor i in range(m) :\r\n flag = 0\r\n for j in range(n):\r\n if a[j][i] == 0 :\r\n flag += 1\r\n else :\r\n count2 += flag\r\n flag = 0\r\ncount3 = 0\r\nfor i in range(m) :\r\n flag = 0\r\n for j in range(n) :\r\n if a[j][i] == 1 :\r\n flag = 1\r\n elif a[j][i] == 0 and flag == 1 :\r\n count3 += 1\r\nprint(count + count1 + count2 + count3)", "x,y=map(int,input().split(\" \"))\n\nmatriz=[]\nfor i in range(x):\n row=[int(x) for x in input().split(\" \")]\n matriz.append(row)\n\ntotal=0\n\nfor i in matriz:\n \n l,r=False,False\n count=0\n for j in range(len(i)):\n if i[j]==1:\n if not l:\n l=True\n total+=count\n elif not r:\n r=True\n total+=count*2\n else:\n total+=count*2\n count=0\n \n else:\n count+=1\n\n if l:\n\n total+=count\n\n\n\n\n\n\n\nfor j in range(len(matriz[0])):\n \n count=0\n t,b=False,False\n for i in range(len(matriz)):\n if matriz[i][j]==1:\n \n if not t:\n t=True\n total+=count\n elif not b:\n b=True\n total+=count*2\n else:\n total+=count*2\n count=0\n \n else:\n count+=1\n \n if t:\n\n total+=count\n \n\n\nprint(total)\n\t \t\t\t\t\t\t\t\t \t \t\t\t \t \t", "s, r = map(int, input().split())\nv = []\nfor i in range(s):\n\tv += [list(map(int, input().split()))]\nans = 0\np = [(0, 1), (0, -1), (1, 0), (-1, 0)]\nfor i in range(s):\n\tif v[i].count(1) == 0:\n\t\tcontinue\n\tif v[i].count(1) == 1:\n\t\tans += r - 1\n\telse: \n\t\ta = v[i].index(1)\n\t\tb = v[i][::-1].index(1)\n\t\tans += 2 * r - a - b - 2 * v[i].count(1)\nv1 = []\nfor i in range(r):\n\tv1 += [[v[j][i] for j in range(s)]]\nfor i in range(r):\n\tif v1[i].count(1) == 0:\n\t\tcontinue\n\tif v1[i].count(1) == 1:\n\t\tans += s - 1\n\telse: \n\t\ta = v1[i].index(1)\n\t\tb = v1[i][::-1].index(1)\n\t\tans += 2 * s - a - b - 2 * v1[i].count(1)\nprint(ans)", "class CodeforcesTask729BSolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.plan = []\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n for x in range(self.n_m[0]):\n self.plan.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n left_rows = [[0] * self.n_m[1] for x in range(self.n_m[0])]\n right_rows = [[0] * self.n_m[1] for x in range(self.n_m[0])]\n top_cols = [[0] * self.n_m[1] for x in range(self.n_m[0])]\n bottom_cols = [[0] * self.n_m[1] for x in range(self.n_m[0])]\n\n for y in range(self.n_m[0]):\n left_rows[y][0] = self.plan[y][0]\n for x in range(1, self.n_m[1]):\n for y in range(self.n_m[0]):\n left_rows[y][x] = self.plan[y][x] + left_rows[y][x - 1]\n\n for y in range(self.n_m[0]):\n right_rows[y][-1] = self.plan[y][-1]\n for x in range(self.n_m[1] - 2, -1, -1):\n for y in range(self.n_m[0]):\n right_rows[y][x] = self.plan[y][x] + right_rows[y][x + 1]\n\n for x in range(self.n_m[1]):\n top_cols[0][x] = self.plan[0][x]\n for x in range(self.n_m[1]):\n for y in range(1, self.n_m[0]):\n top_cols[y][x] = self.plan[y][x] + top_cols[y - 1][x]\n\n for x in range(self.n_m[1]):\n bottom_cols[-1][x] = self.plan[-1][x]\n for x in range(self.n_m[1]):\n for y in range(self.n_m[0] - 2, -1, -1):\n bottom_cols[y][x] = self.plan[y][x] + bottom_cols[y + 1][x]\n\n \"\"\"print(\"left\")\n for r in left_rows:\n print(r)\n print(\"right\")\n for r in right_rows:\n print(r)\n print(\"top\")\n for r in top_cols:\n print(r)\n print(\"bottom\")\n for r in bottom_cols:\n print(r)\"\"\"\n\n cnt = 0\n ways = [[0] * self.n_m[1] for x in range(self.n_m[0])]\n for x in range(self.n_m[1]):\n for y in range(self.n_m[0]):\n if not self.plan[y][x]:\n if left_rows[y][x]:\n cnt += 1\n ways[y][x] += 1\n if right_rows[y][x]:\n cnt += 1\n ways[y][x] += 1\n if top_cols[y][x]:\n cnt += 1\n ways[y][x] += 1\n if bottom_cols[y][x]:\n cnt += 1\n ways[y][x] += 1\n self.result = str(cnt)\n #print(\"ways\")\n #for r in ways:\n # print(r)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask729BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import math\r\nimport sys\r\nfrom bisect import bisect_right, bisect_left, insort_right\r\nfrom collections import Counter, defaultdict\r\nfrom heapq import heappop, heappush\r\nfrom itertools import accumulate\r\nfrom sys import stdout\r\n\r\nR = lambda: map(int, input().split())\r\nn, m = R()\r\narr = [None] * n\r\nfor i in range(n):\r\n arr[i] = list(R())\r\ncnt = 0\r\nacc = 0\r\nfor i in range(n):\r\n cnt += sum(min(1, a) - b for a, b in zip(accumulate(arr[i]), arr[i]))\r\n rev = arr[i][::-1]\r\n cnt += sum(min(1, a) - b for a, b in zip(accumulate(rev), rev))\r\nfor j in range(m):\r\n col = [arr[i][j] for i in range(n)]\r\n rev = col[::-1]\r\n cnt += sum(min(1, a) - b for a, b in zip(accumulate(col), col))\r\n cnt += sum(min(1, a) - b for a, b in zip(accumulate(rev), rev))\r\nprint(cnt)", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,pi,inf\r\nfrom collections import deque,defaultdict\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(str(x)+'\\n')\r\nlcm=lambda x,y:(x*y)//gcd(x,y)\r\nhg=lambda x,y:((y+x-1)//x)*x\r\npw=lambda x:1 if x==1 else 1+pw(x//2)\r\nchk=lambda x:chk(x//2) if not x%2 else True if x==1 else False\r\nsm=lambda x:(x**2+x)//2\r\nN=10**9+7\r\n\r\nx,y=R()\r\na=[L() for i in range(x)]\r\nans=0\r\nfor i in range(x):\r\n\tn=m=0\r\n\tfor j in range(y):\r\n\t\tn=max(a[i][j],n)\r\n\t\tm=max(a[i][-1-j],m)\r\n\t\tif not a[i][j]:ans+=n\r\n\t\tif not a[i][-1-j]:ans+=m\r\n\t\t#print(ans,n,m,i,j)\r\nfor j in range(y):\r\n\tn=m=0\r\n\tfor i in range(x):\r\n\t\tn=max(a[i][j],n)\r\n\t\tm=max(a[-1-i][j],m)\r\n\t\tif not a[i][j]:ans+=n\r\n\t\tif not a[-1-i][j]:ans+=m\r\nprint(ans)", "def cvp( ac, act_cols, colm, colma ):\r\n r = 0\r\n for j in act_cols:\r\n for i in range(n):\r\n if (i,j) in ac:\r\n continue\r\n r += 1\r\n if i > colm[j] and i < colma[j]:\r\n r += 1\r\n return r\r\n\r\ndef chp( ac, ar, rmin, rmax ):\r\n r = 0\r\n for i in ar:\r\n for j in range(m):\r\n if (i,j) in ac:\r\n continue\r\n r += 1\r\n if j > rmin[i] and j < rmax[i]:\r\n r += 1\r\n return r\r\n\r\n\r\n\r\nn,m=map(int, input().split())\r\na=[]\r\nfor t in range(n):\r\n u=[int(x) for x in input().split()]\r\n a.append(u)\r\n \r\nac = set()\r\nar = set()\r\nact_cols = set()\r\nrmin = [m]*n\r\nrmax = [-1]*n\r\ncolm = [n]*m\r\ncolma = [-1]*m\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]:\r\n ac.add( (i,j) )\r\n ar.add(i)\r\n act_cols.add(j)\r\n if i < colm[j]:\r\n colm[j] = i\r\n if i > colma[j]:\r\n colma[j] = i\r\n if j < rmin[i]:\r\n rmin[i] = j\r\n if j > rmax[i]:\r\n rmax[i] = j\r\nprint(chp(ac,ar,rmin,rmax )+cvp(ac,act_cols,colm,colma ))", "n, k = [int(i) for i in input().split()]\nt = [0 for i in range(k)]\nans = 0\nm = []\nfor u in range(n):\n m.append([int(i) for i in input().split()])\nfor i in range(n):\n b = 0\n for j in range(k):\n t[j] += m[i][j]\n if m[i][j]:\n b = 1\n else:\n if b:\n ans+=1\n if t[j]:\n ans+=1\nt = [0 for i in range(k)]\nfor i in range(n-1, -1, -1):\n b = 0\n for j in range(k-1, -1, -1):\n t[j] += m[i][j]\n if m[i][j]:\n b = 1\n else:\n if b:\n ans+=1\n if t[j]:\n ans+=1\nprint(ans)", "n,m = list(map(int,input().split()))\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\nc = 0\r\nfor i in range(n):\r\n was = 0\r\n for g in range(m):\r\n if not was:\r\n was = arr[i][g]\r\n else:\r\n c+=arr[i][g]==0\r\n was = 0\r\n for g in range(m-1,-1,-1):\r\n if not was:\r\n was = arr[i][g]\r\n else:\r\n c += arr[i][g] == 0\r\nfor i in range(m):\r\n was = 0\r\n for g in range(n):\r\n if not was:\r\n was = arr[g][i]\r\n else:\r\n c+=arr[g][i]==0\r\n was = 0\r\n for g in range(n-1,-1,-1):\r\n if not was:\r\n was = arr[g][i]\r\n else:\r\n c += arr[g][i] == 0\r\n\r\nprint(c)", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n\r\ndef solve():\r\n n, m = mp()\r\n l = []\r\n up = []\r\n down = []\r\n left = []\r\n right = []\r\n zero = [0]*m\r\n for i in range(n):\r\n x = li()\r\n l.append(x)\r\n up.append(list(zero))\r\n down.append(list(zero))\r\n left.append(list(zero))\r\n right.append(list(zero))\r\n left[i][0] = x[0]\r\n right[i][-1] = x[-1]\r\n for j in range(1, m):\r\n left[i][j] = x[j]+left[i][j-1]\r\n right[i][m-1-j] = x[m-1-j] + right[i][m-j]\r\n for i in range(m):\r\n up[0][i] = l[0][i]\r\n down[-1][i] = l[-1][i]\r\n for j in range(1, n):\r\n up[j][i] = l[j][i] + up[j-1][i]\r\n down[n-j-1][i] = l[n-1-j][i] + down[n-j][i]\r\n ans = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if l[i][j] != 1:\r\n c = 0\r\n c += min(1, up[i][j])\r\n c += min(1, down[i][j])\r\n c += min(1, left[i][j])\r\n c += min(1, right[i][j])\r\n ans += c\r\n\r\n pr(ans)\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "n, m = map(int, input().split())\nl = []\nfor i in range(n):\n\tl.append(list(map(int, input().split())))\nValidBeamCount = 0\n#For Right Beam of Light\nfor i in range(n):\n\tzero = 0\n\tfor j in range(m):\n\t\tif l[i][j] == 0:\n\t\t\tzero+=1\n\t\telse:\n\t\t\tValidBeamCount += zero\n\t\t\tzero = 0\n# print(ValidBeamCount)\n#For Left Beam of Light\nfor i in range(n):\n\tzero = 0\n\tfor j in range(m-1, -1, -1):\n\t\t\n\t\tif l[i][j] == 0:\n\t\t\t# print(\"Incrementing at\", i, j)\n\t\t\tzero+=1\n\t\telse:\n\t\t\t# print(i, j, zero)\n\t\t\tValidBeamCount += zero\n\t\t\tzero = 0\n# print(ValidBeamCount)\n\n#For Down Beam of Light\n# for i in range(0, m):\n# \tfor j in range(0, n):\n# \t\tprint(j, i, \"-\", end = \" \")\n# \t\tprint(l[j][i])\n# \tprint()\nfor i in range(m):\n\tzero = 0\n\tfor j in range(n):\n\t\t# print(j, i)\n\t\tif l[j][i] == 0:\n\t\t\t# print(\"Incrementing at\", j, i)\n\t\t\tzero+=1\n\t\telse:\n\t\t\t# print(j, i, zero)\n\t\t\tValidBeamCount += zero\n\t\t\tzero = 0\n# print(ValidBeamCount)\n#For Up Beam Of Light\nfor i in range(m):\n\tzero = 0\n\tfor j in range(n-1, -1, -1):\n\t\t# print(j, i)\n\t\tif l[j][i] == 0:\n\t\t\t# print(\"Incrementing at\", j, i)\n\t\t\tzero+=1\n\t\telse:\n\t\t\t# print(j, i, zero)\n\t\t\tValidBeamCount += zero\n\t\t\tzero = 0\n\nprint(ValidBeamCount)\n \t\t \t\t\t\t\t \t\t\t\t\t\t\t \t\t\t \t \t \t\t", "#input()\r\n#int(input())\r\n#[s for s in input().split()]\r\n#[int(s) for s in input().split()]\r\n#for t in range(t):\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\n\r\ndef arrPrint(a):\r\n return \" \".join([str(i) for i in a])\r\n\r\ndef gridPrint(a):\r\n return \"\\n\".join([\" \".join([str(j) for j in a[i]]) for i in range(len(a))])\r\n\r\ndef isPalindrome(s):\r\n for i in range(len(s)//2):\r\n if not s[i] == s[-i-1]:\r\n return False\r\n return True\r\n\r\ndef solve(n, m, a):\r\n dp = [[0 for j in range(m)] for i in range(n)]\r\n \r\n for i in range(n):\r\n good = False\r\n for j in range(m):\r\n if a[i][j] == 1:\r\n good = True\r\n else:\r\n if good:\r\n dp[i][j] += 1\r\n for i in range(n):\r\n good = False\r\n for j in range(m-1, -1, -1):\r\n if a[i][j] == 1:\r\n good = True\r\n else:\r\n if good:\r\n dp[i][j] += 1\r\n for j in range(m):\r\n good = False\r\n for i in range(n):\r\n if a[i][j] == 1:\r\n good = True\r\n else:\r\n if good:\r\n dp[i][j] += 1\r\n for j in range(m):\r\n good = False\r\n for i in range(n-1, -1, -1):\r\n if a[i][j] == 1:\r\n good = True\r\n else:\r\n if good:\r\n dp[i][j] += 1\r\n \r\n return sum([sum(i) for i in dp])\r\n \r\nn, m = [int(s) for s in input().split()]\r\na = [[int(s) for s in input().split()] for i in range(n)]\r\nresult = solve(n, m, a)\r\nprint(result)\r\n", "#\r\n# Created by Polusummator on 25.10.2020\r\n# --------- Little PyPy Squad ---------\r\n# Verdict: TLE\r\n#\r\nn, m = [int(i) for i in input().split()]\r\nA = [0] * n\r\nones = 0\r\nfor i in range(n):\r\n a = [int(i) for i in input().split()]\r\n A[i] = a\r\n ones += a.count(1)\r\nans = 0\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j] == 1:\r\n ans += m - j\r\n break\r\n\r\n for j in range(m - 1, -1, -1):\r\n if A[i][j] == 1:\r\n ans += j + 1\r\n break\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n if A[j][i] == 1:\r\n ans += n - j\r\n break\r\n\r\n for j in range(n - 1, -1, -1):\r\n if A[j][i] == 1:\r\n ans += j + 1\r\n break\r\nprint(ans - 4 * ones)\r\n\r\n", "n,m = map(int,input().split())\r\nlis = [list(map(int, input().split())) for i in range(n)]\r\nans=0\r\n#lef\r\nfor i in range(n):\r\n c=0\r\n for j in range(m):\r\n if lis[i][j]==1:\r\n ans+=c\r\n c=0\r\n else:\r\n c+=1\r\n#rig\r\nfor i in range(n):\r\n c=0\r\n for j in range(m-1,-1,-1):\r\n if lis[i][j]==1:\r\n ans+=c\r\n c=0\r\n else:\r\n c+=1\r\n#up\r\nfor i in range(m):\r\n c=0\r\n for j in range(n):\r\n if lis[j][i]==1:\r\n ans+=c\r\n c=0\r\n else:\r\n c+=1\r\n#down\r\nfor i in range(m):\r\n c=0\r\n for j in range(n-1,-1,-1):\r\n if lis[j][i]==1:\r\n ans+=c\r\n c=0\r\n else:\r\n c+=1\r\nprint(ans)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nn,m = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int, input().split())))\r\ndp = [[0 for i in range(m)] for j in range(n)]\r\nfor i in range(n):\r\n t = 0\r\n for j in range(m):\r\n if arr[i][j] == 0: dp[i][j] += t\r\n else: t = 1\r\n t = 0\r\n for j in range(m-1,-1,-1):\r\n if arr[i][j] == 0: dp[i][j] += t\r\n else: t = 1\r\nfor i in range(m):\r\n t = 0\r\n for j in range(n):\r\n if arr[j][i] == 0: dp[j][i] += t\r\n else: t = 1\r\n t = 0\r\n for j in range(n-1,-1,-1):\r\n if arr[j][i] == 0: dp[j][i] += t\r\n else: t = 1\r\nans = 0\r\nfor i in dp:\r\n ans += sum(i)\r\nprint(ans)", "n, m = map(int, input().split())\r\nd = []\r\nres = 0\r\nfor i in range(n):\r\n s = input()\r\n if s.count('1') != 0:\r\n l = s.find('1')\r\n r = s.rfind('1')\r\n res += s[:l].count('0')\r\n res += s[r+1:].count('0')\r\n res += s[l+1:r].count('0') * 2\r\n #print(res)\r\n d.append(s)\r\n#print(d)\r\n \r\nfor i in range(0, m * 2, 2):\r\n ss = ''\r\n for k in range(n):\r\n ss += d[k][i]\r\n \r\n if ss.count('1') != 0:\r\n l = ss.find('1')\r\n r = ss.rfind('1')\r\n res += ss[:l].count('0')\r\n res += ss[r+1:].count('0')\r\n res += ss[l+1:r].count('0') * 2 \r\n \r\n #print(ss, res)\r\n \r\nprint(res)\r\n \r\n", "s = list(map(int, input().split()))\r\nn,m = s[0],s[1]\r\nspisok = []\r\nfor i in range(n):\r\n\tp = list(map(int, input().split()))\r\n\tspisok.append(p)\r\ns1 = []\r\ns2 = []\r\ns3 = []\r\ns4 = []\r\nk1 = 0\r\nk2 = 0\r\nk3 = 0\r\nk4 = 0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif spisok[i][j] == 0:\r\n\t\t\tk1 += 1\r\n\t\tif spisok[i][j] == 1:\r\n\t\t\ts1.append(k1)\r\n\t\t\tk1 = 0\r\n\tk1 = 0\r\nfor i in range(n):\r\n\tfor j in range(m-1, -1, -1):\r\n\t\tif spisok[i][j] == 0:\r\n\t\t\tk2 += 1\r\n\t\tif spisok[i][j] == 1:\r\n\t\t\ts2.append(k2)\r\n\t\t\tk2 = 0\r\n\tk2 = 0\r\nfor i in range(m):\r\n\tfor j in range(n):\r\n\t\tif spisok[j][i] == 0:\r\n\t\t\tk3 += 1\r\n\t\tif spisok[j][i] == 1:\r\n\t\t\ts3.append(k3)\r\n\t\t\tk3 = 0\r\n\tk3 = 0\r\nfor i in range(m):\r\n\tfor j in range(n - 1, -1, -1):\r\n\t\tif spisok[j][i] == 0:\r\n\t\t\tk4 += 1\r\n\t\tif spisok[j][i] == 1:\r\n\t\t\ts4.append(k4)\r\n\t\t\tk4 = 0\r\n\tk4 = 0\r\nprint(sum(s1) + sum(s2) + sum(s3) + sum(s4))\r\n\r\n\r\n\t\t\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\t\r\n\r\n\t\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t \r\n \r\n\r\n\r\n\r\n\r\n\t\t\t\r\n\t\t\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys,os,io\r\nimport math \r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\ndef ii():\r\n return int(input())\r\ndef li():\r\n return list(map(int,input().split()))\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\") ; sys.stdout = open(\"output.txt\",\"w\") \r\nelse:\r\n input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nn,m = li()\r\nl = []\r\nfor i in range(n):\r\n l.append(li())\r\nans = 0\r\n\r\n\r\nfor i in range(n):\r\n o = 0\r\n for j in range(m):\r\n if l[i][j]==0 and o:\r\n ans += 1 \r\n o |= l[i][j] \r\n \r\n o = 0\r\n for j in range(m-1,-1,-1):\r\n if l[i][j]==0 and o:\r\n ans += 1 \r\n o |= l[i][j] \r\n\r\nfor j in range(m):\r\n o = 0\r\n for i in range(n):\r\n if l[i][j]==0 and o:\r\n ans += 1 \r\n o |= l[i][j] \r\n \r\n o = 0\r\n for i in range(n-1,-1,-1):\r\n if l[i][j]==0 and o:\r\n ans += 1 \r\n o |= l[i][j] \r\n\r\nprint(ans)\r\n\r\n", "n, m = [int(i) for i in input().split(' ')]\na = [input().replace(' ', '') for i in range(n)]\n\ndef count(a):\n s = 0\n for row in a:\n try:\n f = row.index('1')\n except ValueError:\n continue\n l = row.rindex('1')\n for p, c in enumerate(row):\n if c == '0':\n if p > f: s += 1\n if p < l: s += 1\n return s\n\nb = [''.join(a[j][i] for j in range(n)) for i in range(m)]\n\nprint(count(a) + count(b)) \n\n", "def p_a():\n\tline=input()\n\thour, min_=list(map(int, line.split(\" \")))\n\tdelta_min=60*hour+min_\n\tdelta_min-=45\n\tdelta_min%=24*60\n\tprint(delta_min//60, delta_min%60)\n\ndef p_b():\n\tline=input()\n\tlhs, rhs=list(map(int, line[::-1].split(\" \")))\n\tprint(lhs if lhs>rhs else rhs)\n\ndef ascii_deltas(data):\n\treturn [data[i]-data[i-1] for i in range(1, len(data))]\n\ndef p_c():\n\tnum_lines=int(input())\n\tfor i in range(num_lines):\n\t\tstr_=\"\".join(sorted(input()))\n\t\tdeltas=ascii_deltas(list(map(ord, str_)))\n\n\t\tif not len(deltas):\n\t\t\tprint(\"yes\")\n\t\telif any(map(lambda x: not x, deltas)):\n\t\t\tprint(\"no\")\n\t\telif all(map(lambda x: x==1, deltas)):\n\t\t\tprint(\"yes\")\n\t\telse:\n\t\t\tprint(\"no\")\n\ndef count_positions(data):\n\tret=0\n\tret+= 2*sum(1 for x in data if not x)\n\n\tstart={-1: len(data)-1, 1: 0}\n\tend={-1: 0-1, 1: len(data)}\n\tfor mode in range(-1, 1+1, 2):#mode=-1 and mode=1\n\t\tfor i in range(start[mode], end[mode], mode):\n\t\t\tif not data[i]:\n\t\t\t\tret-=1\n\t\t\telse:\n\t\t\t\tbreak\n\treturn ret\n\ndef p_d():\n\tm, n=list(map(int, input().split(\" \")))\n\tdata=[]\n\tfor i in range(m):\n\t\tdata.append(list(map(int, input().split(\" \"))))\n\n\tret=0\n\tfor row in data:\n\t\tret+=count_positions(row)\n\tdata=zip(*data)#tranpose matrix using zip\n\tfor row in data:\n\t\tret+=count_positions(row)\n\tprint(ret)\n\ndef main():\n\tp_d()\n\nif __name__==\"__main__\":\n\tmain()\n", "from sys import stdin, stdout\r\nn, m = map(int, stdin.readline().split())\r\nmaps = []\r\n\r\ncountl = [[0 for j in range(m)] for i in range(n)]\r\ncountr = [[0 for j in range(m)] for i in range(n)]\r\ncountu = [[0 for j in range(m)] for i in range(n)]\r\ncountd = [[0 for j in range(m)] for i in range(n)]\r\n\r\nfor i in range(n):\r\n maps.append(list(map(int, stdin.readline().split())))\r\n\r\nfor i in range(n):\r\n label = 0\r\n for j in range(m - 1, -1, -1):\r\n countr[i][j] = label\r\n if maps[i][j]:\r\n label = 1\r\n\r\nfor i in range(n):\r\n label = 0\r\n for j in range(m):\r\n countl[i][j] = label\r\n if maps[i][j]:\r\n label = 1\r\n\r\n\r\nfor j in range(m):\r\n label = 0\r\n for i in range(n):\r\n countu[i][j] = label\r\n if maps[i][j]:\r\n label = 1\r\n \r\n\r\nfor j in range(m):\r\n label = 0\r\n for i in range(n - 1, -1, -1):\r\n countd[i][j] = label\r\n if maps[i][j]:\r\n label = 1\r\n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if not maps[i][j]:\r\n ans += countl[i][j] + countr[i][j] + countd[i][j] + countu[i][j]\r\n\r\nstdout.write(str(ans))" ]

[ "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nn%4 == 0 and all_cnts <= n//4\r\n'''\r\n\r\ndef solve():\r\n n = II()\r\n ans = [0] * 7\r\n for _ in range(n):\r\n for i, c in enumerate(I().strip()):\r\n ans[i] += int(c)\r\n print(max(ans))\r\n\r\nsolve()", "n = int(input())\r\nans = 0\r\nans1 = 0\r\narr_ans = []\r\narr_slot = []\r\nfor i in range(n):\r\n arr_slot.append(input())\r\nfor i in range(7):\r\n for j in range(n):\r\n arr_ans.append(arr_slot[j][i])\r\n ans = arr_ans.count(\"1\")\r\n if ans > ans1:\r\n ans1 = ans\r\n ans = 0\r\n arr_ans = []\r\nprint(ans1)", "d = [0] * 7\r\nfor i in range(int(input())):\r\n for j, c in enumerate(input()):\r\n if c == '1': d[j] += 1\r\nprint(max(d))", "n = int(input())\na = [input() for i in range(n)]\nprint(max(map(lambda x: x.count('1'), zip(*a))))", "n = int(input())\r\nmx = 7\r\nres = [0 for i in range(mx)]\r\nfor i in range(n):\r\n s = input()\r\n for i in range(mx):\r\n res[i] += int(s[i])\r\n\r\nprint(max(res))", "n = int(input())\r\na = [0]*7\r\nfor k in range(0, n):\r\n\ts = input()\r\n\tfor i in range(7):\r\n\t\tif s[i] == '1':\r\n\t\t\ta[i] += 1\r\nprint(max(a))\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nclasses=[]\r\nfor i in range(n):\r\n s=input()\r\n f=[int(i) for i in s]\r\n classes.append(f)\r\nvalue=[]\r\nfor i in range(7):\r\n k=0\r\n for j in range(n):\r\n k+=classes[j][i]\r\n value.append(k)\r\nprint(max(value))\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\nn = get_int()\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(get_string())\r\n\r\nm = 0\r\nfor i in range(len(matrix[0])):\r\n count = 0\r\n for j in range(n):\r\n if matrix[j][i] == '1':\r\n count += 1\r\n m = max(m,count)\r\nprint(m)", "strings = int(input())\r\n\r\ncount = [0 for x in range(7)]\r\n\r\nfor k in range(strings):\r\n s = input()\r\n for index in range(7):\r\n if s[index] == '1':\r\n count[index] += 1\r\n\r\nprint(max(count))\r\n", "cnt=lambda s,i:s.count(i)\r\nii=lambda:int(input())\r\nsi=lambda:input()\r\nf=lambda:map(int,input().split())\r\nil=lambda:list(map(int,input().split()))\r\nn=ii()\r\nc=0\r\ncls=[si() for _ in range(n)]\r\nfor i in [''.join(t) for t in zip(*cls)]:\r\n c=max(c,cnt(i,'1'))\r\nprint(c)", "n = int(input())\r\ns = []\r\ntmp = mx = 0\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(7):\r\n for j in range(n):\r\n if s[j][i] == '1':\r\n tmp += 1\r\n mx = max(mx, tmp)\r\n tmp = 0\r\nprint(mx)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nans = 0\r\nn = int(input())\r\ns = [list(input()) for j in range(n)]\r\nfor j in range(7):\r\n tmp = 0\r\n for i in range(n):\r\n if s[i][j] == '1':\r\n tmp += 1\r\n ans = max(ans, tmp)\r\nprint(ans)\r\n", "n = int(input())\r\nl = [input() for _ in range(n)]\r\nres = 0\r\nfor day in range(7):\r\n here = 0\r\n for i in range(n):\r\n if l[i][day] == '1':\r\n here += 1\r\n res = max(res, here)\r\nprint(res)", "arr = [0 for i in range(7)]\r\nfor i in range(int(input())) :\r\n temp = input()\r\n for i in range(7) :\r\n arr[i] += int(temp[i])\r\nprint(max(arr))\r\n\r\n", "\nn = int(input())\n\nl = []\nfor i in range(n):\n l.append(input())\n\n\nmaior = 0\nfor j in range(7):\n cont = 0 \n for i in l:\n if i[j]=='1':\n cont+=1\n maior = max(cont, maior)\n\nprint(maior)", "n=int(input())\r\nr=[[*map(int,list(input()))] for _ in [0]*n]\r\nprint(max(sum(i) for i in zip(*r)))", "t = int(input())\r\nl = []\r\nd = [0, 0, 0, 0, 0, 0, 0]\r\nfor i in range(t):\r\n x = str(input())\r\n l.append(x)\r\nfor i in l:\r\n for j in range(0,7):\r\n if i[j] == '1':\r\n d[j] += 1\r\nans = 0\r\nfor x in d:\r\n if x > ans:\r\n ans = x\r\nprint(ans)", "def inp():\r\n return(int(input()))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ng=inp()\r\n\r\narr=[]\r\n\r\nfor i in range(g):\r\n arr.append(insr())\r\n\r\nans=0\r\nfor i in range(7):\r\n s=0\r\n for j in range(g):\r\n s+=int(arr[j][i])\r\n ans=max(ans,s)\r\n\r\nprint(ans)", "n = int(input())\r\npairs = 7\r\nmas = [0] * 7\r\nfor i in range(n):\r\n cache = list(input())\r\n for i in range(pairs):\r\n mas[i] += int(cache[i])\r\nprint(max(mas))", "answer = [0 for _ in range(7)]\r\nn = int(input())\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(7):\r\n answer[i] += int(s[i])\r\nprint(max(answer))", "cases = int(input())\r\nmatrix = []\r\nans = 0\r\nwhile cases:\r\n cases -= 1\r\n lst = list(input())\r\n if lst.count(\"1\") == 0:\r\n pass\r\n elif lst.count(\"0\") == 0:\r\n ans += 1\r\n else:\r\n matrix.append(lst)\r\nmx = 0\r\nif matrix:\r\n traverse = [[matrix[i][j] for i in range(len(matrix))] for j in range(len(matrix[0]))]\r\n for row in traverse:\r\n if row.count(\"1\") > mx:\r\n mx = row.count(\"1\")\r\n\r\nprint(mx+ans)\r\n\r\n\r\n\r\n\r\n\r\n", "#-------------------------------#\r\n#INCLUDE <Amirhossein_Alimirzaei>\r\n#INCLUDE <HajLorenzo>\r\n#-------------------------------#\r\n\r\n__=[]\r\nfor o in range(7):\r\n __.append(0)\r\n \r\nfor _1_ in range(int(input())):\r\n ___=input()\r\n for _2_ in range(7):\r\n __[_2_]+=int(___[_2_])\r\nprint(max(__))\r\n\r\n\r\n\r\n\r\n\r\n", "my_list = []\r\nmy_list_2 = [0] * 7\r\nfor i in range(int(input())):\r\n my_list.append(list(map(int, list(input()))))\r\n\r\nfor k in range(len(my_list)):\r\n for j in range(len(my_list[k])):\r\n my_list_2[j] += my_list[k][j]\r\n\r\nprint(max(my_list_2))", "n=int(input())\r\nm=7\r\nslots=[]\r\nfor i in range(n):\r\n a=input()\r\n slots.append(a)\r\ndef findMinRooms(slots, n, m):\r\n # Store count of classes\r\n # happening in every slot.\r\n counts = [0] * m;\r\n for i in range(n):\r\n for j in range(m):\r\n if (slots[i][j] == '1'):\r\n counts[j] += 1;\r\n \r\n # Number of rooms required is\r\n # equal to maximum classes\r\n # happening in a particular slot.\r\n return max(counts);\r\nprint(findMinRooms(slots, n, m))", "n = int(input())\ns = [0] * 7\nfor _ in range(n):\n\tmes = input()\n\tfor i in range(7):\n\t\ts[i] += (mes[i] == '1')\nprint(max(s))", "n = int(input())\narr = []\nfor i in range(n):\n arr.append(input())\n\np = 0\n\nfor i in range(7):\n x = p\n for j in arr:\n if j[i] == '1':\n if x > 0:\n x -= 1\n else:\n p += 1\n \nprint(p)\n", "ans = [0 for i in range(7)]\r\nn = int(input())\r\nfor i in range(n):\r\n l=list(input())\r\n for j in range(7):\r\n ans[j] += int(l[j])\r\nprint(max(ans))\r\n ", "\nInput=lambda:map(int,input().split())\nn = int(input())\nans = [0]*7\nfor i in range(n):\n s = input()\n for j in range(7):\n ans[j]+=int(s[j])\nprint(max(ans))\n\n", "n = int(input())\r\na = [0 for i in range(7)]\r\nfor i in range(n):\r\n p = input()\r\n for j in range(7):\r\n a[j] += int(p[j])\r\nprint(max(a))", "n = int(input())\r\nm = []\r\nfor _ in range(n):\r\n m.append(input())\r\nans = 0\r\nfor i in range(7):\r\n ans = max(ans, [s[i] for s in m].count('1'))\r\nprint(ans)", "n=int(input())\r\nk=[]\r\nfor i in range(n):\r\n l=input()\r\n k.append(l)\r\nmaxs=0\r\nfor j in range(7):\r\n s=0\r\n for i in range(n):\r\n if k[i][j]=='1':s+=1\r\n if s>maxs:maxs=s\r\nprint(maxs)\r\n", "n =int(input())\r\nc= [0,0,0,0,0,0,0]\r\nfor i in range(n):\r\n s =input()\r\n for j in range(7):\r\n c[j] = c[j] + int(s[j])\r\nprint(max(c))", "n = int(input())\ncounter = [0] * 7\nfor i in range(n):\n s = input()\n for i,v in enumerate(s):\n if v == \"1\":\n counter[i] += 1\nprint(max(counter))\n", "grp = int(input())\ntab = [\"\"] * grp\nfor _ in range(grp):\n tab[_] = input()\nm = 0\nfor i in range(7):\n t = 0\n for seq in tab:\n t+=int(seq[i])\n if t > m:\n m = t\n if t == grp:\n break\nprint(m) \n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(input()))\r\nd=list(zip(*l))\r\nm=0\r\nfor i in range(7):\r\n m=max(m,d[i].count('1'))\r\nprint(m)\r\n", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nans = 0\r\nfor i in range(7):\r\n cur = 0\r\n for j in range(n):\r\n cur += s[j][i] == '1'\r\n ans = max(ans, cur)\r\nprint(ans)\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n lines = []\r\n for _ in range(n):\r\n lines.append(list(map(int, input())))\r\n\r\n print(max(\r\n sum(lines[j][i] for j in range(n)) for i in range(len(lines[0]))\r\n ))", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nm = 0 \r\nfor j in range(7):\r\n count = 0\r\n for i in range(n):\r\n count += int(s[i][j])\r\n if(m < count):\r\n m = count\r\nprint(m) ", "n = int(input())\nl = []\nfor i in range(n):\n l.append(input())\n\nresult = 0\nfor i in range(7):\n sum = 0\n for j in range(n):\n if (l[j])[i] == \"1\":\n sum += 1\n result = max(result,sum)\nprint(result)", "N = int(input())\r\nX = list()\r\nfor i in range(N):\r\n Temp = input()\r\n X.append(Temp)\r\nMax = 0\r\nfor i in range(7):\r\n Max = max(Max, [X[j][i] for j in range(N)].count(\"1\"))\r\n if Max == N:\r\n print(Max)\r\n exit()\r\nprint(Max)\r\n\r\n# UB_CodeForces\r\n# Advice: Do what you can with what you have and never be satisfied\r\n# Location: Still next to the tissue box\r\n# Caption: Damn you cold\r\n", "n = int(input())\r\na = [str(input()) for i in range(n)]\r\nmax = 0\r\nfor i in range(7):\r\n count = 0\r\n for k in range(n):\r\n count +=int(a[k][i])\r\n if count > max:\r\n max = count\r\n \r\nprint(max)", "a=[0]*7\r\nfor i in range(int(input())):\r\n s = input()\r\n for j in range(7):\r\n if s[j]=='1':\r\n a[j]+=1\r\nprint(max(a))", "n = int(input())\r\na = [0] * 7\r\nfor i in range(n):\r\n s = input()\r\n for j in range(7):\r\n a[j] += int(s[j])\r\nprint(max(a))", "d = {1:0,2:0,3:0,4:0,5:0,6:0,7:0}\r\nfor _ in range(int(input())):\r\n x = input()\r\n for i in range(1, 8):\r\n d[i] += int(x[i-1] == '1')\r\nprint(max(d.values()))\r\n", "n=int(input())\r\na=[]\r\nfor i in range(0,n):\r\n s=input()\r\n a.append(s)\r\nc=0\r\nm=0\r\nfor j in range(0,7):\r\n for k in range(0,n):\r\n if a[k][j]=='1':\r\n c+=1\r\n m=max(c,m)\r\n c=0\r\nprint(m)", "n=int(input())\r\ns=[]\r\nfor _ in range(n):\r\n s.append(input())\r\nans=0\r\nfor i in range(7):\r\n count=0\r\n for j in range(n):\r\n count+=int(s[j][i])\r\n ans=max(ans,count)\r\nprint(ans)", "#847G\r\nn = int(input())\r\nans = [0 for x in range(7)]\r\n\r\nfor i in range(n):\r\n a = list(input())\r\n for j in range(7):\r\n ans[j] += int(a[j])\r\n\r\nprint(max(ans))\r\n", "l=[]\r\nc=0\r\nn=int(input())\r\nfor i in range(n):\r\n l.append(list(input()))\r\nfor i in range(7):\r\n d=0\r\n for j in range(n):\r\n if l[j][i]=='1':\r\n d+=1\r\n c=max(c,d)\r\nprint(c) \r\n ", "n = int(input())\r\nmas = []\r\nmaxx = 0\r\nfor i in range(n):\r\n mas.append(input())\r\nfor i in range(7):\r\n ses = 0\r\n for ii in range(n):\r\n if mas[ii][i] == '1':\r\n ses += 1\r\n if ses > maxx:\r\n maxx = ses\r\nprint(maxx)\r\n", "# LUOGU_RID: 101672746\nprint(max(x.count('1')for x in zip(*[*open(0)][1:])))", "n=int(input())\r\nl=[]\r\nfor i in range (n):\r\n a=list(map(int,input()))\r\n for j in range (7):\r\n if a[j]==1:\r\n l.append(j+1)\r\nnum=[]\r\nnum+=set(l)\r\nm=0\r\nfor i in range (len(num)):\r\n count=0\r\n for j in range (len(l)):\r\n if num[i]==l[j] and l[j]!=-1:\r\n count+=1\r\n l[j]=-1\r\n if j==len(l)-1 and count>=m:\r\n m=count\r\nprint(m)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = [list(map(int, input().rstrip())) for _ in range(n)]\r\n\r\nmv = -1\r\nfor i in range(7):\r\n mv = max(mv, [data[j][i] for j in range(n)].count(1))\r\n\r\nprint(mv)", "x,su=[],[]\r\nn=int(input())\r\nfor i in range(n):\r\n x.append(input())\r\nfor i in range(7):\r\n a=0\r\n for j in range(n):\r\n a+=int(x[j][i])\r\n su.append(a)\r\nprint(max(su))\r\n \r\n ", "a = int(input())\r\nb = [0]*7\r\nfor i in range(a):\r\n s = input()\r\n for i in range(7):\r\n if s[i] == \"1\":\r\n b[i] += 1\r\nprint(max(b))\r\n", "n = int(input())\r\narr = [0 for i in range(7)]\r\nfor i in range(n):\r\n s = input()\r\n for j in range(7):\r\n if s[j] == '1':\r\n arr[j] += 1\r\nprint(max(arr))", "arr = []\nfor _ in range(int(input())):\n arr.append(list(map(int, input())))\nprint(max(sum(x) for x in zip(*arr)))\n\n", "n=int(input())\r\ndi={0:0,1:0,2:0,3:0,4:0,5:0,6:0}\r\nfor i in range(n):\r\n a=input()\r\n for i in range(len(a)):\r\n if a[i]=='1':\r\n di[i]=di[i]+1\r\nmax1=0\r\nfor i in di.values():\r\n if i>max1:\r\n max1=i\r\nprint(max1)", "n=int(input())\r\na,count=[],0\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(7):\r\n count=max([a[j][i] for j in range(n)].count(\"1\"),count)\r\nprint(count)", "#input code\r\nn = int(input())\r\n\r\nres = [0]*7\r\nfor i in range(n):\r\n s=input()\r\n for j in range(7):\r\n res[j] += int(s[j])\r\nprint(max(res))", "n = int(input())\r\na = []\r\n\r\nfor i in range(0, n):\r\n a.append([])\r\n str = input()\r\n for j in range(0, 7):\r\n a[i].append(int(str[j]))\r\n\r\nmax = 0\r\ntemp = 0\r\nfor i in range(0, 7):\r\n for j in range(0, n):\r\n if a[j][i] == 1:\r\n temp += 1\r\n if temp > max:\r\n max = temp\r\n temp = 0\r\nprint(max)", "l=[0]*7\r\nn=int(input())\r\nfor i in range(n):\r\n x=input()\r\n for j in range(7):\r\n l[j]+=int(x[j])\r\nprint(max(l))\r\n", "n = int(input())\r\nk1 = 0\r\nk2 = 0\r\n\r\na = []\r\n\r\nfor i in range(0, n):\r\n\ta.append(str(input()))\r\n\r\nfor i in range(0, 7):\r\n\tfor r in range(0, n):\r\n\t\tif (a[r][i] == '1'):\r\n\t\t\tk1 += 1\r\n\tif (k1 > k2):\r\n\t\tk2 = k1\r\n\tk1 = 0\r\n\r\nprint(k2)", "n = int(input())\r\nliste = []\r\nroom = 0\r\nsolution = []\r\nfor loop in range (n):\r\n liste.append(list(input()))\r\n\r\nfor lo in range(7):\r\n for l in range(n):\r\n if liste[l][lo] == \"1\" :\r\n room = room + 1\r\n solution.append(room)\r\n room = 0\r\n\r\nsolution.sort(reverse = True)\r\nprint(solution[0])\r\n\r\n\r\n", "\r\nt=[0]*7\r\nfor i in range(int(input())):\r\n g=input()\r\n t[0]+=int(g[0])\r\n t[1]+=int(g[1])\r\n t[2]+=int(g[2])\r\n t[3]+=int(g[3])\r\n t[4]+=int(g[4])\r\n t[5]+=int(g[5])\r\n t[6]+=int(g[6])\r\n\r\n\r\nprint(max(t))\r\n", "n = int(input())\nC = 7\nd = [0] * C \nfor i in range(n):\n schedule = list(input())\n for c in range(C):\n d[c] += int(schedule[c])\nprint(max(d))\n", "n = int(input())\r\ns = []\r\nfor i in range (n):\r\n s.append(input())\r\ncount = 0\r\nmaximum = []\r\nfor i in range (7):\r\n for j in range (n):\r\n count += int(s[j][i])\r\n maximum.append(count)\r\n count = 0\r\nmaximumSorted = sorted(maximum, key=int, reverse=True)\r\nprint (maximumSorted[0])", "\ndef parser():\n while 1:\n data = list(input().split(' '))\n for number in data:\n if len(number) > 0:\n yield(number) \n\ninput_parser = parser()\ndef get_word():\n global input_parser\n return next(input_parser)\ndef get_number():\n data = get_word()\n try:\n return int(data)\n except ValueError:\n return float(data)\n\nnums = []\nn = get_number()\nfor i in range(n):\n nums.append(get_word())\naudMax = 0\nfor i in range(7):\n curMinAud = 0\n for t in range(len(nums)):\n if nums[t][i] == \"1\":\n curMinAud += 1\n if audMax < curMinAud:\n audMax = curMinAud\nprint(audMax)\n", "n = int(input())\r\na = [0] * 7\r\nfor i in range(n):\r\n s = input()\r\n for j in range(7):\r\n if s[j] == '1':\r\n a[j] += 1\r\nprint(max(a))\r\n", "group_count = int(input())\r\ngroups = []\r\n\r\nslots = [0]*7\r\n\r\nfor i in range(group_count):\r\n group_str = input()\r\n groups.append(group_str)\r\n\r\nfor group in groups:\r\n index = 0\r\n for element in list(group):\r\n if element == '1':\r\n slots[index] += 1\r\n index += 1\r\n\r\nprint(max(slots))", "n=int(input())\r\ny=[]\r\nfor _ in range(0,n):\r\n y.append(input())\r\nz=[]\r\nmax1=0\r\nfor i in range(0,7):\r\n c=int(y[0][i])\r\n for j in range(1,n):\r\n c=c+int(y[j][i])\r\n \r\n if max1<c:\r\n max1=c\r\nprint(max1)\r\n ", "from collections import Counter\r\nimport copy\r\n\r\ndef solve():\r\n n=int(input())\r\n arr=[]\r\n count,Max=0,0\r\n for i in range(n):\r\n arr.append(input())\r\n for i in range(7):\r\n for j in arr:\r\n if j[i]==\"1\":\r\n count+=1\r\n Max=max(Max,count)\r\n count=0\r\n\r\n return Max\r\n\r\n\r\nprint(solve())\r\n\r\n", "t = [0]*7\r\nfor x in range(0, int(input())):\r\n i = list(map(int, input()))\r\n for x in range(0,7):\r\n if i[x] == 1:\r\n t[x] += 1\r\nprint(max(t))", "cases = int(input())\r\nmatrix = []\r\nwhile cases:\r\n cases -= 1\r\n lst = list(input())\r\n matrix.append(lst)\r\n\r\ntraverse = [[matrix[i][j] for i in range(len(matrix))] for j in range(len(matrix[0]))]\r\nmx = -1\r\n\r\nfor row in traverse:\r\n if row.count(\"1\") > mx:\r\n mx = row.count(\"1\")\r\n\r\nprint(mx)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nans=[0]*7\r\nfor i in range(7):\r\n for j in range(n):\r\n ans[i]+=int(l[j][i])\r\nprint(max(ans))", "n=int(input())\r\nl=[0]*7\r\nwhile(n):\r\n n-=1\r\n s=list(input())\r\n for i in range(7):\r\n if(s[i]=='1'):\r\n l[i]+=1\r\nprint(max(l))\r\n ", "n = int(input())\r\n\r\na = [0] * 7\r\n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(7):\r\n a[j] += ord(s[j]) - ord('0')\r\n\r\nprint(max(a))\r\n", "n = int(input())\r\nans = [0,0,0,0,0,0,0]\r\nfor i in range(n):\r\n s = input()\r\n for j in range(7):\r\n ans[j]+=int(s[j])\r\nprint(max(ans))\r\n", "n = int(input())\nstr = [input() for i in range(0,n)]\nstr2 = [sum(int(k[i]) for k in str) for i in range(0,7)]\nprint(max(str2))", "n = int(input())\r\ni = 0\r\n\r\nj = [0,0,0,0,0,0,0]\r\n\r\nwhile i < n :\r\n t = list(input())\r\n for g in range(7):\r\n if t[g] == \"1\":\r\n j[g] += 1\r\n i += 1\r\n\r\n\r\nj.sort()\r\nprint(j.pop())\r\n\r\n\r\n\r\n", "t = int(input())\r\no=t\r\na=[]\r\nwhile t:\r\n x = input()\r\n a.append(x)\r\n \r\n t-=1\r\nmaxc=0\r\nfor i in range(7):\r\n count = 0\r\n for u in range(o):\r\n if a[u][i]=='1':\r\n count+=1\r\n if maxc<count:\r\n maxc=count\r\nprint(maxc)", "l1=[]\r\nn=int(input())\r\nfor j in range(0,n):\r\n s=input()\r\n l=list(s)\r\n l1.append(l)\r\na=[0,0,0,0,0,0,0]\r\nfor i in range(0,n):\r\n if(l1[i][0]==\"1\"):\r\n a[0]+=1\r\n if(l1[i][1]==\"1\"):\r\n a[1]+=1\r\n if(l1[i][2]==\"1\"):\r\n a[2]+=1\r\n if(l1[i][3]==\"1\"):\r\n a[3]+=1\r\n if(l1[i][4]==\"1\"):\r\n a[4]+=1\r\n if(l1[i][5]==\"1\"):\r\n a[5]+=1\r\n if(l1[i][6]==\"1\"):\r\n a[6]+=1\r\nprint(max(a))\r\n \r\n \r\n ", "\nn = int(input())\ngroups = []\nfor c in range(0, n):\n groups.append(input())\nsum_groups = 0\nmax_groups = 0\nfor c in range(0, 7):\n sum_groups = 0\n for i in range(0, n):\n sum_groups += int(groups[i][c])\n if sum_groups > max_groups:\n max_groups = sum_groups\n if max_groups == n:\n break\n if max_groups == n:\n break\nprint(max_groups)\n", "n = int(input())\n\nd = {}\nfor i in range(7): d[i] = 0\n\nfor i in range(n):\n s = input()\n for i in range(7):\n d[i] += int(s[i])\n \n \nprint(max(d.values()))\n", "a, b, c, d, e, f, g = 0, 0, 0, 0, 0, 0, 0\r\nfor i in range(int(input())):\r\n s = input()\r\n a += int(s[0])\r\n b += int(s[1])\r\n c += int(s[2])\r\n d += int(s[3])\r\n e += int(s[4])\r\n f += int(s[5])\r\n g += int(s[6])\r\nprint(max(a, b, c, d, e, f, g))\r\n", "numGroups = int(input())\r\nsum = [0, 0, 0, 0, 0, 0, 0]\r\nfor n in range(numGroups):\r\n groupStr = input()\r\n group = [0, 0, 0, 0, 0, 0, 0]\r\n for i in range(7):\r\n group[i] = int(groupStr[i])\r\n sum[i] += group[i]\r\nprint(max(sum))", "n=int(input())\nli=[]\nflag=0\ndc=[]\nfor i in range(n):\n s=input()\n li.append(s)\nfor i in range(7):\n for j in range(n):\n if ((li[j])[i])==\"1\":\n flag+=1\n dc.append(flag)\n flag=0\nprint(max(dc))\n", "groups = int(input())\nslots = [0, 0, 0, 0, 0, 0, 0]\n\nfor i in range(groups):\n schedule_classes = input()\n for j in range(7):\n slots[j] += int(schedule_classes[j])\n\nprint(max(slots))\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nprint(max([sum(i) for i in zip(*[map(int, list(input()[:-1])) for _ in range(int(input()))])]))", "a=int(input())\r\nlista=[]\r\nfor i in range(a):\r\n lista.append(input())\r\n\r\n \r\n \r\nnumeros=[]\r\ncontador=0\r\nfor i in range(0,7):\r\n for k in range(a):\r\n if(lista[k][i])=='1':\r\n contador+=1\r\n numeros.append(contador)\r\n contador=0\r\nnumeros.sort()\r\nprint(numeros[-1])\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\na = []\r\ncnt1 = 0\r\nmx = 0\r\nfor i in range(0, n):\r\n a.append(input())\r\nfor i in range(0, 7):\r\n cnt1 = 0\r\n for j in range(0, n):\r\n if a[j][i] == '1':\r\n cnt1 += 1\r\n mx = max(cnt1, mx)\r\nprint(mx)", "classes = []\r\nsums = []\r\ntotal = 0\r\nfor i in range(int(input())):\r\n classes.append(input())\r\nfor j in range(7):\r\n for k in range(len(classes)):\r\n total += int(classes[k][j])\r\n sums.append(total)\r\n total = 0\r\nprint(max(sums))", "G = int(input())\r\n\r\nClasses = [0] * 7\r\n\r\nfor g in range(G):\r\n s = input()\r\n for i, c in enumerate(s):\r\n if c == '1':\r\n Classes[i] += 1\r\nprint(max(Classes))", "\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n\tl.append(list(input()))\r\nans = 0\r\nfor i in range(7):\r\n\tli = []\r\n\tfor ii in range(n):\r\n\t\tli.append(l[ii][i])\r\n\r\n\tans = max(ans, li.count('1'))\r\n\r\n\r\nprint(ans)\r\n\r\n", "a=[0]*7\r\nfor j in range(int(input())):\r\n s=input()\r\n for i in range(7):\r\n a[i]=a[i]+int(s[i])\r\nprint(max(a))", "A = [input() for _ in range(int(input()))]\r\n\r\nprint(max(col.count('1') for col in zip(*A)))", "n = int(input())\r\ntarg = [0]*7\r\nfor x in range(n):\r\n l1 = [int(x) for x in list(input())]\r\n for y in range(7):\r\n targ[y]+=l1[y]\r\nprint(max(targ))\r\n", "n=int(input())\r\ny=[0]*100\r\na=0\r\nfor i in range(n):\r\n x=input()\r\n n=len(x)\r\n for j in range(n):\r\n y[j]=y[j]+int(x[j])\r\nprint(max(y))\r\n", "from collections import defaultdict\r\nn = int(input())\r\ncnt = defaultdict(int)\r\nfor i in range(n):\r\n s = input()\r\n for index,i in enumerate(s):\r\n cnt[index] += 1 if i == '1' else 0\r\n\r\nprint(max(list(cnt.values())))", "def main():\n n = int(input())\n counts = [0, 0, 0, 0, 0, 0, 0]\n\n for _ in range(n):\n classes = input()\n\n for i in range(7):\n counts[i] += (classes[i] == '1')\n\n print(max(counts))\n\n\nif __name__ == '__main__':\n main()\n", "#ROUNIAAUDI\r\nnum1=int(input())\r\nlist1=[0 for u in range(7)]\r\n#print(list1)\r\nfor i in range(num1):\r\n d=input()\r\n for u in range(7):\r\n if d[u]==\"1\":\r\n list1[u]+=1\r\n else:\r\n continue\r\nprint(max(list1))\r\n", "n = int(input())\r\nl = [0]*7\r\nfor i in range(n):\r\n\ts = input()\r\n\tfor j in range(7):\r\n\t\tl[j] += int(s[j])\r\n\r\nprint(max(l))\r\n\t\t\r\n", "n = int(input())\r\ns = [0] * 7\r\nfor _ in range(n):\r\n k = input()\r\n for i in range(7):\r\n if k[i] == '1':\r\n s[i] = s[i] + 1\r\nprint(max(s))\r\n", "n = int(input())\r\ni = 0\r\nMax = 0\r\nar = [0,0,0,0,0,0,0]\r\nwhile i < n:\r\n schedule = input()\r\n for k in range(7):\r\n if(schedule[k] == '1'):\r\n ar[k] += 1\r\n i += 1\r\ni = 0\r\nfor i in range(7):\r\n if ar[i] > Max:\r\n Max = ar[i]\r\nprint(Max)\r\n", "n = int(input())\r\nmatrix = []\r\nfor i in range(0,n):\r\n string = input()\r\n arr = []\r\n for j in range(0,7):\r\n arr.append(int(string[j]))\r\n matrix.append(arr)\r\ns = [0,0,0,0,0,0,0]\r\nfor j in range(0, 7):\r\n for i in range(0, n):\r\n s[j] = s[j] + matrix[i][j]\r\nprint(max(s))", "n = int(input())\r\nb = [0 for i in range(7)]\r\nfor i in range(n):\r\n a = input()\r\n for j in range(7):\r\n b[j] += int(a[j])\r\nans = 0\r\nfor i in range(7):\r\n ans = max(b[i], ans)\r\nprint(ans)\r\n", "a=[*zip(*[*open(0)][1:])]\r\nprint(max(x.count('1') for x in a))\r\n", "n = int(input())\r\nclasses = [input() for group in range(n)]\r\nans = max([sum([int(c[i]) for c in classes]) for i in range(7)])\r\nprint(ans)\r\n", "n = int(input())\r\nrs = [0]*8\r\nfor i in range(n):\r\n s = input()\r\n for j in range(7):\r\n if s[j] == '1':\r\n rs[j]+=1\r\nprint(max(rs))\r\n", "n = int(input())\nl = []\nnew = []\nfor i in range(n):\n a = list(map(int,input()))\n for j in range(7):\n if a[j] == 1:\n l.append(j+1)\nfor i in range(1,8):\n new.append(l.count(i))\nprint(max(new))\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n\tl.append(input())\r\nz = float(\"-inf\")\r\n\r\nfor j in range(7):\r\n\tt = 0\r\n\tfor k in range(n):\r\n\t\tif l[k][j] == \"1\":\r\n\t\t\tt = t + 1\r\n\tz = max(t,z)\r\nprint(z)\r\n", "n=int(input())\r\nw=[0,0,0,0,0,0,0]\r\nfor i in range(n):\r\n j=0\r\n for i in input():\r\n if i=='1':\r\n w[j]+=1\r\n j+=1\r\nprint(max(w))\r\n", "n = int(input())\r\nc = [0]*7\r\nmax = 0\r\nfor i in range(n):\r\n a = input()\r\n for j in range(7):\r\n if a[j] == '1':\r\n c[j] += 1\r\n max = c[j] if c[j] > max else max\r\nprint(max)", "r = int(input())\r\nclasses = []\r\nmaxClass = 0\r\nfor i in range(r):\r\n row = input()\r\n classes.append(row)\r\nmaxList = [0]*len(classes[0])\r\nfor c in classes:\r\n for i in range(len(classes[0])):\r\n if int(c[i]) == 1:\r\n maxList[i] += 1\r\nprint(max(maxList))\r\n\r\n\r\n \r\n", "a=int(input())\r\nq,w,e,r,t,y,u=0,0,0,0,0,0,0\r\nfor i in range(a):\r\n\tb=input()\r\n\tq+=int(b[0])\r\n\tw+=int(b[1])\r\n\te+=int(b[2])\r\n\tr+=int(b[3])\r\n\tt+=int(b[4])\r\n\ty+=int(b[5])\r\n\tu+=int(b[6])\r\nprint(max(q,w,e,r,t,y,u))\r\n", "n = int(input())\r\n\r\nschedules = []\r\n\r\nfor i in range(n):\r\n schedules.append(input())\r\n \r\nminimum = 0\r\n\r\nfor i in range(7):\r\n activeSlots = 0\r\n for j in range(n):\r\n activeSlots += int(schedules[j][i])\r\n if activeSlots > minimum:\r\n minimum = activeSlots\r\n\r\nprint(minimum)", "n = int(input())\r\narr = [list(map(int, input().strip())) for i in range(n)]\r\nans = 0\r\nfor i in range(7):\r\n ans = max(ans, sum(arr[j][i] for j in range(n)))\r\nprint(ans)", "n = int(input())\r\na, s = [], []\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(7):\r\n t = \"\"\r\n for j in range(n):\r\n t += \"\".join(a[j][i])\r\n s.append(t.count('1'))\r\nprint(max(s))", "n=int(input())\r\nd1=0\r\nd2=0\r\nd3=0\r\nd4=0\r\nd5=0\r\nd6=0\r\nd7=0\r\nfor i in range(n):\r\n s=input()\r\n d1=d1+int(s[0])\r\n d2=d2+int(s[1])\r\n d3=d3+int(s[2])\r\n d4=d4+int(s[3])\r\n d5=d5+int(s[4])\r\n d6=d6+int(s[5])\r\n d7=d7+int(s[6])\r\nx=max(max(d1,d2),d3)\r\ny=max(max(x,d4),d5)\r\nz=max(max(y,d6),d7)\r\nprint(z)\r\n", "n = int(input())\r\nL = [0]*7\r\ndef Solve(st):\r\n for j in range(7):\r\n if st[j] == '1':\r\n L[j] += 1\r\nmx = 0\r\nfor i in range(n):\r\n s = input()\r\n Solve(s)\r\nfor i in range(7):\r\n mx = max(mx, L[i])\r\nprint(mx)", "s1=[0]*7\r\nfor _ in range(int(input())):\r\n s=input()\r\n for i in range(0,7):\r\n s1[i]+=int(s[i])\r\nprint(max(s1)) ", "res, lst = 0, [input() for x in range(int(input()))]\r\nfor x in range(len(lst[0])):\r\n dem = 0\r\n for i in lst: dem += int(i[x])\r\n res = max(res, dem)\r\nprint(res)", "'''\r\n _ _ \r\n | | | | \r\n ___ _ _| |__ ___ _ __ __ _ ___ ___| | __\r\n/ __| | | | '_ \\ / _ \\ '__/ _` |/ _ \\/ _ \\ |/ /\r\n\\__ \\ |_| | |_) | __/ | | (_| | __/ __/ < \r\n|___/\\__, |_.__/ \\___|_| \\__, |\\___|\\___|_|\\_\\\r\n __/ | __/ | \r\n |___/ |___/ \r\n'''\r\nn=int(input())\r\nclasses=[]\r\nfor _ in range(n):\r\n a=list(map(int,(' '.join(list(input()))).split()))\r\n classes.append(a)\r\nmx=0\r\nfor i in range(7):\r\n s=0\r\n for j in range(n):\r\n s+=classes[j][i]\r\n mx=max(s,mx)\r\nprint(mx)", "n=int(input())\r\ns=[]\r\nfor _ in range(n):\r\n s.append([int(c) for c in input()])\r\n#print(*s)\r\nans=max(map(sum, [t for t in zip(*s)]))\r\nprint(ans)", "n = int(input())\r\nlst = list(map(int, input()))\r\nfor _ in range(n-1):\r\n nxt = list(map(int, input()))\r\n lst = [a+b for a, b in zip(lst, nxt)]\r\nprint(max(lst))", "import sys\r\n\r\nn = int(input())\r\nres = [0] * 7\r\nfor k in range(n):\r\n a = [int(i) for i in input()]\r\n for j in range(7):\r\n res[j] += a[j]\r\n\r\nprint(max(res))\r\n", "n = int(input())\r\na = []\r\ns = 0\r\nfor i in range (n):\r\n a.append(input())\r\nfor i in range(7):\r\n tmp = 0\r\n for e in range(n):\r\n tmp += int(a[e][i])\r\n if tmp > s:\r\n s = tmp\r\nprint(s)", "n = int(input());\r\nA = [];\r\nfor q in range(0, 7):\r\n A.append(0);\r\nc = 0;\r\nwhile 1:\r\n if c == n:\r\n break;\r\n x = input();\r\n b = 0;\r\n for i in range(0, 7):\r\n if x[i] == '1':\r\n A[i] = A[i] + 1;\r\n c = c + 1;\r\nmax = 0;\r\nfor d in range(0, 7):\r\n if A[d] > max:\r\n max = A[d];\r\nprint(max);\r\n ", "def ug(s):\r\n index=[0]*7\r\n for x in s:\r\n #print(x)\r\n for i in range(7):\r\n if(x[i]==\"1\"):\r\n index[i]+=1\r\n #print(index) \r\n return max(index)\r\n \r\ndef main():\r\n t=input()\r\n t=int(t)\r\n tosend=[]\r\n for i in range(t):\r\n s=input().strip()\r\n tosend.append(str(s))\r\n print(ug(tosend))\r\n \r\nif __name__==\"__main__\":\r\n main()", "\r\nn = int(input())\r\nl = [0] * 7\r\n\r\nfor _ in range(n):\r\n\ts = input()\r\n\tfor i in range(7):\r\n\t\tl[i] += int(s[i])\r\n\r\nprint(max(l))", "print(max(map(lambda x: sum(map(int, x)), zip(*(list(input()) for i in range(int(input())))))))", "# https://codeforces.com/problemset/problem/847/G\n# 900\n\nn = int(input())\nr = [0] * 7\n\nfor _ in range(n):\n for i, b in enumerate(input()):\n if b == \"1\":\n r[i] += 1\n\nprint(max(r))", "n = int(input())\r\n\r\nm = [0] * 7\r\n\r\nfor _ in range(n):\r\n s = input().strip()\r\n for j in range(7):\r\n if s[j] != '0':\r\n m[j] += 1\r\n\r\nprint(max(m))", "n = int(input())\n\na = [0]*7\n\nfor i in range(n):\n\tb = input()\n\tfor j in range(7):\n\t\ta[j] += int(b[j])\n\t\nprint(max(a))\n", "n=int(input())\r\na=[];k=[]\r\nfor i in range(n):a.append(list(input()))\r\nfor i in range(7):\r\n s=0\r\n for j in range(n):\r\n if a[j][i]=='1':s+=1\r\n k.append(s)\r\nprint(max(k))", "def f(l):\r\n\tl2=[]\r\n\tfor i in range(len(l[0])):\r\n\t\tlx=[]\r\n\t\tfor j in range(len(l)):\r\n\t\t\tlx.append(l[j][i])\r\n\t\tl2.append(lx)\r\n\treturn l2\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(list(input()))\r\nl=f(l)\r\nm=0\r\nfor i in l:\r\n\ta=i.count(\"1\")\r\n\tif a>m:\t\r\n\t\tm=a\r\nprint(m)", "n, ar = int(input()), []\r\nfor i in range(n) :\r\n ar.append(input())\r\narr = [0 for i in range(7)]\r\nfor slot in ar :\r\n for i in range(7) :\r\n arr[i] += int(slot[i])\r\nprint(max(arr))\r\n\r\n", "\ndef seven_classes(n: int) -> list:\n sched_list = []\n for i in range(n):\n sched = str(input())\n sched_list.append(sched)\n return sched_list\n\n\ndef sched_sort(sched_list: list):\n sev_classes_list = [0, 0, 0, 0, 0, 0, 0]\n for items in sched_list:\n counter = 0\n for i in items:\n sev_classes_list[counter] += int(i)\n counter += 1\n print(max(sev_classes_list))\n\ndef main():\n n = int(input())\n sched_sort(seven_classes(n))\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nans = 0\r\nd = {}\r\nfor x in range(n):\r\n a = input()\r\n for i in range(7):\r\n if a[i] == '1':\r\n if i not in d:\r\n d[i] = 1\r\n else: d[i] += 1\r\nfor key, val in d.items(): ans = max(ans, val)\r\nprint(ans)", "def f():\r\n classes=[0 for element in range (7)]\r\n for i in range(int(input())):\r\n a=input()\r\n for j in range(7):\r\n if(a[j]=='1'):\r\n classes[j]+=1\r\n print(max(classes))\r\nf()", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-08 23:49:56\nLastEditTime: 2021-11-08 23:53:46\nDescription: University Classes\nFilePath: CF847G.py\n'''\n\n\ndef func():\n n = int(input())\n classroom = [0] * 7\n for _ in range(n):\n classes = list(input().strip())\n for i in range(7):\n classroom[i] += int(classes[i])\n \n print(max(classroom))\n\n\nif __name__ == '__main__':\n func()\n ", "n=int(input())\r\ni=0\r\nj=[0,0,0,0,0,0,0]\r\nwhile i<n :\r\n t=list(input())\r\n for g in range(7):\r\n if t[g]==\"1\":\r\n j[g]+=1\r\n i+=1\r\nj.sort()\r\nprint(j.pop())", "n=int(input())\r\nd={}\r\nfor _ in range(n):\r\n s=input()\r\n for i in range(len(s)):\r\n if s[i]=='1':\r\n if i not in d:\r\n d[i]=1 \r\n else:\r\n d[i]+=1 \r\nl=[d[i] for i in d]\r\nif len(l)==0:\r\n print(0)\r\nelse:\r\n print(max(l))", "n1=int(input())\r\narr=[]\r\nfor x in range(n1):\r\n string=input()\r\n arr.append(string)\r\ncount=[]\r\nfor i in range(7):\r\n test=0\r\n for x in arr:\r\n if(x[i]==\"1\"):\r\n test=test+1\r\n count.append(test)\r\nprint(max(count))\r\n \r\n", "\r\nn = int(input())\r\n\r\nx1 =0\r\nx2 =0\r\nx3 =0\r\nx4 =0\r\nx5 =0\r\nx6 =0\r\nx7 =0\r\n\r\nfor i in range(n):\r\n s = input()\r\n x1 += int(s[0])\r\n x2 += int(s[1])\r\n x3 += int(s[2])\r\n x4 += int(s[3])\r\n x5 += int(s[4])\r\n x6 += int(s[5])\r\n x7 += int(s[6])\r\n\r\nprint(max(x1 , x2 , x3 , x4 , x5 , x6 , x7))", "n=int(input())\r\narr=[0]*7\r\nfor i in range(n):\r\n k=input()\r\n j=0\r\n while j<7:\r\n if k[j]=='1':\r\n arr[j]+=1\r\n j+=1\r\nprint(max(arr))", "N = int(input())\r\n\r\nl = [input() for _ in range(N)]\r\n\r\nmax_v = 0\r\n\r\nfor i in range(len(l[0])):\r\n num = sum([int(l[j][i])==1 for j in range(N)])\r\n max_v = max(max_v, num)\r\n\r\nprint(max_v)", "n = int(input())\nl = []\nmn = []\n\nfor i in range(n):\n s = input()\n l.append(s)\n\nfor i in range(7):\n cnt = 0\n for j in l:\n if j[i]=='1': cnt+=1\n mn.append(cnt)\n\nprint(max(mn))\n \n \n\n\t\t \t \t\t \t \t\t \t\t\t \t \t\t\t", "n = int(input())\r\na = [0] * 7\r\nfor i in range(n):\r\n b = list(map(int, input()))\r\n a = [a[i] + b[i] for i in range(7)]\r\n\r\nprint(max(a))\r\n", "count=0;classes=[]\r\nt=int(input())\r\nfor _ in range(t): \r\n classes.append([int(i) for i in input()])\r\n \r\nz=[]\r\nfor j in range(7):\r\n count=0\r\n for k in range(t):\r\n count+=classes[k][j]\r\n z.append(count)\r\nprint(max(z))\r\n", "n = int(input())\r\na = [0]*7\r\n\r\nfor i in range(n):\r\n s = list(map(int, list(input())))\r\n for j in range(7):\r\n a[j] += s[j]\r\nprint(max(a))\r\n", "t=int(input())\r\ntemp=[]\r\nc=0\r\ncount=[]\r\n\r\nif t==1:\r\n l=list(input())\r\n if l.count('1')==0:\r\n print(0)\r\n else:\r\n print(1)\r\nelse:\r\n for i in range(t):\r\n l=list(input())\r\n temp.append(l)\r\n \r\n for k in range(7):\r\n c=0\r\n for j in temp:\r\n if j[k]=='1':\r\n c+=1\r\n count.append(c)\r\n print(max(count))", "l=[input() for i in range(int(input()))]\r\na=[i.count('1') for i in zip(*l)]\r\nprint(max(a))", "n = int(input())\r\nt = [0] * 7\r\nfor i in range(n):\r\n sp = input()\r\n for y in range(7):\r\n t[y] += int(sp[y])\r\nprint(max(t))\r\n \r\n", "n = int(input())\r\nd = [0] * 7\r\nfor i in range(n):\r\n s = list(input())\r\n for i in range(7):\r\n d[i] += int(s[i])\r\nprint(max(d))", "def main():\r\n n=int(input())\r\n matriz=[]\r\n for i in range(n):\r\n aux=input(\"\")\r\n matriz.append(aux)\r\n num_rooms=0\r\n for i in range(7):\r\n num_class=0\r\n for j in range(n):\r\n num_class=num_class+int(matriz[j][i])\r\n if num_class>num_rooms:\r\n num_rooms=num_class\r\n print(num_rooms)\r\nmain()", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n = int(input())\r\n A = [0] * 7\r\n for i in range(n):\r\n s = input()\r\n for j in range(7):\r\n if s[j] == '1':\r\n A[j] += 1\r\n print(max(A))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ntots = [0, 0, 0, 0, 0, 0, 0]\r\nfor i in range(n):\r\n group = [int(x) for x in input()]\r\n tots = [a + b for a, b in zip(tots, group)]\r\nprint(max(tots))", "l = [0]*7\r\nfor i in range(int(input())):\r\n\tx = input()\r\n\tfor j in range(7):\r\n\t\tl[j] += int(x[j])\r\nprint(max(l))", "n = int(input())\r\narr = [0, 0, 0, 0, 0, 0, 0]\r\nfor i in range(n):\r\n k = input()\r\n for j in range(len(k)):\r\n arr[j] += int(k[j])\r\nprint(max(arr))\n# Sun Oct 06 2019 19:32:30 GMT+0300 (MSK)\n", "n=int(input())\r\nl=[]\r\nfor x in range(n):\r\n l.append(input().strip())\r\nm=0\r\nfor y in range(7):\r\n count=0\r\n for x in range(n):\r\n if l[x][y]=='1':\r\n count+=1\r\n m=max(m, count)\r\nprint(m)\r\n", "n = int(input())\r\n\r\narr = [0] * 7\r\nfor _ in range(n):\r\n s = str(input())\r\n\r\n for i in range(len(s)):\r\n if s[i] == \"1\":\r\n arr[i-1] += 1\r\n\r\nprint(max(arr)) ", "l,c=[],0\r\nfor x in range(int(input())):l.append(input())\r\nfor y in range(7):\r\n\ts=0\r\n\tfor x in range(len(l)):\r\n\t\tif l[x][y]==\"1\":s+=1\r\n\tc=max(c,s)\r\nprint(c)", "n=int(input())\r\ngroups=[None]*n\r\nfor i in range(n):\r\n\tgroups[i]=input()\r\n\r\ncount=0\r\nfor i in range(7):\r\n\tcount_temp=0\r\n\tfor j in range(n):\r\n\t\tif groups[j][i]=='1':\r\n\t\t\tcount_temp+=1\r\n\tif count<count_temp:\r\n\t\tcount=count_temp\r\n\t\tif count==n:\r\n\t\t\tbreak\r\nprint(count)", "k=input()\r\nk=int(k)\r\nlist1=[]\r\nfor j in range(1,k+1):\r\n l=input()\r\n list1.append(l)\r\nop=[]\r\nrooms=0\r\nfor p in range(0,7):\r\n op=[]\r\n for e in list1:\r\n op.append(e[p])\r\n r=op.count('1')\r\n if(rooms<r):\r\n rooms=r\r\nprint(rooms)", "wd=7\r\n\r\ndef maxsum(v):\r\n\tn=len(v)\r\n\tmx=0\r\n\tfor c in range(wd):\r\n\t\tcr=0\r\n\t\tfor d in range(n):\r\n\t\t\tif v[d][c]=='1':\r\n\t\t\t\tcr+=1\r\n\t\t\tif mx<cr:\r\n\t\t\t\tmx=cr\r\n\treturn mx\r\n\r\nn=int(input())\r\nv=[]\r\nfor c in range(n):\r\n\tv.append(input())\r\nprint(maxsum(v))", "group_count = int(input())\r\ngroups = []\r\n\r\ncount = 0\r\nmax_count = 0\r\n\r\nfor i in range(group_count):\r\n group_str = input()\r\n groups.append(group_str)\r\n\r\nfor i in range(7):\r\n count = 0\r\n for element in groups:\r\n if element[i] == '1':\r\n count += 1\r\n if count > max_count:\r\n max_count = count\r\n\r\nprint(max_count)\r\n", "n=int(input())\r\nq,w,e,r,t,y,u=0,0,0,0,0,0,0\r\nfor i in range(n):\r\n\ta,s,d,f,g,h,j=list(input())\r\n\tq+=int(a)\r\n\tw+=int(s)\r\n\te+=int(d)\r\n\tr+=int(f)\r\n\tt+=int(g)\r\n\ty+=int(h)\r\n\tu+=int(j)\r\nprint(max(q,w,e,r,t,y,u))", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(input())\r\nmax1count = 0\r\nfor i in range(7):\r\n temp = 0\r\n for j in l:\r\n if j[i] == '1':\r\n temp+=1\r\n if temp>max1count:\r\n max1count = temp\r\nprint(max1count)\r\n \r\n\r\n\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nc=0\r\nfor i in zip(*l):\r\n if i.count('1')>=c:\r\n c=i.count('1')\r\nprint(c) \r\n \r\n ", "n = int(input())\r\nslv = {0:0, 1:0, 2:0, 3:0, 4:0, 5:0, 6:0}\r\nfor a in range (n):\r\n strk = input()\r\n for j in range (7):\r\n if strk [j] == '1':\r\n slv[j] += 1\r\n \r\nsps = slv.values()\r\nprint (max(sps)) ", "n = int(input())\r\n\r\nres = [0, 0, 0, 0, 0, 0, 0]\r\n\r\nfor i in range(n):\r\n str = input()\r\n for j in range(len(str)):\r\n if str[j] == '1':\r\n res[j] += 1\r\n\r\nprint(max(res))", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\ns=[0,0,0,0,0,0,0] \r\nfor i in range(7):\r\n for item in arr:\r\n s[i]+=int(item[i])\r\nprint(max(s)) \r\n ", "n=int(input());\r\ncount=[0 for i in range(7)];\r\nfor i in range(n):\r\n s=input();\r\n l=list(s);\r\n for j in range(len(l)):\r\n count[j]+=int(l[j]);\r\nprint(max(count));\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n", "import sys\r\nInput = sys.stdin.readline\r\na = [0]*7\r\nfor i in range(int(input())):\r\n x = input()\r\n for j in range(7):\r\n a[j] += 1 if x[j] is '1' else 0\r\nprint(max(a))\r\n# FMZJMSOMPMSL\r\n", "a=[]\r\nb=[]\r\nc=[]\r\nd=[]\r\ne=[]\r\nf=[]\r\ng=[]\r\ncount = 0\r\nfor i in range(int(input())):\r\n s = str(input())\r\n if s[0]=='1':\r\n a.append(1)\r\n if s[1]=='1':\r\n b.append(1)\r\n if s[2]=='1':\r\n c.append(1)\r\n if s[3]=='1':\r\n d.append(1)\r\n if s[4]=='1':\r\n e.append(1)\r\n if s[5]=='1':\r\n f.append(1)\r\n if s[6]=='1':\r\n g.append(1)\r\nprint(max( a.count(1) , b.count(1) , c.count(1) , d.count(1) , e.count(1) , f.count(1) ,g.count(1) ))", "if __name__ == '__main__':\n n = int(input().strip())\n classes = [0, 0, 0, 0, 0, 0, 0]\n for g in range(n):\n for t, c in zip(range(7), map(int, input().strip())):\n classes[t] += c\n max_c = max(classes)\n print(max_c)\n", "print(max([sum(x) for x in list(zip(*[list(map(int,list(input()))) for x in range(int(input()))]))]))", "n = int(input())\nm = []\nfor i in range(n):\n m.append(input())\n\nma = 0\nfor i in range(7):\n at = 0\n for j in range(n):\n if m[j][i] == \"1\":\n at += 1\n ma = max(ma, at)\n \nprint(ma)\n", "N = int(input())\r\nans = 7*[0]\r\nfor i in range(N):\r\n vals = input()\r\n for i in range(7):\r\n ans[i]+=int(vals[i])\r\nprint(max(ans))", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n li = list(map(int,input()))\r\n l.append(li)\r\na = len(li)\r\nnum = []\r\nfor i in range(a):\r\n numm = 0\r\n for j in range(n):\r\n numm += l[j][i]\r\n num.append(numm)\r\nprint(max(num))\r\n", "n = int(input().strip())\n\nclasses = []\nfor _ in range(n):\n\tclasses.append(int(input().strip()))\n\nbiggest = -1\n\nfor x in range(8):\n\tbiggest = max(biggest, sum([x%10 for x in classes]))\n\tclasses = [x//10 for x in classes]\n\nprint(biggest)", "n=int(input())\r\nb=[]\r\nfor i in range(0,n):\r\n a=input()\r\n b.append(a)\r\nans=0\r\nfor j in range(0,7):\r\n count=0\r\n for i in range(0,n):\r\n if b[i][j]=='1':\r\n count+=1\r\n ans=max(ans,count)\r\nprint(ans)\r\n ", "a = int(input())\r\nlst = []\r\nf = []\r\nfor i in range(a):\r\n lst.append(input())\r\n\r\nfor i in range(7):\r\n s = 0\r\n for j in lst:\r\n s += int(j[i])\r\n\r\n f.append(s)\r\n\r\nprint(max(f))", "n = int(input())\ncnt = [0] * 7\nfor i in range(n):\n s = input()\n for j in range(7):\n if s[j] == '1': cnt[j] += 1\n\nprint(max(cnt))\n", "v = []\nfor _ in range(0, int(input())):\n v.append(list(map(int, input())))\nprint(max(sum(x) for x in zip(*v)))\n", "n = int(input())\r\nl = []\r\ncom= 0\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(7):\r\n res= 0\r\n for j in range(n):\r\n if l[j][i] == '1':\r\n res += 1\r\n if res > com:\r\n com= res\r\nprint(com) ", "n = int(input())\r\ntable = [list(map(int,list(input()))) for i in range(n)]\r\nrooms = [[table[i][j] for i in range(n)] for j in range(7)]\r\nans = [sum(rooms[i]) for i in range(7)]\r\nprint(max(ans))\r\n", "cnt = [0] * 7\r\nn = int(input())\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(7):\r\n if s[i] == \"1\":\r\n cnt[i] += 1\r\nprint(max(cnt))\r\n", "number = int(input())\r\nclasses = tuple(tuple(int(i) for i in input()) for _ in range(number))\r\ntotal = 0\r\n\r\nfor i in range(7):\r\n t = 0\r\n for j in range(number):\r\n if classes[j][i] == 1:\r\n t += 1\r\n total = max(total, t)\r\n \r\nprint(total)", "n = int(input())\r\na = [0] * 7\r\nfor i in range(n):\r\n b = input()\r\n for h in range(7):\r\n a[h] += (b[h] == '1')\r\nprint(max(a))\r\n ", "# all those moments will be lost in time , like tears in rain\r\nn = int(input())\r\nalist = []\r\nnew = []\r\nfor i in range(n):\r\n a = list(map(int,input()))\r\n # print(a)\r\n for j in range(7):\r\n if a[j] == 1:\r\n alist.append(j+1)\r\n \r\nfor i in range(1,8):\r\n new.append(alist.count(i))\r\n# print(new)\r\nprint(max(new))", "n=int(input())\r\nv=[]\r\nfor i in range(n):\r\n\tv.append(input())\r\nz=float('-inf')\r\nfor i in range(7):\r\n\tt=0\r\n\tfor j in range(n):\r\n\t\t# print(v[j][i])\r\n\t\tif v[j][i]=='1':\r\n\t\t\tt+=1\r\n\tz=max(z,t)\r\n\r\nprint(z)", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nb=[0]*7\r\nfor num in a:\r\n for j in range(7):\r\n if int(num[j]) == 1:\r\n b[j]+=1\r\nmax = b[0]\r\nfor i in range(1,7):\r\n if(max<b[i]):\r\n max = b[i]\r\nprint(max)", "n = int(input())\r\ns=[]\r\nfor i in range(n):\r\n h = [input()]\r\n h=list(map(int, str(h[0])))\r\n s.append(h)\r\nt=[sum(i) for i in zip(*s)]\r\nprint(max(t))\r\n", "m = 0\r\nfor x in zip(*(input() for _ in range(int(input())))):\r\n m = max(m, x.count('1'))\r\nprint(m)\r\n\r\n##########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n##########################################", "p,z=[],[]\r\nfor x in range(int(input())):\r\n\ts=input()\r\n\tz.append(s)\r\nk=zip(*z)\r\nfor x in k:\r\n\tp.append(x.count('1'))\r\nprint(max(p))", "l = [0]*7\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n n = input()\r\n for i in range(7):\r\n\r\n if n[i]==\"1\":\r\n \r\n l[i]+=1\r\nprint(max(l))", "a=[]\r\nb=[]\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(7):\r\n s=0\r\n for j in range(n):\r\n s=s+int(a[j][i])\r\n b.append(s)\r\nprint(max(b))\r\n", "def main():\r\n n = int(input())\r\n Ar = []\r\n Br = []\r\n for _ in range(n):\r\n Ar.append(input())\r\n for row in range(7):\r\n Br.append(0)\r\n for col in range(n):\r\n Br[row] += int(Ar[col][row])\r\n print(max(Br))\r\n\r\n\r\nmain()\r\n", "n = int(input())\r\nslot = 7 * [0]\r\nfor j in range(n):\r\n schedule = str(input())\r\n for j in range(len(schedule)):\r\n slot[j] += ord(schedule[j]) - 48\r\nprint(max(slot))\r\n", "n = int(input())\n\nG = []\nfor i in range(n):\n G.append(tuple(map(int, input())))\n\ndef check(index, G):\n c = 0\n for g in G:\n if g[index] == 1:\n c += 1\n return c\n\nc = 0\ntimes = len(G[0])\nfor t in range(times):\n current_result = check(t,G)\n if current_result > c:\n c = current_result\n\nprint(c)\n", "n = int(input())\r\npair = [input() for i in range(n)]\r\n\r\n_max = 0\r\nfor i in range(7):\r\n temp = [pair[j][i] for j in range(n)]\r\n _max = max(_max, temp.count('1'))\r\n\r\nprint(_max)", "d = {x: x*0 for x in range(1, 8)}\r\nn = int(input())\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(1, 8):\r\n if s[i-1] == \"1\":\r\n d[i] = d[i] + 1\r\nprint(max(d.values()))", "n=int(input())\r\nlst=[0]*7\r\nfor i in range(n):\r\n s=input()\r\n for i in range(len(s)):\r\n if s[i]=='1':\r\n lst[i]+=1\r\nprint(max(lst))", "n = int(input())\r\nl = list()\r\nmax1 = 0\r\nfor i in range(n):\r\n\tl.append(input())\r\nfor i in range(7):\r\n\tcount = 0\r\n\tfor j in range(n):\r\n\t\tif l[j][i]=='1':\r\n\t\t\tcount+=1\r\n\tif count>max1:\r\n\t\tmax1=count\r\nprint(max1)" ]

[ "\r\ndef Solucion(n,k,c,f,h):\r\n # La alegría de no tener cartas favoritas es0\r\n h = [0]+h\r\n \r\n # Contamos la cantidad de veces que una carta es favorita por los jugadores\r\n count_fav = {}\r\n # Guardamos el máximo número de veces que se repite un número en los favoritos\r\n max_count_fav = 0\r\n for i in f:\r\n if i in count_fav:\r\n count_fav[i] += 1\r\n else:\r\n count_fav[i] = 1\r\n if max_count_fav < count_fav[i]:\r\n max_count_fav = count_fav[i]\r\n \r\n # Contamos la cantidad de veces que la carta se encuentra en c \r\n count_num = {}\r\n # Guardamos el máximo número de veces que se repite un número en c\r\n max_count_num = 0\r\n for i in c:\r\n # Si no es una de las posibles cartas favoritas no nos interesa\r\n if i in f:\r\n if i in count_num:\r\n count_num[i] += 1\r\n else:\r\n count_num[i] = 1\r\n if max_count_num < count_num[i]:\r\n max_count_num = count_num[i]\r\n \r\n # La idea es tener una matriz dp donde para dp[i][j] sea la mayor cantidad de alegría que \r\n # se obtiene de repartir j cartas favoritas a i jugadores con la misma carta favorita \r\n # Los límites de la matriz en las filas es \r\n # la máxima cantidad de cartas de un número que se puede repatir + 1\r\n # y en las columnas la máxima cantidad de jugadores a los que hay que repertirle la misma carta favorita + 1 \r\n dp = [[0]*(max_count_num+1) for _ in range(max_count_fav+1)]\r\n for jugador in range(max_count_fav):\r\n for card in range(max_count_num):\r\n for repartir in range(k+1):\r\n if card+repartir > max_count_num:\r\n # no tiene sentido repartir más cartas de la cantidad máxima a repartir\r\n continue\r\n # Se guarda para i(jugador+1) jugadores(1<max_count_fav) y la cantidad de cartas ya repartidas(card) + \r\n # las que se reparte al jugador i(repartir) el máximo entre lo calculado hasta el momento y repartir \r\n # a i-1 jugadores las cartas ya repartidas(card) más repartir las cartas(repartir) al jugador i\r\n dp[jugador+1][card+repartir] = max(dp[jugador+1][card+repartir], dp[jugador][card] + h[repartir])\r\n \r\n # Terminado de construir dp se procede a calcular la alegría sabiendo que dp[i][j] sea la \r\n # mayor cantidad de alegría que se obtiene de repartir j cartas favoritas a i jugadores con \r\n # la misma carta favorita, la suma de todas las alegrías para los grupos de jugadores que\r\n # prefieren cartas diferentes es la alegría máxima \r\n joy = 0\r\n for i in count_num:\r\n # Siempre sumamos la cantidad máxima de repartir j cartas a i jugadores\r\n joy += dp[count_fav[i]][count_num[i]]\r\n \r\n return joy\r\n\r\n# recogemos la entrada\r\nn, k = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nf = list(map(int,input().split()))\r\nh = list(map(int,input().split()))\r\n\r\n#imprimimos la solución\r\nprint(Solucion(n,k,c,f,h))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n n, K = map(int, input().split())\r\n C = list(map(int, input().split()))\r\n F = list(map(int, input().split()))\r\n H = list(map(int, input().split()))\r\n cnt = {}\r\n for f in F:\r\n cnt[f] = cnt.get(f, 0) + 1\r\n cnt2 = {}\r\n for c in C:\r\n cnt2[c] = cnt2.get(c, 0) + 1\r\n \r\n ans = 0\r\n for k, v in cnt.items():\r\n if k not in cnt2:\r\n continue\r\n x = cnt2[k]\r\n dp = [[0] * (x + 1) for _ in range(v + 1)]\r\n for i in range(1, v + 1):\r\n for j in range(K, 0, -1):\r\n p = H[j - 1]\r\n for l in range(x, j - 1, -1):\r\n dp[i][l] = max(dp[i][l], dp[i - 1][l - j] + p)\r\n ans += dp[-1][-1]\r\n print(ans)\r\n \r\n \r\n \r\n \r\n \r\nfor _ in range(1):\r\n main()", "from heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache\r\nimport threading\r\nimport sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n#calc for each fav card seperately\r\ndef calc(m,t,k,h):\r\n\tdp=[[0 for i in range(t+1)] for i in range(m+1)]\r\n\tfor i in range(1,m+1):\r\n\t\tfor j in range(t+1):\r\n\t\t\tfor kk in range(k+1):\r\n\t\t\t\tif kk+j>t:\r\n\t\t\t\t\tbreak\r\n\t\t\t\tdp[i][kk+j]=max(dp[i][kk+j],dp[i-1][j]+h[kk])\r\n\treturn dp[m][t]\r\n\t\r\ndef main():\r\n\tn,k=rl()\r\n\tc=rl() \t\r\n\tf=rl() \t\r\n\th=[0]+rl()\t\r\n\tcc=Counter(c)\r\n\tcf=Counter(f)\r\n\tres=0\r\n\tfor fv in cf:\r\n\t\tm=cf[fv]\r\n\t\tt=min(m*k,cc[fv])\r\n\t\tres+=calc(m,t,k,h)\r\n\tprint(res)\r\n\tpass\r\n\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "n, k = map(int, input().split())\r\nC = list(map(int, input().split()))\r\nC = [c-1 for c in C]\r\nF = list(map(int, input().split()))\r\nF = [f-1 for f in F]\r\nH = list(map(int, input().split()))\r\nH = [0]+H\r\n\r\nfrom collections import Counter\r\n\r\nC = Counter(C)\r\nF = Counter(F)\r\n\r\ndp = [[0]*(k*n+1) for i in range(n+1)]\r\nfor i in range(n):\r\n for j in range(n*k):\r\n for l in range(k+1):\r\n if j+l <= k*n:\r\n dp[i+1][j+l] = max(dp[i+1][j+l], dp[i][j]+H[l])\r\nans = 0\r\nfor c in C.keys():\r\n ans += dp[F[c]][C[c]]\r\nprint(ans)\r\n", "from collections import Counter\r\n\r\nn, k = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\nf = [int(x) for x in input().split()]\r\nh = [0] + [int(x) for x in input().split()]\r\n\r\ncnt_all = Counter(c)\r\ncnt_fav = Counter(f)\r\n\r\nans = 0\r\nfor fi in cnt_fav:\r\n if fi not in cnt_all:\r\n continue\r\n m = cnt_fav[fi]\r\n t = min(cnt_all[fi], m * k)\r\n dp = [[0] * (t + 1) for _ in range(m + 1)]\r\n for x in range(1, m + 1):\r\n for s in range(0, t + 1):\r\n for ki in range(0, k + 1):\r\n if ki + s > t:\r\n break\r\n dp[x][ki + s] = max(dp[x][ki + s], dp[x - 1][s] + h[ki])\r\n ans += dp[m][t]\r\nprint(ans)", "# https://codeforces.com/contest/999\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, k = map(int, input().split()) # 1 <= n <= 500, 1 <= k <= 10\nc = list(map(int, input().split())) # 1 <= c[i] <= 10**5\nf = list(map(int, input().split())) # 1 <= f[i] <= 10**5\nh = [0] + list(map(int, input().split())) # 1 <= h[i] <= 10**5, h[i] < h[i+1]\n\ncnt_c = [0] * (10 ** 5 + 1)\nfor x in c:\n cnt_c[x] += 1\n\ncnt_f = [0] * (10 ** 5 + 1)\nfor x in f:\n cnt_f[x] += 1\n\nans = 0\n\nfor num in range(10 ** 5 + 1):\n # nobody has num as their favourite number or there are no cards with num on it: no joy\n if cnt_f[num] == 0 or cnt_c[num] == 0:\n continue\n\n # there are k cards with num on it for everybody who has num as their favourite number: max joy\n if cnt_c[num] >= k * cnt_f[num]:\n ans += cnt_f[num] * h[k]\n continue\n\n # dp[i][j]: maximum joy of distributing j cards with number num across i players\n dp = [[0] * (min(k * i, cnt_c[num]) + 1) for i in range(cnt_f[num] + 1)]\n for i in range(cnt_f[num]):\n for j in range(min(k * i, cnt_c[num]) + 1):\n for kk in range(k + 1):\n if j + kk <= cnt_c[num]:\n dp[i + 1][j + kk] = max(dp[i + 1][j + kk], dp[i][j] + h[kk])\n ans += dp[cnt_f[num]][cnt_c[num]]\n\nprint(ans)\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nf = list(map(int, input().split()))\r\nh = [0] + list(map(int, input().split()))\r\ncnt1 = defaultdict(lambda : 0)\r\nfor i in c:\r\n cnt1[i] += 1\r\ncnt2 = defaultdict(lambda : 0)\r\nfor i in f:\r\n cnt2[i] += 1\r\nans = 0\r\nfor i in cnt2:\r\n c1, c2 = cnt1[i], cnt2[i]\r\n dp0 = [0]\r\n l = 1\r\n for _ in range(c2):\r\n dp = [0] * (l + k)\r\n for i in range(l):\r\n dp0i = dp0[i]\r\n for j in range(k + 1):\r\n dp[i + j] = max(dp[i + j], dp0i + h[j])\r\n l += k\r\n dp0 = dp\r\n ans += dp[min(c1, k * c2)]\r\nprint(ans)", "from collections import defaultdict\r\n\r\n\r\ndef main():\r\n from sys import stdin, setrecursionlimit\r\n # setrecursionlimit(1000000)\r\n input = stdin.readline\r\n def iinput(): return int(input())\r\n def sinput(): return input().rstrip()\r\n def i0input(): return int(input()) - 1\r\n def linput(): return list(input().split())\r\n def liinput(): return list(map(int, input().split()))\r\n def miinput(): return map(int, input().split())\r\n def li0input(): return list(map(lambda x: int(x) - 1, input().split()))\r\n def mi0input(): return map(lambda x: int(x) - 1, input().split())\r\n INF = 1000000000000000000\r\n MOD = 1000000007\r\n\r\n N, K = miinput()\r\n C = liinput()\r\n F = liinput()\r\n H = [0] + liinput()\r\n MAX_C = 100000\r\n ctr_C = defaultdict(int)\r\n ctr_F = defaultdict(int)\r\n for c in C:\r\n ctr_C[c] += 1\r\n for f in F:\r\n ctr_F[f] += 1\r\n\r\n ans = 0\r\n for f in range(1, MAX_C+1):\r\n people = ctr_F[f]\r\n cards = ctr_C[f]\r\n if people == 0 or cards == 0:\r\n continue\r\n if people * K <= cards:\r\n ans += H[-1] * people\r\n continue\r\n dp = [[0] * (K * people + 1) for _ in [0] * (people + 1)]\r\n for i in range(people):\r\n for j in range(K * people + 1):\r\n for k in range(K+1):\r\n if j + k <= K * people:\r\n dp[i+1][j+k] = max(dp[i+1][j+k], dp[i][j] + H[k])\r\n # print(f, dp)\r\n ans += dp[-1][cards]\r\n print(ans)\r\n\r\nmain()" ]

[ "from sys import stdin\r\n\r\nx,y,n,d = [int(x) for x in stdin.readline().split()]\r\nd = d**2\r\n\r\n\r\nv = []\r\n\r\nfor vec in range(n):\r\n v.append([int(x) for x in stdin.readline().split()])\r\n\r\nfound = {}\r\n\r\ndef winner(x,y,v,d):\r\n if x**2 + y**2 > d:\r\n return 1\r\n if (x,y) in found:\r\n return found[(x,y)]\r\n for a,b in v:\r\n if winner(x+a,y+b,v,d) == 0:\r\n found[(x,y)] = 1\r\n return 1\r\n found[(x,y)] = 0\r\n return 0\r\n\r\nif winner(x,y,v,d):\r\n print('Anton')\r\nelse:\r\n print('Dasha')\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nx, y, n, d = map(int, input().split())\r\nvector = [list(map(int, input().split())) for _ in range(n)]\r\ndp = [[-1] * (d * 2 + 1) for _ in range(d * 2 + 1)]\r\n\r\nfor i in range(d * 2 + 1):\r\n for j in range(d * 2 + 1):\r\n if (i - d) ** 2 + (j - d) ** 2 > d**2:\r\n dp[i][j] = 1\r\n\r\n\r\ndef solve(x, y):\r\n if dp[x][y] != -1:\r\n return dp[x][y]\r\n\r\n for dx, dy in vector:\r\n if 0 <= x + dx <= 2 * d and 0 <= y + dy <= 2 * d and solve(x + dx, y + dy) == 0:\r\n dp[x][y] = 1\r\n return 1\r\n\r\n dp[x][y] = 0\r\n return 0\r\n\r\n\r\nif solve(x + d, y + d):\r\n print('Anton')\r\nelse:\r\n print('Dasha')\r\n" ]

[ "n,k = map(int,input().split())\r\nalist = [int(x) for x in input().split()]\r\n\r\nminchange=n\r\nmina=1000\r\n\r\nfor a in range(1,1001):\r\n blist=[x*k+a for x in range(0,n)]\r\n change=0\r\n\r\n for i in range(0,n):\r\n if alist[i]!=blist[i]:\r\n change+=1\r\n\r\n if change>=minchange:\r\n break\r\n\r\n if change<minchange:\r\n minchange=change\r\n mina=a\r\n\r\nblist=[x*k+mina for x in range(0,n)]\r\nchangelist=[]\r\n\r\nfor i in range(0,n):\r\n if alist[i]>blist[i]:\r\n changelist.append('- '+str(i+1)+' '+str(alist[i]-blist[i]))\r\n elif alist[i]<blist[i]:\r\n changelist.append('+ '+str(i+1)+' '+str(blist[i]-alist[i]))\r\n\r\nprint(minchange)\r\n\r\nif minchange>0:\r\n for change in changelist:\r\n print(change)\r\n", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=10000000000\r\ns = 0\r\np=0\r\nfor i in range(1,1001):\r\n x=0\r\n for j in range(0,a):\r\n h=i+j*b\r\n if l[j]==h:\r\n x=x+1\r\n if x>=s:\r\n p=i\r\n s=x\r\nprint(a-s)\r\nfor i in range(0,a):\r\n s=\"\"\r\n if p+i*b-l[i]==0:\r\n continue\r\n elif p+i*b-l[i]>0:\r\n s=\"+ \"+str(i+1)+\" \"+str(abs(p+i*b-l[i]))\r\n else:\r\n s=\"- \"+str(i+1)+\" \"+str(abs(p+i*b-l[i]))\r\n print(s)", "def main():\r\n n, k = [int(i) for i in input().split()]\r\n a = [int(i) for i in input().split()]\r\n\r\n d = {}\r\n best, best_first = 0, -1\r\n for i, v in enumerate(a):\r\n good_first = v - k * i\r\n if good_first >= 1:\r\n if good_first not in d:\r\n d[good_first] = 0\r\n d[good_first] += 1\r\n if d[good_first] > best:\r\n best = d[good_first]\r\n best_first = good_first\r\n \r\n print(n - best)\r\n for i, v in enumerate(a):\r\n diff = best_first - (v - k * i)\r\n if diff > 0:\r\n print('+', i + 1, diff)\r\n elif diff < 0:\r\n print('-', i + 1, -diff)\r\n \r\nmain()\r\n", "n,k = map(int,input().split())\na = list(map(int,input().split()))\nMAX=1000\ncost=n-1\nstart=a[0]\nfor h in range(1,MAX,1):\n c=0\n for i,height in enumerate(a):\n c += int(h+i*k != height)\n if c<cost:\n cost=c\n start=h\nprint(cost)\nfor i,height in enumerate(a):\n desired_height = start+i*k\n if desired_height != height:\n diff = height - desired_height\n if diff>0:\n print('{0} {1} {2}'.format('-',i+1,abs(diff)))\n else:\n print('{0} {1} {2}'.format('+',i+1,abs(diff)))\n", "from collections import Counter\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nt=[arr[i]-k*i for i in range(n)]\r\nd=Counter(t)\r\ncnt=0\r\nfor key,val in d.items():\r\n if key<=0:\r\n continue\r\n if val>cnt:\r\n cnt=val\r\n best=key\r\nprint(n-cnt)\r\n\r\nfor i in range(n):\r\n x=arr[i]-k*i-best\r\n if x<0:\r\n print(\"{} {} {}\".format(\"+\",i+1,-x))\r\n if x>0:\r\n print(\"{} {} {}\".format(\"-\",i+1,x))\r\n\r\n\r\n", "n,k=map(int,input().split())\r\n\r\nL=list(map(int,input().split()))\r\n\r\na=min(L)\r\nb=max(L)\r\nans=10**10\r\nF=[]\r\nfor s in range(1,1001):\r\n x=0\r\n E=[]\r\n for i in range(n):\r\n if(abs((s+i*k)-L[i])):\r\n x+=1\r\n E.append(i)\r\n if(x<ans):\r\n ans=x\r\n F=list(E)+[s]\r\nprint(ans)\r\ns=F[-1]\r\n\r\nfor i in range(ans):\r\n if(L[F[i]]<s+F[i]*k):\r\n print(\"+\",end=\" \")\r\n else:\r\n print(\"-\",end=\" \")\r\n print(F[i]+1,abs((L[F[i]])-(s+F[i]*k)))\r\n", "n,k = input().split()\nn,k = int(n),int(k)\n\nlista=list(map(int,input().split()))\n\nflagg,posicao,contador=0,0,0\n\nwhile contador != n:\n flagC=0\n for j in range(n):\n if ((j-contador) * k + lista[contador]) <= 0:\n break\n if ((j-contador) * k + lista[contador]) == lista[j]:\n flagC+=1 \n \n if flagg < flagC:\n flagg=flagC\n posicao=contador\n \n contador+=1\n\na=0\ndiferenca=n-flagg\nprint(diferenca)\ncounter=0\nwhile counter != n:\n \n if lista[counter] != lista[posicao] - (posicao-counter)*k:\n armazena=counter+1\n queenDiff=posicao-counter\n if lista[counter] >= lista[posicao] - k * queenDiff:\n calcI= lista[counter] - lista[posicao] + k * queenDiff\n print(\"- %d %d\" %(armazena, calcI)) \n \n else:\n calcO= lista[posicao] - k * queenDiff - lista[counter]\n print(\"+ %d %d\" %(armazena, calcO))\n counter+=1\n\n \t\t \t \t \t\t\t \t\t \t\t\t \t \t", "n, k = map(int,input().split())\n\nl = list(map(int,input().split()))\n\ntaml = len(l)\nres = 0\ncontr = 0\n\nfor i in range(1,1001):\n apro = 0\n \n for j in range(0, taml):\n \n apro += int(l[j] == i +j*k)\n \n if apro > res:\n res = apro\n contr = i\n \nprint(taml-res)\n\nans = contr\n\nfor j in range(0, taml):\n \n if l[j] > ans:\n print('-', j+1, l[j] -ans)\n \n if l[j] < ans:\n print('+', j+1, -l[j] + ans)\n \n ans += k\n\n\n \t \t \t\t\t\t \t \t\t \t\t\t\t \t", "# 402B\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_int_ary():\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\nn, k = read_int_ary()\r\na = list(read_int_ary())\r\nmx = i_mx = 0\r\nfor i in range(n):\r\n if a[i] - k * i <= 0:\r\n continue\r\n sh = a[i] + k\r\n count = 0\r\n for j in range(i + 1, n):\r\n if a[j] == sh:\r\n count += 1\r\n sh += k\r\n if count > mx:\r\n mx = count\r\n i_mx = i\r\n\r\nprint(n - mx - 1)\r\nsh = a[i_mx] - k * i_mx\r\nfor i in range(n):\r\n if a[i] < sh:\r\n print('+ ' + str(i + 1) + ' ' + str(sh - a[i]))\r\n elif a[i] > sh:\r\n print('- ' + str(i + 1) + ' ' + str(a[i] - sh))\r\n sh += k", "n, k = map(int, input().split())\ntrees = map(int, input().split())\ndeltas = [tree-i*k-1 for i, tree in enumerate(trees)]\nfreqs = [0]*1000\n\nfor delta in deltas:\n if delta >= 0:\n freqs[delta] += 1\n\nd = freqs.index(max(freqs))\n\nprint(sum(((delta != d) for delta in deltas)))\nfor i, delta in enumerate(deltas):\n if delta > d:\n print('- %d %d' % (i+1, delta-d))\n elif delta < d:\n print('+ %d %d' % (i+1, d-delta))\n", "N, K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nans = 1e18\r\npos = -1\r\nfor s in range(N):\r\n\tcur = A[s] - K * s\r\n\tif cur <= 0:\r\n\t\tcontinue\r\n\tret = 0\r\n\tfor i in range(N):\r\n\t\tif A[i] != cur:\r\n\t\t\tret += 1\r\n\t\tcur += K\r\n\tif ret < ans:\r\n\t\tans, pos = ret, s\r\nprint(ans)\r\ncur = A[pos] - K * pos\r\nfor i in range(N):\r\n\tif A[i] != cur:\r\n\t\tif A[i] < cur:\r\n\t\t\tprint('+ ' + str(i + 1) + ' ' + str(cur - A[i]))\r\n\t\telse:\r\n\t\t\tprint('- ' + str(i + 1) + ' ' + str(A[i] - cur))\r\n\tcur += K", "n, k = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\nupper_bound = 1\r\nbase_height = 1\r\nans = None\r\n\r\nfor i in range(len(a)):\r\n upper_bound = max(upper_bound, a[i] - k * i)\r\n\r\nfor i in range(1, upper_bound + 1):\r\n ans_candi = sum(1 for j in range(len(a)) if a[j] - i - k * j)\r\n if ans == None or ans_candi < ans:\r\n ans = ans_candi\r\n base_height = i\r\n\r\nprint(ans)\r\nfor i in range(len(a)):\r\n diff = a[i] - base_height - i * k\r\n if diff:\r\n print('{} {} {}'.format('-' if diff > 0 else '+', i + 1, abs(diff)))\r\n", "n, k = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\nl2 = [l[i] - k * i for i in range(n) if l[i] > k * i]\r\nsl = set(l2)\r\nbase, a = 1, 0\r\nfor x in sl:\r\n cnt = l2.count(x)\r\n if cnt > a:\r\n base = x\r\n a = cnt\r\nprint(n - a)\r\nfor i in range(n):\r\n if l[i] < i * k + base:\r\n print('+', i + 1, i * k + base - l[i])\r\n elif l[i] > i * k + base:\r\n print('-', i + 1, l[i] - (i * k + base))", "n, k = map(int, input().split())\r\ntree = list(map(int, input().split()))\r\nmin_action = 1010\r\nfor i in range(1, 1001):\r\n count=0\r\n for j in range(0, n):\r\n if tree[j] != i + j * k:\r\n count+=1\r\n if min_action > count:\r\n min_action = count\r\n ans = i\r\nprint(min_action)\r\nfor i in range(0, n):\r\n if ans + i *k < tree[i]:\r\n print('- %s %s' % (i+1, tree[i] - ans - i*k))\r\n elif ans + i*k > tree[i]:\r\n print('+ %s %s' % (i+1, ans + i*k - tree[i]))\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=[*map(int,input().split())]\r\nb=[1]\r\nfor i in range(1,n):\r\n b.append(b[i-1]+k)\r\nans=int(1e9)\r\nind=-1\r\nfor i in range(1000):\r\n tans=0\r\n for j in range(n):\r\n if b[j]+i!=a[j]:tans+=1\r\n if ans>tans:\r\n ind=i\r\n ans=tans\r\nprint(ans)\r\nfor i in range(n):\r\n if b[i]+ind!=a[i]:\r\n print(('+','-')[a[i]>b[i]+ind],i+1,abs(a[i]-(b[i]+ind)))\r\n", "n,k=map(int,input().split())\n\nz=[int(x) for x in input().split()]\nlim=max(z)\nctr=10000000\n\nminz=[]\nminz_num=[]#no. of moves for every element in z\nfor i in range (1,max(z)+1):\n strt=i\n moves=0\n for j in range (0,len(z)):\n if (z[j]!= strt+j*k):\n moves+=1\n minz.append(moves)\n minz_num.append(strt)\n\n\n\nansf=min(minz)\na=minz_num[minz.index(ansf)]\n\nans=\"\"\nfor i in range (0,len(z)):\n if (z[i] > a+ i*k):\n ans+=\"-\"+\" \"+str(i+1)+\" \"+str(abs(z[i]-a-i*k))+\"\\n\"\n if (z[i] < a+i*k):\n ans+=\"+\"+\" \"+str(i+1)+\" \"+str(abs(z[i]-a-i*k))+\"\\n\"\n\nprint (ansf)\nprint (ans)\n \n \n", "n,k = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\na2 = [a[i]-k*i for i in range(n)]\r\n\r\nbs = set(a2)\r\nbestKey,maxCount = 1,0\r\nfor key in bs:\r\n if key <= 0: continue\r\n count = a2.count(key)\r\n if count > maxCount:\r\n bestKey = key\r\n maxCount = count\r\nb = bestKey\r\n\r\nprint(n-maxCount)\r\nfor i in range(n):\r\n if a[i] > i*k+b:\r\n print('-',i+1,a[i]-(i*k+b))\r\n elif a[i] < i*k+b:\r\n print('+',i+1,i*k+b-a[i])\r\n\r\n", "a = input()\r\na = a.split()\r\na = list(map(int,a))\r\nn = a[0]\r\nk = a[1]\r\nh = input()\r\nh = h.split()\r\nh = list(map(int,h))\r\nc = []\r\ndef make(h,x):\r\n global k\r\n r = list(range(x))\r\n r.reverse()\r\n counter = 0\r\n #print(r)\r\n for i in r:\r\n if (h[i+1] - h[i] != k):\r\n h[i] = h[i+1] - k\r\n counter += 1\r\n #print(list(range(x+1,n)))\r\n for i in range(x+1,n):\r\n if (h[i] - h[i-1] != k):\r\n h[i] = h[i-1] + k\r\n counter += 1\r\n if (min(h) <= 0):\r\n counter = 1000000\r\n return counter\r\ndef myPrint(h,x):\r\n global k\r\n #print(h)\r\n r = list(range(x))\r\n r.reverse()\r\n #print(r)\r\n for i in r:\r\n if (h[i+1] - h[i] != k):\r\n if (h[i] < h[i+1] - k):\r\n print('+',i+1,h[i+1] - k - h[i])\r\n else:\r\n print('-',i+1,-(h[i+1] - k - h[i]))\r\n h[i] = h[i+1] - k\r\n #print(list(range(x+1,n)))\r\n for i in range(x+1,n):\r\n if (h[i] - h[i-1] != k):\r\n if (h[i] < h[i-1] + k):\r\n print('+',i+1,h[i-1] + k - h[i])\r\n else:\r\n print('-',i+1,-(h[i-1] + k - h[i]))\r\n h[i] = h[i-1] + k\r\n return\r\nfor i in range(n):\r\n c.append(make(h.copy(),i))\r\nm = c.index(min(c))\r\nprint(c[m])\r\nmyPrint(h,m)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntmp = {}\r\nfor i in range(n):\r\n x = a[i] - i * k\r\n if x > 0:\r\n tmp[x] = tmp.get(x, 0) + 1\r\nx = max(tmp, key = lambda x: tmp[x])\r\nprint(n - tmp[x])\r\nif tmp[x] == n:\r\n exit(0)\r\nfor i in range(n):\r\n if x + i * k > a[i]:\r\n print('+', i + 1, x + i * k - a[i])\r\n elif x + i * k < a[i]:\r\n print('-', i + 1, a[i] - i * k - x)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nn=len(a)\r\nans=0\r\ns=0\r\nfor i in range(1,1001):\r\n cc=0\r\n for j in range(0,n):\r\n cc+=int(a[j]==i+j*k)\r\n if cc>ans:\r\n ans=cc\r\n s=i\r\nprint(n-ans)\r\nto=s\r\nfor j in range(0,n):\r\n if a[j]>to:\r\n print('-',j+1,a[j]-to)\r\n if a[j]<to:\r\n print('+',j+1,-a[j]+to)\r\n to+=k", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\np=1000\r\nfirst=1\r\nfor i in range(n):\r\n if a[i]>k*i:\r\n now=0\r\n f=a[i]-k*i\r\n for j in range(i):\r\n if a[j]!=f+k*j:\r\n now+=1\r\n for j in range(i+1,n):\r\n if a[j]!=f+j*k:\r\n now+=1\r\n if now<p:\r\n p=now\r\n first=f\r\nprint(p)\r\nfor i in range(n):\r\n if a[i]!=first+k*i:\r\n print('+' if a[i]<first+k*i else '-',i+1,abs(a[i]-first-k*i))", "from collections import Counter\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = [a[i]-k*i for i in range(n)]\r\nocc = Counter(t)\r\nans = 0\r\nfor key, value in occ.items():\r\n\tif key <= 0: continue\r\n\tif value > ans:\r\n\t\tans = value\r\n\t\tbest = key\r\n\r\nprint(n-ans)\r\nfor i in range(n):\r\n\tx = a[i] - i*k - best\r\n\tif x>0: print('{} {} {}'.format('-', i+1, x))\r\n\telif x<0: print('{} {} {}'.format('+', i+1, -x))\r\n", "n,k = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nbest = n \r\nbest_ind = -1\r\nfor i in range(1,1001):\r\n X = [i + k*j for j in range(n)]\r\n cnt = 0 \r\n for j in range(n):\r\n if X[j]!=A[j]:\r\n cnt += 1 \r\n if cnt < best:\r\n best_ind = i \r\n best = min(best,cnt)\r\nans = [best_ind + i*k for i in range(n)]\r\nprint(best)\r\nfor i in range(n):\r\n if ans[i]<A[i]:\r\n print(\"- \" + str(i+1) + \" \" + str(-(-A[i]+ans[i])))\r\n elif ans[i]>A[i]:\r\n print(\"+ \" + str(i+1) + \" \" + str(-(A[i]-ans[i])))\r\n else:\r\n continue", "import math\ndef main():\n n,k = [int(i) for i in input().split()]\n l = [int(i) for i in input().split()]\n l2 = [l[i] - i*k for i in range(len(l))]\n d = dict()\n m = 0\n mn = 0\n for i in l2:\n if i > 0:\n try:\n d[i] += 1\n except:\n d[i] = 1\n if d[i] > m:\n m = d[i]\n mn = i\n count = 0\n ans = []\n for i in range(len(l2)):\n if l2[i] != mn:\n ans += [('+' if l2[i] < mn else '-') + ' ' + str(i+1) + ' ' + str(abs(l2[i] - mn))]\n count += 1\n print(count)\n for i in ans:\n print(i)\n\nif __name__ == '__main__': main()\n", "'''x x+k x+2k ...... '''\r\nn,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\n'''h'''\r\ncm=0\r\nhF=0\r\nfor x in range(1,1001):\r\n cmt=0\r\n for j in range(n):\r\n cmt+=(a[j]==x+j*k)\r\n if cmt>cm:\r\n cm=cmt\r\n hF=x\r\nprint(n-cm)\r\nfor z in range(n):\r\n if a[z]!=hF+z*k:\r\n if a[z]>hF+z*k:\r\n print('-',z+1,a[z]-hF-z*k)\r\n else:\r\n print('+',z+1,abs(a[z]-hF-z*k))\r\n\r\n\r\n" ]

[ "import math\r\nfrom sys import stdin\r\nfrom math import ceil\r\nimport sys\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n table = list()\r\n # newT = list()\r\n for i in range(n):\r\n table.append(input())\r\n # for i in range(2 * n):\r\n # newT.append(1)\r\n # table = [input() for i in range(n)]\r\n newT = [[1] * (2 * n) for i in range(2 * n)]\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if table[i][j] != 'o':\r\n continue\r\n for a in range(n):\r\n for b in range(n):\r\n if table[a][b] == '.':\r\n newT[n + a - i][n + b - j] = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if table[i][j] != 'x':\r\n continue\r\n piece = 0\r\n for a in range(n):\r\n for b in range(n):\r\n if table[a][b] == 'o' and newT[n + i -a][n + j - b] == 1:\r\n piece = 1\r\n break\r\n if piece == 1:\r\n break\r\n if piece == 0:\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\")\r\n for i in range( 1, 2 * n):\r\n for j in range( 1, 2 * n):\r\n if i == n and j == n:\r\n print('o', end = '')\r\n elif newT[i][j] == 1:\r\n print('x', end = '')\r\n else:\r\n print('.', end = '')\r\n print('')\r\n\r\n\r\n", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\n\r\nboard = []\r\n\r\nfor x in range(n):\r\n board.append(list(stdin.readline().strip()))\r\n\r\nmoves = {y:{x:True for x in range(-n+1,n)} for y in range(-n+1,n)}\r\n\r\nfor x in range(n):\r\n for y in range(n):\r\n if board[x][y] == 'o':\r\n for a in range(n):\r\n for b in range(n):\r\n if board[a][b] == '.':\r\n moves[a-x][b-y] = False\r\n\r\nrecreate = [['.' for x in range(n)] for y in range(n)]\r\n\r\nfor x in range(n):\r\n for y in range(n):\r\n if board[x][y] == 'o':\r\n recreate[x][y] = 'o'\r\n for a in moves:\r\n for b in moves:\r\n if moves[a][b]:\r\n if 0 <= x+a < n and 0 <= y+b < n:\r\n if recreate[x+a][y+b] != 'o':\r\n recreate[x+a][y+b] = 'x'\r\n\r\nif board == recreate:\r\n print('YES')\r\n\r\n for x in range(-n+1,n):\r\n l = []\r\n for y in range(-n+1,n):\r\n if moves[x][y]:\r\n l.append('x')\r\n else:\r\n l.append('.')\r\n if x == 0:\r\n l[n-1] = 'o'\r\n print(''.join(l))\r\nelse:\r\n print('NO')\r\n", "def chess(n, B):\n pieces = []\n for r in range(n):\n for c in range(n):\n if B[r][c] == 'o':\n pieces.append((r, c))\n\n m = 2*n - 1\n F = [['?' for _ in range(m)] for _ in range(m)]\n F[n-1][n-1] = 'o'\n\n for r in range(n):\n for c in range(n):\n if B[r][c] == '.':\n for r0, c0 in pieces:\n dr, dc = r - r0, c - c0\n F[n + dr - 1][n + dc - 1] = '.'\n\n for r in range(n):\n for c in range(n):\n if B[r][c] == 'x':\n for r0, c0 in pieces:\n dr, dc = r - r0, c - c0\n if F[n + dr - 1][n + dc - 1] != '.':\n F[n + dr - 1][n + dc - 1] = 'x'\n break\n else:\n return False\n\n return F\n \n\n\n\ndef main():\n n = readint()\n B = [input() for _ in range(n)]\n F = chess(n, B)\n if F:\n print('YES')\n print('\\n'.join(''.join(Fr) for Fr in F).replace('?', '.'))\n else:\n print('NO')\n\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintl():\n return list(readinti())\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\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 = [(\"\"\"\\\n5\noxxxx\nx...x\nx...x\nx...x\nxxxxo\n\"\"\", \"\"\"\\\nYES\n....x....\n....x....\n....x....\n....x....\nxxxxoxxxx\n....x....\n....x....\n....x....\n....x....\n\"\"\"), (\"\"\"\\\n6\n.x.x..\nx.x.x.\n.xo..x\nx..ox.\n.x.x.x\n..x.x.\n\"\"\",\"\"\"\\\nYES\n...........\n...........\n...........\n....x.x....\n...x...x...\n.....o.....\n...x...x...\n....x.x....\n...........\n...........\n...........\n\"\"\"), (\"\"\"\\\n3\no.x\noxx\no.x\n\"\"\",\"\"\"\\\nNO\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" ]

[ "# Description of the problem can be found at http://codeforces.com/problemset/problem/834/A\r\n\r\nd = {\"v\": 0, \"<\": 1, \"^\": 2, \">\": 3}\r\nf1, f2 = input().split()\r\ns = int(input())\r\n\r\nx1 = (d[f1] + s) % 4 == d[f2]\r\nx2 = (d[f1] - s) % 4 == d[f2]\r\nif x1 and x2:\r\n print(\"undefined\")\r\nelif x1:\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")\r\n", "i,f=list(input().split())\r\na=['v','<','^','>']\r\nn=int(input())\r\nn=n%4\r\nq=a.index(i)\r\nc=q+n\r\nac=q-n\r\nif(c>3):\r\n c=c%4\r\nif(ac<0):\r\n ac=ac%4\r\nif (c==ac):\r\n print('undefined')\r\nelif (a[c]==f):\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")\r\n\r\n\r\n\r\n", "s,e=input().split()\r\nn=int(input())\r\nccw='^<v>^<v>'\r\ncw='^>v<^>v<'\r\ni=n%4\r\nif cw[cw.index(s)+i]==ccw[ccw.index(s)+i]==e:\r\n print(\"undefined\")\r\nelif ccw[ccw.index(s)+i]==e:\r\n print(\"ccw\")\r\nelse:\r\n print(\"cw\")", "spinner=['v','<','^','>']\r\n\r\nstart,stop=input().split()\r\nn=int(input())\r\nfor i in range(4):\r\n if spinner[i]==start:\r\n start=i\r\n\r\n if spinner[i]==stop:\r\n stop=i\r\n\r\nif (start+n)%4==stop:\r\n can_cw=True\r\n\r\nelse:\r\n can_cw=False\r\n\r\nstart=3-start\r\nstop=3-stop\r\n\r\nif (start+n)%4==stop:\r\n can_ccw=True\r\n\r\nelse:\r\n can_ccw=False\r\n\r\nif can_cw and can_ccw:\r\n print('undefined')\r\n\r\nelif can_ccw:\r\n print('ccw')\r\n\r\nelse:\r\n print('cw')\r\n", "s = input()\r\nn = int(input())%4\r\np = {'^':0, '>':1, 'v':2, '<':3}\r\nif n%2 == 0:\r\n\tprint(\"undefined\")\r\nelif(p[s[0]] + n)%4 == p[s[2]]:\r\n\tprint(\"cw\")\r\nelse:\r\n\tprint(\"ccw\")\r\n", "s=input()\r\nn=int(input())\r\nif n % 2 ==0:\r\n print(\"undefined\")\r\nelse:\r\n a={\"118\":0,\"60\":1,\"94\":2,\"62\":3}\r\n x,y=(a[str(ord(s[0]))]+n)%4, a[str(ord(s[2]))]\r\n if x==y:\r\n print(\"cw\")\r\n else:\r\n print(\"ccw\")\r\n", "s = input().split()\r\nk = int(input()) % 4\r\npos = ['^','>','v','<']\r\nif s[0] == '^':\r\n st = 1\r\nelif s[0] == '>':\r\n st = 2\r\nelif s[0] == 'v':\r\n st = 3\r\nelse:\r\n st = 4\r\n \r\nif s[1] == '^':\r\n fin = 1\r\nelif s[1] == '>':\r\n fin = 2\r\nelif s[1] == 'v':\r\n fin = 3\r\nelse:\r\n fin = 4\r\n \r\nif abs(st - fin) == 2 or st - fin == 0:\r\n print('undefined')\r\nelse:\r\n if (st - fin )%4 == k:\r\n print('ccw')\r\n else:\r\n print('cw')", "a=[x for x in input().split()]\r\nn=int(input())\r\na[0],a[1]=ord(a[0]),ord(a[1])\r\nif n%2==0:\r\n print('undefined')\r\nelse:\r\n if n%4==1:\r\n if a[0]==118:\r\n if a[1]==60:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n elif a[0]==60:\r\n if a[1]==94:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n elif a[0]==94:\r\n if a[1]==62:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n else:\r\n if a[1]==118:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n else:\r\n if a[0]==118:\r\n if a[1]==62:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n elif a[0]==60:\r\n if a[1]==118:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n elif a[0]==94:\r\n if a[1]==60:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n else:\r\n if a[1]==94:\r\n print('cw')\r\n else:\r\n print('ccw')", "\r\n\r\nm = {'^':0, '>':1, 'v':2, '<':3}\r\n\r\na,b = input().split()\r\nn = int(input())\r\n\r\na,b = m[a], m[b]\r\n\r\ncwdist = (b-a)%4\r\nccwdist = (a-b)%4\r\n\r\nif cwdist == ccwdist:\r\n print(\"undefined\")\r\nelif cwdist == n%4:\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")\r\n", "#problem66\r\na,b = map(str,input().split())\r\nc = int(input())\r\ntoy = 'v<^>'\r\nif c%2==0:\r\n print('undefined')\r\nelif (toy.find(a)+c)%4 == toy.find(b):\r\n print('cw')\r\nelse:\r\n print('ccw')", "a,b = input().split()\na = ord(a)\nb = ord(b)\n\nn = int(input())\ntemp = n//4;\nn = n % 4;\n\n\nif a == 118:\n\n\tif b == 118:\n\n\t\tprint(\"undefined\")\n\n\telif b == 60:\n\n\t\tif n == 1:\n\t\t\tprint(\"cw\")\n\t\telif n == 3:\n\t\t\tprint(\"ccw\")\n\n\telif b == 94:\n\n\t\tif n == 2:\n\t\t\tprint(\"undefined\")\n\n\n\telif b == 62:\n\n\t\tif n == 1:\n\t\t\tprint(\"ccw\")\n\t\telif n == 3:\n\t\t\tprint(\"cw\")\n\n\nelif a == 60:\n\n\tif b == 118:\n\n\t\tif n == 1:\n\t\t\tprint(\"ccw\")\n\t\telif n == 3:\n\t\t\tprint(\"cw\")\n\n\telif b == 60:\n\n\t\tprint(\"undefined\")\n\n\telif b == 94:\n\n\t\tif n == 1:\n\t\t\tprint(\"cw\")\n\t\telif n == 3:\n\t\t\tprint(\"ccw\")\n\n\telif b == 62:\n\n\t\tif n == 2:\n\t\t\tprint(\"undefined\")\n\nelif a == 94:\n\n\tif b == 118:\n\n\t\tif n == 2:\n\t\t\tprint(\"undefined\")\n\n\n\telif b == 60:\n\n\t\tif n == 1:\n\t\t\tprint(\"ccw\")\n\t\telif n == 3:\n\t\t\tprint(\"cw\")\n\n\telif b == 94:\n\n\t\tif n == 0:\n\t\t\tprint(\"undefined\")\n\n\telif b == 62:\n\n\t\tif n == 1:\n\t\t\tprint(\"cw\")\n\t\telif n == 3:\n\t\t\tprint(\"ccw\")\n\nelif a == 62:\n\n\tif b == 118:\n\n\t\tif n == 1:\n\t\t\tprint(\"cw\")\n\t\telif n == 3:\n\t\t\tprint(\"ccw\")\n\n\telif b == 60:\n\n\t\tif n == 2:\n\t\t\tprint(\"undefined\")\n\n\telif b == 94:\n\n\t\tif n == 1:\n\t\t\tprint(\"ccw\")\n\t\telif n == 3:\n\t\t\tprint(\"cw\")\n\n\telif b == 62:\n\n\t\tif n == 0:\n\t\t\tprint(\"undefined\")\n\n\n", "fwd=[\"v\",\"<\",\"^\",\">\"]\nbck=fwd[::-1]\nf,s=input().split()\nn=int(input())%4\nfwdp=fwd.index(f)\nbckp=bck.index(f)\na1,a2=fwd[(fwdp+n)%4],bck[(bckp+n)%4]\nif a1==a2==s:print(\"undefined\")\nelif a1==s:print(\"cw\")\nelse:print(\"ccw\")\n\n", "import sys\n\n\ndef solution(s, n):\n input_map = {'v': 0, '<': 1, '^': 2, '>': 3}\n sb, se = [input_map[v] for v in s.split(\" \")]\n n = n % 4\n sc = se-sb\n if sc == 2 or sc == -2:\n return 'undefined'\n if sc > 0:\n if n == sc:\n return 'cw'\n if n == 4-sc:\n return 'ccw'\n elif sc < 0:\n if n == -sc:\n return 'ccw'\n if n == 4+sc:\n return 'cw'\n return 'undefined'\n\n\nif __name__ == \"__main__\":\n if sys.argv[-1] == 't':\n cases = [\n [\"^ >\", 1, \"cw\"],\n [\"< ^\", 3, \"ccw\"],\n [\"^ v\", 6, \"undefined\"]\n ]\n for case in cases:\n r = solution(*case[:-1])\n if r != case[-1]:\n print(case, r)\n else:\n input_s = input()\n print(solution(input_s, int(input())))\n\n\t\t\t \t \t \t \t\t\t\t \t \t \t\t \t\t", "s = \"^>v<\"\r\na,b = input().split()\r\nn = int(input())\r\na = s.index(a)\r\nb = s.index(b)\r\nok1 = False\r\nok2 = False\r\n#print(a,b)\r\nif((a + n)%4 == b): ok1 = True\r\nif((a - n)%4 == b): ok2 = True\r\nelif((a - n)%4 + 4 == b): ok2 = True\r\nif(ok1 and not ok2): print(\"cw\")\r\nelif(not ok1 and ok2): print(\"ccw\")\r\nelse: print(\"undefined\")\r\n\r\n", "import sys\r\na = input()\r\nb = int(input()) % 4\r\nc = ord(a[0]) - ord(a[2])\r\nd = {58: 'cw', 56: 'ccw', -58: 'ccw', -34: 'cw',\r\n 34: 'ccw', 32: 'cw', -56: 'cw', -32: 'ccw'}\r\nif b % 2 == 0:\r\n sys.stdout.write('undefined')\r\nelse:\r\n if b == 1:\r\n sys.stdout.write(d[c])\r\n else:\r\n sys.stdout.write(d[-c])", "s, g = input().split()\r\nn = int(input())\r\n\r\ncw = {'<': 1, '^': 2, '>': 3, 'v': 4}\r\nccw = {'<': 1, '^': 4, '>': 3, 'v': 2}\r\n\r\nn = n % 4\r\nd1 = cw[g] - cw[s]\r\nd2 = ccw[g] - ccw[s]\r\n\r\nif (d1 < 0):\r\n d1 += 4\r\n\r\nif (d2 < 0):\r\n d2 += 4\r\n\r\nresult = ''\r\n\r\nif (d1 == n and d2 != n):\r\n result = 'cw'\r\nelif (d2 == n and d1 != n):\r\n result = 'ccw'\r\nelse:\r\n result = 'undefined'\r\n \r\nprint(result)", "a,b = input().split()\nn = int(input())\ncw = {'>': 0, 'v': 1, '<': 2, '^': 3}\nccw = {'>': 0, '^': 1, '<': 2, 'v': 3}\n\na_cw = cw[a]\nb_cw = cw[b]\n\na_ccw = ccw[a]\nb_ccw = ccw[b]\n\nif (a_cw + n) % 4 == b_cw and (a_ccw + n) % 4 != b_ccw:\n print('cw')\nelif (a_ccw + n) % 4 == b_ccw and (a_cw + n) % 4 != b_cw:\n print('ccw')\nelse:\n print('undefined')\n", "def main_function():\r\n input_str = [i for i in input().split(\" \")]\r\n n = int(input())\r\n n = n % 4\r\n d = [\"v\", \"<\", \"^\", \">\"]\r\n if not n % 2:\r\n return \"undefined\"\r\n starting_index = d.index(input_str[0])\r\n ending_index = d.index(input_str[1])\r\n new_index_1 = starting_index + n\r\n new_index_2 = starting_index - n\r\n if new_index_1 > 3:\r\n new_index_1 -= 4\r\n if new_index_2 < 0:\r\n new_index_2 = 4 - new_index_2\r\n if ending_index == new_index_1:\r\n return \"cw\"\r\n return \"ccw\"\r\n \r\n \r\n\r\n\r\n\r\n\r\nprint(main_function())", "v = ['v', '<', '^', '>']\ns, e = input().split()\ns = v.index(s)\ne = v.index(e)\nn = int(input())\nif n % 2 == 0:\n print(\"undefined\")\nelse:\n c = (e - s) % 4\n a = (s - e) % 4\n print([\"cw\", \"ccw\"][(n - a) % 4 == 0])\n", "c = ['v', '<', '^', '>']\ns, e = list(input().split())\nn = int(input())\nif n % 2 == 0:\n print('undefined')\nsi, ei = c.index(s), c.index(e)\nif n % 4 == 1:\n if ei - si == 1 or si - ei == 3:\n print('cw')\n else:\n print('ccw')\nif n % 4 == 3:\n if ei - si == 1 or si - ei == 3:\n print('ccw')\n else:\n print('cw')\n\n", "Toy = ['v', '<', '^', '>']\r\n \r\na, b = map(Toy.index, input().split())\r\nn = int(input())\r\n# print(a,b)\r\nd = (b - a + 4) % 4\r\n# print(d)\r\nif d == 0 or d == 2:\r\n print('undefined')\r\nelif d == n % 4:\r\n print('cw')\r\nelse:\r\n print('ccw')", "l,p=False,False\r\ns1,s2=map(str,input().split())\r\ns=s1+''\r\nn=int(input())%4\r\nfor i in range(n):\r\n if s=='v':\r\n s='<'\r\n elif s=='<':\r\n s='^'\r\n elif s=='^':\r\n s='>'\r\n elif s=='>':\r\n s='v'\r\nif s==s2:\r\n l=True\r\ns=s1+''\r\nfor i in range(n):\r\n if s=='v':\r\n s='>'\r\n elif s=='>':\r\n s='^'\r\n elif s=='^':\r\n s='<'\r\n elif s=='<':\r\n s='v'\r\nif s==s2:\r\n p=True\r\nif p==l:\r\n print('undefined')\r\nelif l:\r\n print('cw')\r\nelse:\r\n print('ccw')\r\n \r\n", "l=input().split()\r\nn=int(input())\r\ncw=['^','>','v','<']\r\nccw=['^','<','v','>']\r\nc=cw.index(l[0])\r\na=ccw.index(l[0])\r\nif(cw[(c+n)%4]==l[1] and ccw[(a+n)%4]==l[1]):\r\n print('undefined')\r\nelif(ccw[(a+n)%4]==l[1]):\r\n print('ccw')\r\nelse:\r\n print('cw')", "\r\nstart, end = input().split()\r\nn = int(input())\r\n\r\nl = ['^', '>', 'v', '<'] * 2\r\n\r\nni = n % 4\r\nans = []\r\nif l[l.index(start) + ni] == end:\r\n\tans.append('cw')\r\n\r\nif l[[i for i, n in enumerate(l) if n == start][1] - ni] == end:\r\n\tans.append('ccw')\r\n\r\nif len(ans) == 2 or len(ans) == 0:\r\n\tprint('undefined')\r\nelse:\r\n\tprint(*ans)\r\n", "\r\ni, f = map(str, input().split(' '))\r\nn = int(input())\r\n\r\ncw = [\"^\",\">\",\"v\",\"<\"]\r\nccw = [\"^\",\"<\",\"v\",\">\"]\r\ninicio = cw.index(i)\r\n_cw = (cw[(inicio+(n%4))%4])\r\n\r\n\r\ninicio1 = ccw.index(i)\r\n_ccw = (ccw[(inicio1+(n%4))%4])\r\n\r\n\r\nif _cw == f and _ccw != f:\r\n print(\"cw\")\r\nelif _ccw == f and _cw != f:\r\n print(\"ccw\")\r\nelif _cw == f and _ccw == f:\r\n print(\"undefined\")\r\n", "s, e = input().split()\r\nstates = \"^>v<\"\r\nn = int(input())\r\nif n%2==0:\r\n print(\"undefined\")\r\nelse:\r\n if (states.index(e)-states.index(s))%4 == n%4:\r\n print(\"cw\")\r\n else:\r\n print(\"ccw\")\r\n", "from sys import stdin\r\nfrom math import ceil\r\n\r\nrd = stdin.readline\r\n\r\nx, y = rd().split()\r\nn = int(rd())\r\n\r\nCW = [('^', '>'), ('>', 'v'), ('v', '<'), ('<', '^')]\r\nAW = [('>', '^'), ('v', '>'), ('<', 'v'), ('^', '<')]\r\nOP = [('^', 'v'), ('<', '>')]\r\n\r\nif n % 2 == 0:\r\n\r\n print(\"undefined\")\r\n\r\nelif n % 4 == 1:\r\n\r\n if (x, y) in CW: print('cw')\r\n elif (x, y) in AW: print('ccw')\r\n else: print('undefined')\r\n\r\nelse:\r\n \r\n if (x, y) in AW: print('cw')\r\n elif (x, y) in CW: print('ccw')\r\n else: print('undefined')\r\n \r\n", "while True:\n try:\n a,b=input().split()\n c=int(input())\n c%=4\n s=n=0\n if a=='>':\n if c==3:\n a='^'\n elif c==1:\n a='v'\n elif c==2:\n a='<'\n if a==b:\n s=1\n a='>'\n if c==3:\n a='v'\n elif c==1:\n a='^'\n elif c==2:\n a='<'\n if a==b:\n n=1\n elif a=='v':\n if c==3:\n a='>'\n elif c==1:\n a='<'\n elif c==2:\n a='^'\n if a==b:\n s=1\n a='v'\n if c==3:\n a='<'\n elif c==1:\n a='>'\n elif c==2:\n a='^'\n if a==b:\n n=1\n elif a=='<':\n if c==3:\n a='v'\n elif c==1:\n a='^'\n elif c==2:\n a='>'\n if a==b:\n s=1\n a='<'\n if c==3:\n a='^'\n elif c==1:\n a='v'\n elif c==2:\n a='>'\n if a==b:\n n=1\n elif a=='^':\n if c==3:\n a='<'\n elif c==1:\n a='>'\n elif c==2:\n a='v'\n if a==b:\n s=1\n a='^'\n if c==3:\n a='>'\n elif c==1:\n a='<'\n elif c==2:\n a='v'\n if a==b:\n n=1\n if s==1 and n!=1:\n print(\"cw\")\n if s!=1 and n==1:\n print(\"ccw\")\n if s==1 and n==1:\n print(\"undefined\")\n except EOFError:\n break", "s = input()\r\nn=int(input())\r\nc = ['^','>','v','<']\r\nac = ['^','<','v','>']\r\n\r\nif(n%2==0):\r\n print('undefined')\r\nelse:\r\n n=n%4\r\n \r\n if(c[(c.index(s[0])+n)%4]==s[2]):\r\n print('cw')\r\n elif (ac[(ac.index(s[0])+n)%4]==s[2]):\r\n print('ccw')\r\n else:\r\n print('undefined')", "k=input().split()\nn=int(input())\nif (k[0]==\"^\" and k[1]==\">\") or (k[0]==\">\" and k[1]==\"v\") or (k[0]==\"v\" and k[1]==\"<\") or (k[0]==\"<\" and k[1]==\"^\"):\n if n%4==1:\n print(\"cw\")\n elif n%4==3:\n print(\"ccw\")\nelif(k[0]==\"^\" and k[1]==\"<\") or (k[0]==\"<\" and k[1]==\"v\") or (k[0]==\"v\" and k[1]==\">\") or (k[0]==\">\" and k[1]==\"^\"):\n if n%4==3:\n print(\"cw\")\n elif n%4==1:\n print(\"ccw\")\nelse:\n print(\"undefined\")", "DIRS = ['v', '<', '^', '>']\na, b = map(DIRS.index, input().split())\nn = int(input())\ndelta = (b - a + 4) % 4\nif delta == 0 or delta == 2:\n\tprint('undefined')\nelif delta == n % 4:\n\tprint('cw')\nelse:\n\tprint('ccw')\n", "s,f=input().split()\nn=int(input())\ncw = ['v','<','^', '>']\nccw = ['v','>','^', '<']\necw=cw[(cw.index(s)+n)%4]\neccw=ccw[(ccw.index(s)+n)%4]\nif ecw==f:\n if eccw!=f:\n print('cw')\n else:\n print('undefined')\nelif eccw ==f:\n if ecw!=f:\n print(\"ccw\")\n else:\n print(\"undefined\")\nelse:\n print(\"undefined\")\n", "cloc = ['^','>','v','<']\r\nanti = ['^','<','v','>']\r\nop = 0\r\nx, y = input().split()\r\nn = int(input()) % 4\r\nif cloc[(cloc.index(x)+n)%4] == cloc[cloc.index(y)]:\r\n op += 1\r\nif anti[(anti.index(x)+n)%4] == anti[anti.index(y)]:\r\n op += 2\r\nif op == 1:\r\n print(\"cw\")\r\nelif op == 2:\r\n print(\"ccw\")\r\nelse:\r\n print(\"undefined\")", "''' Thruth can only be found at one place - THE CODE '''\r\n\r\n''' Copyright 2018, SATYAM KUMAR'''\r\nfrom sys import stdin, stdout\r\nimport cProfile, math\r\nfrom collections import Counter\r\nfrom bisect import bisect_left,bisect,bisect_right\r\nimport itertools\r\nfrom copy import deepcopy\r\nfrom fractions import Fraction\r\nimport sys, threading\r\nsys.setrecursionlimit(10**6) # max depth of recursion\r\nthreading.stack_size(2**27) # new thread will get stack of such size\r\n\r\nprintHeap = str()\r\nmemory_constrained = False\r\nP = 10**9+7\r\nimport sys\r\nsys.setrecursionlimit(10000000)\r\n\r\nclass Operation:\r\n def __init__(self, name, function, function_on_equal, neutral_value=0):\r\n self.name = name\r\n self.f = function\r\n self.f_on_equal = function_on_equal\r\ndef add_multiple(x, count):\r\n return x * count\r\ndef min_multiple(x, count):\r\n return x\r\ndef max_multiple(x, count):\r\n return x\r\nsum_operation = Operation(\"sum\", sum, add_multiple, 0)\r\nmin_operation = Operation(\"min\", min, min_multiple, 1e9)\r\nmax_operation = Operation(\"max\", max, max_multiple, -1e9)\r\nclass SegmentTree:\r\n def __init__(self,\r\n array,\r\n operations=[sum_operation, min_operation, max_operation]):\r\n self.array = array\r\n if type(operations) != list:\r\n raise TypeError(\"operations must be a list\")\r\n self.operations = {}\r\n for op in operations:\r\n self.operations[op.name] = op\r\n self.root = SegmentTreeNode(0, len(array) - 1, self)\r\n def query(self, start, end, operation_name):\r\n if self.operations.get(operation_name) == None:\r\n raise Exception(\"This operation is not available\")\r\n return self.root._query(start, end, self.operations[operation_name])\r\n def summary(self):\r\n return self.root.values\r\n def update(self, position, value):\r\n self.root._update(position, value)\r\n def update_range(self, start, end, value):\r\n self.root._update_range(start, end, value)\r\n def __repr__(self):\r\n return self.root.__repr__()\r\nclass SegmentTreeNode:\r\n def __init__(self, start, end, segment_tree):\r\n self.range = (start, end)\r\n self.parent_tree = segment_tree\r\n self.range_value = None\r\n self.values = {}\r\n self.left = None\r\n self.right = None\r\n if start == end:\r\n self._sync()\r\n return\r\n self.left = SegmentTreeNode(start, start + (end - start) // 2,\r\n segment_tree)\r\n self.right = SegmentTreeNode(start + (end - start) // 2 + 1, end,\r\n segment_tree)\r\n self._sync()\r\n def _query(self, start, end, operation):\r\n if end < self.range[0] or start > self.range[1]:\r\n return None\r\n if start <= self.range[0] and self.range[1] <= end:\r\n return self.values[operation.name]\r\n self._push()\r\n left_res = self.left._query(start, end,\r\n operation) if self.left else None\r\n right_res = self.right._query(start, end,\r\n operation) if self.right else None\r\n if left_res is None:\r\n return right_res\r\n if right_res is None:\r\n return left_res\r\n return operation.f([left_res, right_res])\r\n def _update(self, position, value):\r\n if position < self.range[0] or position > self.range[1]:\r\n return\r\n if position == self.range[0] and self.range[1] == position:\r\n self.parent_tree.array[position] = value\r\n self._sync()\r\n return\r\n self._push()\r\n self.left._update(position, value)\r\n self.right._update(position, value)\r\n self._sync()\r\n def _update_range(self, start, end, value):\r\n if end < self.range[0] or start > self.range[1]:\r\n return\r\n if start <= self.range[0] and self.range[1] <= end:\r\n self.range_value = value\r\n self._sync()\r\n return\r\n self._push()\r\n self.left._update_range(start, end, value)\r\n self.right._update_range(start, end, value)\r\n self._sync()\r\n def _sync(self):\r\n if self.range[0] == self.range[1]:\r\n for op in self.parent_tree.operations.values():\r\n current_value = self.parent_tree.array[self.range[0]]\r\n if self.range_value is not None:\r\n current_value = self.range_value\r\n self.values[op.name] = op.f([current_value])\r\n else:\r\n for op in self.parent_tree.operations.values():\r\n result = op.f(\r\n [self.left.values[op.name], self.right.values[op.name]])\r\n if self.range_value is not None:\r\n bound_length = self.range[1] - self.range[0] + 1\r\n result = op.f_on_equal(self.range_value, bound_length)\r\n self.values[op.name] = result\r\n def _push(self):\r\n if self.range_value is None:\r\n return\r\n if self.left:\r\n self.left.range_value = self.range_value\r\n self.right.range_value = self.range_value\r\n self.left._sync()\r\n self.right._sync()\r\n self.range_value = None\r\n def __repr__(self):\r\n ans = \"({}, {}): {}\\n\".format(self.range[0], self.range[1],\r\n self.values)\r\n if self.left:\r\n ans += self.left.__repr__()\r\n if self.right:\r\n ans += self.right.__repr__()\r\n return ans\r\n\r\ndef display(string_to_print):\r\n stdout.write(str(string_to_print) + \"\\n\")\r\n\r\ndef primeFactors(n): #n**0.5 complex \r\n factors = dict()\r\n for i in range(2,math.ceil(math.sqrt(n))+1): \r\n while n % i== 0: \r\n if i in factors:\r\n factors[i]+=1\r\n else: factors[i]=1\r\n n = n // i \r\n if n>2:\r\n factors[n]=1\r\n return (factors)\r\n \r\ndef isprime(n):\r\n \"\"\"Returns True if n is prime.\"\"\"\r\n if n < 4:\r\n return True\r\n if n % 2 == 0:\r\n return False\r\n if n % 3 == 0:\r\n return False\r\n i = 5\r\n w = 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n return False\r\n i += w\r\n w = 6 - w\r\n return True\r\n\r\ndef test_print(*args):\r\n if testingMode:\r\n print(args)\r\n\r\ndef display_list(list1, sep=\" \"):\r\n stdout.write(sep.join(map(str, list1)) + \"\\n\")\r\n\r\ndef get_int():\r\n return int(stdin.readline().strip())\r\n\r\ndef get_tuple():\r\n return map(int, stdin.readline().split())\r\n\r\ndef get_list():\r\n return list(map(int, stdin.readline().split()))\r\n\r\nmemory = dict()\r\ndef clear_cache():\r\n global memory\r\n memory = dict()\r\ndef cached_fn(fn, *args):\r\n global memory\r\n if args in memory:\r\n return memory[args]\r\n else:\r\n result = fn(*args)\r\n memory[args] = result\r\n return result\r\n\r\n\r\n# -------------------------------------------------------------- MAIN PROGRAM\r\nTestCases = False\r\ntestingMode = False\r\noptimiseForReccursion = False #Can not be used clubbed with TestCases\r\n\r\ndef main():\r\n x = list(input().split())\r\n for i,ele in enumerate([94,62,118,60]):\r\n if x[0]==chr(ele):\r\n a = i\r\n if x[1]==chr(ele):\r\n b = i\r\n n = get_int()\r\n x = n%4\r\n a1 = (a+x)%4==b\r\n a2 = (a-x)%4==b\r\n if a1 and a2:\r\n print(\"undefined\")\r\n elif a1:\r\n print(\"cw\")\r\n else: print(\"ccw\")\r\n\r\n\r\n\r\n\r\n# --------------------------------------------------------------------- END\r\n\r\n\r\nif TestCases: \r\n for _ in range(get_int()): \r\n cProfile.run('main()') if testingMode else main() \r\nelse: (cProfile.run('main()') if testingMode else main()) if not optimiseForReccursion else threading.Thread(target=main).start()", "ref_arr = [\"^\",\">\",\"v\",\"<\",\"^\",\">\",\"v\"]\r\n\r\nstring = input().split()\r\nstart = ref_arr.index(string[0])\r\n\r\nn = int(input())\r\n\r\nif n % 2 == 0 :\r\n print (\"undefined\")\r\nelif ref_arr[start + (n%4)] == string[1]:\r\n print (\"cw\")\r\nelse:\r\n print(\"ccw\")", "def ri(): return int(input())\r\ndef rli(): return list(map(int, input().split()))\r\ndef ris(): return list(input())\r\ndef pli(a): return \"\".join(list(map(str, a)))\r\ndef plis(a): return \" \".join(list(map(str, a)))\r\n\r\ndi = [\"v\", \"<\", \"^\", \">\"]\r\ns, e = input().split()\r\nn = ri() % 4\r\ns = di.index(s)\r\ne = di.index(e)\r\niscw = True\r\nif(n == 0 or n == 2):\r\n print(\"undefined\")\r\nelif(n == 1):\r\n if(s-e == 1 or s-e == -3):\r\n iscw = False\r\n print(\"cw\" if iscw else \"ccw\")\r\nelse:\r\n if(e-s == 1 or e-s == -3):\r\n iscw = False\r\n print(\"cw\" if iscw else \"ccw\")", "def main ():\n s, e = input().split()\n N = int(input())\n mapping = {\n \"^\": \">\",\n \"<\": \"^\",\n \">\": \"v\",\n \"v\": \"<\"\n }\n if N%2 == 0:\n return \"undefined\"\n if N%4==1:\n if mapping[s] == e:\n return \"cw\"\n else:\n return \"ccw\"\n else:\n if mapping[s] == e:\n return \"ccw\"\n else:\n return \"cw\"\n\nprint(main())", "# LUOGU_RID: 101672035\na, b, n = open(0).read().split()\r\nn = int(n) % 4\r\nif n % 2 == 0:\r\n exit(print('undefined'))\r\nif (n == 3) ^ (a + b in ['<^', '^>', '>v', 'v<']):\r\n print('cw')\r\nelse:\r\n print('ccw')", "# problem/834/A\n\nstart, end = [str(n) for n in input().split(\" \")]\nn = int(input())\n\noffset_cw = {'^':0, '>':1, 'v':2, '<':3}\noffset_ccw = {'^':0, '<':1, 'v':2, '>':3}\n\ndef check(start, end, n, dict):\n start_n = dict[start]\n end_n = dict[end]\n\n if (start_n + n) % 4 == end_n:\n return True\n else:\n return False\n\ncw = check(start, end, n, offset_cw)\nccw = check(start, end, n, offset_ccw)\n\nif cw and not ccw:\n print(\"cw\")\nelif ccw and not cw:\n print(\"ccw\")\nelse:\n print(\"undefined\")\n", "l = 'v<^>'\r\n\r\n\r\nstart,end = input().split()\r\ns_i = l.index(start)\r\ne_i = l.index(end)\r\nsteps = int(input())\r\nif steps%4 == (s_i-e_i)%4 and steps%4 == (e_i-s_i)%4:\r\n print ('undefined')\r\nelif steps%4 == (e_i-s_i)%4:\r\n print ('cw')\r\nelif steps%4 == (s_i-e_i)%4:\r\n print ('ccw')\r\nelse:\r\n print ('undefined')\r\n", "b,e=input().split()\r\nn=int(input())%4\r\nl=['v','>','^','<']\r\nb=l.index(b)\r\ne=l.index(e)\r\nbccw=b\r\nbcw=b\r\nfor _ in range(n):\r\n bccw=(bccw+1)%4\r\n bcw=(bcw-1+4)%4\r\nif bccw==bcw or (bccw!=e and bcw!=e): print(\"undefined\")\r\nelif bccw==e: print(\"ccw\")\r\nelse: print(\"cw\")", "s,f=list(input().split())\r\narr=['v','<','^','>']\r\nx=arr.index(s)\r\nn=int(input())%4\r\nc=x+n\r\ncw=x-n\r\nif(c>3):\r\n c=c%4\r\nif(cw<0):\r\n cw=cw%4\r\nif (c==cw):\r\n print('undefined')\r\nelif (arr[c]==f):\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")", "spinner = ['v', '<', '^', '>']\r\ns = input().split()\r\nn = int(input())\r\nif n % 2 == 0:\r\n print('undefined')\r\nelse:\r\n if (spinner.index(s[1]) - spinner.index(s[0]) + 4) % 4 == n % 4:\r\n print('cw')\r\n else:\r\n print('ccw')", "import sys\r\nspinner = input()\r\nn = int(input())\r\n\r\nif n > 4:\r\n n = n % 4\r\nclock = 'v<^>v<^>'\r\nclockr ='>^<v>^<v'\r\n\r\ncw = ccw = 0\r\np = clock.index(spinner[0])\r\np2 = clockr.index(spinner[0])\r\n\r\n\r\nif clock[p+n] == spinner[2]:\r\n cw = 1\r\nif clockr[p2+n] == spinner[2]:\r\n ccw = 1\r\n\r\nif cw == 1 and ccw == 0:\r\n print('cw')\r\nelif ccw == 1 and cw == 0:\r\n print('ccw')\r\nelse:\r\n print('undefined')\r\n", "\r\nstart,end=input().split()\r\nn=int(input())\r\narr=['^','>','v','<']\r\nind1=0\r\nind2=0\r\nfor i in range(4):\r\n\tif(arr[i]==start):\r\n\t\tind1=i \r\n\tif(arr[i]==end):\r\n\t\tind2=i\r\nif(ind2>=ind1):\r\n\tdiff1=ind2-ind1\r\nelse:\r\n\tdiff1=4+(ind2-ind1)\r\nif(ind1>=ind2):\r\n\tdiff2=ind1-ind2\r\nelse:\r\n\tdiff2=4+(ind1-ind2)\r\nflag1=0\r\nflag2=0\r\nif(n%4==diff1):\r\n\tflag1=1\r\nif(n%4==diff2):\r\n\tflag2=1\r\nif(flag1==1 and flag2==1):\r\n\tprint(\"undefined\")\r\nelif(flag1==1):\r\n\tprint('cw')\r\nelif(flag2==1):\r\n\tprint('ccw')\r\nelse:\r\n\tprint(\"undefined\")", "def clockwise(n,s1):\r\n s=[\"^\",\">\",\"v\",\"<\"]\r\n v=s.index(s1)+1+n\r\n if v>4:\r\n v=v%4\r\n return s[v-1]\r\ndef anticlockwise(n,s1):\r\n s=[\"^\",\">\",\"v\",\"<\"]\r\n s = s[::-1]\r\n v=s.index(s1)+1+n\r\n if v>4:\r\n v=v%4\r\n return s[v-1]\r\na,b=input().split()\r\nn=int(input())\r\nc1=clockwise(n,a)\r\nc2=anticlockwise(n,a)\r\nif b==c1 and b==c2:\r\n print(\"undefined\")\r\nelif b==c1:\r\n print(\"cw\")\r\nelif b==c2:\r\n print(\"ccw\")\r\n\r\n\r\n", "a, b = (i for i in input().split())\r\nn = int(input())%4\r\nif n%2:\r\n if a == 'v':\r\n if b == '>' and n == 1 or b == '<' and n == 3:\r\n print('ccw')\r\n else:\r\n print('cw')\r\n elif a== '>':\r\n if b == '^' and n == 1 or b == 'v' and n == 3:\r\n print('ccw')\r\n else:\r\n print('cw')\r\n elif a== '^':\r\n if b == '<' and n == 1 or b == '>' and n == 3:\r\n print('ccw')\r\n else:\r\n print('cw')\r\n elif a== '<':\r\n if b == 'v' and n == 1 or b == '^' and n == 3:\r\n print('ccw')\r\n else:\r\n print('cw')\r\nelse:\r\n print('undefined')", "b,e=input().split()\r\nn=int(input())\r\nn=n%4\r\nif n==0:\r\n print('undefined')\r\nelse:\r\n cw='v<^>v<^>'\r\n ccw='v>^<v>^<'\r\n i1=cw.find(b)\r\n i2=cw.find(e,i1+1)\r\n j1=ccw.find(b)\r\n j2=ccw.find(e,j1+1)\r\n if i2-i1==n and j2-j1==n:\r\n print('undefined')\r\n elif i2-i1==n:\r\n print('cw')\r\n elif j2-j1==n:\r\n print('ccw')", "def read(is_int,split_by):\r\n\tif(is_int):\r\n\t\treturn [int(x) for x in input().split(split_by)]\r\n\telse:\r\n\t\treturn [x for x in input().split(split_by)]\r\n\r\ns,f = read(False,\" \")\r\nn = int(input())\r\nseq = ['<','^','>','v']\r\nk = n%4\r\nspin = \"undefined\"\r\nind_s = seq.index(s)\r\nind_f = seq.index(f)\r\n# Case of k == 0 undefined\r\nif not (s == f):\r\n\tif not(k%2==0):\r\n\t\tremind = (ind_s+k) % 4\r\n\t\tif f == seq[remind]:\r\n\t\t\tspin = \"cw\"\r\n\t\tremind = (ind_s-k) % 4\r\n\t\tif f == seq[remind]:\r\n\t\t\tspin = \"ccw\"\r\nprint(spin)\r\n\r\n", "x=['<','^','>','v']\ns,e=input().split()\nit=int(input())\nfor i in range(len(x)):\n if(x[i]==s):\n sp=i\nfor i in range(len(x)):\n if(x[i]==e):\n ep=i\nif(((sp+it)%4)==((sp-it)%4)):\n print('undefined')\nelif(x[((sp+it)%4)]==x[ep]):\n print('cw')\nelif(x[((sp-it)%4)]==x[ep]):\n print('ccw')\nelse:\n print('undefined')\n \t\t\t \t \t\t\t \t\t \t \t\t \t \t \t \t", "initial,final = input().split()\r\ncw_res, ccw_res = initial,initial\r\nn = int(input())\r\nn = n%4\r\nccw = {\r\n '<': 'v',\r\n '>': '^',\r\n 'v': '>',\r\n '^': '<'\r\n}\r\n\r\ncc = {\r\n '<': '^',\r\n '>': 'v',\r\n '^': '>',\r\n 'v': '<'\r\n}\r\n\r\nfor i in range(n):\r\n cw_res = cc[ cw_res ]\r\n ccw_res = ccw[ ccw_res ]\r\nif cw_res == ccw_res:\r\n print('undefined')\r\nelif cw_res == final:\r\n print('cw')\r\nelse:\r\n print('ccw')\r\n\r\n", "from collections import deque\n\ndef main():\n START, END = input().split()\n N = int(input())\n\n cw = deque('v<^>')\n while True:\n if cw[0] == START:\n break\n else:\n cw.rotate(1)\n ccw = deque(cw)\n\n n = N % 4\n for i in range(n):\n cw.rotate(-1)\n ccw.rotate(1)\n\n if cw[0] == ccw[0]:\n print('undefined')\n elif cw[0] == END:\n print('cw')\n else:\n print('ccw')\n\nmain()\n", "from sys import stdin, stdout\r\nfrom functools import reduce\r\n\r\ndef main():\r\n dic={\r\n '^': 0,\r\n '>': 1,\r\n 'v': 2,\r\n '<': 3\r\n }\r\n arr=[x for x in stdin.readline().strip().split(\" \")]\r\n n=int(stdin.readline().strip())%4\r\n r=dic[arr[0]]+n\r\n l=dic[arr[0]]+(4-n)\r\n r=r%4\r\n l=l%4\r\n if l==r: return 'undefined'\r\n return 'cw' if dic[arr[1]] == r else 'ccw'\r\n\r\nstdout.write(str(main()))\r\n", "s = input()\nn = int(input()) % 4\n\nif n == 0 or n == 2:\n print ('undefined')\nelif n == 1:\n if s in ('^ >', '> v', 'v <', '< ^'):\n print ('cw')\n else:\n print ('ccw')\nelse:\n if s in ('^ >', '> v', 'v <', '< ^'):\n print ('ccw')\n else:\n print ('cw')\n", "li=input().split()\r\nn=int(input())\r\nj=n%4\r\nflag=0\r\nanti_clockwise=\"^<v>^<v>\"\r\nclockwise=\"^>v<^>v<\"\r\ndict1={\r\n\t\"^\":\"v\",\r\n\t\"v\":\"^\",\r\n\t\">\":\"<\",\r\n\t\"<\":\">\"\r\n}\r\nif j==0 or li[-1] == dict1[li[0]]:\r\n\tprint(\"undefined\")\r\nelse:\r\n\tk=anti_clockwise.index(li[0])\r\n\tif anti_clockwise[k+j]==li[-1]:\r\n\t\tprint(\"ccw\")\r\n\telse:\r\n\t\tprint(\"cw\")", "poss = {\r\n '^': 0,\r\n '>': 1,\r\n 'v': 2,\r\n '<': 3\r\n}\r\n\r\nsp, ep = input().split()\r\nss = int(input())\r\n\r\nsp = poss[sp]\r\nep = poss[ep]\r\n\r\nss = (ss) % 4\r\n\r\nif ss % 2 == 0:\r\n print('undefined')\r\nelif (sp + ss) % 4 == ep:\r\n print('cw')\r\nelse:\r\n print('ccw')\r\n", "cw = ['^', '>', 'v', '<', '^', '>', 'v', '<']\r\nccw = ['^', '<', 'v', '>', '^', '<', 'v', '>']\r\nstring = input().split()\r\nnumber = int(input()) % 4\r\n\r\nif cw[cw.index(string[0]) + number] == string[1] and ccw[ccw.index(string[0]) + number] == string[1]:\r\n print('undefined')\r\nelif cw[cw.index(string[0]) + number] == string[1]:\r\n print('cw')\r\nelse:\r\n print('ccw')", "st, end = map(str, input().split() )\r\n# print(st, end)\r\nn = int(input())\r\n#we know < opposite is >\r\n#and ^ opposite is v\r\nflag = True\r\nif st in ['>', '<']:\r\n flag = False\r\nelse:\r\n flag = True\r\n\r\nif flag == True and end not in ['<', '>']:\r\n print('undefined')\r\n exit()\r\n\r\nif flag == False and end in ['<', '>']:\r\n print('undefined')\r\n exit()\r\n\r\nclock = [st]\r\nantiClock = [st]\r\nfor i in range(3):\r\n if clock[-1] == 'v':\r\n clock.append('<')\r\n elif clock[-1] == '^':\r\n clock.append('>')\r\n elif clock[-1] == '<':\r\n clock.append('^')\r\n elif clock[-1] == '>':\r\n clock.append('v')\r\n\r\nfor i in range(3):\r\n if antiClock[-1] == 'v':\r\n antiClock.append('>')\r\n elif antiClock[-1] == '^':\r\n antiClock.append('<')\r\n elif antiClock[-1] == '<':\r\n antiClock.append('v')\r\n elif antiClock[-1] == '>':\r\n antiClock.append('^')\r\n\r\n# print(antiClock, clock)\r\n\r\nstate = n%4\r\nif clock[state] == end:\r\n print(\"cw\")\r\nelif antiClock[state] == end:\r\n print(\"ccw\")\r\n", "def main():\r\n\ta=['>','v','<','^','>','v','<','^']\r\n\ts=input().split()\r\n\tn=int(input())\r\n\tn%=4\r\n\ti=a.index(s[0])\r\n\tif s[1]==a[i+n] and s[1]==a[i-n]:\r\n\t\tprint('undefined')\r\n\telif s[1]==a[i+n]:\r\n\t\tprint('cw')\r\n\telif s[1]==a[i-n]:\r\n\t\tprint('ccw')\r\n\telse:\r\n\t\tprint('undefined')\r\nif __name__=='__main__':\r\n\tmain()", "a, b = input().split()\r\nn = int(input())\r\n\r\nmp = {'v': 0, '<': 1, '^': 2, '>': 3}\r\n\r\nu = (mp[b] - mp[a] + 4) % 4\r\n\r\nif(u == 0 or u == 2):\r\n print('undefined')\r\nelif(u == n % 4):\r\n print('cw')\r\nelse:\r\n print('ccw')\r\n", "def solution(n,s,e):\r\n dmap= {\"^\":0 ,\">\":1,\"v\":2,\"<\":3}\r\n s = dmap[s]\r\n e = dmap[e]\r\n if n%2 ==0 :\r\n return \"undefined\" \r\n if (s+n)%4 == e :\r\n return \"cw\" \r\n else:\r\n return \"ccw\" \r\n \r\nif __name__ == \"__main__\":\r\n s,e = input().split()\r\n n = int(input())\r\n print(solution(n,s,e))", "s, e = tuple(input().split())\r\nn = int(input())\r\ns1, s2 = \"v<^>\", \"v>^<\"\r\nprint(\"cw\" if s1[(s1.find(s) + n) % 4] == e and s2[(s2.find(s) + n) % 4] != e else \"ccw\" if s2[(s2.find(s) + n) % 4] == e and s1[(s1.find(s) + n) % 4] != e else \"undefined\")\r\n", "inp=input().split()\r\nduration=int(input())%4\r\nstart=inp[0]\r\nend=inp[1]\r\n\r\nif start==\"^\":\r\n if duration==1:\r\n if end==\">\":\r\n print(\"cw\")\r\n else:\r\n print(\"ccw\")\r\n elif duration==3:\r\n if end==\">\":\r\n print(\"ccw\")\r\n else:\r\n print(\"cw\")\r\n else:\r\n print(\"undefined\")\r\n \r\nif start==\">\":\r\n if duration==1:\r\n if end==\"v\":\r\n print(\"cw\")\r\n else:\r\n print(\"ccw\")\r\n elif duration==3:\r\n if end==\"v\":\r\n print(\"ccw\")\r\n else:\r\n print(\"cw\")\r\n else:\r\n print(\"undefined\")\r\n\r\nif start==\"v\":\r\n if duration==1:\r\n if end==\"<\":\r\n print(\"cw\")\r\n else:\r\n print(\"ccw\")\r\n elif duration==3:\r\n if end==\"<\":\r\n print(\"ccw\")\r\n else:\r\n print(\"cw\")\r\n else:\r\n print(\"undefined\")\r\n\r\nif start==\"<\":\r\n if duration==1:\r\n if end==\"^\":\r\n print(\"cw\")\r\n else:\r\n print(\"ccw\")\r\n elif duration==3:\r\n if end==\"^\":\r\n print(\"ccw\")\r\n else:\r\n print(\"cw\")\r\n else:\r\n print(\"undefined\")\r\n\r\n", "a=[118,60,94,62]\r\nb,c=list(map(lambda a:ord(a),input().split()))\r\nd=int(input())\r\n# print(b,c)\r\nif d%2==0: print(\"undefined\" )\r\nelif a[(a.index(b)+d)%4]==c: print(\"cw\")\r\nelse:\r\n if a.index(b)-d<=0:\r\n e=0 if -(a.index(b)-d)%4==0 else ((((-(a.index(b)-d))//4)+1)*4)+(a.index(b)-d)\r\n else:\r\n e=a.index(b)-d\r\n if a[e]==c: print(\"ccw\")\r\n # else: print(\"Undefined\")\r\n", "start, end = input().split(' ')\nn = int(input())\n\nxn = n\nyn = n\n\nif start == '^':\n xn += 0\nelif start == '>':\n xn += 1\nelif start == 'v':\n xn += 2\nelif start == '<':\n xn += 3\n\nif start == '^':\n yn += 0\nelif start == '<':\n yn += 1\nelif start == 'v':\n yn += 2\nelif start == '>':\n yn += 3\n\nstates_cw = \"^>v<\"\nstates_ccw = \"^<v>\"\n\nxn %= 4\nyn %= 4\n\nif states_cw[xn] == end and states_ccw[yn] == end:\n print(\"undefined\")\nelif states_cw[xn] == end:\n print(\"cw\")\nelif states_ccw[yn] == end:\n print(\"ccw\")\nelse:\n print(\"undefined\")\n\n", "s1, s2 = input().split()\r\nn = int(input()) % 4\r\ni1 = \"^>v<\".index(s1)\r\ni2 = \"^>v<\".index(s2)\r\ndelta = (i2-i1)%4\r\nif n & 1 == 0:\r\n print(\"undefined\")\r\nelif delta == n: \r\n print(\"cw\")\r\nelse: \r\n print(\"ccw\")\r\n\r\n ", "d={\"v\":[\"v\",\"<\",\"^\",\">\"],\"<\":[\"<\",\"^\",\">\",\"v\"],\"^\":[\"^\",\">\",\"v\",\"<\"],\">\":[\">\",\"v\",\"<\",\"^\"]}\r\n\r\nstart,end=map(str,input().split())\r\nn=int(input())\r\n\r\nclock=d[start]\r\ntemp=clock[1:]\r\ntemp=temp[::-1]\r\nanti=[clock[0]]+temp\r\n# print(clock,anti)\r\n\r\nmod=n%4\r\n\r\nif(end==clock[mod] and end==anti[mod]):\r\n print(\"undefined\")\r\nelif(end==clock[mod]):\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")", "cw = {\"v\": 0, \"<\": 1, \"^\": 2, \">\": 3}\r\nccw = {\"v\": 0, \">\": 1, \"^\": 2, \"<\": 3}\r\ns, e = input().split()\r\nn = int(input())\r\nn = n % 4\r\nif n == 0:\r\n print(\"undefined\")\r\nelse:\r\n if (cw[s] + n) % 4 == cw[e] and (ccw[s] + n) % 4 != ccw[e]:\r\n print(\"cw\")\r\n elif (cw[s] + n) % 4 != cw[e] and (ccw[s] + n) % 4 == ccw[e]:\r\n print(\"ccw\")\r\n else:\r\n print(\"undefined\")", "S = list(input().split())\r\n\r\norder = ['^', '>', 'v', '<']\r\nN = int(input()) % 4\r\n\r\nif N == 2 or N == 0:\r\n print(\"undefined\")\r\n\r\nelif N == 1:\r\n if order.index(S[1]) - order.index(S[0]) == 1 or order.index(S[1]) - order.index(S[0]) == -3:\r\n print(\"cw\")\r\n else:\r\n print(\"ccw\")\r\nelif N == 3:\r\n if order.index(S[1]) - order.index(S[0]) == 3 or order.index(S[1]) - order.index(S[0]) == -1:\r\n print(\"cw\")\r\n else:\r\n print(\"ccw\")\r\n \r\n ", "def NextR (c):\n\tif c == 'v': return '<';\n\tif c == '<': return '^';\n\tif c == '^': return '>';\n\tif c == '>': return 'v';\n\ndef NextL (c):\n\tif c == 'v': return '>';\n\tif c == '>': return '^';\n\tif c == '^': return '<';\n\tif c == '<': return 'v';\n\nc1, c2 = input().split();\nn = int (input());\n\nnn = n % 4; cr = cl = c1;\n\nfor i in range (nn):\n\tcl = NextR(cl);\n\nfor i in range (nn):\n\tcr = NextL(cr);\n\nif cl == cr:\n\tprint(\"undefined\");\n\traise SystemExit;\n\nif cl != c2 and cr != c2:\n\tprint(\"undefined\");\n\traise SystemExit;\n\nif cl == c2:\n\tprint(\"cw\");\nelse:\n\tprint(\"ccw\");\n", "set = ('v','<','^', '>')\nstart, stop = input().strip().split(\" \")\ntime = int(input())\nrotations = time%4\nstartPos = set.index(start)\nendPos = set.index(stop)\nres = (startPos - endPos)%4\nif res == 3:\n if rotations == 1:\n print(\"cw\")\n else:\n print(\"ccw\")\nelif res == 1:\n if rotations == 3:\n print(\"cw\")\n else:\n print(\"ccw\")\nelse:\n print(\"undefined\")\n", "def main():\r\n print(f\"{solve(*parse())}\")\r\n\r\ndef parse():\r\n start, end = input().split()\r\n spin = int(input())\r\n\r\n return start, end, spin\r\n\r\ndef solve(start, end, spin):\r\n start = int(signtonumber(start))\r\n end = int(signtonumber(end))\r\n dif_CW = end - start\r\n while dif_CW < 0:\r\n dif_CW += 4\r\n while dif_CW > 3:\r\n dif_CW -= 4\r\n dif_CCW= start - end\r\n while dif_CCW < 0:\r\n dif_CCW += 4\r\n while dif_CCW > 3:\r\n dif_CCW -= 4\r\n \r\n\r\n if dif_CCW == dif_CW:\r\n return \"undefined\"\r\n elif spin % 4 == dif_CW:\r\n return \"cw\"\r\n elif spin % 4 == dif_CCW:\r\n return \"ccw\"\r\n\r\n\r\n\r\n\r\ndef signtonumber(char):\r\n if char == \"v\":\r\n num = 1\r\n elif char == \"<\":\r\n num = 2\r\n elif char == \"^\":\r\n num = 3\r\n elif char == \">\":\r\n num = 4\r\n return num\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "#!/usr/bin/python3\n\nv1, v2 = input().split()\nn = int(input())\n\no1 = ord(v1)\no2 = ord(v2)\n\nif n % 4 == 0:\n print(\"undefined\")\nelif n % 4 == 1:\n if (o1 == 118 and o2 == 60) or (o1 == 60 and o2 == 94) or (o1 == 94 and o2 == 62) or (o1 == 62 and o2 == 118):\n print(\"cw\")\n else:\n print(\"ccw\")\nelif n % 4 == 2:\n print(\"undefined\")\nelse:\n if (o1 == 118 and o2 == 62) or (o1 == 60 and o2 == 118) or (o1 == 94 and o2 == 60) or (o1 == 62 and o2 == 94):\n print(\"cw\")\n else:\n print(\"ccw\")\n", "# cook your dish here\r\n\r\ns=['v','<','^','>']\r\n\r\n\r\nstart,end=input().split()\r\nn=int(input())\r\nfor i in range(len(s)):\r\n if s[i]==start:\r\n start=i\r\n if s[i]==end:\r\n end=i\r\nif s[(start+n)%4]==s[(start-n)%4] and s[(start+n)%4]==s[end]:\r\n print('undefined')\r\nelif s[(start+n)%4]==s[end]:\r\n print('cw')\r\nelif s[(start-n)%4]==s[end]:\r\n print('ccw')\r\nelse:\r\n print('undefined')\r\n\r\n ", "sign = input().split()\r\ntime = int(input())\r\ntypes = 'v<^>'\r\n\r\ni = [i for i, x in enumerate(types) if sign[0] == x][0]\r\n\r\nturn1 = types[(i+time) % 4]\r\nturn2 = types[(i-time) % 4]\r\n\r\nif turn1 == sign[1] != turn2:\r\n print('cw')\r\nelif turn2 == sign[1] != turn1:\r\n print('ccw')\r\nelse:\r\n print('undefined')\r\n", "s,t = input().split()\r\nn = int(input())\r\na = '^>v<'\r\nif n%2==0:\r\n print('undefined')\r\nelse:\r\n i = a.find(s)\r\n d = a.find(t)\r\n if a[(i+n)%4]==t:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n\nimport sys\n\n\ndef main():\n iterator = iter(sys.stdin.read().split())\n a = next(iterator)\n b = next(iterator)\n n = int(next(iterator))\n n %= 4\n s = 'v<^>'\n p1 = s.find(a)\n p2 = s.find(b)\n if (p2 - p1) % 4 == n and (p1 - p2) % 4 == n:\n print('undefined')\n elif (p2 - p1) % 4 == n:\n print('cw')\n elif (p1 - p2) % 4 == n:\n print('ccw')\n else:\n print('undefined')\n\n\nif __name__ == '__main__':\n main()\n", "dirs = input()\r\nn = int(input())\r\nif dirs in [\"^ v\", \"< >\", \"> <\", \"v ^\", \"v v\", \"> >\", \"< <\", \"^ ^\"]:\r\n print(\"undefined\")\r\nelif dirs in [\"^ >\", \"< ^\", \"v <\", \"> v\"]:\r\n if n % 4 == 1:\r\n print(\"cw\")\r\n else:\r\n print(\"ccw\")\r\nelif dirs in [\"^ <\", \"> ^\", \"v >\", \"< v\"]:\r\n if n % 4 == 1:\r\n print(\"ccw\")\r\n else:\r\n print(\"cw\")\r\n", "posiciones = input()\r\ntiempo = int(input())\r\nposiciones = posiciones.split(' ')\r\ninicio = posiciones[0]\r\nfinal = posiciones[1]\r\n\r\ndict = ['^','>','v','<']\r\n\r\n\r\nif tiempo >4:\r\n tiempo =tiempo%4\r\n\r\n#contando ccw\r\ncontador_izq = dict.index(inicio) \r\nfor n in range(tiempo):\r\n if contador_izq-1 <0:\r\n contador_izq= 3\r\n else:\r\n contador_izq -=1\r\n\r\n#contando cw\r\ncontador_der = dict.index(inicio) \r\nfor n in range(tiempo):\r\n if contador_der+1 >3:\r\n contador_der= 0\r\n else:\r\n contador_der +=1\r\n\r\n\r\n\r\nif (posiciones[1] == dict[contador_izq]) and (posiciones[1] != dict[contador_der]):\r\n print('ccw')\r\nelif (posiciones[1] != dict[contador_izq]) and (posiciones[1] == dict[contador_der]):\r\n print('cw')\r\nelse: \r\n print('undefined')", "# Codeforces Round #426 (Div. 2)\r\n# 834A\r\n\r\nclass Node: \r\n def __init__(self,data): \r\n self.data = data; \r\n self.next = None; \r\n self.prev = None;\r\n \r\nclass CreateList: \r\n # initialize head and tail to null \r\n def __init__(self): \r\n self.head = Node(None); \r\n self.tail = Node(None); \r\n self.head.next = self.tail;\r\n self.head.prev = self.tail \r\n self.tail.next = self.head; \r\n self.tail.prev = self.head\r\n \r\n #Add node \r\n def add(self,data): \r\n newNode = Node(data); \r\n if self.head.data is None: \r\n #if list empty, set newnode to head and tail \r\n self.head = newNode; \r\n self.tail = newNode; \r\n newNode.next = self.head;\r\n newNode.prev = self.tail\r\n else: \r\n self.tail.next = newNode;\r\n newNode.prev = self.tail\r\n self.tail = newNode; \r\n self.tail.next = self.head; \r\n self.head.prev = self.tail\r\n \r\n \r\n \r\ncl = CreateList(); \r\ncl.add('^'); \r\ncl.add('>'); \r\ncl.add('v'); \r\ncl.add('<');\r\n\r\nin1 = input().split()\r\npStart = in1[0]\r\npEnd = in1[1]\r\nn = int(input())\r\nif n > 4:\r\n n = n%4\r\n\r\ncur = cl.head\r\nfor i in range(4):\r\n if cur.data == pStart:\r\n cur = cur\r\n break\r\n else:\r\n cur = cur.next\r\n \r\nstart = cur\r\n\r\ncw = False\r\nccw = False\r\n\r\nfor i in range(n):\r\n cur = cur.next\r\nif cur.data == pEnd:\r\n cw = True\r\n \r\ncur = start\r\n\r\nfor i in range(n):\r\n cur = cur.prev\r\nif cur.data == pEnd:\r\n ccw = True\r\n \r\nif cw and not ccw:\r\n print(\"cw\")\r\nelif ccw and not cw:\r\n print(\"ccw\")\r\nelse:\r\n print(\"undefined\")", "n,t=map(str,input().split())\r\ni=int(input())\r\nif i<0:i=4-abs(i)%4\r\nelse:i%=4\r\nif n==\"^\":a=1\r\nelif n==\">\":a=2\r\nelif n==\"v\":a=3\r\nelif n==\"<\":a=4\r\nif t==\"^\":b=1\r\nelif t==\">\":b=2\r\nelif t==\"v\":b=3\r\nelif t==\"<\":b=4\r\nc=b-a\r\nif c<0:c=4-abs(c)%4\r\nelse:c%=4\r\nif (i==0) or (i==2):print(\"undefined\")\r\nelif c==i:print(\"cw\")\r\nelse:print(\"ccw\")", "#n = int(input())\n#n, m = map(int, input().split())\ns = input()\n#c = list(map(int, input().split()))\nn = int(input())\na = ['v', '<', '^', '>']\nk = n % 4\nif k % 2 == 0:\n print('undefined')\nelif (a.index(s[2]) - a.index(s[0]) ) % 4 == k:\n print('cw')\nelse:\n print('ccw')", "class CodeforcesTask834ASolution:\n def __init__(self):\n self.result = ''\n self.positions = ''\n self.time = 0\n\n def read_input(self):\n self.positions = input()\n self.time = int(input())\n\n def process_task(self):\n shift = self.time % 4\n if not shift:\n self.result = \"undefined\"\n else:\n spinner = [\"^\", \">\", \"v\", \"<\"]\n start_pos = spinner.index(self.positions[0])\n stop_pos = spinner.index(self.positions[2])\n cw_result = (start_pos + shift) % 4\n ccw_result = (start_pos - shift) % 4\n if cw_result == stop_pos and ccw_result == stop_pos:\n self.result = \"undefined\"\n elif cw_result == stop_pos:\n self.result = \"cw\"\n else:\n self.result = \"ccw\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask834ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "str_ = input()\ndgs = int(input())\nstr_ = str_[0]+str_[2]\nlst = []\nfor x in str_:\n if x == '^':\n lst.append(0)\n elif x == '>':\n lst.append(1)\n elif x == 'v':\n lst.append(2)\n elif x == '<':\n lst.append(3)\nsum = (lst[1]-lst[0]+4)%4\nif sum == 2 or sum == 0:\n print(\"undefined\")\nelif sum == dgs%4:\n print(\"cw\")\nelif sum == 4-dgs%4:\n print(\"ccw\")\n \t \t\t \t\t\t \t \t\t\t \t \t \t \t", "a,b=map(str,input().split())\r\nn=int(input())\r\nl=[118,60,94,62]\r\nfor x in range(4):\r\n\tif l[x]==ord(a):\r\n\t\tc1=x\r\n\tif l[x]==ord(b):\r\n\t\tc2=x\r\nif (c2-c1)%4==0 or (c2-c1)%4==2:\r\n\tp='undefined'\r\nelif ((c2-c1)%4==1 and n%4==1) or ((c2-c1)%4==3 and n%4==3):\r\n\tp='cw'\r\nelse:\r\n\tp='ccw'\r\nprint(p)\r\n", "# Problem prepared for TheCodingConversations google meet session \r\n# to be held on 2020-09-06. If you are a participant in this session \r\n# kindly refrain from reading the following solution for your own \r\n# benefit.\r\n#\r\n# author - atifcppprogrammer\r\n\r\n# Creating dictionary mapping out possible rotations given \r\n# intial position of spinner.\r\nrotations = {\r\n 'ccw':{\r\n '<':'<v>^', 'v':'v>^<', '>':'>^<v', '^':'^<v>'\r\n },\r\n 'cw':{\r\n '<':'<^>v', '^':'^>v<', '>':'>v<^', 'v':'v<^>'\r\n }\r\n}\r\n\r\n# Collecting problem data from codeforces.\r\nstart, end = list(input().split(' ')); \r\nseconds = int(input()) \r\n\r\n# Moving in round-robin manner in both clock-wise and \r\n# counter-clockwise directions to see if spinner stops\r\n# at given ending position.\r\nisCCW = rotations['ccw'][start][ seconds % 4 ] == end\r\nisCW = rotations['cw'][start][ seconds % 4 ] == end\r\n\r\n# Printing 'ccw or 'cw' if one of the two rotations is\r\n# possible, printing 'undefined' if both or neither is\r\n# possible.\r\nif isCCW and not isCW:\r\n print('ccw')\r\nelif isCW and not isCCW:\r\n print('cw')\r\nelse: print('undefined')\r\n", "from sys import stdin, stdout\r\narr = ['v','<','^','>']\r\nstring = [c for c in stdin.readline().strip().split()]\r\ns = string[0]\r\ne = string[1]\r\nn = int(stdin.readline().strip())\r\npos = 0\r\nfor i in range(4):\r\n if s == arr[i]:\r\n pos = i\r\n break\r\nclock = (pos + n) % 4\r\nanti = (pos - n) % 4\r\nif e == arr[clock] and e != arr[anti]:\r\n stdout.write(\"cw\")\r\nelif e == arr[anti] and e != arr[clock]:\r\n stdout.write(\"ccw\")\r\nelse:\r\n stdout.write(\"undefined\")\r\n", "#!/bin/python3\r\n\r\nimport sys\r\n\r\ny=input()\r\nx = int(input().strip())\r\n #v , < , ^, > \r\narr=[ 'v' , '<' , '^', '>' ]\r\nfor i in range(4):\r\n if arr[i]==y[0]:\r\n t=i\r\n \r\ncw=(t+x)%4\r\nccw=(t-x)%4\r\n#print(y[2])\r\nif(arr[cw]==arr[ccw]):\r\n print(\"undefined\")\r\n \r\nelif(arr[cw]!=y[2] and arr[ccw]!=y[2]):\r\n print(\"undefined\")\r\nelif(arr[cw]==y[2]):\r\n print(\"cw\")\r\n \r\nelif(arr[ccw]==y[2]):\r\n print(\"ccw\")\r\n ", "dict = {'v': 0, '<': 1, '^': 2, '>': 3}\r\n\r\ni, j = input().split()\r\nnum = int(input())\r\n\r\nl = dict[i]\r\nr = dict[j]\r\n\r\ns = r-l % 4\r\nnum = num % 4\r\n\r\nsf = 4-s if s>0 else -s\r\ns = 4+s if s<0 else s\r\n\r\nif s == 0 or abs(s) == 2:\r\n print(\"undefined\")\r\nelif num == sf:\r\n print(\"ccw\")\r\nelif num == s:\r\n print(\"cw\")", "a,b=input().split()\r\nccw=['^',\"<\",\"v\",\">\"]\r\ncw=['^','>','v','<']\r\nk=int(input())\r\ncount=0\r\nif(k%4==0):\r\n count=0\r\nelse:\r\n ind=cw.index(a)\r\n s=k%4\r\n num=s+ind\r\n if(num >3):\r\n num=num%4\r\n if(cw[num]==b):\r\n count += 1\r\n ind=ccw.index(a)\r\n s=k%4\r\n num=s+ind\r\n if(num>3):\r\n num=num%4\r\n if(ccw[num]==b):\r\n count += 2\r\nif(count==0 or count == 3):\r\n print(\"undefined\")\r\nelif(count == 1):\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")\r\n", "lcw = [\"v\",\"<\",\"^\",\">\"]\r\nlccw = lcw[::-1]\r\n\r\na,b = input().split()\r\nn = int(input())\r\nflag = 0\r\n\r\nif lcw[(lcw.index(a)+n)%4]==lccw[((lccw.index(a)+n)%4)]:\r\n print(\"undefined\")\r\nelif lcw[(lcw.index(a)+n)%4]==b:\r\n print(\"cw\")\r\nelif lccw[((lccw.index(a)+n)%4)]==b:\r\n print(\"ccw\")", "#Codeforces Round 426\r\n#problem A\r\n\r\ndef main():\r\n\r\n\tcw_dir = '^>v<'\r\n\tccw_dir = '^<v>'\r\n\r\n\r\n\tinput1 = input()\r\n\tinput2 = input()\r\n\r\n\tstartPos = input1[0]\r\n\tendPos = input1[2]\r\n\tsecs = int(input2)\r\n\r\n\tcw = False\r\n\tccw = False\r\n\r\n\toutput = 'undefined'\r\n\r\n\tif ((cw_dir.find(startPos) + secs) % 4) == (cw_dir.find(endPos)):\r\n\t\tcw = True\r\n\r\n\t#print(cw_dir.find(startPos))\r\n\r\n\tif ((ccw_dir.find(startPos) + secs) % 4) == (ccw_dir.find(endPos)):\r\n\r\n\t\tccw = True\r\n\r\n\tif cw != ccw:\r\n\t\tif cw: output = 'cw'\r\n\t\telse: output = 'ccw'\r\n\r\n\tprint(output)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "\r\n# Creating dictionary mapping out possible rotations given \r\n# intial position of spinner.\r\nrotations = {\r\n 'ccw':{\r\n '<':'<v>^', 'v':'v>^<', '>':'>^<v', '^':'^<v>'\r\n },\r\n 'cw':{\r\n '<':'<^>v', '^':'^>v<', '>':'>v<^', 'v':'v<^>'\r\n }\r\n}\r\n\r\n# Collecting problem data from codeforces.\r\nstart, end = list(input().split(' ')); \r\nseconds = int(input())\r\n\r\n# Ascertaining if given data points to rotation being\r\n# clockwise, counter-clockwise or undefined.\r\nisCCW = rotations['ccw'][start][ seconds % 4 ] == end\r\nisCW = rotations['cw'][start][ seconds % 4 ] == end\r\n\r\nif isCCW and not isCW:\r\n print('ccw')\r\nelif isCW and not isCCW:\r\n print('cw')\r\nelse:\r\n print('undefined')\r\n", "d, s, n = '^>v<', input(), int(input())\r\nif n % 2 == 0:\r\n print('undefined')\r\nelif (d.find(s[0]) + n) % 4 == d.find(s[2]):\r\n print('cw')\r\nelse:\r\n print('ccw')\r\n", "\r\nstart,end = map(str,input().split()) \r\nrotating_time = int(input())\r\n\r\narray = [\"<\",\"^\",\">\",\"v\"]\r\n\r\nif(rotating_time == 1 ):\r\n start_ix = array.index(start)\r\n end_idx = start_ix + 1 \r\n if(end_idx >3):\r\n end_idx =0\r\n if(end == array[end_idx]):\r\n print(\"cw\")\r\n else:\r\n end_idx = start_ix - 1 \r\n if(start_ix == -1):\r\n start_ix = 3 \r\n if(end == array[end_idx]):\r\n print(\"ccw\")\r\n else:\r\n print(\"undefined\") \r\nelse:\r\n rotating_time -= 2 \r\n time_left = rotating_time%4 \r\n start_ix = array.index(start)\r\n flag = 0\r\n \r\n while True:\r\n end_idx = start_ix + time_left\r\n if(end_idx >3 ):\r\n end_idx = end_idx - 4 \r\n if(end == array[end_idx]):\r\n print(\"ccw\")\r\n flag = -1\r\n break\r\n while flag==0 :\r\n end_idx = start_ix - time_left\r\n if(end_idx < 0):\r\n end_idx = 4 + end_idx\r\n if(end == array[end_idx]):\r\n print(\"cw\")\r\n flag=1\r\n else:\r\n print(\"undefined\")\r\n flag=1\r\n break\r\n \r\n", "begin, end = input().split()\r\nbegin = str(begin)\r\nend = str(end)\r\n\r\nn = int(input())\r\n\r\n\r\narrayPosicoes = [\"^\", \">\", \"v\", \"<\"]\r\nfinalPosition = n % 4\r\n\r\nverifyClockWise = False\r\nverifyCounterClock = False\r\n\r\nparameter = arrayPosicoes.index(begin)\r\n\r\n#clockWise\r\nwhile finalPosition != 0:\r\n\tif parameter != 3:\r\n\t\tparameter += 1\r\n\telse:\r\n\t\tparameter = 0\r\n\tfinalPosition -= 1\r\n\r\n\r\nif arrayPosicoes[parameter] == end:\r\n\tverifyClockWise = True\r\n\r\n\r\nfinalPosition2 = n % 4\r\nparameter2 = arrayPosicoes.index(begin)\r\nwhile finalPosition2 != 0:\r\n\tif parameter2 != 0:\r\n\t\tparameter2 -= 1\r\n\telse:\r\n\t\tparameter2 = 3\r\n\tfinalPosition2 -= 1\r\n\r\nif arrayPosicoes[parameter2] == end:\r\n\tverifyCounterClock = True\r\n\r\n\r\n\r\nif verifyClockWise == True and verifyCounterClock == False:\r\n\tprint(\"cw\")\r\nelif verifyClockWise == False and verifyCounterClock == True:\r\n\tprint(\"ccw\")\r\nelse:\r\n\tprint(\"undefined\")", "def solve(a, b):\n a = [x for x in a.split()]\n m = dict()\n m['^'] = 0\n m['>'] = 1\n m['v'] = 2\n m['<'] = 3\n x = (m[a[0]] - m[a[1]]) % 4\n if x == 0 or x == 2:\n print(\"undefined\")\n elif x == b % 4:\n print(\"ccw\")\n else:\n print(\"cw\")\n\n\nsolve(input(), int(input()))\n\t \t\t\t\t\t \t \t\t\t\t\t\t \t\t\t \t \t\t\t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip().decode().split())\r\nv = list(\"v<^>\")\r\nt = [v.index(i) for i in s]\r\nn = int(input())\r\nu = 0\r\nif t[0] % 4 == (t[1] - n) % 4:\r\n u ^= 1\r\nif t[0] % 4 == (t[1] + n) % 4:\r\n u ^= 2\r\nans = [\"?\", \"cw\", \"ccw\", \"undefined\"][u]\r\nprint(ans)", "cw = \"<^>v\"\nccw = \"<v>^\"\n\nstart, end = input().split()\ntime = int(input())\n\nlast_turns = time % 4\ncw_end_pos = (cw.index(start) + last_turns) % 4\nccw_end_pos = (ccw.index(start) + last_turns) % 4\n\nif cw[cw_end_pos] == ccw[ccw_end_pos]:\n print(\"undefined\")\nelif cw[cw_end_pos] == end:\n print(\"cw\")\nelse:\n print(\"ccw\")\n\n", "scw = ['0', 'v', '<', '^', '>']\r\nsccw = ['0', 'v', '>', '^', '<']\r\nc1, c2 = input().split()\r\nn = int(input())\r\nn = n % 4\r\nn1, n2 = scw.index(c1), sccw.index(c1)\r\nif 4 - n1 >= n:\r\n a1 = scw[n1+n]\r\nelse:\r\n a1 = scw[(n1+n)%4]\r\nif 4 - n2 >= n:\r\n a2 = sccw[n2+n]\r\nelse:\r\n a2 = sccw[(n2+n)%4]\r\nif a1 == c2 and a2 == c2:\r\n print(\"undefined\")\r\nelif a1 == c2 and a2 != c2:\r\n print('cw')\r\nelse:\r\n print('ccw')\r\n", "pos = {'>': 0, 'v': 1, '<': 2, '^': 3}\r\n\r\ns, e = input().split(' ')\r\nspins = int(input())\r\n\r\nx = (pos[e] - pos[s] - spins) % 4\r\n\r\nif spins % 2 == 0:\r\n ans = 'undefined'\r\nelif (pos[e] - pos[s]) % 4 == spins % 4:\r\n ans = 'cw'\r\nelif (pos[s] - pos[e]) % 4 == spins % 4:\r\n ans = 'ccw'\r\nprint(ans)", "a = ['v', '<', '^', '>']\n\nstart, end = input().split(' ')\n\nstart_index = a.index(start)\nend_index = a.index(end)\n\nif start_index > end_index:\n\tc_dist = end_index + 4 - start_index\n\tac_dist = start_index - end_index\nelse:\n\tc_dist = end_index - start_index\n\tac_dist = start_index + 4 - end_index\n\nsec = int(input())\n\nif (c_dist == ac_dist) or (start_index == end_index):\n\tprint('undefined')\nelse:\n\tif (sec - c_dist) % 4 == 0:\n\t\tprint('cw')\n\telse:\n\t\tprint('ccw')\n\t \t\t \t \t\t\t \t\t \t\t\t\t\t", "first, last = input().split()\r\nn = int(input())\r\ncw = ['^', '>', 'v', '<', '^', '>', 'v', '<']\r\nccw = ['^', '<', 'v', '>', '^', '<', 'v', '>']\r\ntmp1 = ''\r\ntmp2 = ''\r\nflag_cw = False\r\nflag_ccw = False\r\n\r\nmovement = n % 4\r\ntmp1 = cw[cw.index(first) + movement]\r\n\r\nif tmp1 == last:\r\n flag_cw = True\r\n\r\ntmp2 = ccw[ccw.index(first) + movement]\r\n\r\nif tmp2 == last:\r\n flag_ccw = True\r\n\r\nif flag_cw == flag_ccw == True:\r\n print('undefined')\r\nelif flag_cw == True:\r\n print('cw')\r\nelse:\r\n print('ccw')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nd = {'^':1, '>':2, 'v':3,'<':4}\r\ns = input()[:-1].split()\r\nn = int(input())\r\n\r\nif n%2 == 0:\r\n print(\"undefined\")\r\nelif n%4 == 1:\r\n if d[s[0]] - d[s[1]] == -1 or d[s[0]] - d[s[1]] == 3:\r\n print('cw')\r\n else:\r\n print('ccw')\r\nelse:\r\n if d[s[0]] - d[s[1]] == -1 or d[s[0]] - d[s[1]] == 3:\r\n print('ccw')\r\n else:\r\n print('cw')", "s, f = map(str, input().split())\r\nn = int(input())\r\ncw, ccw = ['^', '>', 'v', '<'], ['^', '<', 'v', '>']\r\ncwp, ccwp = cw[(cw.index(s) + n) % 4], ccw[(ccw.index(s) + n) % 4]\r\nprint(\"undefined\" if cwp == ccwp or cwp != f and ccwp != f else (\"cw\" if cwp == f else \"ccw\"))", "daf1 = ['^', '>', 'v', '<']\r\n\r\na, b = map(str, input().split())\r\nn = int(input())\r\nn = n%4\r\n\r\nif n%2 == 0:\r\n print('undefined')\r\nelse:\r\n pos1 = daf1.index(a)\r\n posf = (pos1 + n)%4\r\n fin = daf1[posf]\r\n if fin == b:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n \r\n", "from itertools import cycle\r\n\r\nbegin, end = input().split()\r\nn = int(input())%4\r\nanswer = \"undefined\"\r\nif n != 0:\r\n clockwise = cycle(\"^>v<\")\r\n counter_clockwise = cycle(\"^<v>\")\r\n current_cw = next(clockwise)\r\n current_ccw = next(counter_clockwise)\r\n while current_cw != begin:\r\n current_cw = next(clockwise)\r\n while current_ccw != begin:\r\n current_ccw = next(counter_clockwise)\r\n for i in range(n):\r\n current_cw = next(clockwise)\r\n current_ccw = next(counter_clockwise)\r\n if current_cw != current_ccw == end:\r\n answer = \"ccw\"\r\n elif end == current_cw != current_ccw:\r\n answer = \"cw\"\r\nprint(answer)\r\n", "s, e = input().split()\r\ncw, ccw = ['^', '>', 'v', '<'], ['^', '<', 'v', '>']\r\nn, a, b = int(input()), False, False\r\nif cw[(n + cw.index(s)) % 4] == e:\r\n a = True\r\nif ccw[(n + ccw.index(s)) % 4] == e:\r\n b = True\r\nprint(\"undefined\" if a and b else(\"cw\" if a and not b else \"ccw\"))", "x = 'v<^>'\r\na,b = input().split()\r\nn = int(input())\r\n\r\na_x = x.find(a)\r\nb_x = x.find(b)\r\nif n%2==0:\r\n print('undefined')\r\nelse:\r\n \r\n if (a_x+n)%4==b_x:\r\n print('cw')\r\n else:\r\n print('ccw')", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\ns,f=input().split()\r\nn=int(input())\r\nl1=[\"^\",\">\",\"v\",\"<\",\"^\",\">\",\"v\",\"<\"]\r\nl2=[\"^\",\"<\",\"v\",\">\",\"^\",\"<\",\"v\",\">\"]\r\nif l1[l1.index(s)+n%4]==f and l2[l2.index(s)+n%4]==f:\r\n\tprint(\"undefined\")\r\nelif l1[l1.index(s)+n%4]==f:\r\n\tprint(\"cw\")\r\nelif l2[l2.index(s)+n%4]==f:\r\n\tprint(\"ccw\")\r\nelse:\r\n\tprint(\"undefined\")", "arr=list(input().strip().split())\r\nn=int(input())\r\nd={\"^\":0,\"<\":1,\"v\":2,\">\":3}\r\nif arr[0]==arr[1] or ((d[arr[0]]+n)%4==d[arr[1]] and (d[arr[1]]+n)%4==d[arr[0]]):\r\n print(\"undefined\")\r\nelif (d[arr[0]]+n)%4==d[arr[1]]:\r\n print(\"ccw\")\r\nelif (d[arr[1]]+n)%4==d[arr[0]]:\r\n print(\"cw\")\r\nelse:\r\n print(\"undefined\")\r\n", "def resi(poc, kraj, n):\r\n if poc == \"^\" and kraj == \">\":\r\n cw = 1\r\n ccw = 3\r\n elif poc == \"^\" and kraj == \"v\":\r\n cw = 2\r\n ccw = 2\r\n elif poc == \"^\" and kraj == \"<\":\r\n cw = 3\r\n ccw = 1\r\n elif poc == \"^\" and kraj == \"^\":\r\n cw = 0\r\n ccw = 0\r\n\r\n if poc == \">\" and kraj == \">\":\r\n cw = 0\r\n ccw = 0\r\n elif poc == \">\" and kraj == \"v\":\r\n cw = 1\r\n ccw = 3\r\n elif poc == \">\" and kraj == \"<\":\r\n cw = 2\r\n ccw = 2\r\n elif poc == \">\" and kraj == \"^\":\r\n cw = 3\r\n ccw = 1\r\n\r\n if poc == \"v\" and kraj == \">\":\r\n cw = 3\r\n ccw = 1\r\n elif poc == \"v\" and kraj == \"v\":\r\n cw = 0\r\n ccw = 0\r\n elif poc == \"v\" and kraj == \"<\":\r\n cw = 1\r\n ccw = 3\r\n elif poc == \"v\" and kraj == \"^\":\r\n cw = 2\r\n ccw = 2\r\n\r\n if poc == \"<\" and kraj == \">\":\r\n cw = 2\r\n ccw = 2\r\n elif poc == \"<\" and kraj == \"v\":\r\n cw = 3\r\n ccw = 1\r\n elif poc == \"<\" and kraj == \"<\":\r\n cw = 0\r\n ccw = 0\r\n elif poc == \"<\" and kraj == \"^\":\r\n cw = 1\r\n ccw = 3\r\n\r\n #print(cw,ccw)\r\n\r\n if n % 4 == cw and n % 4 == ccw:\r\n print('undefined')\r\n elif n % 4 == cw:\r\n print('cw')\r\n elif n % 4 == ccw:\r\n print('ccw')\r\n\r\ninputt = input()\r\npoc = inputt[0]\r\nkraj = inputt[2]\r\nn = int(input())\r\nresi(poc, kraj, n)\r\n", "#problem 834 A\r\nx,y=input().split()\r\ntemp1=0\r\ntemp2=0\r\nsize=int(input())\r\nlist_cw=[\"^\",\">\",\"v\",\"<\",\"^\",\">\",\"v\",\"<\"]\r\nlist_ccw=[\"^\",\"<\",\"v\",\">\",\"^\",\"<\",\"v\",\">\"]\r\nfor i in range(0,5):\r\n if x==list_cw[i] and y==list_cw[i+(size%4)]:\r\n temp1=1\r\n #print(\"checkpoint 1\")\r\n if x==list_ccw[i] and y==list_ccw[i+(size%4)]:\r\n temp2=2\r\n #print(\"checkpoint 2\")\r\n else:\r\n #print(\"checkpoint 3\")\r\n temp=0\r\nif temp1==1 and temp2==2:\r\n print(\"undefined\")\r\nelif temp1==1:\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")", "start, end = map(str, input().split())\r\nd = int(input())\r\n\r\nspinner = ['^','>','v','<']\r\n\r\ni = spinner.index(start)\r\n\r\nif d%2 == 0:\r\n print('undefined')\r\nelse:\r\n count = (i+d)%4\r\n if spinner[count]==end:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n", "s , f = map(ord, input().split(' '))\r\nn = int(input())\r\na = [118, 60, 94, 62]\r\nif not(n % 2):\r\n print('undefined')\r\nelse:\r\n n %= 4\r\n k = a.index(s)\r\n if a[k-n] == f:\r\n print('ccw')\r\n else:\r\n print('cw')\r\n", "a,b=map(str,input().split())\r\nn=int(input())\r\nc=[\"v\",\"<\",\"^\",\">\",\"v\",\"<\",\"^\",\">\"]\r\nd=[\"v\",\">\",\"^\",\"<\",\"v\",\">\",\"^\",\"<\"]\r\nif(n%4==1):\r\n for i in range(8):\r\n if(a==c[i]):\r\n if(b==c[i+1]):\r\n print(\"cw\")\r\n break\r\n else:\r\n for i in range(8):\r\n if(a==d[i]):\r\n if(b==d[i+1]):\r\n print(\"ccw\")\r\n break\r\n else:\r\n print(\"undefined\")\r\n break\r\n break\r\nelif(n%4==3):\r\n for i in range(8):\r\n if(a==c[i]):\r\n if(b==c[i+3]):\r\n print(\"cw\")\r\n break\r\n else:\r\n for i in range(8):\r\n if(a==d[i]):\r\n if(b==d[i+3]):\r\n print(\"ccw\")\r\n break\r\n else:\r\n print(\"undefined\")\r\n break\r\n break\r\nelse:\r\n print(\"undefined\")", "start_end = input().strip()\r\ntime = int(input().strip())\r\nstart = start_end.split()[0]\r\nend = start_end.split()[1]\r\n\r\nstart_dir = -1\r\nend_dir = -1\r\n\r\nif start == '<':\r\n start_dir = 0\r\nelif start == '^':\r\n start_dir = 1\r\nelif start == '>':\r\n start_dir = 2\r\nelif start == 'v':\r\n start_dir = 3\r\n\r\n\r\nif end == '<':\r\n end_dir = 0\r\nelif end == '^':\r\n end_dir = 1\r\nelif end == '>':\r\n end_dir = 2\r\nelif end == 'v':\r\n end_dir = 3\r\n\r\nturns = time\r\n\r\nccw =False\r\ncw = False\r\n\r\nif (start_dir == end_dir) or (start_dir % 2 == end_dir %2):\r\n print('undefined')\r\nelif (start_dir + turns) % 4 == end_dir:\r\n print('cw')\r\nelse:\r\n print('ccw')\r\n\r\n", "x,y=input().split()\nn=int(input())\nif(n%2==0):\n print('undefined')\nelse:\n k=ord(x)-ord(y)\n if(n%4==1):\n if(k==58 or k==-34 or k==32 or k==-56):\n print('cw')\n else:\n print('ccw')\n else:\n if(k==-58 or k==34 or k==-32 or k==56):\n print('cw')\n else:\n print('ccw')\n \n \n", "import sys\r\n\r\ndef f(cc):\r\n\tif ord(cc) == 118 : return 0\r\n\telif ord(cc) == 60 : return 1\r\n\telif ord(cc) == 94 : return 2\r\n\telif ord(cc) == 62 : return 3\r\n\r\nfor word in sys.stdin:\r\n\tword = list(word)\r\n\ta, b = word[0], word[2]\r\n\tn = int(input())\r\n\tss = \"\"\r\n\ttmp1 = (f(a) + n) % 4\r\n\ttmp2 = (f(a) - n) % 4\r\n\tif tmp1 == tmp2 : ss = \"undefined\"\r\n\telse:\r\n\t\tif tmp1 == f(b): ss = \"cw\"\r\n\t\telse:\r\n\t\t\tif tmp2 == f(b): ss = \"ccw\"\r\n\tprint(ss)\r\n\r\n", "directions = ['v', '<', '^', '>']\r\nx, y = map(directions.index, input().split())\r\nn = int(input())\r\na = (y - x + 4) % 4\r\nif a == 0 or a == 2:\r\n print('undefined')\r\nelif a == n % 4:\r\n print('cw')\r\nelse:\r\n print('ccw')\r\n", "[start, end] = [x for x in input().split()]\n\nduration = int(input())\n\ncw = ['v', '<', '^', '>']\nccw = ['v', '>', '^', '<']\n\ncw_bool = end == cw[((cw.index(start) + duration) % 4)]\nccw_bool = end == ccw[((ccw.index(start) + duration) % 4)]\n\nif cw_bool and ccw_bool:\n print(\"undefined\")\nelif cw_bool:\n print(\"cw\")\nelse:\n print(\"ccw\")\n\n", "s1, s2 = input().split()\r\nn = int(input())\r\nA = ['^', '>', 'v', '<']\r\nif n % 2 == 0:\r\n print(\"undefined\")\r\nelif A[A.index(s2)-1]==s1:\r\n if n%4==3:\r\n print('ccw')\r\n else:\r\n print('cw')\r\nelse:\r\n if n%4==3:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n", "n,m = input().strip().split()\r\n#print(n,' ',m)\r\nt=int(input())\r\ntr=t % 4\r\ncww=[chr(118), '<',chr(94),'>']\r\ncwww=[chr(118),'>',chr(94),'<']\r\np=cww.index(n)\r\nq=cwww.index(n)\r\n#print(p,' ',q)\r\nif cww[(p+tr)%4]==cwww[(q+tr)%4]:\r\n print('undefined')\r\nelif cww[(p+tr)%4]==m:\r\n print('cw')\r\nelif cwww[(q+tr)%4]==m:\r\n print('ccw')\r\n", "\nstr1=input(\"\")\nfirststr=str1[0]\nsecondstr=str1[2]\nnum=int(input(\"\"))\n\ndef switch(x):\n if x=='v' :\n return 1\n if x=='<' :\n return 2\n if x=='^' : \n return 3\n if x=='>' :\n return 4\n \nfsn=switch(firststr)\nssn=switch(secondstr)\noutput=\"undefined\"\nnum=(num%4)\nflag1=0\nflag2=0\n\nif num==0 :\n num=4\n \nfsnnum=fsn+num\n \nif fsn+num>4 :\n fsnnum=(fsn+num)-4\n \nif fsnnum==ssn :\n output=\"cw\"\n flag1=1\n \nif fsn-num==(-4+ssn) or fsn-num == ssn :\n output=\"ccw\"\n flag2=1\n \nif flag1==flag2 :\n output = \"undefined\"\nprint(output)\n\n", "s,q1=input().split()\r\nn=int(input())\r\ns1=[\"v\",\"<\",\"^\",\">\"]\r\ns2=[\"v\",\">\",\"^\",\"<\"]\r\np=s1.index(s)\r\ni=(p+n)%4\r\nq=s2.index(s)\r\ni1=(q+n)%4\r\n##print(p,i,q,i1)\r\nif q1==s1[i] and q1!=s2[i1]:\r\n print(\"cw\")\r\nelif q1==s2[i1] and q1!=s1[i]:\r\n print(\"ccw\")\r\nelse:\r\n print(\"undefined\")\r\n", "def main():\r\n start, end = input().split()\r\n n = int(input())\r\n d = {\"v\":1, \"<\":2, \"^\":3, \">\":0}\r\n start, end = d[start], d[end]\r\n rev = (start - n) % 4\r\n forw = (start + n) % 4\r\n if rev == forw == end:\r\n print(\"undefined\")\r\n elif rev == end:\r\n print(\"ccw\")\r\n elif forw == end:\r\n print(\"cw\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Dec 19 19:28:14 2019\r\n\r\n@author: HP\r\n\"\"\"\r\n\r\nDIRS = ['v', '<', '^', '>']\r\n\r\na, b = map(DIRS.index, input().split())\r\nn = int(input())\r\n#print(a)\r\n#print(b)\r\n\r\ndelta = (b - a + 4) % 4\r\n#print(delta)\r\n\r\nif delta == 0 or delta == 2:\r\n print('undefined')\r\nelif delta == n % 4:\r\n print('cw')\r\nelse:\r\n print('ccw')", "s, n, f, sp= input(), int(input()), 0, 'v<^>'\r\nl = sp.index(s[0])\r\nif sp[(l + n) % 4] == s[2]: f += 1\r\nif sp[(l - n) % 4] == s[2]: f += 2\r\nif f == 1: print('cw')\r\nelif f == 2: print('ccw')\r\nelse: print('undefined')\r\n", "import sys\r\na,b=input().split()\r\nn=int(input())\r\nif a=='v':\r\n lcw=['<','^','>','v']\r\n lccw=['>','^','<','v']\r\n n=n%4-1\r\n if lcw[n]==lccw[n]:\r\n print(\"undefined\")\r\n sys.exit()\r\n elif lcw[n]==b:\r\n print(\"cw\")\r\n sys.exit()\r\n elif lccw[n]==b:\r\n print(\"ccw\")\r\nelif a=='^':\r\n lcw=['>','v','<','^']\r\n lccw=['<','v','>','^',]\r\n n=n%4-1\r\n if lcw[n]==lccw[n]:\r\n print(\"undefined\")\r\n sys.exit()\r\n elif lcw[n]==b:\r\n print(\"cw\")\r\n sys.exit()\r\n elif lccw[n]==b:\r\n print(\"ccw\")\r\nelif a=='>':\r\n lcw=['v','<','^','>']\r\n lccw=['^','<','v','>']\r\n n=n%4-1\r\n if lcw[n]==lccw[n]:\r\n print(\"undefined\")\r\n sys.exit()\r\n elif lcw[n]==b:\r\n print(\"cw\")\r\n sys.exit()\r\n elif lccw[n]==b:\r\n print(\"ccw\")\r\nelif a=='<':\r\n lcw=['^','>','v','<']\r\n lccw=['v','>','^','<']\r\n n=n%4-1\r\n if lcw[n]==lccw[n]:\r\n print(\"undefined\")\r\n sys.exit()\r\n elif lcw[n]==b:\r\n print(\"cw\")\r\n sys.exit()\r\n elif lccw[n]==b:\r\n print(\"ccw\")\r\n \r\n\r\n \r\n \r\n", "a, b = map(str, input().split())\r\nn = int(input())\r\nf1 = [\"<\", \"v\", \">\", \"^\"]\r\nf2 = [\"^\", \">\", \"v\", \"<\"]\r\nh = n * 90 % 360 // 90\r\nr = -h\r\nj = -h\r\nif a == \"<\":\r\n r += 0\r\n j += 3\r\nelif a == \"v\":\r\n r += 1\r\n j += 2\r\nelif a == \">\":\r\n r += 2\r\n j += 1\r\nelse:\r\n r += 3\r\n j += 0\r\nif b == f1[r] == f2[j]:\r\n print(\"undefined\")\r\nelif b == f1[r]:\r\n print(\"cw\")\r\nelif b == f2[j]:\r\n print(\"ccw\")\r\nelse:\r\n print(\"undefined\")\r\n", "a, b = input().split()\r\nd = {'v': 0, '<': 1, '^': 2, '>':3}\r\nn = int(input())\r\ncw = False\r\nccw = False\r\nif (d[a] + n) % 4 == d[b]:\r\n cw = True\r\nif (d[b] + n) % 4 == d[a]:\r\n ccw = True\r\nif cw == ccw:\r\n print(\"undefined\")\r\nelif cw:\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")", "start, end = [ str(x) for x in input().split()]\r\n\r\nn = int(input())\r\n\r\nspinner_sides = ['^', '>', 'v', '<']\r\n\r\ndef get_side(spinner):\r\n if(spinner == '^'):\r\n return 0\r\n elif spinner == '>':\r\n return 1\r\n elif spinner == 'v':\r\n return 2\r\n else:\r\n return 3\r\n\r\n\r\n\r\n# ignore full rotations\r\nn = n % 4\r\n\r\nif( n % 2 == 0 ):\r\n print('undefined')\r\n exit()\r\nelse:\r\n # final turns are 1 or 3\r\n # see which side it rotates\r\n curr_side = get_side(start)\r\n while(n):\r\n curr_side = (curr_side+1)%4\r\n n -= 1\r\n\r\n if(spinner_sides[curr_side] == end):\r\n print('cw')\r\n else:\r\n print('ccw')\r\n\r\n", "d=['v','<','^','>']\r\ns,e=input().split()\r\nn=int(input())\r\nt=(d.index(e)-d.index(s)+4)%4\r\nif(t==0 or t==2):\r\n print('undefined')\r\nelif(t==n%4):\r\n print('cw')\r\nelse:\r\n print('ccw')", "first, last = input().split()\r\nn = int(input())\r\ndirections = {\"^\":0, \">\":1, \"v\":2, \"<\":3}\r\nfirst = directions[first]\r\nlast = directions[last]\r\ncw = False\r\nccw = False\r\nif (last - first)%4 == n%4:\r\n\tcw = True\r\nif (first - last)%4 == n%4:\r\n\tccw = True\r\n\r\nif ccw and not cw:\r\n\tprint(\"ccw\")\r\nelif cw and not ccw:\r\n\tprint(\"cw\")\r\nelse:\r\n\tprint(\"undefined\")", "rotation = ['v', '<', '^', '>', 'v']\r\na, b = input().split()\r\nn = int(input())\r\nc = n % 4\r\nd = rotation.index(a)\r\nif c % 2 == 0:\r\n print(\"undefined\")\r\nelif (rotation.index(b)-rotation.index(a)+4) % 4 == c:\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")", "a={'v': 0, '<': 1, '^': 2, '>': 3}\ns=input().strip().split()\nn=int(input())\ncw=(a[s[0]]+n)%4==a[s[1]]\ncc=(a[s[0]]-n)%4==a[s[1]]\nif cw and not cc: print('cw')\nelif cc and not cw: print('ccw')\nelse: print('undefined')\n", "s = ['^', '>', 'v', '<']\r\n\r\nfe = input()\r\nf,e = fe.split()\r\nn = int(input())\r\n\r\nb = s.index(f)\r\ne = s.index(e)\r\n\r\nif n % 2 == 0:\r\n print('undefined')\r\nelse:\r\n n = n % 4\r\n if (b + n) % 4 == e:\r\n print('cw')\r\n else:\r\n print('ccw')\r\n ", "start , end = input().split(' ')\r\ntime = int(input())\r\ntime = time%4\r\npositions = ['v','<','^','>']\r\npos_reverse = ['v','>','^','<']\r\ncw = ccw = False\r\npos_start_cw = positions.index(start)\r\npos_end_cw = positions.index(end)\r\npos_start_ccw = pos_reverse.index(start)\r\npos_end_ccw = pos_reverse.index(end)\r\nif (pos_start_cw + time)%4 == pos_end_cw:\r\n cw = True\r\nif (pos_start_ccw + time)%4 == pos_end_ccw:\r\n ccw = True\r\n\r\nif cw is True:\r\n if ccw is False:\r\n print('cw')\r\n else:\r\n print('undefined')\r\nelif ccw is True:\r\n if cw is False:\r\n print('ccw')\r\n else:\r\n print('undefined')\r\nelse:\r\n print('undefined')\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nchk = ['v', '<', '^', '>']\r\n\r\na, b = input().split()\r\nn = int(input())\r\n\r\nai = chk.index(a)\r\nbi = chk.index(b)\r\n\r\nchk = ai < bi\r\nf = abs(ai - bi)\r\ns = 4 - f\r\n\r\nif (f - n) % 4 == 0 and (s - n) % 4 == 0:\r\n print(\"undefined\")\r\nelif (f - n) % 4 == 0:\r\n print(\"cw\" if chk else \"ccw\")\r\nelif (s - n) % 4 == 0:\r\n print(\"ccw\" if chk else \"cw\")\r\nelse:\r\n print(\"undefined\")\r\n\r\n", "start,end=map(str,list(input().split()))\r\nn=int(input())\r\nl1=[\"^\",\">\",\"v\",\"<\"]\r\ns1=l1.index(start) \r\ne1=l1.index(end)\r\nn=n%4 \r\nif(n%2==0):\r\n print(\"undefined\")\r\nelif(l1[s1-n]==end):\r\n print(\"ccw\")\r\nelse:\r\n print(\"cw\")", "s = input()\r\n\r\nn = int(input())\r\n\r\nif not(n%2):\r\n print(\"undefined\")\r\nelif (\"^>v<\".find(s[0])+n)%4 == \"^>v<\".find(s[2]):\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")\r\n", "se = input().replace(\" \", \"\")\nn = int(input())\nif n & 1 == 0:\n res = \"undefined\"\nelse:\n n %= 4\n cw = {\n 1: set([\"<^\", \"^>\", \">v\", \"v<\"]),\n 3: set([\"<v\", \"^<\", \">^\", \"v>\"]),\n }\n res = \"cw\" if se in cw[n] else \"ccw\"\nprint(res)\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nClimb Stairs\r\n'''\r\n\r\ndef solve():\r\n s, e = I().split()\r\n n = II() % 4\r\n\r\n pos = 'v<^>'\r\n i = pos.index(s)\r\n\r\n r = i - n\r\n if r < 0:\r\n r += 4\r\n\r\n if pos[(i+n)%4] == e and pos[r] == e:\r\n print('undefined') \r\n elif pos[(i+n)%4] == e:\r\n print('cw')\r\n elif pos[r] == e:\r\n print('ccw')\r\n\r\nsolve()", "a = (94, 62, 118, 60, 94, 62, 118, 60)\r\nb = (94, 60, 118, 62, 94, 60, 118, 62)\r\ns = *map(ord, input().split()),\r\nn = int(input()) % 4\r\nif a[a.index(s[0]) + n] == s[1] and b[b.index(s[0]) + n] != s[1]:\r\n print(\"cw\")\r\nelif a[a.index(s[0]) + n] != s[1] and b[b.index(s[0]) + n] == s[1]:\r\n print(\"ccw\")\r\nelse: print(\"undefined\")", "\r\na, b = input().split()\r\nt = int(input())\r\n\r\nd = dict()\r\nd[\"^\"] = 0\r\nd[\">\"] = 1\r\nd[\"v\"] = 2\r\nd[\"<\"] = 3\r\n\r\na, b = d[a], d[b]\r\nt = t % 4\r\nif t == 2 or t == 0:\r\n print(\"undefined\")\r\nelse:\r\n if t == 1:\r\n if (b-1) % 4 == a:\r\n print(\"CW\".lower())\r\n else:\r\n print(\"CCW\".lower())\r\n elif t == 3:\r\n if (b+1) % 4 == a:\r\n print(\"CW\".lower())\r\n else:\r\n print(\"CCW\".lower())\r\n\r\n\r\n", "str1 = str(input())\r\nn = int(input())\r\n\r\nlis = ['v', '>','^', '<']\r\n\r\nif n % 2 == 0:\r\n print('undefined')\r\nelse:\r\n index1 = lis.index(str1.split(' ')[0])\r\n if str1.split(' ')[1] == lis[(index1 + n) % 4]:\r\n print('ccw')\r\n else:\r\n print('cw')", "c='^>v<'\r\na,b=map(c.index,input().split())\r\nn=int(input())\r\nprint([['ccw','cw'][(a+n)%4==b],'undefined'][abs(a-b)%2==0])", "def rotate(start, n_rotations, direction):\n return (start + (n_rotations * direction)) % 4\n\n\ndef main():\n positions = {'^': 0, '>': 1, 'v': 2, '<': 3}\n [start, end] = input().split()\n (start, end) = (positions[start], positions[end])\n n_rotations = int(input())\n\n clockwise = rotate(start, n_rotations, 1)\n cclockwise = rotate(start, n_rotations, -1)\n\n print('undefined' if clockwise == cclockwise else 'cw' if clockwise == end else 'ccw')\n\n\nif __name__ == '__main__':\n main()\n", "line = input()\na, b = line.split()\nn = int(input())\n\npositions = {'^': 0, '>': 1, 'v': 2, '<': 3}\n\nn %= 4\n\ni = (positions[a] + n) % 4 == positions[b]\nj = (positions[a] - n) % 4 == positions[b]\n\nif i and j:\n print('undefined')\nelif i:\n print('cw')\nelse:\n print('ccw')\n\n \t\t \t\t \t\t\t \t \t \t\t \t \t", "char1, char2 = input().split()\r\nn = int(input())%4\r\ncw = \"v<^>v<^>\"\r\nccw = \"v>^<v>^<\"\r\nif n%2==1 and cw[cw.find(char1)+n]==char2:\r\n print(\"cw\")\r\nelif n%2==1 and ccw[ccw.find(char1)+n]==char2:\r\n print(\"ccw\")\r\nelse:\r\n print(\"undefined\")", "a,b = map(str,input().split())\r\nn = int(input())\r\ntoy = 'v<^>'\r\nif n%2==0:\r\n print('undefined')\r\nelif (toy.find(a)+n)%4 == toy.find(b):\r\n print('cw')\r\nelse:\r\n print('ccw')", "first,final=input().split()\r\nn=int(input())%4\r\ncw=first\r\ncww=first\r\nif n==0:\r\n print(\"undefined\")\r\nelse:\r\n for _ in range(n):\r\n if cw == \"^\":\r\n cw = \">\"\r\n elif cw == \">\":\r\n cw = \"v\"\r\n elif cw == \"v\":\r\n cw = \"<\"\r\n else:\r\n cw = \"^\"\r\n\r\n if cww == \"^\":\r\n cww = \"<\"\r\n elif cww == \"<\":\r\n cww = \"v\"\r\n elif cww == \"v\":\r\n cww = \">\"\r\n else:\r\n cww = \"^\"\r\n if cw==cww:\r\n print(\"undefined\")\r\n elif final==cw:\r\n print(\"cw\")\r\n elif final == cww:\r\n print(\"ccw\")\r\n else:\r\n print(\"undefined\")", "a,b = map(str,input().split())\r\nn = int(input())\r\nd = 'v<^>'\r\n#print(d.find('v')+n)\r\nif (n%2==0):\r\n print(\"undefined\")\r\nelif (d.find(a)+n)%4 == d.find(b):\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")", "def check(d,f):\r\n \r\n if d==f[0]:\r\n if n%4==1:\r\n return f[1]\r\n elif n%4==2:\r\n return f[2]\r\n elif n%4==3:\r\n return f[3]\r\n else:\r\n return f[0]\r\n elif d==f[1]:\r\n if n%4==1:\r\n return f[2]\r\n elif n%4==2:\r\n return f[3]\r\n elif n%4==3:\r\n return f[0]\r\n else:\r\n return f[1]\r\n elif d==f[2]:\r\n if n%4==1:\r\n return f[3]\r\n elif n%4==2:\r\n return f[0]\r\n elif n%4==3:\r\n return f[1]\r\n else:\r\n return f[2]\r\n elif d==f[3]:\r\n if n%4==1:\r\n return f[0]\r\n elif n%4==2:\r\n return f[1]\r\n elif n%4==3:\r\n return f[2]\r\n else:\r\n return f[3]\r\n\r\n\r\n \r\ns=list(map(str,input().split()))\r\nn=int(input())\r\narr=['^','>','v','<']\r\narr1=['^','<','v','>']\r\na=check(s[0],arr)\r\nb=check(s[0],arr1)\r\nif a==b:\r\n print(\"undefined\")\r\nelif a==s[1]:\r\n print('cw')\r\nelif b==s[1]:\r\n print('ccw')\r\nelse:\r\n print('undefined')", "cw = [60,94,62,118]\r\nccw = [60,118,62,94]\r\ni,f = map(ord,input().split())\r\nn = int(input())\r\nans = 'undefined'\r\n\r\nindex_i = cw.index(i)\r\nindex_f = cw.index(f)\r\nif (index_i+n)%4==index_f:\r\n\tans='cw'\r\n\r\nindex_i = ccw.index(i)\r\nindex_f = ccw.index(f)\r\nif (index_i+n)%4==index_f:\r\n\tif ans=='undefined':\r\n\t\tans='ccw'\r\n\telse:\r\n\t\tans= 'undefined'\r\nprint(ans)\r\n", "def parse():\r\n positions = {'v': 0, '<': 1, '^': 2, '>': 3}\r\n start_pos, end_pos = input().split(' ')\r\n time = int(input())\r\n return positions[start_pos], positions[end_pos], time\r\n\r\n\r\ndef solve(start, end, t):\r\n cw = (start + t) % 4 == end\r\n ccw = (start - t) % 4 == end\r\n return cw, ccw\r\n\r\n\r\ndef display(cw, ccw):\r\n if cw and ccw:\r\n print(\"undefined\")\r\n elif cw:\r\n print(\"cw\")\r\n elif ccw:\r\n print(\"ccw\")\r\n\r\n\r\ndef main():\r\n display(*solve(*parse()))\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "states = [\"^\",\">\",\"v\",\"<\"]\r\ns,e = map(states.index, input().split())\r\ni = int(input())\r\nd = (e-s+4)%4\r\nif d == 0 or d == 2:\r\n print('undefined')\r\nelif d == i % 4:\r\n print('cw')\r\nelse:\r\n print('ccw')", "d,s,n = '^>v<',input(),int(input())\r\nif n%2==0: print(\"undefined\")\r\nelif (d.find(s[0])+n)%4 == d.find(s[2]):\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")", "s, g = input().split()\r\nn = int(input())\r\nl = ['<', '^', '>', 'v']\r\na = (l.index(s)+n)%4\r\nb = (l.index(s)-n)%4\r\nif a==l.index(g) and b==l.index(g):\r\n\tprint(\"undefined\")\r\nelif a==l.index(g):\r\n\tprint('cw')\r\nelse:\r\n\tprint('ccw')", "ordem = \"v<^>\"\nentrada = input()\nc = entrada[0]\nf = entrada[2]\nn = int(input()) % 4\n\nfor i in range(len(ordem)):\n if ordem[i] == c:\n posComeco = i\n break\n\ncw = (posComeco + n) % 4\nccw = (posComeco - n) % 4\nif n % 2 == 0:\n print(\"undefined\")\nelif f == ordem[cw]:\n print(\"cw\")\nelif f == ordem[ccw]:\n print(\"ccw\")\n", "ch1, ch2 = input().split()\r\nn = int(input()) % 4\r\n\r\nch = ['v', '<', '^', '>']\r\n\r\n_ch1 = ch[(ch.index(ch1)+n)%4]\r\n_ch2 = ch[(ch.index(ch1)-n)]\r\n\r\n# print(_ch1)\r\n# print(_ch2)\r\nif _ch1==ch2:\r\n ans = 'cw'\r\nelif _ch2==ch2:\r\n ans = 'ccw'\r\nelse:\r\n ans = 'undefined'\r\n\r\nif _ch1==_ch2==ch2:\r\n ans = 'undefined'\r\nprint(ans)", "states = ['v', '<', '^', '>']\r\nstart, end = input().split()\r\nn = int(input())\r\n\r\ncw = False\r\nccw = False\r\n\r\nif states[(states.index(start)+n)%4] == end:\r\n cw = True\r\nif states[(states.index(start)-n)%4] == end:\r\n ccw = True\r\n\r\nprint(['cw','ccw','undefined'][cw+ccw-(1-ccw)])", "fr, ls = input().split()\r\nn = int(input())\r\nn %= 4\r\nif n == 1:\r\n if fr == '^':\r\n if ls == '>':\r\n print('cw')\r\n else:\r\n print('ccw')\r\n if fr == '>':\r\n if ls == '^':\r\n print('ccw')\r\n else:\r\n print('cw')\r\n if fr == 'v':\r\n if ls == '>':\r\n print('ccw')\r\n else:\r\n print('cw')\r\n if fr == '<':\r\n if ls == '^':\r\n print('cw')\r\n else:\r\n print('ccw')\r\n exit()\r\nif n == 3:\r\n if fr == '^':\r\n if ls == '<':\r\n print('cw')\r\n else:\r\n print('ccw')\r\n if fr == '>':\r\n if ls == '^':\r\n print('cw')\r\n else:\r\n print('ccw')\r\n if fr == 'v':\r\n if ls == '>':\r\n print('cw')\r\n else:\r\n print('ccw')\r\n if fr == '<':\r\n if ls == '^':\r\n print('ccw')\r\n else:\r\n print('cw')\r\n exit()\r\nprint('undefined')", "arr = [chr(118) , chr(60) , chr(94) , chr(62)]\r\n\r\na , b = input().split()\r\nn = int(input())\r\nn = n%4\r\n\r\nx = arr.index(a)\r\n# print(arr)\r\no = arr[(x + n)%4]\r\n\r\np = arr[(x + 4 - n)%4]\r\n\r\n\r\n\r\nif o==p: print(\"undefined\")\r\n\r\nelif o==b: print(\"cw\")\r\nelse: print(\"ccw\")\r\n", "d = {}\r\nd[chr(118)] = 0\r\nd[chr(60)] = 1\r\nd[chr(94)] = 2\r\nd[chr(62)] = 3\r\ns = input()\r\ni = d[s[0]]\r\nf = d[s[2]]\r\ndelta = int(input())%4\r\n\r\nif (i+1)%4 == f or (i-1)%4 == f:\r\n if (i+delta)%4 == f:\r\n print(\"cw\")\r\n else:\r\n print(\"ccw\")\r\nelse:\r\n print(\"undefined\")\r\n\r\n ", "X = input().split()\r\nY = int(input())\r\nAnswer = 'v<^>'\r\nif Y % 2 == 0:\r\n print(\"undefined\")\r\n exit()\r\nif Y % 4 == 1:\r\n print(\"ccw\" if Answer[Answer.index(X[0]) - 1] == X[1] else \"cw\")\r\n exit()\r\nprint(\"cw\" if Answer[Answer.index(X[0]) - 1] == X[1] else \"ccw\")\r\n", "l=list(map(str,input().strip().split(' ')))\r\n#print(l)\r\n#print(int(input()))\r\nx=int(input())%4\r\na=l[0]\r\nb=l[1]\r\nl1=['<','^','>','v']\r\nl2=['<','v','>','^']\r\ni1=l1.index(a)\r\ni2=l2.index(a)\r\nif l1[(i1+x)%4]==b and l2[(i2+x)%4]!=b:\r\n print(\"cw\")\r\nelif l2[(i2+x)%4]==b and l1[(i1+x)%4]!=b:\r\n print(\"ccw\")\r\nelse:\r\n print(\"undefined\")\r\n", "s=input()\r\nn=int(input())\r\na=\"v<^>v<^>\"\r\nb=\"v>^<v>^<\"\r\nif n%2==0:print(\"undefined\")\r\nelif a[a.index(s[0])+(n%4)]==s[2]:print(\"cw\")\r\nelif b[b.index(s[0])+(n%4)]==s[2]:print(\"ccw\")", "read = lambda: map(int, input().split())\r\na, b = input().split()\r\nn = int(input()) % 4\r\ns = 'v<^>'\r\nk1 = (s.index(b) - s.index(a)) % 4\r\nk2 = (s.index(a) - s.index(b)) % 4\r\nprint('cw' if k1 == n and k2 != n else 'ccw' if k1 != n and k2 == n else 'undefined')", "s,s2=input().split()\r\nn=int(input())\r\nk=\"v<^>\"\r\nif n%2==0:\r\n print(\"undefined\")\r\nelif (k.find(s)+n)%4==k.find(s2):\r\n print(\"cw\")\r\nelse:\r\n print(\"ccw\")\r\n" ]

[ "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\npos = []\r\nneg = []\r\nz = 0\r\n\r\nfor i in range(n):\r\n if a[i] > 0:\r\n pos.append(a[i])\r\n elif a[i] < 0:\r\n neg.append(a[i])\r\n else:\r\n z += 1\r\n\r\nm = len(neg)\r\nneg.sort()\r\n\r\nif m % 2:\r\n m -= 1\r\n\r\nfor i in range(m):\r\n pos.append(neg[i])\r\n\r\nif len(pos) > 0:\r\n for i in range(len(pos)):\r\n print(pos[i], end=' ')\r\nelse:\r\n # either there are a single negative, 0 positives, 0 or more zeros\r\n if z:\r\n print(0)\r\n else:\r\n print(neg[0])\r\n", "n, a = int(input()), list(map(int, input().split()))\r\nan, ap = sorted(x for x in a if x < 0), [x for x in a if x > 0]\r\nif n > 1 and len(an) % 2:\r\n an.pop()\r\nprint(' '.join(map(str, ap + an)) if ap or an else 0)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\nfor x in a:\r\n if x>0:\r\n b.append(x)\r\n elif x<0:\r\n c.append(x)\r\nif len(c)%2!=0:\r\n c=sorted(c)[:-1]\r\nb+=c\r\nif len(b)==0:\r\n print(*a)\r\nelse:\r\n print(*b)\r\n", "n=int(input())\r\nlst=[*map(int,input().split())]\r\na,b=[],[]\r\nfor i,x in enumerate(lst):\r\n if x>0:a.append(x)\r\n if x<0:b.append(x)\r\nb.sort()\r\nif len(b)%2==0:a.extend(b)\r\nelse:a.extend(b[:-1])\r\nif a==[]:print(max(lst))\r\nelse:print(*a)", "n = int(input())\r\narr = list(map(int,input().split()))\r\ncount_neg = 0\r\nneg_max = -100\r\nfor e in arr:\r\n if e<0:\r\n count_neg+=1\r\n neg_max = max(neg_max,e)\r\nans = []\r\nif count_neg&1:\r\n arr.remove(neg_max)\r\n\r\nfor e in arr:\r\n if e!=0:\r\n ans.append(e)\r\nif ans: \r\n print(*ans)\r\nelse:\r\n if arr:\r\n print(max(arr))\r\n else:\r\n print(neg_max)\r\n \r\n ", "n=int(input())\r\n\r\ns=list(map(int,input().split()))\r\ns.sort()\r\ns.reverse()\r\n\r\nnum_manfi=0\r\nnum_sefr=0\r\nflag=0\r\nfor i in s:\r\n if i>0:\r\n print(i,end=' ')\r\n flag=1\r\n elif i==0:\r\n num_sefr+=1\r\n else:\r\n num_manfi+=1\r\n \r\nnum_manfi-=(num_manfi%2)\r\n\r\ns.reverse()\r\n\r\nfor i in range(num_manfi):\r\n print(s[i],end=' ')\r\n\r\nif (not flag) and num_manfi<=0 and num_sefr>0 :\r\n print(0,end=' ')\r\n exit()\r\n\r\nif (not flag) and num_sefr<=0 and num_manfi<=0 :\r\n print(s[0])\r\n exit()\r\n", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nn = int(input())\nnums = list(map(int, input().split()))\nnums.sort()\nres = []\ni = 0\nwhile i < n:\n if nums[i] < 0 and i < n - 1 and nums[i+1] < 0:\n res.append(nums[i])\n res.append(nums[i+1])\n i += 2\n elif nums[i] == 0:\n i += 1\n elif nums[i] > 0:\n res.append(nums[i])\n i += 1\n else:\n i += 1\nif res:\n print(*res)\nelse:\n print(nums[-1])", "from bisect import bisect_left as bl;n=int(input())\r\nif n==1:\r\n print(input())\r\nelse:\r\n a=list(map(int,input().split()));a.sort()\r\n if bl(a,0)%2==1:\r\n if a[bl(a,0)-1]<0:a.remove(a[bl(a,0)-1])\r\n q=len(a)\r\n while 0 in a and q>1:a.remove(0);q-=1\r\n print(*a)", "try:\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n positive = [item for item in arr if item > 0]\r\n negative = [item for item in arr if item < 0]\r\n zero = [item for item in arr if item == 0]\r\n negative.sort(reverse=True)\r\n length = len(negative)\r\n z_length = len(zero)\r\n if length > 1:\r\n if length % 2 == 0:\r\n ans = positive + negative\r\n print(*ans)\r\n else:\r\n ans = positive + negative[1:]\r\n print(*ans)\r\n elif length == 1:\r\n if len(positive) > 0:\r\n print(*positive)\r\n elif z_length != 0:\r\n print(0)\r\n else:\r\n print(*negative)\r\n else:\r\n if len(positive) > 0:\r\n print(*positive)\r\n elif z_length != 0:\r\n print(0)\r\n\r\n\r\nexcept e:\r\n pass\r\n", "for _ in range(1):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n pos = []\r\n neg = []\r\n zero = 0\r\n for i in range(n):\r\n if a[i] > 0:\r\n pos.append(a[i])\r\n elif a[i] == 0:\r\n zero += 1\r\n else:\r\n neg.append(a[i])\r\n\r\n if len(neg) % 2:\r\n neg.remove(max(neg))\r\n\r\n ans = pos + neg\r\n if len(ans) == 0:\r\n print(max(a))\r\n else:\r\n print(*ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nif n == 1:\r\n print(a[0])\r\n exit(0)\r\nif n == 2 and a[1] == 0:\r\n print(0)\r\n exit(0)\r\noutput = []\r\ni = 0\r\nwhile i < n:\r\n if a[i] > 0:\r\n output.append(a[i])\r\n elif a[i] < 0 and a[i+1] < 0:\r\n output.extend([a[i], a[i+1]])\r\n i += 1\r\n i += 1\r\nprint(\" \".join(map(str, output)))#moondance vladiysxxs.near", "\r\nn=int(input())\r\nc=list(map(int,input().split()))\r\n\r\nneg=[]\r\npos=[]\r\nzero=False\r\n\r\nif list(set(c))==[0]:\r\n print(0)\r\n quit()\r\n\r\nfor i in range(n):\r\n if c[i]>0:pos.append(c[i])\r\n elif c[i]<0:neg.append(c[i])\r\n else:zero=True\r\n\r\nneg.sort()\r\n\r\nfor i in range(len(pos)):\r\n print(pos[i],end=\" \")\r\nfor i in range(0,len(neg)//2):\r\n print(neg[2*i],neg[2*i+1],sep=\" \",end=\" \")\r\n\r\nif len(pos)==0 and len(neg)==1:\r\n if zero:\r\n print(0)\r\n else:\r\n print(neg[0])\r\n", "n = int(input())\r\nL = [int(l) for l in input().split()]\r\nif (n == 1):\r\n print(*L)\r\nelse:\r\n L.sort()\r\n L.reverse()\r\n res = []\r\n for i in L:\r\n if i > 0:\r\n res.append(i)\r\n else:\r\n break\r\n L.reverse()\r\n dp = []\r\n for i in L:\r\n if i < 0:\r\n dp.append(i)\r\n if (len(dp) == 2):\r\n res.append(dp[0])\r\n res.append(dp[1])\r\n dp = []\r\n else:\r\n break\r\n if len(res) == 0:\r\n print(max(L))\r\n else:\r\n print(*res)\r\n" ]

[ "from collections import*\r\nfrom heapq import*\r\nn,k=map(int,input().split())\r\nans=0\r\ng=defaultdict(list)\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n g[a].append(b)\r\nh=[]\r\nfor day in range(1,3002):\r\n if day in g:\r\n for i in g[day]:heappush(h,[day,i])\r\n sobr=k\r\n while h and sobr:\r\n if h[0][0]+1<day:heappop(h)\r\n else:\r\n f=heappop(h)\r\n if f[1]<=sobr:ans+=f[1];sobr-=f[1]\r\n else:ans+=sobr;heappush(h,[f[0],f[1]-sobr]);sobr=0\r\nprint(ans)", "from collections import defaultdict\r\nn,v=map(int,input().split())\r\nhashmap=[0]*(30002)\r\nm=-1\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n hashmap[a]+=b\r\n m=max(m,a)\r\nans=0\r\nfor i in range(1,m+2):\r\n took=0\r\n # print(hashmap[i-1],'#')\r\n if hashmap[i-1]>0:\r\n took=min(hashmap[i-1],v)\r\n hashmap[i-1]-=took\r\n ans+=took\r\n rem=v-took\r\n ct=min(rem,hashmap[i])\r\n ans+=ct\r\n hashmap[i]-=ct\r\n # print(ans)\r\n# print(hashmap)\r\nprint(ans)\r\n\r\n", "def main():\r\n\tn,m = map(int,input().split())\r\n\ta = []\r\n\tb = []\r\n\tfor _ in range(n):\r\n\t\ta1,b1 = map(int,input().split())\r\n\t\ta.append(a1)\r\n\t\tb.append(b1)\r\n\tprev = 0\r\n\ttv = 0\r\n\tans = 0\r\n\tfor i in range(1,3002):\r\n\t\tcurr = 0\r\n\t\tfor j in range(n):\r\n\t\t\tif a[j]==i:\r\n\t\t\t\tcurr+=b[j]\r\n\t\tif curr+prev<=m:\r\n\t\t\tans += prev+curr\r\n\t\t\tprev = 0 \r\n\t\telse:\r\n\t\t\tans += m\r\n\t\t\ttv = m - prev\r\n\t\t\tif tv<0:\r\n\t\t\t\ttv = 0\r\n\t\t\tprev = curr-tv\r\n\tprint(ans)\r\n\treturn\r\n\r\nmain()\r\n", "n,v=map(int,input().split())\r\nf=[0]*(3005)\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n f[a]+=b \r\nday=1 \r\ndown=0 \r\ncollect=0 \r\nwhile day<=3001:\r\n curr=f[day]\r\n if curr+down<=v:\r\n collect+=curr+down \r\n curr=0 \r\n else:\r\n collect+=v \r\n if down <v:\r\n curr=curr+down -v \r\n day+=1 \r\n down =curr \r\nprint(collect)", "n,v=map(int,input().split())\r\nli=[]\r\nfor i in range(n):\r\n tp=[int(x) for x in input().split()]\r\n li.append(tp)\r\nli.sort(key=lambda x: x[0])\r\nd={}\r\nend={}\r\ndistinct=set()\r\nfor i in range(n):\r\n if d.get(li[i][0],-1)==-1:\r\n d[li[i][0]]=i\r\n if i<(n-1) and li[i][0]!=li[i+1][0]:\r\n end[li[i][0]]=i\r\n distinct.add(li[i][0])\r\nto=set()\r\nfor ele in distinct:\r\n if ele+1 not in distinct:\r\n to.add(ele+1)\r\nfor ele in to:\r\n distinct.add(ele)\r\ndistinct=list(distinct)\r\ndistinct.sort()\r\nend[li[n-1][0]]=n-1\r\nfruit=0\r\ni=0\r\nwhile i<len(distinct):\r\n ele=distinct[i]\r\n k=v\r\n if d.get(ele-1,-1)!=-1:\r\n start=d.get(ele-1)\r\n else:\r\n start=d.get(ele)\r\n ennd=end[ele] if end.get(ele,-1)!=-1 else end[ele-1]\r\n for j in range(start,ennd+1):\r\n if k==0:\r\n break\r\n else:\r\n if li[j][1]>0:\r\n vl=min(li[j][1],k)\r\n k-=vl\r\n li[j][1]-=vl\r\n fruit+=vl\r\n i+=1\r\n\r\nprint(fruit)", "n, v = [int(c) for c in input().split()]\r\nm = [[0, 0] for i in range(3003)]\r\n\r\n\r\n\r\nfor i in range(n):\r\n a, b = [int(c) for c in input().split()]\r\n m[a][1] += b\r\n m[a+1][0] += b\r\n\r\n\r\nres = 0\r\n\r\nfor i in range(1,3002):\r\n if v <= m[i][0]:\r\n res += v\r\n else:\r\n from_future = v - m[i][0]\r\n got_fr = min(from_future, m[i][1])\r\n res += m[i][0] + got_fr\r\n m[i+1][0] -= got_fr\r\n\r\nprint(res)", "n, v = map(int,input().split())\r\nf = list()\r\nfor i in range(n):\r\n f.append(list(map(int,input().split())))\r\nf.sort()\r\nsum = 0\r\ndanas = 0\r\nsutra = 0\r\ndan = 0\r\nostalo = 0\r\nfor drvo in f:\r\n if drvo[0] > dan + 1:\r\n sum += min(sutra, v)\r\n sutra = drvo[1]\r\n sum += min(sutra, v)\r\n ostalo = v - min(sutra, v)\r\n sutra -= min(sutra,v)\r\n dan = drvo[0]\r\n elif drvo[0] == dan + 1:\r\n sum += min(sutra, v)\r\n ostalo = v - min(sutra, v)\r\n sutra = drvo[1]\r\n t = min(sutra, ostalo)\r\n sum += t\r\n ostalo -= t\r\n sutra -= t\r\n dan = drvo[0]\r\n else :\r\n sutra += drvo[1]\r\n t = min(sutra, ostalo)\r\n sum += t\r\n ostalo -= t\r\n sutra -= t\r\nsum += min(sutra, v)\r\nprint(sum)", "\"\"\"\r\nCodeforces Round 252 Div 2 Problem B\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\ndef read(mode=2):\r\n # 0: String\r\n # 1: List of strings\r\n # 2: List of integers\r\n inputs = input().strip()\r\n if mode == 0:\r\n return inputs\r\n if mode == 1:\r\n return inputs.split()\r\n if mode == 2:\r\n return [int(x) for x in inputs.split()]\r\n\r\ndef write(s=\"\\n\"):\r\n if isinstance(s, list): s = \" \".join(s)\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\n################################################### SOLUTION\r\nn,v = read()\r\na = []\r\nfor i in range(n):\r\n a.append(read())\r\na.sort(key=lambda x: x[0])\r\nres = 0\r\nfor day in range(1, 3002):\r\n n = 0\r\n while a and a[0][0] <= day:\r\n if a[0][1] <= v-n:\r\n n += a[0][1]\r\n a[0][1] = 0\r\n else:\r\n a[0][1] -= v-n\r\n n = v\r\n if a[0][1] == 0:\r\n a.pop(0)\r\n else:\r\n break\r\n while a and a[0][0] == day-1: a.pop(0)\r\n res += n\r\nprint(res)", "n,v=map(int,input().split())\na=[0]*(3002)\nans=0\nfor i in range(n):\n\ty,x=map(int,input().split())\n\ta[y]+=x\n\nfor i in range(1,3002):\n\tusable=v\n\tz=min(usable,a[i-1])\n\tans+=z\n\tusable-=z\n\ta[i-1]-=z\n\tz=min(usable,a[i])\n\tans+=z\n\tusable-=z\n\ta[i]-=z\n\nprint(ans)\n", "n, v = map(int,input().split())\nf = list()\nfor i in range(n):\n f.append(list(map(int,input().split())))\nf.sort()\nsum = 0\ndanas = 0\nsutra = 0\ndan = 0\nostalo = 0\nfor drvo in f:\n if drvo[0] > dan + 1:\n sum += min(sutra, v)\n sutra = drvo[1]\n sum += min(sutra, v)\n ostalo = v - min(sutra, v)\n sutra -= min(sutra,v)\n dan = drvo[0]\n elif drvo[0] == dan + 1:\n sum += min(sutra, v)\n ostalo = v - min(sutra, v)\n sutra = drvo[1]\n t = min(sutra, ostalo)\n sum += t\n ostalo -= t\n sutra -= t\n dan = drvo[0]\n else :\n sutra += drvo[1]\n t = min(sutra, ostalo)\n sum += t\n ostalo -= t\n sutra -= t\nsum += min(sutra, v)\nprint(sum)\n\t \t\t\t\t\t \t \t \t\t \t \t \t \t\t \t", "T = 3333;\nn, v = map(int, input().split());\n\ndata = [0] * T;\n\nfor i in range(0, n):\n a, b = map(int, input().split());\n data[a] += b;\n\nanswer = 0;\n\nfor i in range(1, T):\n x = v;\n tmp = min(v, data[i - 1]);\n x -= tmp;\n data[i - 1] -= tmp;\n answer += tmp;\n tmp = min(x, data[i]);\n data[i] -= tmp;\n answer += tmp;\n\n\nprint(answer);\n\n\n\n", "from sys import stdin,stdout\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\r\nfrom bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\n\r\nn,m=mp()\r\n\r\nmx = 30002\r\nv = [0]*mx\r\n\r\nfor _ in range(n):\r\n\tl =mp()\r\n\tv[l[0]] += l[1]\r\n\r\nans = 0\r\nprev = 0\r\nfor i in range(1,mx):\r\n\tif prev+v[i] <= m:\r\n\t\tans += prev+v[i]\r\n\t\tprev = 0\r\n\telse:\r\n\t\tans += m\r\n\t\tprev = max(0,v[i] - max(0,m-prev))\r\n\r\nprint(ans)\r\n\r\n", "n, v = map(int, input().split())\r\napples = [0] * 3002\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n apples[a] += b\r\n\r\ncount = 0\r\nfor i in range(1, 3002):\r\n leftover = apples[i - 1]\r\n collectable = min(v, apples[i] + leftover)\r\n count += collectable\r\n apples[i] = apples[i] + min(0, leftover - collectable)\r\n\r\nprint (count)\r\n\r\n#for i in range(first, last + 1):\r\n# count += min(v, dp[i])\r\n\r\n#print (count)", "n, v = map(int, input().split())\r\nN = 3003\r\nt = [0] * N\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n t[a] += b\r\nres = 0\r\nfor i in range(1, N):\r\n c = v\r\n res += min(c, max(t[i-1], 0))\r\n c -= max(t[i-1], 0)\r\n if c > 0:\r\n res += min(c, t[i])\r\n t[i] = max(t[i] - c, 0)\r\nprint(res)\r\n", "n,k= map(int,input().split())\nc= 0\nl = [0]*(3005)\nfor i in range(n):\n a,b = map(int,input().split())\n l[a] +=b\nans = 0\nfor i in range(1,3002):\n if(l[i] +c>=k):\n ans+=k\n if(c>k):\n c= l[i]\n else:\n c= l[i]- (k-c)\n else:\n ans+=l[i] + c\n c= 0\nans += min(c,k)\nprint(ans)", "n,v=map(int,input().split())\n\nf=[0]*3002\n\nfor _ in range(n):\n\n a,b=map(int,input().split())\n\n f[a]+=b\n\nans=0\n\ncur=0\n\nfor i in range(1,3002):\n\n if cur+f[i]<=v: ans+=cur+f[i]; cur=0\n\n else:\n\n ans+=v\n\n cur=f[i]-max(v-cur,0)\n\nprint(ans)\n\n\n\n# Made By Mostafa_Khaled", "n, v = map(int, input().split())\r\nr = [0 for i in range(3100)]\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n r[a] += b\r\n\r\nres = 0\r\ncan_grab_yesterday = 0\r\n\r\nfor day in range(0, 3100):\r\n res += min(can_grab_yesterday, v)\r\n can_grab_today = v - min(v, can_grab_yesterday)\r\n\r\n if r[day] != 0:\r\n res += min(can_grab_today, r[day])\r\n\r\n can_grab_yesterday = max(0, r[day] - can_grab_today)\r\n\r\nprint(res)\r\n", "n, v = [int(i) for i in input().split()]\r\na = [0] * n\r\nb = [0] * n\r\ndays1 = [0] * 3001\r\ndays2 = [0] * 3001\r\nfor i in range(n):\r\n a[i], b[i] = [int(j) for j in input().split()]\r\n days1[a[i] - 1] += b[i]\r\n days2[a[i]] += b[i]\r\nres = 0\r\nfor i in range(3001):\r\n left = max(0, v - days2[i])\r\n res += max(0, min(v, days2[i]))\r\n res += min(left, days1[i])\r\n if i != 3000:\r\n days2[i + 1] -= min(left, days1[i])\r\nprint(res)", "n, v = map(int, input().rstrip().split())\nli = [0] * (3002)\nt = 0\nfor i in range(n):\n a, b = map(int, input().rstrip().split())\n li[a] += b\nfor i in range(1, 3002):\n x = min(v, li[i - 1])\n y = min(li[i], v - x)\n li[i - 1] -= x\n li[i] -= y\n t += x + y\nprint(t)", "read = lambda: map(int, input().split())\r\nn, v = read()\r\nN = 3002\r\np = [0] * N\r\nfor i in range(n):\r\n a, b = read()\r\n p[a] += b\r\nans = 0\r\nrem = 0\r\nfor i in range(1, N):\r\n cur = min(v, rem + p[i])\r\n ans += cur\r\n if rem >= v: rem = p[i]\r\n else: rem = max(0, p[i] - (v - rem))\r\nprint(ans)", "n, v = map(int, input().split())\r\ns, t = 0, [0] * 3002\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n t[a] += b\r\nfor d in range(1, 3002):\r\n ds = min(t[d - 1], v)\r\n s += ds\r\n ds = min(t[d], v - ds)\r\n t[d] -= ds\r\n s += ds\r\nprint(s)", "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,v=f()\r\nl=[0]*3003\r\nfor _ in range(n):\r\n a,b=f()\r\n l[a]+=b\r\nfromprevDay=0\r\ncurrDay=0\r\ntemp=0\r\nans=0\r\nfor i in range(1,3002):\r\n currDay=l[i]\r\n if fromprevDay+currDay<=v:\r\n ans+=fromprevDay+currDay\r\n fromprevDay=0\r\n elif fromprevDay>=v:\r\n ans+=v\r\n fromprevDay=currDay\r\n else:\r\n ans+=v\r\n temp=v-fromprevDay\r\n fromprevDay=currDay-temp\r\nprint(ans)", "n,v=map(int,input().split())\r\ntrees=[0]*3002\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n trees[a]+=b\r\nans=0\r\nprev=0\r\nfor i in range(1,len(trees)):\r\n available=min(v,prev+trees[i])\r\n ans+=available\r\n if prev>=v:\r\n prev=trees[i]\r\n else:\r\n prev=max(0,trees[i]-(v-prev))\r\nprint(ans)\r\n\r\n", "def money(a, lst):\r\n ans=0\r\n tmp=0\r\n ln=len(lst)\r\n for i in range(1,4000):\r\n cur=0\r\n for j in range(ln):\r\n if lst[j][0]==i:\r\n cur+=lst[j][1]\r\n if cur+tmp<=a:\r\n ans+=cur+tmp\r\n tmp=0\r\n else:\r\n ans+=a\r\n b=a-tmp\r\n b=max(b,0)\r\n tmp=cur-b\r\n return ans\r\n\r\nn,a=map(int,input().split())\r\nlst=[]\r\nfor i in range(n):\r\n d,m=map(int,input().split())\r\n lst.append([d,m])\r\nprint(money(a,lst))\r\n", "n,v=map(int,input().split())\r\nd=[0]*(3003)\r\na=[]\r\nj=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n d[a]+=b\r\nans=0\r\nx=0\r\nfor i in range(1,3002):\r\n if d[i]+x<v:\r\n ans+=d[i]+x\r\n x=0\r\n else:\r\n t=max(v-x,0)\r\n x=d[i]-t\r\n ans+=v\r\n\r\n\r\n \r\nprint(ans)", "n,v=map(int,input().split())\na=[]\nfor x in range(n):\n p=list(map(int,input().split()))\n a.append((p[0],p[1]))\na.sort()\narr=[0]*(4000)\nfor x in range(n):\n arr[a[x][0]]+=a[x][1]\n tmp=max(0,arr[a[x][0]]-v)\n arr[a[x][0]]-=tmp\n arr[a[x][0]+1]+=tmp\n arr[a[x][0]+1]=min(arr[a[x][0]+1],v)\nprint(sum(arr))", "n, v = map(int, input().split())\r\nT = 3010\r\na = [[] for i in range(T)]\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a[x].append([y, 1])\r\n\r\n \r\nans = 0\r\nfor i in range(T):\r\n a[i] = a[i][::-1]\r\n j = 0\r\n cur = v\r\n while j < len(a[i]):\r\n if a[i][j][0] > cur:\r\n ans += cur\r\n if a[i][j][1] == 0:\r\n j += 1 \r\n else:\r\n a[i][j][0] -= cur\r\n break\r\n else:\r\n ans += a[i][j][0]\r\n cur -= a[i][j][0]\r\n j += 1\r\n for t in range(j, len(a[i])):\r\n if a[i][t][1] != 0:\r\n a[i + 1].append([a[i][t][0], 0]) \r\n \r\n \r\nprint(ans)", "n,v = map(int, input().split())\r\narr = [0]*3002\r\n\r\nfor _ in range(n):\r\n a,b = map(int, input().split())\r\n arr[a] += b\r\n\r\nx = v\r\nans = 0\r\nprev = 0\r\nfor i in range(1,3002):\r\n x = max(x-prev,0)\r\n ans += (v-x)\r\n if arr[i]<=x:\r\n ans += arr[i]\r\n prev = 0\r\n else:\r\n ans += x\r\n prev = arr[i]-x\r\n x = v\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n", "n,v = [int(i) for i in input().split()]\nf = 0\nl = [0]*3002\nfor i in range(n):\n a,b = [int(i) for i in input().split()]\n l[a] += b\n\nfor i in range(1,3002):\n pick = min(v,l[i-1])\n l[i-1] -= pick\n pick2 = min(v-pick,l[i])\n l[i] -= pick2\n f += pick + pick2\n\nprint(f)\n", "n, v = map(int, input().split())\n\ng = [0 for x in range(3002)]\n\nfor i in range(n):\n a, b = map(int, input().split())\n g[a]+=(b)\n\nr = 0\n\nfor i in range(1, 3002):\n c = v\n r += min(c, max(g[i-1], 0))\n c -= max(g[i-1], 0)\n if c > 0:\n r += min(c, g[i])\n g[i] = max(g[i]-c, 0)\n\n\nprint(r)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, v = map(int, input().split())\r\nd = [0]*3003\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n d[a] += b\r\nc = 0\r\ny = 0\r\nfor i in range(1, 3002):\r\n x = min(v, d[i])\r\n c += x\r\n d[i] -= max(y, x)\r\n y = max(d[i], 0)\r\n d[i+1] += y\r\n\r\nprint(c)", "import math\r\nn,v = map(int, input().strip().split(' '))\r\nl=[]\r\nfor j in range(n):\r\n a,b = map(int,input().strip().split(' '))\r\n l.append([a,b])\r\nl.sort()\r\nl1=[0]*(l[-1][0]+1)\r\nfor j in range(len(l)):\r\n if l1[l[j][0]-1]+l[j][1]<=v:\r\n l1[l[j][0]-1]+=l[j][1]\r\n else:\r\n p1=v-l1[l[j][0]-1]\r\n l1[l[j][0]-1]=v\r\n p2=l[j][1]-p1\r\n if l1[l[j][0]]+p2<=v:\r\n l1[l[j][0]]+=p2\r\n else:\r\n l1[l[j][0]]=v\r\n\r\nprint(sum(l1))\r\n ", "R = lambda:list(map(int, input().split()))\r\nn, v = R()\r\nM = 3001\r\nx = [0] * M\r\nfor i in range(n):\r\n a, b = R()\r\n x[a - 1] += b\r\ny = [0] * M\r\ns = 0\r\nfor i in range(M):\r\n a = min(v, y[i])\r\n b = min(v - a, x[i])\r\n s += a + b\r\n if i < M - 1:\r\n y[i + 1] = x[i] - b\r\nprint(s)", "n,v = map(int,input().split(' '))\r\nresult,day,trees = 0,1,{}\r\nfor i in range(n):\r\n days,fruits = map(int,input().split(' ')) \r\n if days in trees:\r\n trees[days] += fruits\r\n else: trees[days] = fruits\r\nwhile day <= 3001:\r\n to_collect = v\r\n if day - 1 in trees:\r\n x = trees[day - 1]\r\n trees[day - 1] = max(0,trees[day - 1] - v)\r\n to_collect = max(0,v - x)\r\n result += v - to_collect\r\n if day in trees:\r\n f = to_collect; t = trees[day]\r\n trees[day] = max(0,trees[day] - to_collect)\r\n to_collect = max(0,to_collect - t)\r\n result += f - to_collect\r\n day += 1\r\nprint(result)\r\n\r\n\r\n'''\r\nnowy koncept: hash mapa {dzien: suma mozliwa do zebrania} O(n) z czerwonoczarnym O(nlogn)\r\ni idziesz po dniach\r\nwhile dzien <= max_dzien na zbieranie + 1 \r\n if dzien - 1 in mapa: \r\n bierzemy/odlcziamy\r\n i z aktualnego bierzemy odliczamy ( O ile jeszcze możemy)\r\n dzien++\r\ntaka mapa ma prawo istnieć dlateog że w danym dniu i tak możemy zebrać max v. Nieważne z których drzew\r\nbędziemy zbierać w jednym dniu.\r\n\r\nO(nlogn + n)\r\nalgorytm greedy:\r\nmusimy zebrać jak najwięcej owoców każdego dnia, wybierając\r\nbierzemy najpierw pod uwagę te których nie będzie mozna zebrać potem.\r\n\r\ndays = 1\r\nsort()\r\nwhile :\r\n v -= arr[i][1]\r\n arr[i][1] -= (max - arr[i][1])\r\n if v == 0: days += 1\r\n\r\nzaczynamy od pierwszego dnia w którym możemy coś zebrać.\r\njeden dzien to zebranie v jabłek. (No chyba że będzie mniej jabłek niż maksymalnie możemy zebrać to\r\nwtedy wszystkie zbieramy w jeden dzień)\r\nTo nie jest tak że jak pójdziesz na jakieś inne drzewo to będziesz mógł zebrać więcej.\r\nZawsze masz limit v, dystrybujca się nie liczy. znajdź przykłąd w którym się liczy.\r\nv = 10\r\n1 20 \r\n1 20 \r\n1 20 \r\n2 50\r\nmax: 20\r\n\r\nv = 3\r\n1 5 \r\n2 3\r\n\r\nposortować dniami rosnąco pary? i doliczać po kolei z każdego drzewa += v \r\njeden dzien przerwy w zbieraniu oznacza reset (możemy zacząć zbierać od dnia 'a' znowu z pełnym v)\r\nStrategia: idź po kolei po dniach i zbieraj z drzewa póki jest dojrzałe. (przez a do a + 1)\r\nPotem dopiero następne. Jak wyzerujesz drzewo to idziesz na następne tego samego dnia jeśli możesz,\r\njak nie to następuje reset.\r\n\r\n1 20, 2 20, 3 20, 4 20, 5 20, 5 10\r\n1: 1 10, 2 20, 3 20, 4 20, 5 20, 5 10 - 10\r\n2: 1 0, 2 20, 3 20, 4 20, 5 20, 5 10 - 20\r\n3: 1 0, 2 10, 3 20, 4 20, 5 20, 5 10 - 30\r\n4: 1 0, 2 10, 3 10, 4 20, 5 20, 5 10 - 40\r\n5: 1 0, 2 10, 3 10, 4 10, 5 20, 5 10 - 50\r\n6: 1 0, 2 10, 3 10, 4 10, 5 10, 5 10 - 60\r\n7: koniec\r\n'''", "n,v=map(int, input().split())\r\nb=[0]*3002\r\nfor _ in range(n):\r\n a = list(map(int,input().split()))\r\n b[a[0]]+=a[1]\r\ns = 0\r\nfor i in range(1,3002):\r\n r=v\r\n t=min(r,b[i-1])\r\n s+=t\r\n r-=t\r\n b[i-1]-=t\r\n t=min(r, b[i])\r\n s+=t\r\n r-=t\r\n b[i]-=t\r\nprint(s)\r\n", "l=lambda :map(int,input().split())\r\nn,v=l()\r\nt={}\r\nfor _ in ' '*n:\r\n x,y=l()\r\n t[x]=t.get(x,0)+y\r\ns=0\r\nfor i in range(min(t),max(t)+2):\r\n us=v\r\n x=min(us,t.get(i-1,0))\r\n s+=x\r\n us-=x\r\n t[i-1]=t.get(i-1,0)-x\r\n x=min(us,t.get(i,0))\r\n s+=x\r\n t[i]=t.get(i,0)-x\r\nprint(s)", "N = 3005\nn, v = map(int, input().split())\nripe = [0] * N\nfor i in range(n):\n a, b = map(int, input().split())\n ripe[a] += b\nt = 0\nans = 0\nfor i in range(N):\n if ripe[i] + t <= v:\n ans += (ripe[i] + t)\n t = 0\n else:\n ans += min(t, v)\n ans += min(max(0, v - t), ripe[i])\n t = max(0, ripe[i] - max(0, v - t))\nprint(ans)\n\t \t \t \t\t \t \t \t \t\t\t\t\t\t", "n,v=map(int,input().split())\r\nlis=[0]*3005\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n lis[a]+=b\r\nans=0\r\nfor i in range(1,3005):\r\n pick=min(v,lis[i-1]+lis[i])\r\n lis[i]-=max(0,pick-lis[i-1])\r\n ans+=pick\r\nprint(ans)", "n, v = map(int, input().split())\r\nlst = [0] * 3002\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n lst[a] += b\r\n\r\nans = 0\r\nprev = 0\r\nfor i in range(1, len(lst)):\r\n available = min(v, prev + lst[i])\r\n ans += available\r\n if prev >= v:\r\n prev = lst[i]\r\n else:\r\n prev = max(0, lst[i] - (v - prev))\r\n\r\nprint(ans)", "from math import gcd\r\ndef take_input(s): #for integer inputs\r\n if s == 1: return int(input())\r\n return map(int, input().split())\r\n\r\nn, v = take_input(2)\r\nd = {0:0}\r\ndays = 1\r\nfor i in range(n):\r\n ai, bi = take_input(2)\r\n d[ai] = d.get(ai,0) + bi\r\n if ai > days:\r\n days = ai\r\nans = 0\r\nprev_day = 0\r\nfor i in range(1,days+2):\r\n day_lim = min(d.get(i-1,0),v)\r\n d[i-1] = d.get(i-1,0) - day_lim\r\n ans += day_lim\r\n\r\n if day_lim < v:\r\n prev_c = min(v - day_lim,d.get(i,0))\r\n d[i] = d.get(i,0) - prev_c\r\n ans += prev_c\r\nprint(ans)\r\n\r\n \r\n ", "'''input\r\n1 1\r\n1 1\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\nn,v = getints()\r\nd=[0 for i in range(3010)]\r\nfor i in range(n):\r\n\ta,b = getints()\r\n\td[a]+=b\r\nans = 0\r\nfor i in range(3010):\r\n\tif i==0: continue\r\n\tans += min(d[i-1], v)\r\n\tvv = v - min(d[i-1], v)\r\n\td[i-1] -= min(d[i-1], v)\r\n\tans += min(d[i], vv)\r\n\td[i] -= min(d[i], vv)\r\n\r\nprint(ans)", "def a():\t\n\tn, v = list(map(int, input().split(\" \")))\n\td = []\n\tfor i in range(n):\n\t\td.append(list(map(int, input().split(\" \"))))\n\td.sort()\n\n\tcur = 0\n\tnex = 0\n\tk = 0\n\tr = 0\n\tfor i in range(d[-1][0] + 2):\n\t\tnex = 0\n\t\tp = v\n\t\tif k != n:\n\t\t\twhile(d[k][0] < i):\n\t\t\t\tk += 1\n\t\t\t\tif k == n:\n\t\t\t\t\tbreak\n\t\tif k != n:\n\t\t\twhile(d[k][0] == i):\n\t\t\t\tnex += d[k][1]\n\t\t\t\tk += 1\n\t\t\t\tif k == n:\n\t\t\t\t\tbreak\n\t\tr += min(p, cur)\n\t\tp -= min(p, cur)\n\t\tr += min(p, nex)\n\t\tcur = nex - min(p, nex)\n\treturn r\n\nprint(a())\n\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn, v = map(int, input().split())\r\nls = [0] * 3005\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n ls[a] += b\r\nprev = 0\r\nans = 0\r\nfor i in range(1, 3005):\r\n curr = ls[i]\r\n if curr + prev <= v:\r\n ans += curr + prev\r\n curr = 0\r\n else:\r\n ans += v\r\n if prev < v:\r\n curr = curr + prev - v\r\n prev = curr\r\nprint(ans)\r\n", "n,v=map(int,input().split())\r\narr=[0 for i in range(3003)]\r\nfor i in range(n):\r\n x,a=map(int,input().split())\r\n arr[x]+=a\r\nans=0\r\nfor i in range(1,3003):\r\n left=v\r\n ans+=min(v,arr[i-1])\r\n left-=min(v,arr[i-1])\r\n ans+=min(left,arr[i])\r\n arr[i]-=min(left,arr[i])\r\nprint(ans)", "n, v = [int(x) for x in input().split(' ')]\r\na_dict = {}\r\nm = 0\r\np = 0\r\nfor tree in range(n):\r\n a, b = [int(x) for x in input().split(' ')]\r\n m = max(a, m)\r\n if a in a_dict.keys():\r\n a_dict[a] += b\r\n else:\r\n a_dict[a] = b\r\n\r\nfor day in range(m + 2):\r\n if day not in a_dict.keys():\r\n a_dict[day] = 0\r\n\r\n\r\nfor day in range(1, m + 2):\r\n\r\n y = min(v, a_dict[day - 1])\r\n a_dict[day - 1] -= y\r\n z = min(v - y, a_dict[day])\r\n a_dict[day] -= z\r\n\r\n p += z + y\r\n\r\nprint(p)", "n,v=map(int,input().split())\r\narr=[0]*3002\r\nfor h in range(n):\r\n a,b=map(int,input().split())\r\n arr[a]+=b\r\nans=0\r\nx=0\r\nfor i in range(1,3002):\r\n if x+arr[i]<=v:ans+=x+arr[i];x=0\r\n else:ans+=v;x=arr[i]-max(v-x,0)\r\nprint(ans)", "trees, collect = map(int, input().split())\r\ninfo = [0] * 3002\r\nfor x in range(trees):\r\n day, fruits = map(int, input().split())\r\n info[day] += fruits\r\nprev = 0\r\ncnt = 0\r\nfor x in range(1, 3002):\r\n temp = collect\r\n cnt += min(prev, collect)\r\n temp = collect - min(prev, collect)\r\n current = min(info[x], temp)\r\n cnt += current\r\n prev = info[x] - current\r\nprint(cnt)", "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 Valera_and_Fruits():\r\n n,v = invr()\r\n \r\n num_fruits_acc_to_day_dict = {}\r\n\r\n for i in range(n):\r\n ai,bi = invr()\r\n if ai not in num_fruits_acc_to_day_dict.keys():\r\n num_fruits_acc_to_day_dict[ai] = bi\r\n else:\r\n num_fruits_acc_to_day_dict[ai] += bi \r\n\r\n prev_day_remaining_fruits = 0\r\n total_collection = 0\r\n\r\n for day in range(1,3002): #day can go from 1 to 3001 and on 3001, 3000th remaining fruits can be collected\r\n if day not in num_fruits_acc_to_day_dict.keys():\r\n space_in_bag = v \r\n \r\n if prev_day_remaining_fruits <= space_in_bag:\r\n fruits_collected = prev_day_remaining_fruits\r\n space_in_bag -= fruits_collected\r\n \r\n else:\r\n fruits_collected = space_in_bag\r\n space_in_bag = 0\r\n \r\n prev_day_remaining_fruits = 0\r\n total_collection += fruits_collected\r\n \r\n else:\r\n fruits = num_fruits_acc_to_day_dict[day]\r\n space_in_bag = v\r\n\r\n if prev_day_remaining_fruits <= space_in_bag: \r\n fruits_collected = prev_day_remaining_fruits\r\n space_in_bag -= fruits_collected\r\n\r\n else:\r\n fruits_collected = space_in_bag\r\n space_in_bag = 0 \r\n\r\n if fruits <= space_in_bag:\r\n fruits_collected += fruits\r\n prev_day_remaining_fruits = 0\r\n else:\r\n fruits_collected += space_in_bag\r\n prev_day_remaining_fruits = fruits - space_in_bag\r\n \r\n total_collection += fruits_collected\r\n\r\n \r\n print(total_collection)\r\n return\r\n\r\nValera_and_Fruits() ", "import sys\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\nA = [0]*3005\r\nn, v = map(int,minp().split())\r\nfor i in range(n):\r\n\ta, b = map(int, minp().split())\r\n\tA[a] += b\r\n\r\nr = 0\r\nfor i in range(1,len(A)-1):\r\n\tz = min(v, A[i-1])\r\n\tA[i-1] -= z\r\n\tw = min(v-z, A[i])\r\n\tA[i] -= w\r\n\tr += z + w\r\nprint(r)" ]

[ "from sys import stdin, stdout, exit\r\n \r\nn, m, k = map(int, stdin.readline().split())\r\nd = 1 if stdin.readline()[6] == 'l' else -1\r\nm = 1 if m < k else n\r\n \r\nfor i, c in enumerate(stdin.readline(), 1):\r\n if c == '0':\r\n if k == 1: k, d = 2, 1\r\n elif k == n: k, d = n - 1, -1\r\n else: k += d\r\n if m == k:\r\n stdout.write('Controller ' + str(i))\r\n exit(0)\r\n else:\r\n if k == 1: k, d, m = 2, 1, 1\r\n elif k == n: k, d, m = n - 1, -1, n\r\n elif d == 1:\r\n k += 1\r\n m = 1\r\n else:\r\n k -= 1\r\n m = n\r\n \r\nstdout.write('Stowaway')", "# вводим кол-во вагонов, начальное положение зайца и контролера\r\nn, z1, k1 = map(int, input().split())\r\nz1 -= 1\r\nk1 -= 1\r\n\r\n# вводим направление\r\ns = input()\r\n\r\n# направление контролера\r\nif (s == 'to head'):\r\n napr = -1\r\nelse:\r\n napr = 1\r\n\r\n# вводим состояние электрички\r\ns = input()\r\n\r\n# условие проверки встречи зайца и контролера\r\nfor i in range(len(s)):\r\n # если заяц и контролер в одном вагоне\r\n if (k1 == z1):\r\n print('Controller', i)\r\n exit(0)\r\n \r\n # если электричка движется\r\n if (s[i] == '0'):\r\n # если контролер ближе к хвосту и заяц не в голове, заяц ходит ближе к голове\r\n if (k1 > z1 and z1 != 0):\r\n z1 -= 1\r\n # если заяц ближе к хвосту, но не в конце, заяц ходит ближе к хвосту\r\n elif (k1 < z1 and z1 != n - 1):\r\n z1 += 1\r\n # шаг контролера\r\n k1 += napr\r\n \r\n # если контролер дошел до края поезда, поменять направление\r\n if (k1 == 0 or k1 == n - 1):\r\n napr = -napr\r\n else:\r\n # шаг контролера\r\n k1 += napr\r\n\r\n # если контролер дошел до края поезда, поменять направление\r\n if (k1 == 0 or k1 == n - 1):\r\n napr = -napr\r\n\r\n # если контролер в голове, заяц в хвосте\r\n if (k1 == 0):\r\n z1 = n - 1\r\n # если контролер в хвосте, заяц в голове\r\n elif (k1 == n - 1):\r\n z1 = 0\r\n # если направление к хвосту и контролер не в голове, заяц в голове\r\n elif (napr == 1 and k1 != 0):\r\n z1 = 0\r\n else:\r\n z1 = n - 1\r\n # если заяц и контролер в одном вагоне\r\n if (k1 == z1):\r\n print('Controller', i + 1)\r\n exit(0)\r\n\r\nprint('Stowaway')\r\n\r\n", "R = lambda: map(int, input().split())\r\nn, k, m = R()\r\ndir = 'to tail' == input()\r\nfor t, x in enumerate(map(int, input())):\r\n if m == 1:\r\n dir = 1\r\n elif m == n:\r\n dir = 0\r\n if not x:\r\n k = min(n, k + 1) if m < k else max(1, k - 1)\r\n else:\r\n k = 1 if dir else n\r\n m = m + 1 if dir else m - 1\r\n if k == m:\r\n print('Controller ' + str(t + 1))\r\n exit(0)\r\nprint('Stowaway')", "import sys\n\n#input functions\nreadint = lambda: int(sys.stdin.readline())\nreadints = lambda: map(int,sys.stdin.readline().split())\nreadar = lambda: list(map(int,sys.stdin.readline().split()))\nflush = lambda: sys.stdout.flush()\n\n\ndef findoptimal(n,m,k,rev,x): #either 1 or n\n if x == 1: #stop case\n if k == 1: return n\n if k == n: return 1\n if rev: return n\n else: return 1\n else: #move case\n if m < k: return 1\n else: return n\n\ndef sim(n,m,k,rev,s):\n #change direction if needed\n if k == 1: rev = False\n if k == n: rev = True\n for i in range(len(s)):\n if s[i] == \"1\": #stop\n #move conductor\n if rev: k -= 1\n else: k += 1\n m = findoptimal(n,m,k,rev,1)\n else: #move\n #determine stowaway move\n d = findoptimal(n,m,k,rev,0)\n if m != d:\n if d > m: m += 1\n else: m -= 1\n #move conductor\n if rev: k -= 1\n else: k += 1\n #check if found\n if m == k: return i+1\n #change direction if needed\n if k == 1: rev = False\n if k == n: rev = True\n return -1\n \n\nn,m,k = readints()\na = input()\ns = input()\nrev = False\nif a == \"to head\": rev = True\nans = sim(n,m,k,rev,s)\nif ans == -1: print(\"Stowaway\")\nelse: print(\"Controller\",ans)\n\n \t\t \t \t\t\t\t \t \t \t\t \t \t \t \t\t", "n, rider, cop = map(int, input().split())\nrider, cop = rider - 1, cop - 1\nif input().strip() == 'to head':\n cop_dir = -1\nelse:\n cop_dir = 1\nfor pos, ch in enumerate(input().strip()):\n #print(pos, ch, rider, cop, cop_dir)\n if ch == '1':\n rider = -1\n else:\n if cop_dir == -1 and rider < cop:\n rider = max(0, rider - 1)\n elif cop_dir == 1 and rider > cop:\n rider = min(n - 1, rider + 1)\n cop += cop_dir\n if cop == rider:\n print('Controller %d' % (pos + 1))\n import sys; sys.exit()\n if cop == 0:\n cop_dir = 1\n elif cop == n - 1:\n cop_dir = -1\n if ch == '1':\n if cop_dir == -1:\n if cop == n - 1:\n rider = 0\n else:\n rider = n - 1\n else:\n if cop == 0:\n rider = n - 1\n else:\n rider = 0\nprint('Stowaway')\n", "J = lambda: map(int, input().split())\r\nv, y, z = J()\r\ndir = 'to tail' == input()\r\nfor t, x in enumerate(map(int, input())):\r\n if z == 1:\r\n dir = 1\r\n elif z == v:\r\n dir = 0\r\n if not x:\r\n y = min(v, y + 1) if z < y else max(1, y - 1)\r\n else:\r\n y = 1 if dir else v\r\n z = z + 1 if dir else z - 1\r\n if y == z:\r\n print('Controller ' + str(t + 1))\r\n exit(0)\r\nprint('Stowaway')\r\n", "def stowaway_controller_function(steps,n,stowaway_pos,controller_pos, dirr): # Зайца можно поймать только в момент езды электрички\r\n step_num = 0\r\n for step in steps: \r\n step_num += 1\r\n if int(step) == 0: # Электричка едет \r\n # Ход зайца он просто пытается уйти насколько можно дальше от контроллера\r\n if controller_pos > stowaway_pos and stowaway_pos > 1: # Если контроллер ближе к концу поезда чем заяц, тогда заяц идет в самое начало\r\n stowaway_pos-=1\r\n elif controller_pos < stowaway_pos and stowaway_pos < n: # Если контроллер ближе к началу поезда, тогда заяц идет в конец\r\n stowaway_pos+=1\r\n # Если заяц был в самом первом или самом последнем он уже никуда и не идет ему там выгодно \r\n\r\n #Ход кондуктора\r\n if controller_pos+dirr <= n and controller_pos+dirr >= 1: # Он просто гоняет пока не упирается, ему по преколу\r\n controller_pos+=dirr\r\n else:\r\n dirr*=-1 #Тут он типо такой меняет дирекшен \r\n controller_pos+=dirr\r\n\r\n if controller_pos == stowaway_pos: #Капец зайцу крч \r\n return \"Controller \" + str(step_num)\r\n \r\n else: # Электричка стоит, когда электричка стоит зайца как не возможно поймать, он сам выбирает куда зайти\r\n #Представим что тут заяц вышел и как бы ходит кондуктор и на основе его хода заяц зайдет в какой-то вагон \r\n if step_num == len(steps):\r\n return \"Stowaway\" # Ходы кончились, заяц вышел и доехал ну и больше заходить не будет, он и победил \r\n #Ход кондуктора\r\n if controller_pos+dirr <= n and controller_pos+dirr >= 1: # Он просто гоняет пока не упирается, ему по преколу\r\n controller_pos+=dirr\r\n else:\r\n dirr*=-1 #Тут он типо такой меняет дирекшен \r\n controller_pos+=dirr\r\n # Ход зайца (выбор выгодного вагона)\r\n if dirr > 0 and controller_pos!=1: # Кондуктор идет к концу вагона\r\n stowaway_pos = 1 # Заяц выбирает первый вагон \r\n elif dirr > 0 and controller_pos==1: # Кондуктор идет к концу, но сейчас он в первом вагоне \r\n stowaway_pos = n\r\n elif dirr < 0 and controller_pos!=n:\r\n stowaway_pos = n\r\n elif dirr < 0 and controller_pos==n:\r\n stowaway_pos = 1\r\n# print(\"Заяц: \", stowaway_pos, \"Контроллер: \", controller_pos, dirr, \"Номер хода: \", step_num, step)\r\nn, m, k = input().split()\r\nn, m, k = int(n), int(m), int(k)\r\ndirection = input()\r\na = list(input())\r\nif direction == \"to head\":\r\n dirr = -1\r\nelse: \r\n dirr = 1\r\nprint(stowaway_controller_function(a,n,m,k,dirr))\r\n\r\n " ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef suffix_array(s):\r\n l = len(s)\r\n x = [[] for _ in range(222)]\r\n for i in range(l):\r\n x[s[i]].append(i)\r\n y = []\r\n z = [0]\r\n for x0 in x:\r\n for i in x0:\r\n y.append(i)\r\n z.append(len(y))\r\n u = list(z)\r\n p = 1\r\n for _ in range((l - 1).bit_length()):\r\n y0, s0, z0 = [0] * l, [0] * l, [0]\r\n for i in range(len(z) - 1):\r\n z1, z2 = z[i], z[i + 1]\r\n k = z1\r\n for j in range(z1, z2):\r\n if y[j] - p >= 0:\r\n k = j\r\n break\r\n for _ in range(z2 - z1):\r\n j = s[(y[k] - p) % l]\r\n y0[u[j]] = (y[k] - p) % l\r\n u[j] += 1\r\n k += 1\r\n if k == z2:\r\n k = z1\r\n i, u, v, c = 0, s[y0[0]], s[(y0[0] + p) % l], 0\r\n for j in y0:\r\n if u ^ s[j] or v ^ s[(j + p) % l]:\r\n i += 1\r\n u, v = s[j], s[(j + p) % l]\r\n z0.append(c)\r\n c += 1\r\n s0[j] = i\r\n z0.append(l)\r\n u = list(z0)\r\n p *= 2\r\n y, s, z = y0, s0, z0\r\n if len(z) > l:\r\n break\r\n return y, s\r\n\r\ndef lcp_array(s, sa):\r\n l = len(s)\r\n lcp, rank = [0] * l, [0] * l\r\n for i in range(l):\r\n rank[sa[i]] = i\r\n v = 0\r\n for i in range(l):\r\n if not rank[i]:\r\n continue\r\n j = sa[rank[i] - 1]\r\n u = min(i, j)\r\n while u + v < l and s[i + v] == s[j + v]:\r\n v += 1\r\n lcp[rank[i]] = v\r\n v = max(v - 1, 0)\r\n return lcp\r\n\r\ndef largest_rectangle(a, n):\r\n ans = 0\r\n st = []\r\n l = []\r\n for i in range(n):\r\n ai = a[i]\r\n if not st or st[-1] ^ ai:\r\n j = i\r\n while st and st[-1] > ai:\r\n k = st.pop()\r\n j = l.pop()\r\n ans = max(ans, (i - j + 1) * k)\r\n if not st or st[-1] ^ ai:\r\n st.append(ai)\r\n l.append(j)\r\n for i in range(len(st)):\r\n ans = max(ans, (n - l[i] + 1) * st[i])\r\n return ans\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\ns.reverse()\r\ns.append(0)\r\nt = list(input().rstrip())\r\nt.reverse()\r\nif min(t) & 1:\r\n ans = 0\r\n print(ans)\r\n exit()\r\nsa, p = suffix_array(list(s))\r\nlcp = lcp_array(s, sa)\r\nu = [1] * n\r\nfor i in range(1, n + 1):\r\n if t[sa[i]] & 1:\r\n u[i - 1] = 0\r\nans = n\r\nfor i in t:\r\n if not i & 1:\r\n break\r\n ans -= 1\r\nc = n\r\nv = []\r\nfor i, j in zip(lcp[1:], u):\r\n c = min(c, i)\r\n if j:\r\n v.append(c)\r\n c = n\r\nans = max(ans, largest_rectangle(v, len(v)))\r\nprint(ans)" ]

[ "#!/usr/bin/env python3\r\n\r\nimport itertools\r\nimport collections\r\n\r\n# Read input strings\r\ns1 = input()\r\ns2 = input()\r\n\r\n# Read evolution rules, use a mapping from the 2 target characters to the source character\r\nrules = collections.defaultdict(set)\r\nn = int(input())\r\nfor i in range(n):\r\n rule = input()\r\n target = rule[-2:]\r\n source = rule[0]\r\n rules[target].add(source)\r\n\r\ndef substrings_of_precise_length(s, l):\r\n # Generator for all substrings of s that are of length l \r\n for start_pos in range(len(s)-l+1):\r\n yield s[start_pos:start_pos+l]\r\n\r\ndef substrings_of_minimum_length(s, minlen):\r\n # Generator for all substrings of s that are of length l or larger, in order from short to long length\r\n return itertools.chain.from_iterable(substrings_of_precise_length(s,l) for l in range(minlen, len(s)+1))\r\n\r\ndef partitions_of_string(s):\r\n # Generator for all possible pairs (a,b) such that a+b = c where a and b are not empty strings\r\n for l1 in range(1, len(s)):\r\n yield (s[:l1], s[l1:])\r\n\r\n# Dictionary mapping strings onto the set of single characters from which those strings could evolve\r\nancestors = collections.defaultdict(set)\r\n\r\ndef update_ancestors(ancestors, rules, s):\r\n # Update the ancestor dictionary for string s\r\n # O(len(s)**3 * len(rules))\r\n \r\n # All single characters can \"evolve\" from a single character\r\n for c in s:\r\n ancestors[c].add(c)\r\n\r\n # Examine all substrings of s, in order of increasing length\r\n for sub in substrings_of_minimum_length(s, 2):\r\n # Examine any way the substring can be created from two seperate, smaller strings\r\n for (sub1, sub2) in partitions_of_string(sub):\r\n # Check all rules to see if the two substrings can evolve from a single character by using that rule\r\n for target, sources in rules.items():\r\n if (target[0] in ancestors[sub1]) and (target[1] in ancestors[sub2]):\r\n ancestors[sub].update(sources)\r\n\r\n# Update the ancestors based on s1 and s2\r\nupdate_ancestors(ancestors, rules, s1)\r\nupdate_ancestors(ancestors, rules, s2)\r\n\r\ndef prefixes(s):\r\n # Generator for all non-empty prefixes of s, in order of increasing length\r\n for l in range(1, len(s)+1):\r\n yield s[:l]\r\n\r\ndef determine_shortest_common_ancestor(ancestors, s1, s2):\r\n # Returns the length of the shortest common ancestor of string s1 and s2, or float('inf') if there is no common ancestor.\r\n # The ancestors is a dictionary that contains for every substring of s1 and s2 the set of single characters from which that substring can evolve\r\n # O(len(s1)**2 * len(s2)**2 * 26 )\r\n\r\n # Dictionary mapping pairs of strings onto the length of their shortest common ancestor\r\n shortest_common_ancestor = collections.defaultdict(lambda:float('inf'))\r\n\r\n # Check every possible combinations of prefixes of s1 and s2\r\n for (pre1,pre2) in itertools.product(prefixes(s1), prefixes(s2)):\r\n # If both prefixes have an overlap in the single character from which they can evolve, then the shortest common ancestor is 1 letter\r\n if not ancestors[pre1].isdisjoint(ancestors[pre2]):\r\n shortest_common_ancestor[(pre1,pre2)] = 1\r\n\r\n # Check all possible combinations of partitions of pre1 and pre2\r\n temp = shortest_common_ancestor[(pre1, pre2)]\r\n for ((sub1a,sub1b),(sub2a,sub2b)) in itertools.product(partitions_of_string(pre1), partitions_of_string(pre2)):\r\n if not ancestors[sub1b].isdisjoint(ancestors[sub2b]):\r\n # sub1b and sub2b can evolve from the same character, so the shortest common ancestor of sub1a+sub1b and sub2a+sub2b is\r\n # never longer than the shortest common ancestor of sub1a and sub2a plus the one letter from which sub1b and sub2b can evolve\r\n temp = min(temp, shortest_common_ancestor[(sub1a, sub2a)] + 1)\r\n shortest_common_ancestor[(pre1, pre2)] = temp\r\n\r\n return shortest_common_ancestor[(s1, s2)]\r\n\r\nanswer = determine_shortest_common_ancestor(ancestors, s1, s2)\r\nif (answer == float('inf')):\r\n print(-1)\r\nelse:\r\n print(answer)\r\n", "# 49 e - zeyuanxy\r\nimport string\r\n \r\ndef get_pos(s, rule):\r\n dp = set()\r\n for i in range(len(s), 0, -1):\r\n dp.add((i, i, s[i - 1]))\r\n for j in range(i + 1, len(s) + 1):\r\n for k in range(i, j):\r\n for r in rule:\r\n if (i, k, r[0]) in dp and (k + 1, j, r[1]) in dp:\r\n dp.add((i, j, r[2]))\r\n p = {}\r\n for i, j, c in dp:\r\n if (i, c) in p:\r\n p[i, c].add(j)\r\n else:\r\n p[i, c] = set([j])\r\n return p\r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n s1 = input()\r\n s2 = input()\r\n n = int(input())\r\n rule = []\r\n for _ in range(n):\r\n line = input()\r\n rule.append(line[3:] + line[0])\r\n \r\n p1 = get_pos(s1, rule)\r\n p2 = get_pos(s2, rule)\r\n \r\n dp = {}\r\n dp[0, 0] = 0\r\n for i in range(len(s1)):\r\n for j in range(len(s2)):\r\n if (i, j) in dp:\r\n for c in list(string.ascii_lowercase):\r\n if (i + 1, c) in p1 and (j + 1, c) in p2:\r\n for ii in p1[i + 1, c]:\r\n for jj in p2[j + 1, c]:\r\n if (ii, jj) in dp:\r\n dp[ii, jj] = min(dp[ii, jj], dp[i, j] + 1)\r\n else:\r\n dp[ii, jj] = dp[i, j] + 1\r\n if ii == len(s1) and jj == len(s2) and dp[ii, jj] == 1:\r\n print(1)\r\n exit(0)\r\n \r\n \r\n if (len(s1), len(s2)) in dp:\r\n print(dp[len(s1), len(s2)])\r\n else:\r\n print(-1)\r\n " ]

[ "from copy import deepcopy\r\n\r\n\r\nclass Digit(object):\r\n def __init__(self, _cost, _value):\r\n self.cost = _cost\r\n self.value = _value\r\n\r\n\r\ndef main():\r\n v = int(input())\r\n a = list(map(int, input().split()))\r\n a = tuple(Digit(cost, digit+1) for digit, cost in enumerate(a))\r\n low_digit = deepcopy(min(a, key=lambda digit: digit.cost*10 - digit.value))\r\n\r\n# print(\"low_digit.cost : \",low_digit.cost,\" low_digit.value : \",low_digit.value)\r\n\r\n if low_digit.cost > v:\r\n print(-1)\r\n return\r\n\r\n digits = v // low_digit.cost\r\n v -= digits * low_digit.cost\r\n for i in range(9):\r\n a[i].cost -= low_digit.cost\r\n# print(\"i : \",i,\" a[i].cost : \",a[i].cost)\r\n low_digit.cost = 0\r\n\r\n# print(\"low_digit.cost : \",low_digit.cost,\"low_digit.value : \",low_digit.value,\" digits : \",digits,\" v : \",v)\r\n \r\n \r\n for better in reversed(a):\r\n if better.cost > 0 and better.value > low_digit.value:\r\n count = v // better.cost\r\n v -= count * better.cost\r\n digits -= count\r\n print(str(better.value) * count, end='')\r\n print(str(low_digit.value) * digits)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = min(a)\r\ni = 8 \r\nwhile(i >= 0):\r\n if(a[i] == m):\r\n break \r\n i -= 1 \r\nif(m > n):\r\n print(-1)\r\n exit()\r\ns = list(n // m * str(i + 1))\r\nn = n % m\r\nfor j in range(len(s)):\r\n for k in range(8, i, -1):\r\n if(n + m >= a[k]):\r\n s[j] = str(k + 1)\r\n n = n + m - a[k] \r\n break \r\nprint(''.join(s))", "import collections\r\nimport heapq\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\nfrom io import BytesIO, IOBase\r\nimport os\r\n######################################################################################\r\n#--------------------------------------funs here-------------------------------------#\r\n######################################################################################\r\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\r\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\r\ndef inp(): return int(sys.stdin.readline())\r\ndef instr(): return sys.stdin.readline().strip()\r\ndef words(): return [i for i in sys.stdin.readline().strip().split()]\r\ndef chars(): return [i for i in sys.stdin.readline().strip()]\r\n######################################################################################\r\n#--------------------------------------code here-------------------------------------#\r\n######################################################################################\r\n\r\n\r\ndef solve():\r\n v = inp()\r\n l = values()\r\n amount = min(l)\r\n for i in range(8,-1,-1):\r\n if l[i]==amount:unit=i;break\r\n if v < amount:\r\n print(-1) ;return \r\n rem = v-(v//amount)*amount\r\n s=[0]*9\r\n s[unit]+=(v//amount)\r\n for i in range(8,unit,-1):\r\n while l[i]-amount<=rem:\r\n s[i]+=1;s[unit]-=1\r\n rem-=l[i]-amount\r\n ss=''\r\n for i in range(8,-1,-1):\r\n ss+=s[i] *str(i+1)\r\n print(ss)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(inp()):\r\n (solve())\r\n", "import bisect\nimport sys\nimport math\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_string(): return sys.stdin.readline().strip()\ndef get_int(): return int(sys.stdin.readline().strip())\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\n\n\n# Output for list\n# sys.stdout.write(\" \".join(map(str, final)) + \"\\n\")\n\n# Output for int or str\n# sys.stdout.write(str(best) + \"\\n\")\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\ndef solve():\n v = get_int()\n arr = get_list()\n\n l = v // min(arr)\n\n if l == 0:\n print(-1)\n return\n\n least = min(arr)\n req = None\n for i in range(8, -1, -1):\n if arr[i] == least:\n req = i + 1\n break\n\n res = [str(req) for i in range(l)]\n v -= l*least\n\n if v == 0:\n ans = ''.join(res)\n print(ans)\n return\n \n i = 0\n while v > 0 and i < len(res):\n v += least\n flag = 0\n for ele in range(9, req, -1):\n if v >= arr[ele-1]:\n v -= arr[ele-1]\n res[i] = str(ele)\n flag = 1\n break\n \n if flag == 0:\n break\n\n i += 1\n \n ans = ''.join(res)\n print(ans)\n return\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nsolve()\n", "v=int(input())\ncc=[int(x) for x in input().split(' ')]\n# cc=[]\n# for d in z:\n# cc.append(d)\nl,a,f,q,n,m=0,0,0,0,9,10000000\nans=''\nfor i in range(9):\n if cc[i]<=m:\n m,a=cc[i],i\nl=v//cc[a]\nv-=l*cc[a]\nif l==0:\n print(-1)\n f=1\nres=l*str(a+1)\nif f==0:\n l=len(res)\n for i in range(l):\n a=int(res[i])\n for j in range(9,a,-1):\n if cc[j-1]<=v+cc[a-1]:\n v+=cc[a-1]\n v-=cc[j-1]\n res=res[0:i]+str(j)+res[i+1:]\n break\n print(res)\n \n \n \n \n \n \n \n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=a[0]\r\nd=1\r\nfor i in range(9):\r\n\tif a[i]<=m:\r\n\t\tm=a[i]\r\n\t\td=i+1\r\nif m>n:\r\n\tprint(-1)\r\n\texit()\r\nans=list(str(d)*(n//m))\r\nrem=n-m*(n//m)\r\nfor i in range(len(ans)):\r\n\tif rem<=0:\r\n\t\tbreak\r\n\tfor j in range(8,d-1,-1):\r\n\t\tif a[j]-a[d-1]<=rem:\r\n\t\t\tans[i]=str(j+1)\r\n\t\t\trem-=a[j]-a[d-1]\r\n\t\t\tbreak\r\n\r\nprint(''.join(ans))\r\n", "import sys\r\nfrom bisect import bisect_left,bisect_right\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque\r\nfrom functools import cache\r\nfrom heapq import heappop,heappush,heapify\r\nfrom itertools import permutations, accumulate\r\nfrom math import lcm,gcd,sqrt,ceil,comb\r\n\r\ntoBin=lambda x:bin(x).replace(\"0b\",\"\")\r\ninf=float(\"inf\");DIRS=[[1,0],[-1,0],[0,1],[0,-1]];CHARS=\"abcdefghijklmnopqrstuvwxyz\"\r\nMOD=10**9+7;N=300010;fac=[1]*N;invfac=[1]*N #Fill out N to calculate combinations\r\nfor i in range(2,N):fac[i]=fac[i-1]*i%MOD\r\ninvfac[N-1]=pow(fac[N-1],MOD-2,MOD)\r\nfor i in range(N-1)[::-1]:invfac[i]=invfac[i+1]*(i+1)%MOD\r\ndef c(i,j):return 0 if i<j else fac[i]*invfac[j]*invfac[i-j]\r\ninput=sys.stdin.readline\r\n\r\ndef solve():\r\n v=int(input());A=list(map(int,input().split()));res=[];mi=min(A)\r\n j=-1\r\n for i in range(9,0,-1):\r\n if A[i-1]==mi:j=i;break\r\n for _ in range(v//mi):res.append(str(j))\r\n v-=(v//mi)*mi\r\n for i,a in enumerate(res):\r\n if v<=0:break\r\n v+=mi\r\n for j in range(8,-1,-1):\r\n if v-A[j]>=0:break\r\n v-=A[j]\r\n res[i]=str(j+1)\r\n if not res:print(-1)\r\n else:print(\"\".join(res))\r\n\r\nif __name__==\"__main__\":\r\n solve()", "v=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\nr1=v//m\r\nnum=r1\r\nif(num==0):\r\n print(-1)\r\nelse:\r\n while num:\r\n for i in range(8,-1,-1): \r\n if(l[i] <= v and (v-l[i])//m==num-1):\r\n v=v-l[i]\r\n num=num-1\r\n print(i+1,end='')\r\n break", "v = int(input())\r\nmxdig, dig = 0, -1\r\nls = list(map(int,input().split()))\r\nfor i in range(9) :\r\n if v//ls[i] > mxdig or (v//ls[i] == mxdig and ls[i]*(v//ls[i]) <= ls[dig-1]*(v//ls[dig-1])) :\r\n mxdig = v//ls[i]\r\n dig = i+1\r\nif mxdig == 0 :\r\n print(-1)\r\nelif dig == 9 :\r\n print(''.join('9' for _ in range(mxdig)))\r\nelse :\r\n val, dg, left = 0, 0, v - ls[dig-1]*mxdig\r\n ans = [dig for _ in range(mxdig)]\r\n i, j = 0, 8\r\n while i < len(ans) :\r\n if j == dig-1 :\r\n break\r\n while i < len(ans) and left//(ls[j]-ls[dig-1]) >= 1 :\r\n ans[i] = j+1\r\n left -= (ls[j]-ls[dig-1])\r\n i += 1\r\n j -= 1\r\n print(''.join(str(ans[i]) for i in range(mxdig)))", "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 Color_the_Fence2():\r\n v = inp()\r\n sequence = inlt()\r\n\r\n smallest_paint = min(sequence)\r\n\r\n if smallest_paint > v :\r\n print(-1)\r\n return\r\n \r\n smallest_paint_largest_num = -1\r\n\r\n for index,paint in enumerate(sequence):\r\n num = index + 1\r\n if paint == smallest_paint and num > smallest_paint_largest_num:\r\n smallest_paint_largest_num = num \r\n \r\n base_number = [smallest_paint_largest_num] * (v//smallest_paint)\r\n length = v//smallest_paint\r\n extra_paint_each_digit = [(p-smallest_paint) for p in sequence]\r\n remaining_paint = v - (smallest_paint*length)\r\n\r\n for pos in range(length):\r\n for new_num in range(9,smallest_paint_largest_num,-1):\r\n if extra_paint_each_digit[new_num-1] <= remaining_paint:\r\n base_number[pos] = new_num\r\n remaining_paint -= extra_paint_each_digit[new_num-1]\r\n break \r\n \r\n #print(base_number)\r\n outputStr = ''.join(str(x) for x in base_number)\r\n print(outputStr)\r\n return \r\n\r\nColor_the_Fence2()", "\r\nfrom sys import stdin,stdout\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\t\r\n# from bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\ndef get_key(val,my_dict):\r\n for key, value in my_dict.items():\r\n if val == value:\r\n return key\r\nn = it()\r\nl = mp()\r\ns = set()\r\nd= dd(lambda:0)\r\nif n < min(l):\r\n\tprint(-1)\r\n\texit()\r\nfor i in range(9):\r\n\tif l[i] in d.values():\r\n\t\tdel d[get_key(l[i],d)] \r\n\t\td[i+1] = l[i]\r\n\telse:\r\n\t\td[i+1] = l[i]\r\n# print(dict(d))\r\n\r\nmi = min(d.values())\r\nkey = get_key(mi,d)\r\ns = str(key)*(n//mi)\r\nn = n%mi\r\n\r\nif n == 0:\r\n\tprint(s)\r\nelif key == 9:\r\n\tprint(s)\r\nelse:\r\n\tx = list(d.keys())\r\n\tfor i in x:\r\n\t\tif i < key:\r\n\t\t\tdel d[i]\r\n\r\n\tl = sorted(d.keys(),reverse=True)\r\n\ti,j = 0,0\r\n\ts = list(s)\r\n\ttt = len(s)\r\n\twhile n and i < tt and j < len(l):\r\n\t\tif int(s[i]) < l[j]:\r\n\t\t\tif n + d[int(s[i])] >= d[l[j]]:\r\n\t\t\t\tn -= (d[l[j]] - d[int(s[i])])\r\n\t\t\t\ts[i] = str(l[j])\r\n\t\t\t\ti += 1\r\n\t\t\telse:\r\n\t\t\t\tj += 1\r\n\t\telse:\r\n\t\t\tj += 1\r\n\r\n\tprint(''.join(s))\r\n\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nif n == 0 or n//min(l) == 0:\r\n print(-1)\r\n exit()\r\nd = n//min(l) # max digits possible\r\nfor i in range(1, d+1):\r\n for j in range(8, -1, -1):\r\n if (d-i)*min(l) <= n-l[j]:\r\n print(j+1, end=\"\")\r\n n -= l[j]\r\n break\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nd = []\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nx = min(w)\r\na = -1\r\nfor j in range(8, -1, -1):\r\n if w[j] == x:\r\n a = j\r\n break\r\nif n < x:\r\n print(-1)\r\nelse:\r\n d.extend([a+1]*(n//x))\r\n b = n%x\r\n c = w[a]\r\n for i in range(len(d)):\r\n for j in range(8, -1, -1):\r\n if j == a:\r\n print(''.join(map(str, d)))\r\n exit()\r\n if w[j]-w[a] <= b:\r\n b -= w[j]-w[a]\r\n d[i] = j+1\r\n break", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int, input().split()))\r\nfor i in range(1):#nmbr():\r\n n=nmbr()\r\n a=lst();f=1\r\n dp=[0]*(1+n)\r\n fd=[0]*(1+n)\r\n l=[]\r\n for i in range(1,n+1):\r\n x=-1;used=0\r\n for digit in range(9,0,-1):\r\n if i>=a[digit-1] and dp[i-a[digit-1]]>x:\r\n x=dp[i-a[digit-1]]\r\n used=digit\r\n dp[i]=x+1\r\n fd[i]=used\r\n col=n\r\n # print(fd)\r\n while col>0:\r\n if fd[col]==0:\r\n f=0\r\n break\r\n l+=[fd[col]]\r\n col-=a[fd[col]-1]\r\n if l:\r\n for v in l:stdout.write(str(v))\r\n else:print(-1)", "v = int(input())\r\na = [0] + list(map(int, input().split()))\r\n\r\n# priming the detonation\r\nm = float(\"inf\")\r\nn = -1\r\nfor i in range(1, 10):\r\n if a[i] <= m:\r\n m = a[i]\r\n n = i\r\n\r\n# reversing the polarity of the neutron flow\r\nif v < m:\r\n print(-1)\r\nelse:\r\n res = [n+1] * (v // m)\r\n rem = v % m\r\n for i in range(len(res)):\r\n replace = -1\r\n for j in range(n, 10):\r\n if a[j] <= rem + m:\r\n replace = j\r\n if replace != -1:\r\n res[i] = replace\r\n rem = rem + m - a[replace]\r\n print(''.join(map(str, res)))", "v=int(input())\r\nl1=[int(a) for a in input().split()]\r\ndt=dict()\r\nfor i in range(9):\r\n dt[i+1]=l1[i]\r\nl1.sort()\r\nfirst=-1\r\nfor i in range(9):\r\n if dt[i+1]==l1[0]:\r\n first=i+1\r\ndigs=v//l1[0]\r\nv-=digs*(l1[0])\r\nans=[first for i in range(digs)]\r\nif v>0:\r\n pos=0\r\n for i in range(digs):\r\n for j in range(9-first):\r\n if dt[9-j]-l1[0]<=v:\r\n ans[i]=9-j\r\n v-=dt[9-j]-l1[0]\r\n break\r\ns=''.join(str(a) for a in ans)\r\nif digs==0:\r\n s=-1\r\nprint(s)\r\n\r\n", "import sys\r\nfrom bisect import bisect_left,bisect_right\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque\r\nfrom functools import cache\r\nfrom heapq import heappop,heappush,heapify\r\nfrom itertools import permutations, accumulate\r\nfrom math import lcm,gcd,sqrt,ceil,comb\r\n\r\ntoBin=lambda x:bin(x).replace(\"0b\",\"\")\r\ninf=float(\"inf\");DIRS=[[1,0],[-1,0],[0,1],[0,-1]];CHARS=\"abcdefghijklmnopqrstuvwxyz\"\r\nMOD=10**9+7;N=300010;fac=[1]*N;invfac=[1]*N #Fill out N to calculate combinations\r\nfor i in range(2,N):fac[i]=fac[i-1]*i%MOD\r\ninvfac[N-1]=pow(fac[N-1],MOD-2,MOD)\r\nfor i in range(N-1)[::-1]:invfac[i]=invfac[i+1]*(i+1)%MOD\r\ndef c(i,j):return 0 if i<j else fac[i]*invfac[j]*invfac[i-j]\r\ninput=sys.stdin.readline\r\n\r\ndef solve():\r\n v=int(input());A=list(map(int,input().split()));mi=min(A)\r\n digits=v//mi\r\n if digits==0:print(-1);exit()\r\n for i in range(digits,0,-1):\r\n for j in range(9,0,-1):\r\n if v-A[j-1]>=mi*(i-1):\r\n print(j,end=\"\")\r\n v-=A[j-1]\r\n break\r\n\r\n\r\nif __name__==\"__main__\":\r\n solve()", "\"\"\"\r\nfor _ in range(int(input())):\r\n n,m = map(int,input().split())\r\n l=[]\r\n ans=0\r\n for i in range(n):\r\n s = input()\r\n l.append(s)\r\n # print(l)\r\n for i in range(n):\r\n for j in range(m):\r\n if l[i][j]==\"C\":\r\n continue\r\n elif i+1==n and l[i][j]==\"D\":\r\n ans+=1\r\n elif j+1==m and l[i][j]==\"R\":\r\n ans+=1\r\n print(ans)\r\n\"\"\"\r\n\"\"\"\r\nt = int(input())\r\nfor _ in range(t):\r\n poss=0\r\n cnt=0\r\n cnt1=0\r\n cnt2=0\r\n ans=1000000000\r\n n,e,h,a,b,c = map(int,input().split())\r\n ee = e-min(e,h)\r\n hh = h-min(e,h)\r\n # ttt=0\r\n poss+=min(e,h)\r\n if ee>0:\r\n poss+=(ee//2)\r\n # ttt+=(ee//2)\r\n elif hh>0:\r\n poss+=(hh//3)\r\n if poss<n:\r\n #print(poss)\r\n print(-1)\r\n else:\r\n if n<=0:\r\n cnt=0\r\n elif c<=a and c<=b:\r\n if min(e,h)>=n:\r\n cnt+=n*c\r\n else:\r\n cnt+=(min(e,h)*c)\r\n min1 = min(e,h)\r\n n-=min1\r\n e-=min1\r\n h-=min1\r\n if h>0:\r\n cnt+=(n)*b\r\n elif e>0:\r\n cnt+=(n)*a\r\n elif c>=a and c>=b:\r\n if a<=c and a>=b:\r\n pp=h//3\r\n tttt = h%3\r\n if pp>=n:\r\n cnt+=n*b\r\n else:\r\n pp+=e//2\r\n ssss = e%2\r\n if pp>=n:\r\n cnt+=(((h//3)*b)+(n-h//3)*a)\r\n else:\r\n pp+=min(tttt,ssss)\r\n # rrrr = n-(h//3+min(ssss,tttt))\r\n # n-=rrrr\r\n if pp>=n:\r\n cnt+=((((h//3)*b)+(e//2)*a)+((n-(h//3+e//2))*c))\r\n else:\r\n if min(e, h) >= n:\r\n cnt += n * c\r\n else:\r\n cnt += (min(e, h) * c)\r\n min1 = min(e,h)\r\n n -= min1\r\n e -= min1\r\n h -= min1\r\n if h > 0:\r\n cnt += (n) * b\r\n elif e > 0:\r\n cnt += (n) * a\r\n elif b<=c and b>=a:\r\n # print(poss)\r\n pp=e//2\r\n ssss = e%2\r\n if pp>=n:\r\n cnt+=n*a\r\n else:\r\n pp+=h//3\r\n tttt = h%3\r\n # print(ssss,tttt,n)\r\n if pp>=n:\r\n # print(poss)\r\n cnt+=(((e//2)*a)+(n-e//2)*b)\r\n else:\r\n pp+=min(tttt,ssss)\r\n if pp>=n:\r\n cnt+=((((e//2)*a)+((h//3)*b))+(n-(h//3+e//2))*c)\r\n else:\r\n if min(e,h) >= n:\r\n cnt += n * c\r\n else:\r\n cnt += (min(e, h) * c)\r\n min1 = min(e,h)\r\n n -= min1\r\n e -= min1\r\n h -= min1\r\n if h > 0:\r\n cnt += (n) * b\r\n elif e > 0:\r\n cnt += (n) * a\r\n elif a>=c and a>=b:\r\n if c<=a and c>=b:\r\n pp = h // 3\r\n tttt=h%3\r\n if pp >= n:\r\n cnt += n * b\r\n else:\r\n pp +=min(tttt,e)\r\n pppp = tttt-min(tttt,e)\r\n ssss = e-min(tttt,e)\r\n if pp >= n:\r\n cnt += (((h // 3) * b) + (n-h//3) * c)\r\n else:\r\n if pppp>0:\r\n pp+=pppp//3\r\n if pp>=n:\r\n cnt+=(((h//3)*b)+(min(tttt,e))*c+(n-(h//3+min(tttt,e)))*b)\r\n else:\r\n if min(e, h) >= n:\r\n cnt += n * c\r\n else:\r\n cnt += (min(e, h) * c)\r\n min1 = min(e,h)\r\n n -= min1\r\n e -= min1\r\n h -= min1\r\n if h > 0:\r\n cnt += (n) * b\r\n elif e > 0:\r\n cnt += (n) * a\r\n elif ssss>0:\r\n pp+=ssss//2\r\n if pp>=n:\r\n cnt+=(((h//3)*b)+(min(tttt,e)*c)+(n-(h//3+min(e,tttt)))*a)\r\n else:\r\n if min(e, h) >= n:\r\n cnt += n * c\r\n else:\r\n cnt += (min(e, h) * c)\r\n min1 = min(e,h)\r\n n -= min1\r\n e -= min1\r\n h -= min1\r\n if h > 0:\r\n cnt += (n) * b\r\n elif e > 0:\r\n cnt += (n) * a\r\n elif b>=c and b>=a:\r\n if c<=b and c>=a:\r\n pp = e // 2\r\n ssss = e%2\r\n if pp >= n:\r\n cnt += n * a\r\n else:\r\n pp += min(h, ssss)\r\n pppp = ssss - min(ssss,h)\r\n tttt = h-min(ssss,h)\r\n if pp >= n:\r\n cnt += (((e//2) * a) + (n - e//2) * c)\r\n else:\r\n if tttt > 0:\r\n pp += tttt // 3\r\n if pp >= n:\r\n cnt += (((e//2) * a) + (min(h, ssss)) * c + (n - (e//2 + min(h, ssss))) * b)\r\n else:\r\n if min(e, h) >= n:\r\n cnt += n * c\r\n else:\r\n cnt += (min(e, h) * c)\r\n min1 = min(e,h)\r\n n -= min1\r\n e -= min1\r\n h -= min1\r\n if h > 0:\r\n cnt += (n) * b\r\n elif e > 0:\r\n cnt += (n) * a\r\n elif pppp > 0:\r\n pp += pppp // 2\r\n if pp >= n:\r\n cnt += (((e//2) * a) + (min(h, ssss) * c) + (n - (e//2 + min(ssss, h))) * a)\r\n else:\r\n if min(e, h) >= n:\r\n cnt += n * c\r\n else:\r\n cnt += (min(e, h) * c)\r\n min1 = min(e,h)\r\n n -= min1\r\n e -= min1\r\n h -= min1\r\n if h > 0:\r\n cnt += (n) * b\r\n elif e > 0:\r\n cnt += (n) * a\r\n print(cnt)\r\n\"\"\"\r\n\"\"\"\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nif arr.count(0)==0:\r\n print(-1)\r\nelse:\r\n five = arr.count(5)\r\n five = five-five%9\r\n if five==0:\r\n print(0)\r\n else:\r\n print(\"5\"*five+\"0\"*arr.count(0))\r\n\"\"\"\r\n\"\"\"\r\ndef binaryToDecimal(n):\r\n return int(n,2)\r\ns = input()\r\ns=s.replace(\">\",\"1000\")\r\ns=s.replace(\"<\",\"1001\")\r\ns=s.replace(\"+\",\"1010\")\r\ns=s.replace(\"-\",\"1011\")\r\ns=s.replace(\".\",\"1100\")\r\ns=s.replace(\",\",\"1101\")\r\ns=s.replace(\"[\",\"1110\")\r\ns=s.replace(\"]\",\"1111\")\r\np = binaryToDecimal(s)\r\nans = p%((10**6) +3)\r\nprint(ans)\r\n\"\"\"\r\n\"\"\"\r\nn,m,d = map(int,input().split())\r\ndd=[]\r\nfor _ in range(n):\r\n arr = list(map(int,input().split()))\r\n dd+=arr\r\ndd=sorted(dd)\r\n#print(dd)\r\nfor i in range(len(dd)):\r\n #print((dd[i]-dd[0])%d)\r\n if (dd[i]-dd[0])%d!=0:\r\n # print(dd[i])\r\n print(-1)\r\n break\r\nelse:\r\n ll=[]\r\n tt =set(dd)\r\n tt = list(tt)\r\n sum=0\r\n i=0\r\n while(i<len(tt)):\r\n for j in range(len(dd)):\r\n sum+=abs(dd[j]-tt[i])\r\n ll.append(sum)\r\n sum=0\r\n i+=1\r\n #print(ll)\r\n print(min(ll)//d)\r\n\"\"\"\r\n\"\"\"\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nmin1=100000000000\r\nc=0\r\nfor i in range(k):\r\n sum1=sum(arr[i::k])\r\n # print(sum1)\r\n if sum1<min1:\r\n c=i\r\n min1= sum1\r\nprint(c+1)\r\n\"\"\"\r\n\"\"\"\r\nn = int(input())\r\ns=n\r\nl=[n]\r\ni=s-1\r\nwhile(s>0):\r\n if i==0:\r\n break\r\n if s%i==0:\r\n l.append(i)\r\n s=i\r\n i=s-1\r\n if i==0:\r\n break\r\n else:\r\n i-=1\r\nprint(*l)\r\n\"\"\"\r\n\"\"\"\r\nn,a,b = map(int,input().split())\r\nslope=[]\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n if x-a !=0:\r\n slope.append((y-b)/(x-a))\r\n else:\r\n slope.append(\"0\")\r\nprint(len(set(slope)))\r\n\"\"\"\r\n\"\"\"\r\ns = input()\r\nss = input()\r\nt = set(ss)\r\nt = list(t)\r\nfor i in t:\r\n if i not in s:\r\n print(-1)\r\n break\r\nelse:\r\n sum1=0\r\n for i in t:\r\n sum1+=min(s.count(i),ss.count(i))\r\n print(sum1)\r\n\"\"\"\r\n\"\"\"\r\nn,m = map(int,input().split())\r\nl=[0]*(n+1)\r\nfor _ in range(m):\r\n p=[1,2,3]\r\n arr = list(map(int,input().split()))\r\n for i in arr:\r\n if l[i]!=0:\r\n p.remove(l[i])\r\n for i in arr:\r\n if l[i]==0:\r\n l[i]=p.pop()\r\n # print(p)\r\nfor i in range(1,n+1):\r\n print(l[i],end=\" \")\r\n\"\"\"\r\n\"\"\"\r\nfrom itertools import accumulate\r\nm, n = map(int, input().split())\r\nt = []\r\nfor i in range(m):\r\n arr= list(map(int, input().split()))\r\n t.append(arr)\r\nd = [0] * m\r\nfor i in range(n):\r\n d[0] += t[0][i]\r\n for j in range(1, m):\r\n d[j] = max(d[j - 1], d[j]) + t[j][i]\r\nprint(*d)\r\n\"\"\"\r\n\"\"\"\r\nn = int(input())\r\ns=\"abcd\"\r\nt=s*1000001\r\nprint(t[:n])\r\n\"\"\"\r\n\"\"\"\r\nd={}\r\ndef f(n):\r\n if n in d.keys():\r\n return d[n]\r\n a=n//2\r\n b=n//3\r\n c=n//4\r\n if a+b+c>n:\r\n t= f(a)+f(b)+f(c)\r\n d[n]=t\r\n return t\r\n else:\r\n d[n]=n\r\n return n\r\nfor i in range(10):\r\n try:\r\n n=int(input())\r\n print(f(n))\r\n except:\r\n break\r\n\"\"\"\r\n\r\n\"\"\"\r\ndef C(n, k):\r\n k = min(n - k, k)\r\n answer = 1\r\n for i in range(k):\r\n answer *= (n - i)\r\n\r\n for i in range(k, 1, -1):\r\n answer = answer // i\r\n\r\n return answer\r\n\r\n\r\nnumTest = int(input())\r\n\r\nfor i in range(numTest):\r\n N, k = [int(j) for j in input().split(' ')]\r\n print(C(N - 1, k - 1))\r\n\"\"\"\r\n\"\"\"\r\nn= int(input())\r\narr = list(map(int,input().split()))\r\nr=0\r\n#cnt=0\r\nfor i in range(n):\r\n j=i\r\n while j+1<n and arr[j+1]>=arr[j]: j+=1\r\n #j=i\r\n #print(j)\r\n while j+1<n and arr[j]>=arr[j+1]: j+=1\r\n # print(j,i)\r\n r = max(r,j-i+1)\r\nprint(r)\r\n\"\"\"\r\n\"\"\"\r\na,b,c,d = map(int,input().split())\r\nx=a/b\r\ny=c/d\r\nxx = 1-x\r\nyy = 1-y\r\nf = x/(1-(xx*yy))\r\nprint(f)\r\n\"\"\"\r\n\"\"\"\r\nimport math\r\nn,k,l,m = map(int,input().split())\r\nk=k*l\r\nm=m*n\r\na=abs(k-m)\r\nb=max(k,m)\r\nx=math.gcd(a,b)\r\na//=x\r\nb//=x\r\nprint(str(a)+\"/\"+str(b))\r\n\"\"\"\r\nv = int(input())\r\narr = list(map(int,input().split()))\r\nmin1 = min(arr)\r\n#index1 = arr.index(min1)\r\nif v==0:\r\n print(\"-1\")\r\nelse:\r\n if min1>v:\r\n print(-1)\r\n else:\r\n rem = v//min1\r\n for i in range(rem, 0, -1):\r\n for j in range(9, 0, -1):\r\n if v - arr[j - 1] >= min1 * (i - 1):\r\n print(j, end=\"\")\r\n v -= arr[j - 1]\r\n break\r\n print()\r\n", "v = int(input())\r\na = list(map(int, input().split()))\r\nm = min(a)\r\n\r\nif v<m:\r\n print(-1)\r\n exit()\r\n\r\nk = v//m\r\nans = []\r\n\r\nfor i in range(k):\r\n for d in range(8, -1, -1):\r\n if v-a[d]>=(k-i-1)*m:\r\n v -= a[d]\r\n ans.append(d+1)\r\n break\r\n\r\nprint(''.join(map(str, ans)))", "from cmath import inf\r\nimport sys\r\ninput = sys.stdin.readline\r\nMOD=10**9+7\r\n\r\nif __name__ == '__main__':\r\n n=int(input())\r\n arr=list(map(int, input().split()))\r\n \r\n minid=0\r\n for i, v in enumerate(arr):\r\n if v<=arr[minid]:\r\n minid=i\r\n\r\n tot=n//arr[minid]\r\n rem=n%arr[minid]\r\n if tot==0:print(-1)\r\n else:\r\n res=[minid+1]*tot\r\n i=8\r\n j=0\r\n while rem>0 and i>minid:\r\n diff=arr[i]-arr[minid]\r\n cnt=rem//diff\r\n rem %=diff\r\n for nex in range(cnt):\r\n res[j]=i+1\r\n j +=1\r\n i -=1\r\n print(*res, sep='')\r\n\r\n ", "def solve(v, a):\n mn = min(a)\n d = v // mn\n if d == 0:\n return None\n r = v % mn\n res = []\n for i in range(d):\n t = 9\n while t >= 1:\n if a[t - 1] <= mn + r:\n break\n t -= 1\n assert t >= 1\n r -= a[t - 1] - mn\n res.append(t)\n return res\n\n\nv = int(input())\na = list(map(int, input().split()))\nres = solve(v, a)\nif res:\n print(*res, sep='')\nelse:\n print(-1)", "n = int(input())\r\na = list(map(int,input().split()))\r\nmn = min(a)\r\ndiv = n//mn\r\nif div== 0:\r\n print(-1)\r\n exit()\r\nfor i in range(div):\r\n for j in range(8,-1,-1):\r\n if (div-i-1)*mn <= n-a[j]:\r\n print(j+1,end=\"\")\r\n n -= a[j]\r\n break\r\n \r\n ", "v = int(input())\r\na = list(map(int, input().split()))\r\na = a[::-1]\r\nm = min(a)\r\nx = 9 - a.index(m)\r\n\r\nd = v//m\r\nr = v%m\r\n\r\nif d < 1:\r\n print(-1) \r\n exit()\r\n \r\nc = d * [x]\r\ni = 0\r\n\r\n#print(c)\r\nwhile i < d:\r\n t = m + r\r\n j = 0\r\n while a[j] > t: j += 1\r\n c[i] = 9 - j\r\n i += 1\r\n r = t - a[j]\r\n \r\nprint(\"\".join(map(str, c)))", "v=int(input())\r\na=[0]+list(map(int,input().split()))\r\nb=[True for _ in range(10)]\r\nfor i in range(9,0,-1):\r\n j=1\r\n while j<i and b[i]:\r\n if a[j]>=a[i]:\r\n b[j]=False\r\n j+=1\r\nnum=[]\r\nc=[]\r\nfor i in range(1,10):\r\n if b[i]:\r\n num.append(i)\r\n c.append(a[i])\r\ndp=[[0 for _ in range(len(num)+2)] for _ in range(v+1)]\r\ndp[0][0]=1\r\nm=0\r\na=[]\r\nfor i in range(1,v+1):\r\n for j in range(len(num)):\r\n if i<c[j]:\r\n continue\r\n if dp[i-c[j]][0]==1:\r\n if dp[i][0]!=1:\r\n for k in range(len(num)+2):\r\n dp[i][k]=dp[i-c[j]][k]\r\n dp[i][-1]+=1\r\n dp[i][j+1]+=1\r\n else:\r\n if dp[i-c[j]][-1]+1>=dp[i][-1]:\r\n for k in range(len(num)+2):\r\n dp[i][k]=dp[i-c[j]][k]\r\n dp[i][-1]+=1\r\n dp[i][j+1]+=1\r\n if dp[i][-1]>=m:\r\n m=dp[i][-1]\r\n a=dp[i]\r\nif m==0:\r\n print(-1)\r\nelse:\r\n s=''\r\n for i in range(1,len(a)-1):\r\n s+=str(num[i-1])*a[i]\r\n print(s[::-1])", "import sys\r\nimport math\r\nimport heapq as hp\r\n#hp.heapify hp.heappush hp.heappop\r\n\r\nfrom collections import deque\r\n#appendleft append pop popleft\r\n\r\n#BITWISE: and:& or:| not:~ XOR:^ \r\ninput=sys.stdin.readline\r\nm=1000000007\r\ndef inp():\r\n return int(input())\r\ndef minp():\r\n return map(int,input().split())\r\ndef strinp():\r\n S=input().rstrip()\r\n return S\r\ndef lst():\r\n return list(map(int,input().split()))\r\n#------------------------------------#\r\n\r\nn=inp()\r\nL=lst()\r\nmaxm=-1\r\nindex=0\r\nrem=0\r\nfor i in range(9):\r\n if n//L[i]>maxm:\r\n index=i\r\n maxm=n//L[i]\r\n rem=n%L[i]\r\nif maxm==0:\r\n print(-1)\r\nelse:\r\n out=[]\r\n smallest=min(L[index+1:])\r\n diff=smallest-L[index]\r\n while(rem>=diff):\r\n i=8\r\n while(i>index):\r\n if L[i]-L[index]==0:\r\n index=i\r\n rem=-1\r\n break\r\n if L[i]-L[index]<=rem:\r\n out.append(str(i+1))\r\n maxm-=1\r\n rem-=L[i]-L[index]\r\n break\r\n else:\r\n i-=1\r\n print(\"\".join(out),str(index+1)*maxm,sep=\"\")", "#!/usr/bin/env python3\r\n# created : 2020. 12. 31. 23:59\r\n\r\nimport os\r\nfrom sys import stdin, stdout\r\n\r\n\r\ndef solve(tc):\r\n v = int(stdin.readline().strip())\r\n seq = list(map(int, stdin.readline().split()))\r\n\r\n minval = int(1e6)\r\n minpick = 9\r\n for i in range(8,-1,-1):\r\n if seq[i]<minval:\r\n minval = seq[i]\r\n minpick = i\r\n\r\n length = v//seq[minpick]\r\n if length == 0:\r\n print(-1)\r\n return\r\n\r\n ans = [chr(minpick+1+ord('0')) for i in range(length)]\r\n pick = 8\r\n p = 0\r\n remain = v % seq[minpick]\r\n while p < length and pick > minpick:\r\n if seq[pick]-seq[minpick] <= remain:\r\n remain -= seq[pick]-seq[minpick]\r\n ans[p] = chr(pick+1+ord('0'))\r\n p += 1\r\n else:\r\n pick -= 1\r\n \r\n print(''.join(ans))\r\n\r\n\r\ntcs = 1\r\ntc = 1\r\nwhile tc <= tcs:\r\n solve(tc)\r\n tc += 1\r\n", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n\r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n \r\ndef main():\r\n # Write Your Code Here\r\n v = int(input())\r\n ad = get_ints_in_list()\r\n # first we will get minimum number for making a large number\r\n mn = sys.maxsize\r\n start = 8\r\n while start >= 0:\r\n if ad[start] < mn:\r\n mn = ad[start]\r\n idx = start + 1\r\n start -= 1\r\n \r\n sz = v / mn # size of number\r\n rem = v % mn # reaming paint \r\n ans = \"\"\r\n flag = True\r\n while flag:\r\n flag = False\r\n start = 8\r\n while start >= idx:\r\n if mn+rem >= ad[start]:\r\n ans += str(start+1)\r\n rem -= (ad[start]-mn)\r\n flag = True\r\n sz -= 1\r\n break\r\n start -= 1\r\n for _ in range(0, int(sz)):\r\n ans += str(idx)\r\n \r\n if len(ans) == 0:\r\n ans += \"-1\"\r\n print(ans)\r\n\r\n\r\n\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "v = int(input())\na = list(map(int, input().split()))\n\nmincost = min(a)\ndig = v // mincost\n\nif dig == 0:\n print(-1)\n exit()\n\nfor i in range(dig, 0, -1):\n for j in range(9, 0, -1):\n if v - a[j-1] >= mincost * (i-1):\n print(j, end = \"\")\n v -= a[j-1]\n break\nprint()\n", "p = int(input())\r\nams = list(map(int, input().split()))\r\n\r\ncheapest = 0\r\n\r\nfor i in range(9):\r\n if ams[i] <= ams[cheapest]:\r\n cheapest = i\r\n\r\nif p < ams[cheapest]:\r\n print(-1)\r\nelse:\r\n digs = [cheapest + 1] * (p // ams[cheapest])\r\n p -= ams[cheapest] * len(digs)\r\n ch = ams[cheapest]\r\n for i in range(9):\r\n ams[i] -= ch\r\n\r\n dec = 0\r\n while dec < len(digs) and p > 0:\r\n found = False\r\n for i in range(8, cheapest, -1):\r\n if ams[i] <= p:\r\n digs[dec] = i + 1\r\n p -= ams[i]\r\n found = True\r\n break\r\n if not found:\r\n break\r\n dec += 1\r\n print(\"\".join(map(str, digs)))\r\n\r\n", "#\n# Joseph Matsushita\n# Problem U\n#\n\nv = int(input())\n\na = list(map(int, input().split()))\n\nsmall = 10000000\nsmallindex = -1\n\nfor i in range(9):\n if a[i] <= small:\n small = a[i]\n smallindex = i\nif(small > v):\n print(\"-1\")\nelse:\n div = int(v / small)\n rem = v % small\n num = \"\"\n digitm = 8\n while(rem > 0 and div > 0 and digitm > smallindex):\n dif = a[digitm] - a[smallindex]\n difdiv = int(rem / dif)\n if(difdiv > 0):\n if(difdiv > div):\n num = num + div * str(digitm+1)\n div = 0\n else:\n num = num + difdiv * str(digitm+1)\n div = div - difdiv\n rem = int(rem % dif)\n digitm -= 1\n num = num + div * str(smallindex+1)\n print(num)\n\t\t \t \t \t\t\t \t\t\t \t \t\t \t \t\t", "# -*- coding : utf-8 -*-\r\n# @Time: 2023/10/10 22:20\r\n# @Author: yefei.wang\r\n# @File: 394B.py\r\n\r\nimport sys\r\n\r\n# sys.stdin = open('./../input.txt', 'r')\r\nI = lambda: int(input())\r\nMI = lambda: map(int, input().split())\r\nLI = lambda: list(map(int, input().split()))\r\n\r\nn = I()\r\na = LI()\r\nmi = min(a)\r\nv = 1\r\nfor i, x in enumerate(a):\r\n if x == mi:\r\n v = i + 1\r\n\r\nx, y = divmod(n, mi)\r\ncnt = {v: x}\r\nfor i in range(8, v - 1, -1):\r\n d = a[i] - mi\r\n if y >= d:\r\n cnt[i + 1] = min(y // d, cnt[v])\r\n cnt[v] -= cnt[i + 1]\r\n y %= d\r\nans = ''\r\nfor i in range(9, 0, -1):\r\n if i in cnt:\r\n ans += str(i) * cnt[i]\r\n\r\nif ans:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "import math\r\nimport bisect\r\n\r\ndef main():\r\n v = int(input())\r\n aux = list(map(int, input().split()))\r\n\r\n liters = [(aux[i], i+1) for i in range(0, 9)]\r\n liters = sorted(liters, key = lambda x : (x[0], -x[1]))\r\n\r\n if v < liters[0][0]:\r\n print(-1)\r\n else:\r\n num_rep = v//liters[0][0]\r\n liters_used = num_rep * liters[0][0]\r\n answer = [liters[0][1] for _ in range(0, num_rep)]\r\n\r\n for i in range(0, len(answer)):\r\n for j in range(9, 0, -1):\r\n if liters_used - liters[0][0] + aux[j - 1] <= v:\r\n liters_used = liters_used - liters[0][0] + aux[j - 1]\r\n answer[i] = j\r\n break\r\n\r\n answer = list(map(str, answer))\r\n answer = \"\".join(answer)\r\n print(answer)\r\n\r\nmain()", "from sys import*\r\nv=int(stdin.readline())\r\nl=[int(e) for e in stdin.readline().split()]\r\nc=min(l)\r\nd=v//c\r\nif d == 0:\r\n stdout.write(str(-1))\r\n exit()\r\nfor i in range(d,0,-1):\r\n for j in range(9,0,-1):\r\n if v-l[j-1] >= c*(i-1):\r\n print(j, end='')\r\n v-=l[j-1]\r\n break\r\n", "v = int(input())\r\na = [int(t) for t in input().split(' ')]\r\nmin_cost = min(a)\r\ncheapest_digit = 0\r\nfor i in range(9):\r\n if a[i] == min_cost:\r\n cheapest_digit = i\r\n \r\nnumber_len = v // min_cost\r\nif number_len == 0:\r\n print(-1)\r\nelse:\r\n rem = v - number_len * min_cost\r\n prefix = []\r\n while rem > 0:\r\n for i in range(8, cheapest_digit, -1):\r\n dcost = a[i] - min_cost\r\n if dcost <= rem:\r\n rem -= dcost\r\n prefix.append(str(i+1))\r\n number_len -= 1\r\n break\r\n else:\r\n break\r\n \r\n print(''.join(prefix) + str(cheapest_digit+1)*number_len)", "v = int(input())\r\nA = list(map(int, input().split()))\r\nmin = min(A)\r\nlen = v//min\r\nif len == 0:\r\n print(-1)\r\n exit()\r\nrem = v % min\r\nout = \"\"\r\nS = [str(i) for i in range(1,10)]\r\nfor i in range(len):\r\n j = A.__len__()\r\n while j > 0:\r\n if A[j-1] - min <= rem:\r\n rem -= A[j-1]-min\r\n break\r\n j -= 1\r\n out += S[j-1]\r\nprint(out)" ]

[ "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nba = list(map(lambda x: str(bin(x))[2:], a))\r\nbcom = ba[0]\r\nl = len(bcom)\r\nfor bnum in ba:\r\n # i + 1\r\n j = 0\r\n while j < l and bnum[j] == bcom[j]:\r\n j += 1\r\n l = j\r\n\r\nbcom = bcom[:l]\r\n\r\n# print(com)\r\nans = nop = sum(map(len, ba)) - len(ba) * len(bcom)\r\n\r\ncom = int(bcom, base=2)\r\nmaxnum = a[-1]\r\nwhile com <= maxnum:\r\n com *= 2\r\n bcom += '0'\r\n for num, bnum in zip(a, ba):\r\n if num < com:\r\n nop += 1\r\n elif num == com:\r\n nop -= 1\r\n else:\r\n if bnum[:len(bcom)] == bcom:\r\n nop -= 1\r\n else:\r\n nop += 1\r\n if nop < ans:\r\n ans = nop\r\n\r\nprint(ans)\r\n\r\n# 11 3\r\n# 101 5\r\n# 110 7", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(read())\r\nm = max(a) + 5\r\ncnt = [0] * m\r\nstep = [0] * m\r\nwas = [-1] * m\r\nfor i in range(n):\r\n x = a[i]\r\n q = [(x, 0)]\r\n st = 0\r\n while st < len(q):\r\n x, y = q[st]\r\n st += 1\r\n if x >= m or was[x] == i:\r\n continue\r\n was[x] = i\r\n step[x] += y\r\n cnt[x] += 1\r\n q.append((x * 2, y + 1))\r\n q.append((x // 2, y + 1))\r\nans = min(step[x] for x in range(m) if cnt[x] == n)\r\nprint(ans)", "n = int(input())\r\na = [bin(int(i)) for i in input().split()]\r\nj = 2\r\ns = '0b'\r\nwhile True:\r\n\tok = True\r\n\ti = a[0]\r\n\tif j < len(i):\r\n\t\tc = i[j]\r\n\telse:\r\n\t\tc = '0'\r\n\tfor i in a:\r\n\t\tif j < len(i):\r\n\t\t\tcc = i[j]\r\n\t\telse:\r\n\t\t\tcc = '0'\r\n\t\tif cc != c:\r\n\t\t\tok = False\r\n\t\t\tbreak\r\n\tif not ok or j > 20:\r\n\t\tbreak\r\n\ts += c\r\n\tj += 1\r\nb = []\r\nr = 0\r\nfor i in a:\r\n\tpos = i.find('1', len(s))\r\n\tif pos == -1:\r\n\t\tb.append(len(i))\r\n\telse:\r\n\t\tb.append(pos)\r\n\t\tr += len(i)-pos\r\nb.sort()\r\nm = b[len(b)//2]\r\nfor i in b:\r\n\tr += abs(i-m)\r\nprint(r)\r\n\r\n" ]

[ "s = {0:0,1:0}\r\nfor i in range(4):\r\n a,b,c,d = input().split()\r\n if a==c and b!=d:\r\n s[0]+=1\r\n if b==d and a!=c:\r\n s[1]+=1\r\n for q in [(a,b),(c,d)]:\r\n s[q] = s.get(q,0) + 1\r\nprint(\"YES\" if all(i==2 for i in s.values())else \"NO\")", "def slope(seg):\r\n\tif seg[0] == seg[2]:\r\n\t\treturn 1\r\n\telif seg[1] == seg[3]:\r\n\t\treturn 0\r\n\telse:\r\n\t\treturn -1\r\n\t\r\nsegs = []\r\nfor i in range(4):\r\n\tsegs.append(list(map(int,input().split())))\r\nslopes = [slope(seg) for seg in segs]\r\nisRect = \"NO\"\r\nif slopes.count(0) == 2 and slopes.count(1) == 2:\r\n\tslopes0 = [seg for seg in segs if slope(seg) == 0]\r\n\tslopes1 = [seg for seg in segs if slope(seg) == 1]\r\n\tif abs(slopes0[0][0]-slopes0[0][2]) == abs(slopes0[1][0]-slopes0[1][2]) and abs(slopes1[0][1]-slopes1[0][3]) == abs(slopes1[1][1]-slopes1[1][3]) and abs(slopes0[0][1]-slopes0[1][1]) == abs(slopes1[0][1]-slopes1[0][3]):\r\n\t\tpoints = [str(seg[0])+\"_\"+str(seg[1]) for seg in segs]+[str(seg[2])+\"_\"+str(seg[3]) for seg in segs]\r\n\t\tif(len(set(points)) == 4):\r\n\t\t\tisRect=\"YES\"\r\n\t\t\r\n\t\t\r\nprint(isRect)", "dic = {}\r\nedge = [[] for _ in range(4)]\r\nv = 0\r\nx,y = 0,0\r\nfor _ in range(4):\r\n x1,y1,x2,y2 = map(int,input().split())\r\n if (x1,y1) not in dic:\r\n if v==4: print(\"NO\"); exit()\r\n dic[(x1,y1)] = v\r\n v += 1\r\n if (x2,y2) not in dic:\r\n if v==4: print(\"NO\"); exit()\r\n dic[(x2,y2)] = v\r\n v += 1 \r\n v1,v2 = dic[(x1,y1)],dic[(x2,y2)]\r\n edge[v1] += v2,; edge[v2] += v1,\r\n if x1==x2 and y1!=y2: y += 1\r\n elif x1!=x2 and y1==y2: x += 1\r\n else: print(\"NO\"); exit()\r\nif x!=2 or y!=2: print(\"NO\"); exit()\r\nfor j in range(3):\r\n if len(edge[j])!=2: print(\"NO\"); exit()\r\nprint(\"YES\")", "puntos={0:0,1:0}\r\nfor i in range(4):\r\n linea=list(map(int,input().split()))\r\n p1=(linea[0],linea[1])\r\n p2=(linea[2],linea[3])\r\n if p1[0]==p2[0] and p1[1]!=p2[1]: puntos[0]+=1\r\n elif p1[0]!=p2[0] and p1[1]==p2[1]: puntos[1]+=1\r\n for punto in [p1,p2]:\r\n puntos[punto]=puntos.get(punto,0)+1\r\nif all( i==2 for i in puntos.values()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "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\ng = M(4)\r\nh = []\r\nv = []\r\nfor x1,y1,x2,y2 in g:\r\n if x1==x2 and y1==y2:\r\n pb(0)\r\n exit(0)\r\n if x1 == x2:\r\n v.append([x1,y1,x2,y2])\r\n if y1 == y2:\r\n h.append([x1,y1,x2,y2])\r\nif len(v) != 2 or len(h) != 2:\r\n pb(0)\r\n exit(0)\r\npoints = set()\r\ng1, g2 = h\r\npoints.add((g1[0],g1[1]))\r\npoints.add((g1[2],g1[3]))\r\npoints.add((g2[0],g2[1]))\r\npoints.add((g2[2],g2[3]))\r\n\r\ng1, g2 = v\r\npp = set()\r\npp.add((g1[0],g1[1]))\r\npp.add((g1[2],g1[3]))\r\npp.add((g2[0],g2[1]))\r\npp.add((g2[2],g2[3]))\r\n\r\npb(pp == points)", "\n# Very drunk implementation\n\ndef point_to_str(x, y):\n return str(x) + \" \" + str(y)\n\n# best names ever\ndef segment_from_point_values_to_str(a, b):\n mini = min(a, b)\n maxi= max(a, b)\n\n # LOL\n return point_to_str(mini, maxi)\n\n\nsegments = []\n\npoints = []\n\nleft = 10**10\nright = -10**10\n\nbottom = 10**10\ntop = -10**10\n\nfor i in range(4):\n segment = [int(i) for i in input().split()]\n\n segments.append(segment)\n \n\nfor segment in segments:\n xA = segment[0]\n yA = segment[1]\n \n\n xB = segment[2]\n yB = segment[3]\n\n left = min(left, xA, xB)\n right = max(right, xA, xB)\n\n bottom = min(bottom, yA, yB)\n top = max(top, yA, yB)\n\n\n# Returns the point, if none then returns -1\n# 2 --------- 3\n# | |\n# | |\n# 0 --------- 1\ndef identify_point(x, y):\n if(x == left and y == bottom):\n return 0\n\n if(x == right and y == bottom):\n return 1\n\n if(x == left and y == top):\n return 2\n\n if(x == right and y == top):\n return 3\n \n # Ya dirty scallywag\n #print(\"Scallywag: \", x, y)\n return -1\n\nsegment_strings = []\n\nfor segment in segments:\n xA = segment[0]\n yA = segment[1]\n\n xB = segment[2]\n yB = segment[3]\n\n pointA = identify_point(xA, yA)\n pointB = identify_point(xB, yB)\n\n segment_str = segment_from_point_values_to_str(pointA, pointB)\n segment_strings.append(segment_str)\n\n\nis_rectangle = True\nif bottom >= top:\n is_rectangle = False\n\nif left >= right:\n is_rectangle = False\n\n\n# 2 --------- 3\n# | |\n# | |\n# 0 --------- 1\n\n# Segment string should definitely be\n# [\"0 1\", \"0 2\", \"1 3\", \"2 3\"]\n\n\ncorrect_segments = [\"0 1\", \"0 2\", \"1 3\", \"2 3\"]\n\nactual_segments = sorted(segment_strings)\n\n\nif actual_segments != correct_segments:\n is_rectangle = False\n\nprint([\"NO\", \"YES\"][is_rectangle])\n\n\n \n \n \n \n\n\t\t\t\t \t\t \t \t\t \t \t\t\t \t\t \t", "pl = [[0,0,0,0], [0,0,0,0], [0,0,0,0], [0,0,0,0]]\r\n\r\nv = []\r\nh = []\r\ns = set()\r\n\r\nfor i in range(4):\r\n linearr = input().split()\r\n for j in range(4):\r\n pl[i][j] = int(linearr[j])\r\n s.add((pl[i][0], pl[i][1]))\r\n s.add((pl[i][2], pl[i][3]))\r\n if (pl[i][0] == pl[i][2]) and (pl[i][1] != pl[i][3]):\r\n v += [i]\r\n elif (pl[i][1] == pl[i][3]) and (pl[i][0] != pl[i][2]):\r\n h += [i]\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nif (len(s) == 4) and (len(v) == 2) and (len(h) == 2):\r\n if (pl[v[0]][0] == pl[v[1]][0]) or (pl[h[0]][1] == pl[h[1]][1]):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "r1 = list(map(int, input().split()))\r\nr2 = list(map(int, input().split()))\r\nr3 = list(map(int, input().split()))\r\nr4 = list(map(int, input().split()))\r\n\r\ncoord = {}\r\nvertical = horizontal = 0\r\nfor r in [r1,r2,r3,r4]:\r\n if r[0] == r[2] and r[1] != r[3]: # x1 e x2 iguais, mas pontos distintos\r\n vertical += 1\r\n elif r[1] == r[3] and r[0] != r[2]: # y1 e y2 iguais, mas pontos distintos\r\n horizontal += 1\r\n if (r[0],r[1]) not in coord:\r\n coord[(r[0],r[1])] = 1\r\n else:\r\n coord[(r[0],r[1])] += 1\r\n if (r[2],r[3]) not in coord:\r\n coord[(r[2],r[3])] = 1\r\n else:\r\n coord[(r[2],r[3])] += 1\r\n\r\nres = False\r\nif vertical == 2 and horizontal == 2:\r\n res = True\r\n for valor in coord.values():\r\n if valor != 2:\r\n res = False\r\n break\r\n\r\nprint(\"YES\") if res else print(\"NO\")", "from sys import stdin\nclass my_vector:\n def __init__(self, x1, y1, x2, y2):\n self.i_coord = (x1, y1)\n self.end_coord = (x2, y2)\n self.my_vector = (y2 - y1, x2 - x1)\n def __mul__(self, other):\n return self.my_vector[0] * other.my_vector[0] + self.my_vector[1] * other.my_vector[1]\ndef problem(lines):\n v_dict = {}\n number = 0\n for row in lines:\n number += 1\n x1, y1, x2, y2 = row.strip().split()\n v_dict[number] = my_vector(int(x1), int(y1), int(x2), int(y2))\n # Check if the first my_vector has connected i and end:\n A = 1\n B = []\n C = []\n D = []\n possible_candidates = {2, 3, 4}\n for i in range(2, 5):\n if v_dict[A].i_coord == v_dict[i].i_coord:\n if v_dict[A].end_coord == v_dict[i].end_coord:\n return False\n possible_candidates.remove(i)\n B.append(i)\n elif v_dict[A].i_coord == v_dict[i].end_coord:\n if v_dict[A].end_coord == v_dict[i].i_coord:\n return False\n possible_candidates.remove(i)\n B.append(i)\n elif v_dict[A].end_coord == v_dict[i].end_coord:\n if v_dict[A].i_coord == v_dict[i].i_coord:\n return False\n possible_candidates.remove(i)\n C.append(i)\n elif v_dict[A].end_coord == v_dict[i].i_coord:\n if v_dict[A].i_coord == v_dict[i].end_coord:\n return False\n possible_candidates.remove(i)\n C.append(i)\n if len(B) == 1 and len(C) == 1:\n B = B.pop()\n C = C.pop()\n D = possible_candidates.pop()\n if v_dict[D].i_coord == v_dict[B].i_coord or v_dict[D].i_coord == v_dict[B].end_coord:\n if v_dict[D].end_coord != v_dict[C].i_coord and v_dict[D].end_coord != v_dict[C].end_coord:\n return False\n elif v_dict[D].end_coord == v_dict[B].i_coord or v_dict[D].end_coord == v_dict[B].end_coord:\n if v_dict[D].i_coord != v_dict[C].i_coord and v_dict[D].i_coord != v_dict[C].end_coord:\n return False\n else:\n return False\n else:\n return False\n x_coord = my_vector(0,0,0,1)\n y_coord = my_vector(0,0,1,0)\n x_p = 0\n y_p = 0\n for i in range(1, 5):\n\n if x_coord * v_dict[i] == 0:\n x_p += 1\n elif y_coord * v_dict[i] == 0:\n y_p += 1\n else:\n return False\n coords = set()\n for _, v in v_dict.items():\n coords.add(v.i_coord)\n coords.add(v.end_coord)\n if len(coords)==4 and x_p == 2 and y_p == 2:\n return True\n else:\n return False\n\n return True\n\n\ndef main():\n if problem(stdin.readlines()):\n print(\"YES\")\n else:\n print(\"NO\")\n\nmain()\n\n \t \t \t \t \t\t \t\t \t \t\t", "s = {0 : 0, 1 : 0}\r\nfor i in range(4) :\r\n a, b, c, d = input().split()\r\n if a == c and b != d :\r\n s[0] += 1\r\n if b == d and a != c :\r\n s[1] += 1\r\n for q in [(a, b), (c, d)] :\r\n s[q] = s.get(q, 0) + 1\r\nif all(i == 2 for i in s.values()) :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "pontos = set()\nretas = set()\nfail = False\nfor i in range (0, 4):\n\ts = list(map(int, input().split()))\n\tif (s[0] != s[2] and s[1] != s[3]):\n\t\tfail = True\n\tp1 = (s[0], s[1])\n\tp2 = (s[2], s[3])\n\tif (p1 == p2):\n\t\tfail = True\n\tmenor = min(p1, p2)\n\tmaior = max(p1, p2)\n\tretas.add((menor[0], menor[1], maior[0], maior[1]))\n\tpontos.add(p1)\n\tpontos.add(p2)\n\nif (len(pontos) != 4 or len(retas) != 4):\n\tfail = True\n\t\n\nordenados = sorted(list(pontos))\n\nif (not fail):\n\tarea = abs(ordenados[2][0] - ordenados[0][0]) * abs(ordenados[1][1] - ordenados[0][1])\n\nif (not fail and ordenados[0][0] == ordenados[1][0] and ordenados[0][1] == ordenados[2][1]\nand ordenados[1][1] == ordenados[3][1] and ordenados[2][0] == ordenados[3][0]\nand area > 0): \n\tprint(\"YES\")\n\nelse:\n\tprint(\"NO\")\n", "\r\nH, V = 0, 0\r\np = set()\r\ns = set()\r\n\r\nfor _ in range(4):\r\n x, y, x_, y_ = list(map(int, input().split()))\r\n if x == x_:\r\n V += 1\r\n if y == y_:\r\n H += 1\r\n\r\n p.add((x, y)); p.add((x_, y_))\r\n s.add(((x, y), (x_, y_)))\r\n s.add(((x_, y_), (x, y)))\r\n\r\nif len(s) != 8 or len(p) != 4 or H != 2 or V != 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "x, y = 0, 0\r\nmp = {}\r\nfor i in range(4):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n if x1==x2 and y1!=y2:\r\n x += 1\r\n if y1==y2 and x1!=x2:\r\n y += 1\r\n if (x1,y1) not in mp:\r\n mp[(x1,y1)] = 1\r\n else:\r\n mp[(x1,y1)] += 1\r\n if (x2,y2) not in mp:\r\n mp[(x2,y2)] = 1\r\n else:\r\n mp[(x2,y2)] += 1\r\nflag = False\r\nif x==2 and y==2:\r\n flag = True\r\nfor key, wd in mp.items():\r\n if wd != 2:\r\n flag = False\r\nprint ('YES') if flag else print('NO')", "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\nA=[]\r\nfor i in range(4):\r\n x1,y1,x2,y2=L()\r\n A.append(sorted([(x1,y1),(x2,y2)]))\r\nA.sort()\r\n\r\ncondition=True \r\n\r\ncondition&=(A[0][0]==A[1][0])\r\ncondition&=(A[0][1]==A[2][0])\r\ncondition&=(A[1][1]==A[3][0])\r\ncondition&=(A[2][1]==A[3][1])\r\ncondition&=(A[0][0][0]==A[0][1][0])\r\ncondition&=(A[1][0][1]==A[1][1][1])\r\ncondition&=(A[2][0][1]==A[2][1][1])\r\ncondition&=(A[3][0][0]==A[3][1][0])\r\ncondition&=(A[0][0]!=A[0][1])\r\ncondition&=(A[1][0]!=A[1][1])\r\ncondition&=(A[2][0]!=A[2][1])\r\ncondition&=(A[3][0]!=A[3][1])\r\n\r\nif condition:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\ndef check_pendiente(p1, p2):\n\n try:\n result = (p2[1] - p1[1]) / (p2[0] - p1[0]) == 0\n\n if result:\n return 0\n else:\n return \"No\"\n\n except ZeroDivisionError:\n return -1\n\ndef check_segments(segments):\n\n zero_counter = 0\n undef_counter = 0\n\n for segment in segments:\n\n result = check_pendiente(segment[0], segment[1])\n\n if result == 0:\n zero_counter += 1\n elif result == -1:\n undef_counter += 1\n\n if result not in [-1, 0]:\n print(\"NO\")\n return False\n\n if (zero_counter == undef_counter) and (zero_counter + undef_counter == 4):\n return True\n else:\n print(\"NO\")\n return False\n\n\ndef is_rectangle(x1, y1, x2, y2, x3, y3, x4, y4):\n\n lengths = [\n (x1 - x2) ** 2 + (y1 - y2) ** 2,\n (x2 - x3) ** 2 + (y2 - y3) ** 2,\n (x3 - x4) ** 2 + (y3 - y4) ** 2,\n (x4 - x1) ** 2 + (y4 - y1) ** 2\n ]\n\n lengths.sort()\n\n if (lengths[0] != lengths[1]) or (lengths[2] != lengths[3]):\n return \"NO\"\n\n return \"YES\"\n\n\ndef unico(points):\n explored = set()\n return [x for x in points if not (x in explored or explored.add(x))]\n\npoint_list = list()\nsegments = []\n\nfor _ in range(4):\n x1, y1, x2, y2 = map(int, input().split())\n point_list.append((x1, y1))\n point_list.append((x2, y2))\n\n segments.append([[x1, y1], [x2, y2]])\n\npoint_list = unico(point_list)\n\nif len(point_list) != 4:\n print(\"NO\")\nelse:\n if check_segments(segments):\n print(is_rectangle(point_list[0][0], point_list[0][1], point_list[1][0], point_list[1][1], point_list[2][0], point_list[2][1], point_list[3][0], point_list[3][1]))\n\n\t\t\t\t\t \t\t \t\t \t \t \t\t \t", "coordinates = set()\nsegments = set()\nis_rectangle = True\nhorizontal_lengths = set()\nvertical_lengths = set()\n\nfor _ in range(4):\n x1, y1, x2, y2 = map(int, input().strip().split(\" \"))\n if x1 == x2 and y1 == y2:\n is_rectangle = False\n elif x1 == x2:\n vertical_lengths.add(abs(y1 - y2))\n elif y1 == y2:\n horizontal_lengths.add(abs(x1 - x2))\n else:\n is_rectangle = False\n segments.add(tuple(sorted([(x1, y1), (x2, y2)])))\n coordinates.add((x1, y1))\n coordinates.add((x2, y2))\n\nif is_rectangle and len(coordinates) == 4 and len(segments) == 4 and len(horizontal_lengths) == 1 and len(vertical_lengths) == 1:\n setx = set()\n sety = set()\n for i in coordinates:\n setx.add(i[0])\n sety.add(i[1])\n if len(setx) == 2 and len(sety) == 2:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")\n\n \t\t \t \t \t \t\t \t\t \t\t\t \t\t\t \t", "x1 = []\ny1 = []\nx2 = []\ny2 = []\nfor i in range(4):\n a,b,c,d=map(int,input().split())\n x1.append(a)\n y1.append(b)\n x2.append(c)\n y2.append(d)\n\n# vemos cuantas coord hor y ver hay\ncoord_h = 0\ncoord_v = 0\nfor i in range(4):\n if x1[i]==x2[i]:\n coord_h += 1\n if y1[i]==y2[i]:\n coord_v += 1\n\n# Ahora q sea un cuadrado bien hecho xd\ne = 0\nfor i in range(3):\n for j in range(i + 1, 4):\n if (x1[i] == x2[j] and y1[i] == y2[j]) or (x1[i] == x1[j] and y1[i] == y1[j]) or (x2[i] == x1[j] and y2[i] == y1[j]) or (x2[i] == x2[j] and y2[i] == y2[j]):\n e+=1\n\nif (coord_h, coord_v, e) == (2,2,4):\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", "# Try to do in 30 minutes\r\n# 4 segments are given\r\n\r\n\r\ndef read_points():\r\n hSegs = []\r\n vSegs = []\r\n for i in range(4):\r\n rawline = input().split()\r\n line = {\"p1\":[int(rawline[0]),int(rawline[1])],\"p2\":[int(rawline[2]),int(rawline[3])]}\r\n\r\n if line[\"p1\"][0] == line[\"p2\"][0]: # X values the same, Vertical line\r\n if line[\"p1\"][1] > line[\"p2\"][1]: # Swap order so p1 is smaller\r\n line[\"p2\"][1], line[\"p1\"][1] = line[\"p1\"][1], line[\"p2\"][1]\r\n vSegs.append(line)\r\n\r\n elif line[\"p1\"][1] == line[\"p2\"][1]: # Y values the same, horizontal line\r\n if line[\"p1\"][0] > line[\"p2\"][0]: # Swap order so p1 is smaller\r\n line[\"p2\"][0], line[\"p1\"][0] = line[\"p1\"][0], line[\"p2\"][0]\r\n hSegs.append(line)\r\n\r\n else:\r\n return False\r\n \r\n if line[\"p1\"][1] == line[\"p2\"][1] and line[\"p1\"][0] == line[\"p2\"][0]: # line segments length = 0\r\n return False\r\n \r\n if len(hSegs) != 2 or len(vSegs) != 2:\r\n return False\r\n\r\n hSegs.sort(key=lambda a : a[\"p1\"][1])\r\n vSegs.sort(key=lambda a : a[\"p1\"][0])\r\n\r\n if hSegs[0]['p1'][1] == hSegs[1]['p1'][1] or vSegs[0]['p1'][0] == vSegs[1]['p1'][0]: # no area\r\n return False\r\n \r\n for h in hSegs:\r\n if h['p1'][0] != vSegs[0]['p1'][0]: #line does not touch 1st vert\r\n return False\r\n if h['p2'][0] != vSegs[1]['p1'][0]: #line does not touch 2nd vert\r\n return False\r\n \r\n for v in vSegs:\r\n if v['p1'][1] != hSegs[0]['p1'][1]: #line does not touch 1st horizontal\r\n return False\r\n if v['p2'][1] != hSegs[1]['p1'][1]: #line does not touch 2nd horizontal\r\n return False\r\n\r\n return True\r\n\r\n\r\nprint(\"YES\" if read_points() else \"NO\")", "def main():\n x_s, y_s = set(), set()\n edges = set()\n\n for _ in range(4):\n x1, y1, x2, y2 = map(int, input().split())\n\n x1, x2 = min(x1, x2), max(x1, x2)\n y1, y2 = min(y1, y2), max(y1, y2)\n\n edges.add((x1, y1, x2, y2))\n\n x_s |= {x1, x2}\n y_s |= {y1, y2}\n\n if len(edges) != 4:\n return False\n\n x_min, y_min, x_max, y_max = min(x_s), min(y_s), max(x_s), max(y_s)\n\n if x_max == x_min or y_max == y_min:\n return False\n\n if (x_min, y_min, x_max, y_min) not in edges or \\\n (x_min, y_min, x_min, y_max) not in edges or \\\n (x_max, y_min, x_max, y_max) not in edges or \\\n (x_min, y_max, x_max, y_max) not in edges:\n return False\n\n return True\n\n\nif main():\n print('YES')\nelse:\n print('NO')", "hor=[]\r\nver=[]\r\npoints=[]\r\nfor i in range(4):\r\n data=input()\r\n lst=[int(i) for i in data.split()]\r\n x1,y1,x2,y2=lst\r\n points.extend([[x1,y1],[x2,y2]])\r\n if x1==x2:\r\n if y1!=y2:\r\n ver.append(y1)\r\n elif y1==y2:\r\n if x1!=x2:\r\n hor.append(x1)\r\n else: \r\n break\r\ncheck=True\r\n\r\nif not(len(ver)==len(hor)==2):\r\n check=False\r\n \r\ndef checkpoints(points):\r\n for point in points:\r\n if points.count(point)!=2:\r\n return False \r\n return True\r\n \r\nif check:\r\n if checkpoints(points):\r\n print('YES')\r\n else:\r\n check=False\r\n\r\nif not check:\r\n print('NO')\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n", "s = {0: 0, 1: 0}\nfor i in range(4):\n a, b, c, d = input().split()\n if a == c and b != d: s[0] += 1\n if b == d and a != c: s[1] += 1\n for q in [(a, b), (c, d)]: s[q] = s.get(q, 0) + 1\nprint('YES' if all(i == 2 for i in s.values()) else 'NO')\n\n\t\t\t\t \t \t\t\t\t \t\t\t\t \t \t \t \t \t\t", "points={};\r\nf=0;\r\nypara=0;\r\nxpara=0;\r\nfor i in range(4):\r\n x1,y1,x2,y2=map(int,input().split());\r\n if (x1,y1)!=(x2,y2):\r\n if (x1-x2)!=0 and (y1-y2)!=0:\r\n f=1;\r\n break;\r\n if (x1-x2)==0:\r\n ypara+=1;\r\n if (y1-y2)==0:\r\n xpara+=1;\r\n if (x1,y1) in points:\r\n points[(x1,y1)]+=1;\r\n else:\r\n points[(x1,y1)]=1;\r\n if (x2,y2) in points:\r\n points[(x2,y2)]+=1;\r\n else:\r\n points[(x2,y2)]=1;\r\n else:\r\n f=1;\r\n break;\r\n\r\nif f:\r\n print('NO');\r\nelse:\r\n if len(points)!=4 or xpara!=2 or ypara!=2:\r\n print('NO');\r\n else:\r\n for i in range(4):\r\n if points[next(iter(points))]!=2:\r\n print('NO');\r\n break;\r\n else:\r\n del points[next(iter(points))];\r\n if len(points)==0:\r\n print('YES');\r\n", "horizontal = 0\nvertical = 0\npoints = set()\nseg = set()\n\nfor _ in range(4):\n coord_in = input()\n coord = coord_in.split()\n coord = list(map(int, coord))\n x1 = coord[0]\n y1 = coord[1]\n x2 = coord[2]\n y2 = coord[3]\n\n if x1 == x2:\n vertical += 1\n if y1 == y2:\n horizontal += 1\n\n points.add((x1, y1))\n points.add((x2, y2))\n seg.add(((x1, y1), (x2, y2)))\n seg.add(((x2, y2), (x1, y1)))\n\np_max = max(points)\nx_max = p_max[0]\ny_max = p_max[1]\np_min = min(points)\nx_min = p_min[0]\ny_min = p_min[1]\n\nif (x_max == x_min) or (y_max == y_min):\n print(\"NO\")\nelif (len(seg) != 8) or (len(points) != 4) or (horizontal != 2) or (vertical != 2):\n print(\"NO\")\nelse:\n print(\"YES\")\n \t \t \t \t\t \t\t\t\t\t \t\t\t \t\t\t", "a={}\r\nox,oy=0,0\r\nfor i in range(4):\r\n x1,y1,x2,y2=map(int,input().split())\r\n a[(x1,y1)]=a.get((x1,y1),0)+1\r\n a[(x2,y2)]=a.get((x2,y2),0)+1\r\n if x1==x2 and y1!=y2: ox+=1\r\n if y1==y2 and x1!=x2: oy+=1\r\nans=\"YES\"\r\nfor p in a.values():\r\n if p!=2:\r\n ans=\"NO\"\r\n break\r\nif ox!=2 or oy!=2:\r\n ans=\"NO\"\r\nprint(ans)", "\ndef is_rect():\n def seg():\n [x0, y0, x1, y1] = input().split(' ')\n return int(x0), int(y0), int(x1), int(y1)\n\n def parallel(x0, x1, y0, y1, x2, x3, y2, y3):\n return y0 == y1 and y2 == y3 and y0 != y2 and ((x2 == x0 and x3 == x1) or (x3 == x0 and x2 == x1))\n\n def shared(sx0, sy0, x1, y1, x2, y2):\n return sx0, y1, x2, y1, x2, sy0, x2, y1\n\n x0, y0, x1, y1 = seg()\n x2, y2, x3, y3 = seg()\n x4, y4, x5, y5 = seg()\n x6, y6, x7, y7 = seg()\n\n def find_corner(x0, y0, x1, y1, x2, y2, x3, y3):\n if x0 == x2 and y0 == y2:\n return x0, y0\n elif x0 == x3 and y0 == y3:\n return x0, y0\n elif x1 == x2 and y1 == y2:\n return x1, y1\n elif x1 == x3 and y1 == y3:\n return x1, y1\n else:\n return None, None\n\n def flip_seg(cx, cy, x0, y0, x1, y1):\n if cx == x0 and cy == y0:\n return x0, y0, x1, y1\n elif cx == x1 and cy == y1:\n return x1, y1, x0, y0\n\n cx0, cy0 = find_corner(x0, y0, x1, y1, x2, y2, x3, y3)\n if cx0 == None:\n # Segments are parallel\n cx0, cy0 = find_corner(x0, y0, x1, y1, x4, y4, x5, y5)\n if cx0 == None:\n cx0, cy0 = find_corner(x0, y0, x1, y1, x6, y6, x7, y7)\n if cx0 == None:\n return False\n else:\n x2, y2, x3, y3, x6, y6, x7, y7 = x6, y6, x7, y7, x2, y2, x3, y3\n else:\n x2, y2, x3, y3, x4, y4, x5, y5 = x4, y4, x5, y5, x2, y2, x3, y3\n\n cx1, cy1 = find_corner(x4, y4, x5, y5, x6, y6, x7, y7)\n if cx1 == None:\n return False\n\n if cx0 == cx1 or cy0 == cy1:\n return False\n\n x0, y0, x1, y1 = flip_seg(cx0, cy0, x0, y0, x1, y1)\n x2, y2, x3, y3 = flip_seg(cx0, cy0, x2, y2, x3, y3)\n x4, y4, x5, y5 = flip_seg(cx1, cy1, x4, y4, x5, y5)\n x6, y6, x7, y7 = flip_seg(cx1, cy1, x6, y6, x7, y7)\n\n if x1 == x0:\n pass\n elif y1 == y0:\n x0, y0, x1, y1, x2, y2, x3, y3 = x2, y2, x3, y3, x0, y0, x1, y1\n else:\n return False\n if x0 != x1 or y2 != y3:\n return False\n\n if x5 == x4:\n pass\n elif y5 == y4:\n x4, y4, x5, y5, x6, y6, x7, y7 = x6, y6, x7, y7, x4, y4, x5, y5\n else:\n return False\n if x4 != x5 or y6 != y7:\n return False\n\n if y1 == cy1 and x3 == cx1 and y5 == cy0 and x7 == cx0:\n return True\n else:\n return False\n\n\nif is_rect():\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t\t\t \t\t\t\t \t\t \t \t\t \t", "p = []\r\nmp = {}\r\npx, py = 0, 0\r\nflag = True\r\n\r\nfor i in range(4):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n if x1 != x2 and y1 != y2:\r\n flag = False\r\n elif x1 == x2:\r\n px += 1\r\n elif y1 == y2:\r\n py += 1\r\n else:\r\n flag = False\r\n mp[(x1, y1)] = mp.get((x1, y1), 0) + 1\r\n mp[(x2, y2)] = mp.get((x2, y2), 0) + 1\r\n p.append((x2, y2))\r\n p.append((x1, y1))\r\n\r\nif px != 2 or py != 2:\r\n flag = False\r\nfor i in range(len(p)):\r\n if mp[p[i]] != 2:\r\n flag = False\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x1, y1, x2, y2 = [], [], [], []\r\ns = set()\r\nfor i in range(4):\r\n\ta, b, c, d = map(int, input().split())\r\n\tif a > c:\r\n\t\ta, c = c, a\r\n\tif b > d:\r\n\t\tb, d = d, b\r\n\tx1.append(a)\r\n\ty1.append(b)\r\n\tx2.append(c)\r\n\ty2.append(d)\r\n\ts.add((a, b, c, d))\r\nxmin, ymin = min(min(x1), min(x2)), min(min(y1), min(y2))\r\nxmax, ymax = max(max(x1), max(x2)), max(max(y1), max(y2))\r\ns1 = set()\r\ns1.add((xmin, ymin, xmin, ymax))\r\ns1.add((xmin, ymin, xmax, ymin))\r\ns1.add((xmin, ymax, xmax, ymax))\r\ns1.add((xmax, ymin, xmax, ymax))\r\nif s == s1 and len(s) == 4:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\r\nH, V = 0, 0\r\n\r\nS = []\r\nfor _ in range(4):\r\n x, y, x_, y_ = list(map(int, input().split()))\r\n S.append(((x, y), (x_, y_)))\r\n if x == x_:\r\n V += 1\r\n if y == y_:\r\n H += 1\r\n\r\nans = True\r\nfor s in S:\r\n cnt1 = 0; cnt2 = 0\r\n for s_ in S:\r\n cnt1 += (s[0] in s_)\r\n cnt2 += (s[1] in s_)\r\n if cnt1 != 2 or cnt2 != 2:\r\n ans = False\r\n\r\nprint(\"YES\" if (ans and H == 2 and V == 2) else \"NO\")\r\n", "h = 0\r\nt = 0\r\nv = set()\r\nj = set()\r\nfor _ in range(4):\r\n a, b, c, d = list(map(int, input().split()))\r\n if a == c:\r\n h +=1\r\n if b == d:\r\n t +=1\r\n v.add((a, b))\r\n v.add((c, d))\r\n j.add(((a, b), (c, d)))\r\n j.add(((c, d), (a, b)))\r\nif len(j)==8 and len(v) == 4 and t == 2 and h == 2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "dicionario=dict()\n\ncontadorA,contadorB=0,0\n\nfor i in range(4):\n a,b,c,d=input().split()\n \n for q in [(a, b), (c, d)]:\n dicionario[q] = dicionario.get(q, 0) + 1\n \n if a == c and b != d:\n contadorA+=1\n \n if b == d and a != c:\n contadorB+=1\n \nresultFlag=\"YES\"\nvalores=dicionario.values()\n\nfor valor in valores:\n if valor != 2:\n resultFlag=\"NO\"\n break\n \nif contadorA != 2 or contadorB != 2:\n resultFlag=\"NO\"\n \nprint(resultFlag)\n\n\t \t \t\t\t\t\t\t\t \t \t\t \t \t\t \t \t \t", "\r\n\r\n######################################################################\r\n# Write your code here\r\nimport sys\r\n#import resource\r\n#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])\r\n#sys.setrecursionlimit(0x100000)\r\n# Write your code here\r\n# For getting input from input.txt file \r\n# sys.stdin = open('input.txt', 'r') \r\n# Printing the Output to output.txt file \r\n# sys.stdout = open('output.txt', 'w')\r\nRI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nrw = lambda : sys.stdin.readline().strip().split()\r\nri = lambda : int(sys.stdin.readline().strip())\r\nrs = lambda : sys.stdin.readline().strip()\r\nfrom collections import defaultdict as df\r\n#import heapq \r\n#heapq.heapify(li) heappush(li,4) heappop(li)\r\nimport random\r\n# random.shuffle(list)\r\n#infinite = float('inf')\r\n#######################################################################\r\nfrom queue import PriorityQueue as pq\r\n# from math import pow as p\r\nfrom math import ceil\r\n\r\nd = set()\r\nedges = set()\r\nxmin,xmax,ymin,ymax = float('inf'),-float('inf'),float('inf'),-float('inf')\r\nfor i in range(4):\r\n\tx1,y1,x2,y2 = RI()\r\n\tedges.add((x1,y1,x2,y2))\r\n\td.add((x1,y1))\r\n\td.add((x2,y2))\r\n\txmax = max(xmax,x1,x2)\r\n\txmin = min(xmin,x1,x2)\r\n\tymax = max(ymax,y1,y2)\r\n\tymin = min(ymin,y1,y2)\r\nif(len(d)!=4):\r\n\tprint(\"NO\")\r\n\texit(0)\r\n\r\nif(xmax == xmin or ymax == ymin):\r\n\tprint(\"NO\")\r\n\texit(0)\r\n\r\n\r\nif( ((xmin,ymin,xmax,ymin) not in edges) and ((xmax,ymin,xmin,ymin) not in edges) ):\r\n\tprint(\"NO\")\r\n\texit(0)\r\n\r\nif( ((xmin,ymin,xmin,ymax) not in edges) and ((xmin,ymax,xmin,ymin) not in edges) ):\r\n\tprint(\"NO\")\r\n\texit(0)\r\n\r\nif( ((xmax,ymax,xmax,ymin) not in edges) and ((xmax,ymin,xmax,ymax) not in edges) ):\r\n\tprint(\"NO\")\r\n\texit(0)\r\n\r\nif( ((xmin,ymax,xmax,ymax) not in edges) and ((xmax,ymax,xmin,ymax) not in edges) ):\r\n\tprint(\"NO\")\r\n\texit(0)\r\n\r\nprint(\"YES\")\r\n\r\n", "import collections\r\ncoordinates=[]\r\nfor _ in range(4):\r\n x1,y1,x2,y2=map(int,input().split())\r\n l1=sorted([[x1,y1],[x2,y2]])\r\n if [x1,y1]==[x2,y2]:print(\"NO\");exit()\r\n if x1==x2 and y1!=y2:\r\n coordinates.append(l1)\r\n elif y1==y2 and x1!=x2:\r\n coordinates.append(l1)\r\n else:print(\"NO\");exit()\r\ncoordinates.sort()\r\nfor i in coordinates:\r\n if coordinates.count(i)>1:\r\n print(\"NO\")\r\n exit()\r\nif coordinates[0][0]==coordinates[1][0] and coordinates[0][1]==coordinates[2][0]:\r\n if coordinates[1][1]==coordinates[3][0] and coordinates[2][1]==coordinates[3][1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n print(\"NO\")\r\n exit()\r\n" ]

[ "data = {}\r\nfor _ in range(int(input())):\r\n x, k = map(int, input().split())\r\n if k in data:\r\n data[k].append(x)\r\n else:\r\n data[k] = [x]\r\nflag = True\r\nfor counts in data.values():\r\n allowed = 0\r\n for count in counts:\r\n if count > allowed:\r\n flag = False\r\n break\r\n if count == allowed:\r\n allowed += 1\r\n if not flag:\r\n break\r\nprint(['NO', 'YES'][flag])", "import sys\r\nread = sys.stdin.readline\r\n\r\nn = int(read())\r\na = []\r\nfor _ in range(100000): a.append(-1)\r\n\r\nb = True\r\nfor i in range(n):\r\n x,k = map(int, read().split())\r\n k -= 1\r\n b &= a[k] >= x - 1\r\n a[k] = max(a[k], x)\r\n \r\nsys.stdout.write(\"YES\" if b else \"NO\")", "t=int(input())\r\ndicti={}\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n if dicti.get(b,0)>=a:\r\n if dicti.get(b,0)>a:\r\n dicti[b]=dicti[b]\r\n else:\r\n dicti[b]=a+1\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\nd = {}\nfor i in range(n):\n\tp = list(map(int, input().split()))\n\tif p[0] == 0:\n\t\td[p[1]] = d.get(p[1], 0)\n\telse:\n\t\tif p[0] - d.get(p[1], -1) > 1:\n\t\t\tprint(\"NO\")\n\t\t\texit()\n\t\td[p[1]] = max(d[p[1]], p[0])\nprint(\"YES\")\t\t\n", "#the basic idea is to use a dict to record every participant's submission\n\nn = int(input())\nparticipants = {}\norder = True\nwhile n:\n\tn -= 1\n\tx, k = map(int,input().split())\n\tif k in participants:\n\t\tif x in participants[k]:\n\t\t\tcontinue\n\t\telif x-1 in participants[k]:\n\t\t\tparticipants[k].add(x)\n\t\telse:\n\t\t\torder = False\n\t\t\tbreak\n\telse:\n\t\tif x != 0:\n\t\t\torder = False\n\t\t\tbreak\n\t\ttmp = set()\n\t\ttmp.add(x)\n\t\tparticipants[k] = tmp\n\n\nif order:\n print(\"YES\")\nelse:\n print(\"NO\") \n", "c = [0] * 100001\r\nfor i in range(int(input())):\r\n x, k = map(int, input().split())\r\n if x == c[k]:\r\n c[k] += 1\r\n elif x > c[k]:\r\n print('NO')\r\n exit()\r\nprint('YES')", "import collections\r\nimport math\r\nimport sys\r\n \r\n \r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n \r\n \r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\n \r\n \r\ndef input(): return sys.stdin.readline().strip()\r\n \r\n \r\nMOD = 1000000007\r\n \r\nn = int(input())\r\narr = [0] * int(1e6 + 1)\r\nfor i in range(n):\r\n x, k = get_ints()\r\n if arr[k] == x:\r\n arr[k] += 1\r\n elif x > arr[k]:\r\n print('NO')\r\n sys.exit(0)\r\nprint('YES')", "from collections import deque\r\nfor _ in range(1):\r\n n = int(input())\r\n visited = set()\r\n flag = 1\r\n for i in range(n):\r\n x,k = map(int,input().split())\r\n if x == 0:\r\n visited.add((x,k))\r\n\r\n else:\r\n if (x-1,k) in visited:\r\n visited.add((x, k))\r\n\r\n else:\r\n flag = 0\r\n\r\n if flag:\r\n print(\"YES\")\r\n\r\n else:\r\n print(\"NO\")", "n = int(input())\n\ntasks = {}\nfail = False\n\nfor i in range(n):\n\tx, k = map(int, input().split())\n\tif k not in tasks:\n\t\tif x == 0:\n\t\t\ttasks[k] = {x}\n\t\telse:\n\t\t\tfail = True\n\t\t\tbreak\n\telse:\n\t\tif x == 0:\n\t\t\tif x in tasks[k]:\n\t\t\t\ttasks[k].add(x)\n\t\t\telse:\n\t\t\t\tfail = True\n\t\t\t\tbreak\n\t\telif x > 0:\n\t\t\tif (x-1) in tasks[k]:\n\t\t\t\ttasks[k].add(x)\n\t\t\telse:\n\t\t\t\tfail = True\n\t\t\t\tbreak\n\t\telse:\n\t\t\tfail = True\n\t\t\tbreak\n\nif fail:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n", "\r\n\r\nn = int(input())\r\n\r\nr = [\"NO\", \"YES\"]\r\n\r\nd = {}\r\n\r\nfor _ in range(n):\r\n x, k = map(int, input().split(\" \"))\r\n a = d.get(k, -1)\r\n if a + 1 < x:\r\n print(r[0])\r\n exit(0)\r\n elif a + 1 == x:\r\n d[k] = x\r\n \r\nprint(r[1])\r\n \r\n ", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = dict()\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n if b not in d:\r\n if a != 0:\r\n print('NO')\r\n exit(0)\r\n else:\r\n d[b] = 0\r\n else:\r\n if a - d[b] > 1:\r\n print('NO')\r\n exit(0)\r\n else:\r\n d[b] = max(d[b], a)\r\nprint('YES')\r\n", "n = int(input())\r\n\r\nm = []\r\nd = dict()\r\n\r\nfor i in range(n):\r\n x, k = map(int, input().split())\r\n\r\n if k in d:\r\n r = d[k]\r\n if x > r+1:\r\n print('NO')\r\n exit()\r\n d[k] = max(r, x)\r\n else:\r\n if x != 0:\r\n print('NO')\r\n exit()\r\n d[k] = x\r\n\r\nprint('YES')", "def adds(s,x,k):\r\n\tif k in s.keys():\r\n\t\txs=s[k]\r\n\t\tif x<=xs:\r\n\t\t\treturn 0\r\n\t\telse:\r\n\t\t\tif x-1==xs:\r\n\t\t\t\ts[k]=x\r\n\t\t\t\treturn 0\r\n\t\t\telse:\r\n\t\t\t\treturn 1\r\n\telse:\r\n\t\tif x==0:\r\n\t\t\ts[k]=0\r\n\t\t\treturn 0\r\n\t\telse:\r\n\t\t\treturn 1\r\n\r\ndef corr(v):\r\n\ts=dict()\r\n\tfor c in v:\r\n\t\tif adds(s,c[0],c[1]):\r\n\t\t\treturn 0\r\n\treturn 1\r\n\r\nn=int(input())\r\nv=[]\r\nfor c in range(n):\r\n\tx,k=map(int,input().split(' '))\r\n\tv.append((x,k))\r\nif corr(v):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\nuser = 100001 * [-1]\r\nfor i in range(n):\r\n x, k = map(int, input().split())\r\n if user[k] == x - 1:\r\n user[k] = x\r\n elif user[k] < x - 1:\r\n print('NO')\r\n exit()\r\nprint('YES')", "n = int(input())\np = 0\na = []\nfor _ in range(n):\n x, k = list(map(int, input().split()))\n while k > len(a):\n a.append(-1)\n k = k - 1\n if a[k] < x - 1:\n print('NO')\n exit()\n else:\n a[k] = max(x, a[k])\nprint('YES')", "n = int(input())\nfrom collections import defaultdict\na = defaultdict(lambda: {-1})\nfor i in range(n):\n x,k = map(int,input().split())\n p = a[k]\n if x-1 not in p:\n print('NO')\n break\n else:\n a[k].add(x)\nelse:\n print('YES')\n", "for _ in range(int(input()) if not True else 1):\r\n n = int(input())\r\n a = []\r\n pos = True\r\n for i in range(n):\r\n x, k = map(int, input().split())\r\n if x > len(a):\r\n pos = False\r\n break\r\n if x != 0 and k not in a[x-1]:\r\n pos = False\r\n break\r\n if x == len(a):\r\n a += [{k}]\r\n else:\r\n a[x].add(k)\r\n if not pos:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "import sys\r\n\r\n\r\ndef main():\r\n f = sys.stdin\r\n n = int(f.readline())\r\n\r\n count = dict()\r\n for _ in range(n):\r\n x, k = map(int, f.readline().split())\r\n if k not in count:\r\n count[k] = -1\r\n if count[k] < x - 1:\r\n print(\"NO\")\r\n return \r\n count[k] = max(count[k], x)\r\n print(\"YES\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\nfrom math import *\nfrom collections import Counter\ninput=sys.stdin.readline\n\ndef isSorted(a):\n for i in range(1, len(a)):\n if a[i] < a[i-1]:\n return False\n return True\n\nd={}\n# for _ in range(int(input())):\nn=int(input())\nfor i in range(n):\n a,b=map(int,input().split())\n a,b=b,a\n # print(d)\n if a in d:\n if b in d[a]:\n continue\n elif b-1 in d[a]:\n d[a].add(b)\n else:\n print(\"NO\")\n exit()\n if not a in d:\n if b==0:\n d[a]=set([b])\n else:\n print(\"NO\")\n exit()\nprint(\"YES\")\n\n ", "n = int(input())\r\nc = [-1] * 100001\r\nfor i in range(n):\r\n\tx, k = map(int, input().split())\r\n\tif x > c[k] + 1:\r\n\t\tprint('NO')\r\n\t\tbreak\r\n\tc[k] = max(c[k], x)\r\nelse:\r\n\tprint('YES')# 1697807799.4821746", "def solve():\r\n n = int(input())\r\n p = True\r\n d = []\r\n for _ in range(int(1e5 + 1)):\r\n d.append(set())\r\n\r\n for _ in range(n):\r\n x, k = map(int, input().split())\r\n if x > 0 and x - 1 not in d[k]:\r\n p = False\r\n else:\r\n d[k].add(x)\r\n print('YES' if p else 'NO')\r\n\r\n\r\nsolve()\r\n", "d = [0] * 100001\r\n\r\nfor _ in range(int(input())):\r\n v, k = map(int, input().split())\r\n if v > d[k]:\r\n print('NO')\r\n exit()\r\n elif v == d[k]:\r\n d[k] += 1\r\nprint('YES')\r\n", "n = int(input())\r\nvis = set()\r\nflag = 1\r\nfor i in range(n):\r\n x,k = map(int,input().split())\r\n if x == 0:\r\n vis.add((x,k))\r\n else:\r\n if (x-1,k) in vis:\r\n vis.add((x,k))\r\n else:\r\n flag = 0\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")" ]

[ "n,d=map(int,input().split())\r\nm=[]\r\na=0\r\nfor i in range(d):\r\n l=input()[:n]\r\n if \"0\" in l:\r\n a=a+1\r\n else:\r\n m.append(a)\r\n a=0\r\n if i==d-1:\r\n m.append(a)\r\nprint(max(m))\r\n", "n,d=map(int,input().split())\r\nm=0\r\ncount=0\r\nf=1\r\nfor i in range(d):\r\n s=input()\r\n for j in s:\r\n if j=='0':\r\n f=1 \r\n break\r\n else:\r\n f=0\r\n if f==1:\r\n count+=1 \r\n else:\r\n count=0 \r\n if count>m:\r\n m=count \r\nprint(m)", "n,d = map(int,input().split())\r\npresent = []\r\nfor i in range(d):\r\n a = list(map(int,input().strip()))\r\n present.append(a)\r\nmaxi = 0\r\ncount = 0\r\nfor i in range(d):\r\n if 0 in present[i]:\r\n count += 1\r\n maxi = max(maxi,count)\r\n else:\r\n count = 0\r\nprint(maxi)", "n,d=map(int,input().split())\r\nbrr=[]\r\ncount=0\r\nmax=0\r\nwhile d!=0:\r\n s=input()\r\n li=list(s)\r\n if li.count('0')>=1:\r\n count+=1\r\n else:\r\n count=0\r\n if count!=0:\r\n if max<count:\r\n max=count\r\n d=d-1\r\nprint(max)", "m,n=input().split()\r\nans=count=0\r\nfor i in range (int(n)):\r\n if '0' in input() : count+=1\r\n else : count=0\r\n ans=max(ans,count)\r\nprint(ans)", "m,n=map(int,input().split())\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n s=input()\r\n if(s.count('1')<m):\r\n c=c+1\r\n else:\r\n l.append(c)\r\n c=0\r\n l.append(c)\r\nprint(max(l))\r\n", "n,m=map(int,input().split())\r\ncnt=mx=0\r\nfor i in range(m):\r\n if '0' in input():cnt+=1\r\n else: cnt=0\r\n mx=max(cnt,mx)\r\nprint(mx)", "from sys import stdin\nfrom itertools import groupby\n\nreadln = stdin.readline\nn, d = map(int,readln().split())\nl = ['0' in readln() for _ in range(d)]\nl = [list(y) for g,y in groupby(l) if g]\nprint(max(map(len,l),default=0))\n", "n, d = map(int, input().split())\r\nans = streak = 0\r\nfor i in range(d):\r\n s = input().count('1')\r\n if s < n:\r\n streak += 1\r\n else:\r\n streak = 0\r\n ans = max(ans, streak)\r\nprint(ans)", "l=[int(x) for x in input().split()]\r\nopp=l[0]\r\nday=l[1]\r\nl3=[]\r\n\r\ndef product(l):\r\n pro=1\r\n for i in range(len(l)):\r\n pro=pro*int(l[i])\r\n if pro==0:\r\n return 0\r\n else:\r\n return 1\r\nfor i in range(day):\r\n l2=input()\r\n l3.append(product(l2))\r\n\r\nmaxcons=0\r\ncons=0\r\nfor i in range(day):\r\n if l3[i]==0:\r\n cons+=1\r\n else:\r\n cons=0\r\n maxcons=max(maxcons,cons)\r\n\r\nprint(maxcons) \r\n\r\n\r\n\r\n\r\n\r\n \r\n", "n,d=map(int,input().split())\r\nc=0\r\nl=[]\r\ndd=0\r\nfor i in range(d):\r\n s=input()\r\n l.append(s)\r\n\r\nfor j in l:\r\n w=list(j)\r\n if(w.count('1')!=n):\r\n c+=1\r\n \r\n else:\r\n dd=max(c,dd)\r\n \r\n c=0\r\ndd=max(c,dd)\r\nprint(dd)", "n,a=map(int,input().split())\r\nar=[]\r\nc=0\r\nm=0\r\nfor i in range(a):\r\n ar.append(input())\r\nfor i in ar:\r\n if \"0\" in i:\r\n c+=1\r\n m=max(c,m)\r\n else:\r\n c=0\r\nprint(m)", "# Opponents\ndef fight(ar):\n ans = 0\n fin = 0\n for i in ar:\n if i.count('1') == len(i):\n fin = max(fin, ans)\n ans = 0\n \n else:\n ans += 1\n return max(fin, ans)\n\n\n\nn, d = list(map(int, input().rstrip().split()))\narr = []\nfor i in range(d):\n s = input()\n arr.append(s)\nprint(fight(arr))", "n, d=list(map(int, input().split()))\r\ntemp=0\r\nanswer=0\r\nfor i in range(d):\r\n string=list(input())\r\n if string.count('1')!=n:\r\n temp+=1\r\n else:\r\n temp=0\r\n answer=max(temp, answer)\r\nprint(answer)", "a,b = map(int,input().split())\narray = []\ncounter = 0\nfor x in range(b):\n string = input()\n data = []\n if \"0\" in string:\n counter += 1\n else:\n counter = 0\n array.append(counter)\nprint(max(array))\n \t\t\t\t \t\t \t \t \t \t \t \t\t\t", "# A. Opponents\n\nn, d = map(int, input().split())\ndays = [1] * d\nfor i in range(d):\n s = input()\n if '0' in s:\n days[i] = 0\n\nans = 0\ncur = 0\nfor day in days:\n if day == 1:\n cur = 0\n else:\n cur += 1\n if cur > ans:\n ans = cur\n\nprint(ans)\n", "r,x=0,0\r\nfor _ in[0]*int(input().split()[1]):\r\n x=[0,x+1]['0'in input()]\r\n r=max(r,x)\r\nprint(r)", "n,d = map(int,input().split())\r\ncur=0\r\nm=0\r\nfor _ in range(d):\r\n s=input()\r\n if \"0\" in s:\r\n cur+=1\r\n if cur>m:m=cur\r\n else:cur=0\r\nprint(m)", "n, m = map(int,input().split())\r\nans, cur = 0, 0\r\nfor i in range(m):\r\n\tif '0' in input():\r\n\t\tcur += 1\r\n\t\tans = max(ans, cur)\r\n\telse:\r\n\t\tcur = 0\r\nprint(ans)\r\n", "a,b=list(map(int,input().split()))\r\ns=[]\r\nf=0\r\nfor i in range(b):\r\n t=list(input())\r\n if '0' in t:\r\n f+=1\r\n else:\r\n s.append(f)\r\n f=0\r\n s.append(f)\r\nS=set(s)\r\nprint(max(S))\r\n \r\n", "n,x = map(int,input().split())\r\ncnt =0\r\nmaxi =0\r\nfor __ in range(x):\r\n \r\n s = str(input())\r\n \r\n if ((s.count(s[0])==n) and s[0] ==\"0\"):\r\n cnt += 1\r\n maxi = max(cnt,maxi)\r\n \r\n \r\n \r\n elif s.count(s[0])!=n :\r\n cnt += 1\r\n maxi = max(cnt,maxi)\r\n \r\n else:\r\n maxi = max(cnt,maxi)\r\n cnt = 0\r\n #maxi = max(cnt,maxi) \r\nprint(maxi) ", "n,d = map(int,input().split())\r\ncount = 0\r\nval = 0\r\nfor i in range(d):\r\n s = input()\r\n if s.count('1') == n:\r\n val = 0\r\n else:\r\n val+=1\r\n count = max(count,val)\r\nprint(count) \r\n \r\n ", "a,b=map(int,input().split())\r\ncount=0;z=0\r\nfor _ in range(b):\r\n x=input().count('1')\r\n if x<a:\r\n count+=1\r\n if count>=z:\r\n z=count\r\n elif x==a:\r\n count=0\r\nprint(z) ", "n,d=map(int,input().split())\r\nc,p=0,-1\r\nfor i in range(d):\r\n s=input()\r\n if(s.count('0')>0):\r\n c=max(c,i-p)\r\n else:\r\n p=i\r\nprint(c) ", "n, d = map(int, input().split())\r\nans = 0\r\ncur = 0\r\nfor i in range(d):\r\n x = input()\r\n if '0' not in x:\r\n cur = 0\r\n else:\r\n cur += 1\r\n ans = max(ans, cur)\r\nprint(ans)\r\n", "n, d = [int(s) for s in input().split(' ')]\r\ncd = 0\r\ncd_max = 0\r\nfor i in range(d):\r\n s = input()\r\n if s.count('0') == 0:\r\n cd = 0\r\n else:\r\n cd += 1\r\n cd_max = max(cd, cd_max)\r\nprint(cd_max)\r\n", "opp,day=map(int, input().split())\r\ncnt=0\r\nx=[]\r\nfor _ in range(day):\r\n if input().count('0')>0: cnt+=1\r\n else: \r\n x.append(cnt)\r\n cnt=0\r\nx.append(cnt)\r\nprint(max(x))", "n,m=list(map(int,input().strip().split()))\r\nl=[]\r\nt=0\r\nfor i in range(m):\r\n a=input()\r\n if a.count(\"1\")==n:\r\n l +=[t]\r\n t=0\r\n else:\r\n t +=1\r\nelse:\r\n l +=[t]\r\nprint(max(l))\r\n \r\n", "n,m=list(map(int,input().split()))\r\nl=[]\r\ncnt=0\r\nfor i in range(m):\r\n s=input()\r\n x=s.count('1')\r\n y=s.count('0')\r\n if y:\r\n cnt+=1 \r\n else:\r\n l.append(cnt)\r\n cnt=0\r\nl.append(cnt)\r\nprint(max(l))\r\n", "def chk(n):\r\n s=list(n)\r\n if '0' in s:\r\n return True\r\n return False\r\nn,d=map(int,input().split())\r\nc,m=0,0\r\nfor _ in range(d):\r\n if chk(input())==True:\r\n c+=1\r\n m=max(m,c)\r\n #print(chk(a))\r\n else:\r\n c=0\r\n #print(chk(a))\r\nprint(m)\r\n\r\n\r\n\r\n", "def check(str):\r\n if '0' in str:\r\n return 0\r\n return 1\r\n\r\nn, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nlist = []\r\nfor i in range(m):\r\n str = input()\r\n list.append(str)\r\ncons = 0\r\ntemp = []\r\nfor i in list:\r\n if check(i) == 0:\r\n cons = cons + 1\r\n else:\r\n cons = 0\r\n temp.append(cons)\r\nprint(max(temp))", "n,d=map(int,input().split(' '))\r\ncount=0\r\nb=[]\r\nfor i in range(d):\r\n a=list(map(int,input()))\r\n sum1=0\r\n for j in range(n):\r\n sum1=sum1+a[j]\r\n if sum1<n:\r\n count=count+1\r\n b.append(count)\r\n elif sum1==n:\r\n count=0\r\n b.append(count)\r\nprint(max(b))", "n, k = map(int, input().split())\r\nres = 0\r\nc = 0\r\nfor i in range(k):\r\n a = input()\r\n if a.count('1')==n:\r\n res = max(res,c)\r\n c = 0\r\n else:\r\n c+=1\r\nprint(max(res,c))\r\n ", "n,d=map(int,input().split())\r\na=[list(input()) for i in range(d)]\r\ncount=0;max=0\r\nfor i in range(d):\r\n if sum(list(map(int,a[i])))==n:\r\n count=0\r\n else:\r\n count+=1\r\n if count>max:\r\n max=count\r\nprint(max)", "n,m=[int(x) for x in input().split()]\r\nd=[]\r\nc=0\r\nfor i in range(m):\r\n s=input()\r\n x=s.count('1')\r\n y=s.count('0')\r\n if(y>=1):\r\n c+=1 \r\n elif(y==0):\r\n d.append(c)\r\n c=0\r\nd.append(c)\r\nprint(max(d))\r\n\r\n#4 5\r\n#1101\r\n#1111\r\n#0110\r\n#1011\r\n#1111\r\n\r\n \r\n#2 2\r\n#10\r\n#00\r\n\r\n ", "def e(g,n,d):\r\n k=0\r\n f=[]\r\n for i in range(d):\r\n if \"1\"*n==g[i]:\r\n f.append(k)\r\n k=0\r\n continue\r\n k+=1\r\n f.append(k)\r\n return max(f)\r\nn,d=map(int,input().split())\r\nh=[]\r\nfor i in range(d):\r\n h.append(input())\r\nprint(e(h,n,d))", "n, d = map(int, input().split())\r\ncount = 0\r\nb = []\r\nfor i in range(d):\r\n\ta = input()\r\n\tif '0' in a:\r\n\t\tcount+=1\r\n\telse:\r\n\t\tb.append(count)\r\n\t\tcount = 0\r\n\tif i==d-1:\r\n\t\tb.append(count)\r\nprint(max(b))\r\n", "a,b=map(int,input().split())\r\nc=0\r\np=0\r\nm=0\r\nfor i in range(a):\r\n p=p*10+1\r\nfor i in range(b):\r\n l=int(input())\r\n if l!=p:\r\n c=c+1\r\n else:\r\n c=0\r\n m=max(m,c)\r\nprint(m)", "n,d=map(int,input().split())\r\nr=0\r\nm=0\r\nfor _ in range(d):\r\n s=input()\r\n if '0' in s:\r\n r=r+1\r\n else:\r\n m=max(r,m)\r\n r=0\r\n m=max(r,m)\r\nprint(m)\r\n", "n,d=map(int,input().split())\r\np,k=0,0\r\nfor i in range(d):\r\n \r\n s=input()\r\n if '0' in s:\r\n p=p+1\r\n if p>k:\r\n k=p\r\n else:\r\n p=0\r\nprint(k)", "n, d = map(int,input().split())\r\ndaysl = []\r\nfor i in range(d):\r\n daysl.append(input())\r\ncounter = 0\r\nmaxl = 0\r\nfor i in daysl:\r\n if '0' in i:\r\n counter += 1\r\n else:\r\n counter = 0\r\n if maxl < counter:\r\n maxl = counter\r\nprint(maxl)", "n,k=map(int,input().split())\r\nc=0\r\nt=0\r\nfrom functools import reduce\r\nimport operator as op\r\nfor i in range(k):\r\n s=list(map(int,input()))\r\n temp=reduce(op.mul,s)\r\n if temp:\r\n c=max(t,c)\r\n t=0\r\n else:\r\n t+=1\r\nprint(max(c,t))", "n, d = map(int, input().split())\r\nbeat_str = '1'*n\r\n# print(beat_str)\r\nmx = 0\r\ncnt = 0\r\nfor i in range(d):\r\n s = input()\r\n if s == beat_str:\r\n cnt = 0\r\n else:\r\n cnt = cnt+ 1\r\n mx = max(mx, cnt)\r\nprint(mx)\r\n ", "n=input()\r\nl=n.split()\r\nd=int(l[1])\r\nop=int(l[0])\r\nmx=0\r\nlst=mx\r\nfor ui in range(0,d):\r\n line=input()\r\n if \"0\" in line:\r\n mx=mx+1\r\n if mx>=lst:\r\n lst=mx\r\n else:\r\n mx=0\r\n \r\nprint(lst)", "n,d=map(int,input().split())\r\nr=[str(input()) for _ in [0]*d]\r\nj=0;maxi=0\r\nfor i in r:\r\n if '0' in i:j+=1\r\n else:j=0\r\n maxi=max(maxi,j)\r\nprint(maxi)", "n, d = map(int, input().split())\r\nlst = \"\".join([str(min(map(int, list(input())))) for i in range(d)]).split(\"1\")\r\nprint(max([len(i) for i in lst]))", "def longest_non_max_subarray(numbers, target):\r\n max_length = 0\r\n current_length = 0\r\n for number in numbers:\r\n if number < target:\r\n current_length += 1\r\n else:\r\n current_length = 0\r\n if current_length > max_length:\r\n max_length = current_length\r\n return max_length\r\n \r\ntarget, n = map(int, input().split())\r\nnumbers = []\r\nfor _ in range(n):\r\n current_sum = 0\r\n word = input()\r\n for letter in word:\r\n if letter == '1':\r\n current_sum += 1\r\n numbers.append(current_sum)\r\n\r\nprint(longest_non_max_subarray(numbers, target))", "# Write Python 3 code in this online editor and run it.\nr,x=0,0\nfor _ in[0]*int(input().split()[1]):\n x=[0,x+1]['0'in input()]\n r=max(r,x)\nprint(r)\n \t\t\t\t\t \t\t \t\t\t \t \t \t \t \t", "n,m=map(int,input().split())\r\ncount=0\r\nl1=[]\r\nfor j in range (m):\r\n s1=input()\r\n if(s1.count('1')==n):\r\n l1.append(count)\r\n count=0\r\n elif(j==m-1):\r\n count+=1\r\n l1.append(count)\r\n else:\r\n count+=1\r\nprint(max(l1))\r\n", "[d ,n] = map(int, input().split(\" \"))\ndata = []\nfor i in range(n):\n data.append(input())\n\nmax_consecutive_day = 0\ncount_day = 0\nfor i in range(n):\n if data[i].count('0') > 0:\n count_day += 1\n else:\n count_day = 0\n if max_consecutive_day < count_day:\n max_consecutive_day = count_day\n\nprint(max_consecutive_day)", "n, d = input().split()\r\nn, d = int(n), int(d)\r\npresent = ''.join(['1']*n)\r\nmax = 0\r\nwin = 0\r\nfor i in range(d):\r\n day = input()\r\n if day != present:\r\n win = win+1\r\n else:\r\n if win > max:\r\n max = win\r\n win = 0\r\n \r\nif win > max:\r\n max = win\r\nprint(max)\r\n ", "t=list(map(int,input().split()))\r\ncount=0\r\nans=0\r\nfor i in range(t[1]):\r\n l=list(input())\r\n temp=l.count('1')\r\n if temp==t[0]:\r\n count=0;\r\n else:\r\n count+=1\r\n ans=max(count,ans)\r\nprint(ans)", "no_of_opponents, no_of_days = map(int, input().split())\n\ndef is_win(oppo) :\n return '0' in oppo\n\nwin, wins = 0, []\n\nfor i in range(no_of_days) :\n oppo = input()\n if is_win(oppo) :\n win += 1\n else :\n wins.append(win)\n win = 0\n wins.append(win)\n\"\"\"\nif len(wins) == 0:\n print(win)\nelse :\"\"\"\nprint(max(wins))\n", "# Level - 800\r\n# Link - https://codeforces.com/problemset/problem/688/A\r\n\r\nn, d = map(int, input().split())\r\ncur = 0\r\nans = 0\r\nfor i in range(d):\r\n s = input()\r\n if s == '1' * n:\r\n cur = 0\r\n else:\r\n cur += 1\r\n ans = max(ans, cur)\r\nprint(ans)\r\n", "a,b = map(int, input().split())\r\nn = []\r\nfor i in range(b):\r\n x = input()\r\n if \"0\" in x:\r\n n.append(1)\r\n else:\r\n n.append(0)\r\nc = []\r\nfor i in range(0, len(n)):\r\n if n[i] == 0:\r\n continue\r\n else:\r\n t = 0\r\n for j in range(i, len(n)):\r\n if n[j] == 1:\r\n t += 1\r\n else:\r\n break\r\n c.append(t)\r\nif len(c) == 0:\r\n print(0)\r\nelse:\r\n print(max(c))", "if __name__ == '__main__':\r\n n,d = map(int, input().split())\r\n co = 0\r\n m = 0\r\n for _ in range(d):\r\n s = input()\r\n if \"0\" in s:\r\n co += 1\r\n if \"0\" not in s:\r\n m = max(m,co)\r\n co = 0\r\n m = max(m,co)\r\n print(m)\r\n \r\n", "n, d = map(int, input().split())\r\n\r\na, b = 0, 0\r\nfor _ in range(d):\r\n s = input()\r\n if s.find('0') >= 0:\r\n a += 1\r\n if a > b:\r\n b = a\r\n else:\r\n a = 0\r\n\r\nprint(b)", "# https://codeforces.com/problemset/problem/688/A\r\n\r\nn, d = map(int, input().split())\r\n\r\nans = temp = 0\r\n\r\nfor _ in range(d):\r\n\r\n for i in input():\r\n if i == '0':\r\n temp += 1\r\n ans = max(temp, ans)\r\n break\r\n else:\r\n temp = 0\r\nprint(ans)\r\n", "n,d=map(int,input().split())\r\nx=0\r\nans=0\r\nfor i in range(d):\r\n f=0\r\n s=input()\r\n for j in range(n):\r\n if s[j]=='0':f=1\r\n if f==1: x+=1\r\n else:\r\n ans=max(ans,x)\r\n x=0\r\nans=max(ans,x)\r\nprint(ans)", "\r\na,b=list(map(int,input().split()))\r\nc=0\r\nm=0\r\nfor _ in range(b):\r\n l=input()\r\n o=l.count('0')\r\n\r\n if o>=1:\r\n c+=1\r\n else:\r\n c=0\r\n if c>m:\r\n m=c\r\n\r\n\r\nprint(m)\r\n \r\n", "n,m=map(int,input().split())\r\ncnt=0;mx=0\r\nfor i in range(m):\r\n x=sum([int(digit) for digit in str(input())])\r\n if x<n:\r\n cnt+=1\r\n mx=max(mx,cnt) \r\n if x==n:\r\n cnt=0\r\nprint(mx)", "n, d = map(int, input().split(\" \"))\r\ncount, maximum = 0, 0\r\nfor i in range(d):\r\n a = input().replace(\"0\", \"\")\r\n if len(a) != n:\r\n count += 1\r\n else:\r\n\r\n if count > maximum:\r\n maximum = count\r\n\r\n count = 0\r\n\r\nif count > maximum:\r\n maximum = count\r\n count = 0\r\n\r\nprint(maximum)", "def solve(t_id):\r\n n, d = map(int, input().split())\r\n ans = 0\r\n cnt = 0\r\n for i in range(d):\r\n s = input()\r\n if s != '1' * n:\r\n cnt += 1\r\n else:\r\n cnt = 0\r\n ans = max(ans, cnt)\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", "n,d=map(int,input().split())\r\ncount=0\r\nmaxi=0\r\nfor _ in range(d):\r\n s=input()\r\n if s.count(\"0\")!=0:\r\n count+=1\r\n maxi=max(count,maxi)\r\n \r\n else:\r\n \r\n count=0\r\n \r\nprint(maxi)\r\n \r\n \r\n ", "n,d=map(int,input().split())\r\na=[]\r\nfor _ in \" \"*d:\r\n a.append(input())\r\ncnt=0\r\nmx=0\r\nfor i in a:\r\n if i == \"1\"*n:\r\n mx=max(mx,cnt)\r\n cnt=0\r\n else:\r\n cnt+=1\r\nprint(max(mx,cnt))\r\n", "n, d = map(int, input().split())\r\nanswer = []\r\ncol = 0\r\nfor i in range(d):\r\n s = list(input())\r\n if \"0\" in s:\r\n col += 1\r\n else:\r\n col = 0\r\n answer.append(col)\r\nprint(max(answer))", "\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\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\n\r\nn , d = MAP()\r\nmx = 0\r\ncnt = 0\r\nfor i in range(d):\r\n s = STR()\r\n if len(set(s)) == 1:\r\n if s[0] == '1':\r\n cnt = 0\r\n mx = max(mx , cnt)\r\n else:\r\n cnt +=1\r\n mx = max(mx , cnt)\r\n\r\n else:\r\n cnt +=1\r\n mx = max(mx , cnt)\r\n\r\n\r\nprint(mx)\r\n\r\n", "n, d = map(int, input().split())\r\narr = [1] * d\r\nfor i in range(d):\r\n arr[i] = input().count('1') == n\r\n\r\narr += [1]\r\nans = 0\r\nind = -1\r\nfor i in range(d + 1):\r\n if arr[i]:\r\n ans = max(ans, i - ind - 1)\r\n ind = i\r\nprint(ans)", "nd = list(map(int, input().split()))\r\nschool = []\r\nmaximum = 0\r\ntemp = 0\r\naccept = 1\r\nfor k in range(nd[1]):\r\n\tschool.append(list(map(int, input())))\r\n\taccept = 1\r\n\tfor i in range(nd[0]):\r\n\t\tif school[k][i] == 0:\r\n\t\t\ttemp += 1\r\n\t\t\taccept = 0\r\n\t\t\tbreak\r\n\tif accept == 1:\r\n\t\taccept = 0\r\n\t\tmaximum = max(maximum, temp)\r\n\t\ttemp = 0\r\nmaximum = max(maximum, temp)\r\nprint(maximum) ", "nums = list(map(int, input().split()))\noponentNum, days = [nums[i] for i in (0,1)]\ngap = 0\nans = []\nfor i in range(days):\n oponentAttend = input()\n lenOponent = (len(oponentAttend))\n onecount = oponentAttend.count('1')\n zeroCount = oponentAttend.count('0')\n if(lenOponent == onecount):\n gap =0\n else:\n gap += 1\n finalgap =0\n ans.append(gap)\nif(len(ans) ==0):\n print(0)\nelse:print(max(ans))\n\n \t \t\t \t\t \t\t\t \t \t\t \t \t\t", "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=read_ints()\r\n\tl=0\r\n\tans=0\r\n\tfor i in range(m):\r\n\t\ta=read()\r\n\t\tif \"0\" in a:\r\n\t\t\tl+=1\r\n\t\telse:\r\n\t\t\tl=0\r\n\t\tans=max(ans, l)\r\n\tprint(ans)\r\n\r\nsolve()\r\n", "n, d = map(int, input().split())\r\nans = 0\r\nconsMax = 0\r\nfor i in range(d):\r\n strTemp = input()\r\n setTemp = set(strTemp)\r\n if(len(setTemp) == 1 and list(setTemp)[0] == '0'):\r\n consMax += 1\r\n elif(len(setTemp) > 1):\r\n consMax += 1\r\n else: \r\n if(consMax > ans):\r\n ans = consMax\r\n consMax = 0\r\nif(consMax > ans):\r\n ans = consMax\r\nprint(ans)", "n,d=map(int,input().split())\r\nmax=0\r\ns=0\r\nfor i in range(d):\r\n dd=str(input())\r\n if dd.count(\"0\"):\r\n s+=1\r\n else:\r\n s=0\r\n if s>max:\r\n max=s\r\nprint(max)", "x,y=map(int,input().split())\r\nmaxim=0\r\nc=[]\r\nfor i in range(y):\r\n\tc.append(input())\r\n\r\ncount=0\r\nflag=0\r\nfor i in range(len(c)):\r\n\tif '0' in c[i]:\r\n\t\tcount+=1\r\n\t\tflag=0\r\n\telse:\r\n\t\tmaxim=max(count,maxim)\r\n\t\tcount=0\r\n\t\tflag=1\r\nif flag==1:\r\n\tprint(maxim)\r\nelse:\r\n\tmaxim=max(maxim,count)\r\n\tprint(maxim)\r\n\t\r\n", "n,d=map(int,input().split())\r\nc=0;ans=0\r\nli=[]\r\nwhile(d>0):\r\n\ts=input()\r\n\tli.append(s)\r\n\td-=1\r\nfor i in range(len(li)):\r\n\tif('0' in li[i]):\r\n\t\tc+=1\r\n\t\tans=max(c,ans)\r\n\telse:\r\n\t\tc=0\r\n\t\t\r\nans=max(c,ans)\r\nprint(ans)\r\n\t", "a,b=map(int,input().split())\r\nd=int(0)\r\ne=[]\r\nfor _ in range(b):\r\n c=str(input())\r\n if c.find(\"0\")!=-1:\r\n d=d+1\r\n else:\r\n e.append(d)\r\n d=0\r\ne.append(d)\r\nprint(max(e))", "n, d = (int(i) for i in input().split())\nres, cur = 0, 0\nfor _ in range(d):\n p = sum(int(i) for i in input())\n if p < n:\n cur += 1\n else:\n res = max(res, cur)\n cur = 0\nres = max(res, cur)\nprint(res)\n", "from sys import stdin, stdout\r\ndef istr(): return input()\r\ndef inum(): return int(stdin.readline())\r\ndef imul(): return map(int, stdin.readline().split())\r\ndef ilst(): return list(map(int, stdin.readline().split()))\r\ndef splt(): return list(stdin.readline().strip())\r\ndef emat(row): return [splt() for i in range(row)]\r\nmax_itr = 100\r\nfrom itertools import combinations\r\nimport math\r\n\r\n#************************* Code******************************\r\n#************************************************************\r\n\r\nn,m = imul()\r\naa = emat(m)\r\ncount=0\r\nmaxx=0\r\nfor i in aa:\r\n\tif(i.count('0')>=1):\r\n\t\tcount+=1\r\n\t\tmaxx = max(count,maxx)\r\n\telse:count=0\r\nprint(maxx)", "n, d = map(int, input().split())\r\nopponents = [input() for _ in range(d)]\r\n\r\nconsecutive_days = 0\r\nmax_consecutive_days = 0\r\n\r\nfor day in opponents:\r\n if '0' in day:\r\n consecutive_days += 1\r\n max_consecutive_days = max(max_consecutive_days, consecutive_days)\r\n else:\r\n consecutive_days = 0\r\n\r\nprint(max_consecutive_days)\r\n", "n, d = map(int, input().split())\r\n\r\nmax_consecutive_days = 0\r\nconsecutive_days = 0\r\n\r\nfor i in range(d):\r\n schedule = input()\r\n if '0' in schedule:\r\n consecutive_days += 1\r\n max_consecutive_days = max(max_consecutive_days, consecutive_days)\r\n else:\r\n consecutive_days = 0\r\n\r\nprint(max_consecutive_days)\r\n", "t = list(map(int,input(\"\").split()))\nw=0\ntemp=0\nfor i in range(t[1]):\n d = input(\"\")\n if d.find(\"0\") != -1:\n temp += 1\n if temp > w : w = temp\n else:\n temp = 0\nprint(w)", "n,d=map(int,input().split())\r\nl=[]\r\nl1=[]\r\nfor i in range(d):\r\n s=input()\r\n l.append(s)\r\nc=0\r\nfor i in range(d):\r\n for j in range(n):\r\n if l[i][j]=='0':\r\n c+=1\r\n break\r\n else:\r\n l1.append(c)\r\n c=0\r\nif l1:\r\n print(max(max(l1),c))\r\nelse:\r\n print(c)", "n,d=map(int,input().split())\r\nl=[]\r\nfor i in range(d):\r\n s=input()\r\n z=s.count(\"0\")\r\n l.append(z)\r\n\r\nc=0\r\nans=0\r\nfor i in range(len(l)):\r\n if(l[i]>0):\r\n c+=1\r\n else:\r\n c=0\r\n ans=max(ans,c)\r\nprint(ans)\r\n \r\n ", "n,m=map(int,input().split())\r\nr=0\r\na=0\r\nfor _ in range(m):\r\n if set(\"1\")!=set(input()):r+=1\r\n else: r=0\r\n a=max(a,r)\r\nprint(a)\r\n", "n,d=map(int,input().split())\r\nx=y=0\r\nfor i in range(d):\r\n if '0' in input():\r\n x+=1\r\n else:\r\n x=0\r\n y=max(x,y)\r\nprint(y)", "n,m = map(int,input().split())\r\nz =[]\r\nc =0\r\nfor i in range(m):\r\n\ta = list(input())\r\n\tif \"0\" in a:\r\n\t\tc+=1\r\n\telse:\r\n\t\tc =0\r\n\tz.append(c)\r\nprint(max(z))\r\n\r\n\r\n", "a = []\r\ns = []\r\nd = 0\r\nfor i in range(int(input().split()[1])):\r\n a.append(input())\r\nfor i in a:\r\n if \"0\" in i:\r\n d += 1\r\n else:\r\n s.append(d)\r\n d = 0\r\ns.append(d)\r\nprint(max(s))", "n, d = map(int, input().split())\r\ndays = [0]*d\r\nfor i in range(d):\r\n days[i] = input()\r\nk = 0\r\nans = 0\r\nfor i in range(d):\r\n if '0' in days[i]:\r\n k += 1\r\n else:\r\n if k > ans:\r\n ans = k\r\n k = 0\r\nif k > ans:\r\n ans = k\r\nprint(ans)", "d=int(input().split()[1])\r\na,c=0,0\r\nfor i in range(d):\r\n if '0' in input():\r\n c+=1\r\n else:\r\n c=0 \r\n a=max(a,c)\r\nprint(a) ", "def check(d):\r\n t=0\r\n for i in range(len(d)):\r\n if d[i]==\"0\":\r\n t=t+1\r\n \r\n if t>=1:\r\n return True\r\n else:\r\n return False\r\n \r\n\r\na,b=map( int,input().split())\r\nc=0\r\nl2=[]\r\nma=0\r\nfor i in range(b):\r\n s=input()\r\n l2.append(s)\r\nfor x in l2:\r\n if check(x)==True:\r\n c=c+1\r\n ma=max(c,ma)\r\n else:\r\n c=0\r\nprint(ma)\r\n\r\n", "def I(): return map(int, input().split())\r\n\r\n\r\n_, d = I()\r\ntmp = 0\r\nans = 0\r\nfor i in range(d):\r\n if all(ii == \"1\" for ii in input()):\r\n tmp = 0\r\n else:\r\n tmp += 1\r\n ans = max(tmp, ans)\r\nprint(ans)\r\n", "n, d = map(int, input().split())\r\ncur = 0\r\nmax_days = 0\r\nfor i in range(d):\r\n s = input().strip()\r\n if '0' in s:\r\n cur += 1\r\n else:\r\n cur = 0\r\n max_days = max(max_days, cur)\r\n\r\nprint(max_days)", "n,d = map(int,input().split())\r\nans = 0\r\nls = []\r\nfinal = []\r\nfor t in range(d):\r\n s = input()\r\n ls.append(s)\r\nfor i in range(len(ls)):\r\n if '0' in ls[i]:\r\n ans += 1\r\n if '0' not in ls[i] or i == len(ls) - 1:\r\n final.append(ans)\r\n ans = 0\r\nprint(max(final))\r\n\r\n", "n,d = map(int,input().split())\r\nl = []\r\nmax = 0\r\nc = 0\r\nfor i in range(d):\r\n a = input()\r\n b = a.count(\"1\")\r\n if b == n:\r\n if c > max:max = c\r\n c = 0\r\n else:\r\n c+=1\r\n if i == d-1 and c > max:\r\n max = c\r\nprint(max)", "n, d = map(int, input().split())\r\noutput = 0\r\nt = 0\r\nfor i in range(d):\r\n l = input()\r\n if l.count('0') > 0:\r\n t += 1\r\n else:\r\n output = max(output, t)\r\n t = 0\r\nprint(max(output, t))", "m,n=input().split()\r\nb=w=0\r\nfor i in range(int(n)):\r\n if '0' in input(): w+=1\r\n else: w=0\r\n b=max(w,b)\r\nprint(b)", "a,b=input().split( )\r\na=c=0\r\nfor i in range(int(b)):\r\n if '0' in input():\r\n a+=1\r\n else:\r\n c=max(a,c)\r\n a=0\r\nprint(max(a,c))\r\n", "n,d=input().split()\r\nstreak=0\r\ns=[]\r\nfor i in range(0,int(d)):\r\n str=input()\r\n if \"0\" in str:\r\n streak+=1\r\n if i==int(d)-1:\r\n s.append(streak)\r\n \r\n else:\r\n s.append(streak)\r\n streak=0\r\nprint(max(s))", "n,d = map(int,input().split())\r\narr = []\r\nfor i in range(d):\r\n s = input()\r\n arr.append(s)\r\na = 0\r\nb = 0\r\nfor i in range(len(arr)):\r\n if arr[i] == \"1\"*n:\r\n a = 0\r\n continue\r\n else:\r\n a+=1\r\n b = max(a,b)\r\nprint(b)", "o,d = list(map(int,input().split()))\r\n\r\nb=[]\r\nfor i in range(d):\r\n\ts = input()\r\n\tb.append(s)\r\n\r\ncount=0\r\nc=[]\r\nfor i in b:\r\n\tif '0' in i:\r\n\t\tcount+=1\r\n\t\tc.append(count)\r\n\telse:\r\n\t\tc.append(count)\r\n\t\tcount=0\r\nprint(max(c))", "n,d = map(int,input().split())\r\nans = cur = 0\r\nfor i in range(d):\r\n\ts = input()\r\n\tif(s=='1'*n):\r\n\t\tcur = 0\r\n\telse:\r\n\t\tcur+=1\r\n\tans = max(ans,cur)\r\nprint(ans)", "opps, days = [int(i) for i in input().split()]\r\n\r\nstreak = 0\r\nmaxStreak = 0\r\nfor i in range(days):\r\n currentDay = [int(i) for i in list(input())]\r\n if 0 in currentDay:\r\n streak += 1\r\n else:\r\n streak = 0\r\n maxStreak = max(streak, maxStreak)\r\n\r\nprint(maxStreak)", "n, m = map(int, input().split())\r\nc = 0\r\ncons = []\r\n\r\nfor _ in range(m):\r\n s = input()\r\n\r\n if '0' in s:\r\n c += 1\r\n else:\r\n cons.append(c)\r\n c = 0\r\n\r\ncons.append(c)\r\nprint(max(cons))\r\n", "def solve(absents):\r\n result = 0\r\n count = 0\r\n for day in absents:\r\n if all(x == 1 for x in day):\r\n count = 0\r\n else:\r\n count += 1\r\n result = max(result, count)\r\n return result\r\n\r\ndef main():\r\n n, d = map(int, input().split())\r\n absents = []\r\n for _ in range(d):\r\n line = input().strip()\r\n day_absents = [int(x) for x in line]\r\n absents.append(day_absents)\r\n print(solve(absents))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nk=[0]\r\nl=0\r\n\r\nfor i in range(m):\r\n\ta=list(input())\r\n\tc=a.count(\"0\")\r\n\tif(c>=1):\r\n\t\tl+=1\r\n\telse:\r\n\t\tk.append(l)\r\n\t\tl=0\r\n\tif(i==m-1 and c>=1):\r\n\t\tk.append(l)\r\nprint(max(k))\r\n", "enem, days = map(int, input().split())\r\nmax_count = 0\r\nnew_count = 0\r\nfor i in range(days):\r\n string = input()\r\n if string.count('1') < enem:\r\n new_count += 1\r\n else:\r\n if new_count > max_count:\r\n max_count = new_count\r\n new_count = 0\r\nif new_count > max_count:\r\n max_count = new_count\r\nprint(max_count)\r\n", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nm,n=q()\r\ncm=0\r\nc=0\r\nfor _ in range(n):\r\n a=input()\r\n if not a.count('0'):\r\n c=0\r\n else:c+=1\r\n if cm<c:\r\n cm=c\r\nprint(cm)", "n,d=map(int,input().split())\r\nc=0\r\n\r\nl=[]\r\nfor i in range(d):\r\n l.append(input())\r\nemp=[] \r\nfor i in range(d):\r\n if(l[i].count('0')==0):\r\n emp.append(c)\r\n c=0\r\n else:\r\n c+=1\r\n\r\nemp.append(c)\r\nprint(max(emp))", "n, d = map(int, input().split())\r\n\r\nmax_streak = 0\r\ncurrent_streak = 0\r\n\r\nfor _ in range(d):\r\n day_schedule = input()\r\n \r\n if '0' in day_schedule:\r\n current_streak += 1\r\n max_streak = max(max_streak, current_streak)\r\n else:\r\n current_streak = 0\r\n\r\nprint(max_streak)\r\n", "d = int(input().split()[1])\r\na, c = 0, 0\r\n\r\nfor i in range(d):\r\n if '0' in input():\r\n c += 1\r\n else:\r\n c = 0\r\n\r\n a = max(a, c)\r\n\r\nprint(a)", "n = [int(x) for x in input().split()]\r\ncount =0\r\ncountmax =0\r\nfor i in range(0,n[1]):\r\n q = input()\r\n check =1\r\n for j in range(0,n[0]):\r\n if(q[j] == '0'):\r\n check =0\r\n break\r\n if(check==0):\r\n #print(str(q)+\" :save\")\r\n count+=1\r\n else:\r\n #print(str(q)+\" :not save\")\r\n count=0 \r\n if(count>countmax): countmax = count\r\nprint(countmax)", "n, d = [int(i) for i in input().split()]\r\nm = 0\r\nnow = 0\r\nfor i in range(d):\r\n if not all([bool(int(j)) for j in list(input())]):\r\n now += 1\r\n else:\r\n m = max(m, now)\r\n now = 0\r\n\r\n\r\nm = max(m, now)\r\n\r\nprint(m)\r\n", "n,d=map(int,input().split())\r\ncount=0\r\nl=[]\r\nx=[]\r\nfor i in range(d):\r\n\ts=input()\r\n\tif \"0\" in s:\r\n\t\tl.append(1)\r\n\telse:\r\n\t\tl.append(0)\r\nfor i in range(len(l)):\r\n\tif l[i]==1 :\r\n\t\tcount+=1\r\n\t\tif i==len(l)-1:\r\n\t\t\tx.append(count)\r\n\telif l[i]==0 or i==len(l)-1:\r\n\t\tx.append(count)\r\n\t\tcount=0\r\nprint(max(x))", "'''\nAuthor : knight_byte\nFile : A_Opponents.py\nCreated on : 2021-04-19 11:29:37\n'''\n\n\ndef main():\n n, d = map(int, input().split())\n cnt = 0\n ans = 0\n for _ in range(d):\n\n op = input()\n if \"0\" not in op and len(op) == n:\n cnt = 0\n else:\n cnt += 1\n ans = max(ans, cnt)\n\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "n,d=map(int,input().split())\r\nmaz=0\r\nres=0\r\nfor _ in range(d):\r\n a=[int(a) for a in input()]\r\n if 0 in a:\r\n maz+=1\r\n if maz>res:\r\n res=maz\r\n else:\r\n maz=0\r\nprint(res)", "a, b = input().split()\r\ntotal = 0\r\nmax_ = 0\r\nfor _ in range(int(b)):\r\n i = input()\r\n if '0' in i:\r\n total += 1\r\n else:\r\n max_ = max(total, max_)\r\n total = 0\r\nif total > 0:\r\n max_ = max(total, max_)\r\nprint(max_)\r\n", "# Author: SaykaT\r\n# Problem: 688A\r\n# Time Created: August 04(Tuesday) 2020 || 04:21:12\r\n\r\n#>-------------------------<#\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n#>-------------------------<#\r\n\r\n\r\n# Helper Functions. -> Don't cluster your code.\r\n\r\n\r\n# IO Functions. -> Input output\r\ndef io():\r\n r, n = map(int, input().split())\r\n s = []\r\n for _ in range(n):\r\n tmp = input()\r\n tmp = tmp.replace('\\n', '')\r\n s.append(tmp)\r\n return r, n, s\r\n\r\n\r\n# Main functions. -> Write the main solution here\r\ndef solve():\r\n r, n, s = io()\r\n bad_day = '1' * r\r\n\r\n longest = 0\r\n tmp = 0\r\n for i in s:\r\n if i != bad_day:\r\n tmp += 1\r\n else:\r\n tmp = 0\r\n longest = max(longest, tmp)\r\n print(longest)\r\n\r\n\r\n# Multiple test cases. -> When you have T test cases.\r\nsolve()\r\n\r\n", "\r\ncount=0\r\ns=0\r\nn,d=map(int,input().split())\r\nfor i in range(d):\r\n\tinp=input()\r\n\tif \"0\" in inp:\r\n\t\tcount+=1\r\n\telse:\r\n\t\tcount=0\r\n\ts=max(s,count)\r\n\r\n\r\nprint(s)\r\n", "n,d=input().split()\ni=1\nj=1\nn=int(n)\nd=int(d)\ncount=0\nmaxi=0\nfor i in range(1,d+1):\n attendence=input()\n if \"0\" in attendence:\n count+=1\n if count>maxi:\n maxi=count\n else:\n count=0\n i+=1\nprint(str(maxi))\n \t\t \t \t \t\t \t \t \t\t\t\t\t\t\t\t\t", "n,d = input().split(\" \")\r\nn=int(n)\r\nd =int(d)\r\nbeats = []\r\nfor _ in range(0,d):\r\n inp = input()\r\n if '0' in inp:\r\n beats.append(1)\r\n else:\r\n beats.append(0)\r\nans = 0\r\nhighCons = 0\r\n\r\nfor i in beats:\r\n if i ==1:\r\n ans +=1\r\n else:\r\n ans = 0\r\n highCons = max(highCons,ans)\r\n\r\n\r\nprint(highCons)\r\n\r\n\r\n ", "# @Chukamin ZZU_TRAIN\n\ndef main():\n n, times = map(int, input().split())\n ans = 0\n now_ans = 0\n for _ in range(times):\n data = input()\n flag = 0\n for i in range(n):\n if data[i] == '0':\n flag = 1\n break\n if flag:\n now_ans += 1\n ans = max(ans, now_ans)\n else:\n now_ans = 0\n print(ans)\n \n \n \nif __name__ == '__main__':\n main()\n\n\t\t \t \t \t\t\t\t\t \t\t\t \t \t\t\t\t\t\t\t\t\t", "n, d = map(int, input().split())\r\nmaxR, curr = 0, 0\r\nfor _ in range(d):\r\n pres = input()\r\n if pres == \"1\"*n:\r\n maxR = max(maxR, curr)\r\n curr = 0\r\n else:\r\n curr += 1\r\nmaxR = max(maxR, curr)\r\nprint(maxR)", "n,d = map(int,input().split())\r\ntemp_res = 0\r\nres = 0\r\nfor i in range(d):\r\n\ts = list(input())\r\n\tif s.count('1')==len(s):\r\n\t\tif temp_res>res:\r\n\t\t\tres = temp_res\r\n\t\ttemp_res = 0\r\n\telse:\r\n\t\ttemp_res+=1\r\n\t\tif temp_res>res:\r\n\t\t\tres = temp_res\r\n\r\nprint(res)\r\n", "n,d=map(int,input().split())\nres=[]\ndays=[0]*d\nfor day in range(d):\n n=list(map(int,input()))\n for i in n:\n if i==0:\n days[day]=1\n break\nc,mc=0,0\nfor i in days:\n if i==1:\n c+=1\n if c>mc:\n mc=c\n else:\n c=0\nprint(mc)\n\t\t\t \t \t\t\t \t\t\t\t \t\t\t\t\t \t\t\t \t \t", "n,d=map(int,input().split())\r\ncount=0\r\nmax_count=0\r\nfor i in range(d):\r\n day=list(input())\r\n if day.count(\"1\")==n:\r\n count=0\r\n else:\r\n count+=1\r\n max_count=max(count,max_count)\r\nprint(max_count)", "import math\nfrom typing import Iterable, List\n\n\ndef solve(arr:Iterable[str], n: int) -> int:\n curr = 0\n res = 0\n for v in arr:\n if v == '1'*n:\n curr = 0\n else :\n curr += 1\n res = max(res , curr)\n return res\n \n \n \n\n \ndef main():\n n,d = map(int, input().split(' '))\n arr = []\n for i in range(d) :\n x = input()\n arr.append(x)\n print(solve(arr,n))\n\nmain()", "s = input().split(\" \")\r\nn = int(s[0])\r\nd = int(s[1])\r\nma = 0\r\nt = 0\r\nfor i in range(d):\r\n s = input()\r\n if('0' in s):\r\n t += 1\r\n ma = max(ma,t)\r\n else:\r\n t = 0\r\nprint(ma)\r\n \r\n \r\n \r\n\r\n\r\n \r\n", "n, d = [int(i) for i in input().split()]\r\nc = 0\r\nmx = 0\r\nfor i in range(d):\r\n s = input()\r\n if s.count('1') != n:\r\n c += 1\r\n else:\r\n mx = max(mx, c)\r\n c = 0\r\nmx = max(mx, c)\r\nprint(mx)", "if __name__ == '__main__':\r\n n, d = map(int, input().split())\r\n mx, current = 0, 0\r\n for _ in range(d):\r\n if '0' in input():\r\n current += 1\r\n else:\r\n mx = max(mx, current)\r\n current = 0\r\n print(max(mx, current))\r\n", "# # RED CODER # #\r\nn, d = map(int, input().split())\r\nnew = []\r\ncount = 0\r\nfor i in range(d):\r\n x = [int(i) for i in input()]\r\n if sum(x) == n:\r\n new.append(count)\r\n count = 0\r\n else:\r\n count += 1\r\nif count:\r\n new.append(count)\r\nprint(max(new))", "n,k=map(int,input().split())\r\nc,l1=0,[]\r\nfor i in range(k):\r\n\tl=list(input())\r\n\tif '0' in l:\r\n\t\tc+=1\r\n\telse:\r\n\t\tl1.append(c)\r\n\t\tc=0\r\n\tif i==k-1:\r\n\t\tl1.append(c)\r\nprint(max(l1))", "n,d = map(int, input().split())\r\na = []\r\ncnt, ma = 0,0 \r\nfor i in range(d):\r\n t = map(int, list(input()))\r\n a.append(sum(t))\r\n\r\nfor i in range(d):\r\n if a[i] < n:\r\n cnt += 1\r\n else:\r\n cnt = 0\r\n ma = max(cnt, ma)\r\n\r\nprint(ma)\r\n", "import sys\r\ninput = sys.stdin.readline\r\np = print\r\nfrom collections import deque, defaultdict\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in range(n)]\r\ndef pb(b): print('Yes' if b else 'No')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn ,d = II()\r\nres = \"\"\r\nfor i in range(d):\r\n if S() != '1'*n:\r\n res+=\"1\"\r\n else:\r\n res+=\"0\"\r\nfor j in reversed(range(d+1)):\r\n if \"1\"*j in res:\r\n print(j)\r\n exit(0)", "n, d = map(int, input().split())\r\nans = 0\r\ntemp = 0\r\nfor i in range(0, d):\r\n s = input()\r\n if '0' in s:\r\n temp += 1\r\n else:\r\n if temp > ans:\r\n ans = temp\r\n temp = 0\r\nif temp > ans:\r\n ans = temp\r\nprint(ans)", "n,d=map(int,input().split())\r\nmax_p=0;now_p=0\r\nfor i in range(d):\r\n s=str(input())\r\n if s!='1'*n:\r\n now_p+=1\r\n max_p=max(max_p,now_p)\r\n else:\r\n max_p=max(max_p,now_p)\r\n now_p=0\r\nprint(max_p)", "n,t=map(int,input().split())\r\nm,max1=0,0\r\nfor j in range(t):\r\n s=input()\r\n c=s.count('0')\r\n if(c>0):\r\n m=m+1\r\n max1=max(m,max1)\r\n else:\r\n m=0\r\nprint(max1)\r\n", "def check(s):\r\n if '0' in s:\r\n return True\r\n else:\r\n return False\r\na,b=map(int,input().split())\r\nz=0\r\nl=[]\r\nfor i in range(b):\r\n s=input()\r\n if (check(s)):\r\n z+=1\r\n else:\r\n z=0\r\n l.append(z)\r\nprint(max(l))", "n,d=map(int,input().split())\r\nc=0\r\nf=[]\r\nfor _ in range(d):\r\n s=input()\r\n k=0\r\n for i in range(n):\r\n if s[i]=='1':\r\n k+=1\r\n if k==n:\r\n c=0\r\n else:\r\n c+=1\r\n f+=[c]\r\n\r\nprint(max(f))\r\n", "L = input().split()\nn = int(L[0])\nd = int(L[1])\n\ndays_he_wins_cons = 0\nlist_of_cons_wins = []\n\nfor i in range(d):\n win = False\n day_data = input()\n for i in range(n):\n if day_data[i] == \"0\":\n win = True\n break\n if win:\n days_he_wins_cons+=1\n else:\n list_of_cons_wins.append(days_he_wins_cons)\n days_he_wins_cons=0\n\nlist_of_cons_wins.append(days_he_wins_cons)\nprint(max(list_of_cons_wins))\n\n\n\n \t \t\t \t \t\t\t\t\t\t \t\t \t \t\t \t\t", "n,t=map(int,input().split())\r\nm=0\r\nc=0\r\nfor _ in range(0,t):\r\n s=input()\r\n if(s.count(\"1\")<n):\r\n c+=1\r\n m=max(m,c)\r\n else:\r\n c=0\r\nprint(m)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, d = map(int, input().split())\r\nans, c = 0, 0\r\nfor _ in range(d):\r\n s = list(input().rstrip())\r\n c += 1\r\n if min(s) & 1:\r\n c = 0\r\n ans = max(ans, c)\r\nprint(ans)", "x = input().split()\r\nn = int(x[0])\r\nd = int(x[1])\r\n\r\nlist1 = []\r\nfor i in range(d):\r\n list1.append(input())\r\nstreak = 0\r\nmax1 = 0\r\nfor i in range(len(list1)):\r\n if \"0\" in list1[i]:\r\n streak+=1\r\n if streak > max1:\r\n max1 = streak\r\n else:\r\n streak = 0\r\nprint(max1)\r\n \r\n \r\n ", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n a, b = 0, 0\r\n for s in inp[1:]:\r\n if set(s) == {'1'}:\r\n a, b = max(a,b), 0\r\n else: b += 1\r\n return max(a, b)\r\n\r\nprint(main())\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, d = map(int, input().split())\r\ntotmax = 0\r\ncurrmax = 0\r\nfor _ in range(d):\r\n st = [int(i) for i in input()]\r\n if sum(st)!=n:\r\n currmax+=1\r\n else:\r\n currmax=0\r\n totmax = max(totmax, currmax)\r\nprint(totmax)", "#688A (58No. Problem A)\r\n\r\nno,nd = map(int,input().split())\r\nf = 0\r\nans = []\r\nfor i in range(nd):\r\n s = input()\r\n one = s.count('1')\r\n if (one == no):\r\n f = 0\r\n else:\r\n f+=1 \r\n ans.append(f)\r\nprint(max(ans)) ", "def solve(n, m):\r\n\r\n mx = 0\r\n count = 0\r\n for _ in range(m):\r\n test = input()\r\n if all(x == '1' for x in test):\r\n mx = max(mx, count)\r\n count = 0\r\n else:\r\n count += 1\r\n\r\n return max(count, mx)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n print(solve(n, m))", "n, d = map(int, input().split())\r\n\r\ncur_streak = 0\r\nmax_streak = 0\r\n\r\nfor i in range(d):\r\n s = input().strip()\r\n if '0' in s:\r\n cur_streak += 1\r\n else:\r\n cur_streak = 0\r\n max_streak = max(max_streak, cur_streak)\r\n\r\nprint(max_streak)\r\n", "n,d=map(int,input().split())\r\nl=[]\r\nc=0\r\nfor i in range(d):\r\n s=input()\r\n if s.count(\"0\")==0:\r\n l.append(c)\r\n c=0\r\n else:\r\n c=c+1\r\nl.append(c)\r\nprint(max(l))", "n, d = tuple(map(int, input().split()))\n\ndays = 0\nD = []\nfor i in range(d):\n A = input()\n if '0' in A:\n days += 1\n else:\n days = 0\n D.append(days)\n\nprint(max(D))\n", "n, d = map(int, input().split())\nwin = k = 0\nfor i in range(d):\n n = input()\n if '0' in n:\n win += 1\n else:\n win = 0\n k = max(k, win)\nprint(k)\n", "a,b = map(int,input().split())\r\nz = 0\r\nm = 0\r\nfor i in range(b):\r\n s = str(input())\r\n if '0' in s: z=z+1\r\n else: z=0\r\n if m < z: m = z\r\nprint(m)", "n, d = map(int, input().split())\r\nx = '1' * n\r\nres = 0\r\ncurr = 0\r\nfor _ in range(d):\r\n y = input().strip()\r\n if x == y:\r\n res = max(res, curr)\r\n curr = 0\r\n else:\r\n curr += 1\r\nelse:\r\n res = max(curr, res)\r\nprint(res)\r\n", "n, d = [int(i) for i in input().split()]\r\nc, mc = 0, 0\r\nfor i in range(d):\r\n if input() != \"1\" * n:\r\n c += 1\r\n else:\r\n mc = max(mc, c)\r\n c = 0\r\nmc = max(mc, c)\r\nprint(mc)\r\n", "n, d = map(int, input().split())\narr = []\n\nfor _ in range(d):\n s = input()\n arr.append(s)\n\ncons = 0\nans = 0\n\nfor fights in arr:\n if \"0\" in fights:\n cons += 1\n\n else:\n ans = max(ans, cons)\n cons = 0\n\nans = max(ans, cons)\n\nprint(ans)\n\t \t\t \t\t \t\t\t \t \t\t\t\t \t\t \t\t\t \t\t", "n, d = map(int,input().split())\r\nans = 0 \r\nout = []\r\nfor i in range(d):\r\n s = input()\r\n if s[:n] == '1'*n:\r\n ans = 0\r\n else:\r\n ans += 1\r\n out.append(ans)\r\n\r\nprint(max(out))\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n, d = map(int, input().split())\r\n B = [0] * d\r\n for i in range(d):\r\n A = list(int(a) for a in input())\r\n if sum(A) < n:\r\n B[i] = 1\r\n max_val = 0\r\n val = 0\r\n for i in range(d):\r\n if B[i] == 1:\r\n val += 1\r\n else:\r\n val = 0\r\n max_val = max(max_val, val)\r\n print(max_val)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\nn, d = map(int, input().split())\r\n\r\nmax_ans = 0\r\nseq = 0\r\nfor i in range(d):\r\n val_str = input()\r\n if '0' in val_str:\r\n seq += 1\r\n else:\r\n seq = 0\r\n max_ans = max(seq, max_ans)\r\n \r\nprint(max_ans)", "pointer, ans, temp = 0, 0, 0 \r\nn , d = list(map(int, input().split()))\r\nfor i in range(d):\r\n a = input()\r\n if (\"0\" in a):\r\n ans += 1\r\n# print(\"lolos\")\r\n temp = ans\r\n if (pointer < temp):\r\n pointer = temp\r\n if (\"0\" not in a):\r\n ans = 0\r\nprint(pointer)", "n,d=map(int,input().split())\r\nlst=[]\r\nm=0\r\nmax=0\r\nfor i in range(d):\r\n\ts=str(input())\r\n\tlst.append(s)\r\nfor i in range(d):\r\n\ts=lst[i]\r\n\tif '0' in s:\r\n\t\tm+=1\r\n\telse:\r\n\t\tm=0\r\n\tif max<m:\r\n\t\tmax=m\r\nprint(max)", "n,d=map(int,input().split())\r\nst,m=0,0\r\nfor i in range(d):\r\n s=input()\r\n if \"0\" in s:\r\n st+=1\r\n else:\r\n m=max(st,m)\r\n st=0\r\nprint(max(m,st))", "n, d = map(int, input().split())\n\ndays = []\n\nfor i in range(d): \n days.append(input())\n\nmaxStreak = 0\ncurMax = 0\nfor i in range(d): \n if days[i].count('1') != n: \n curMax += 1\n else: \n curMax = 0 \n maxStreak = max(maxStreak, curMax)\nprint(maxStreak)\n", "n, d = input().split()\nn, d = int(n), int(d)\nmaximum = 0\ncurrent = 0\nfor each_d in range(d):\n s = input()\n if s.count('1') != n:\n current = current + 1\n if current > maximum:\n maximum = current\n else:\n current = 0\nprint(maximum)", "numOp,numOd = map(int,input().split(\" \"))\r\ncount = 0\r\nfinal = 0\r\nfor i in range(numOd):\r\n s = input()\r\n if \"0\" in s:\r\n count = count+1\r\n final = max(final,count)\r\n else:\r\n count = 0\r\n\r\nprint(final)", "ans = 0\r\ntimesDefeating = 0\r\nnumberOfOpponents, numberOfDays = list(map(int, input().split()))\r\n\r\nfor _ in range(numberOfDays):\r\n opponents = input()\r\n if \"0\" in opponents:\r\n timesDefeating += 1\r\n ans = max(timesDefeating, ans)\r\n else:\r\n timesDefeating = 0\r\n\r\nprint(ans)", "n, d = map(int, input().split())\r\nres = 0\r\ncount = 0\r\nfor _ in range(d):\r\n s = input()\r\n if s.count(\"0\") == 0:\r\n count = 0\r\n else:\r\n count += 1\r\n if res < count:\r\n res = count\r\nprint(res)\r\n", "n,d=map(int,input().split())\r\nm=0\r\ns=-1\r\nfor i in range(0,d):\r\n x=input()\r\n x=list(x)\r\n if x.count('0')>=1:\r\n m=m+1\r\n else:\r\n s=max(s,m)\r\n m=0\r\ns=max(s,m)\r\nprint(s)", "op, day = map(int, input().split())\r\ndays=0;d=[]\r\n\r\nfor j in range(day):\r\n\tp=input()\r\n\tpresent=0\r\n\tfor i in p:\r\n\t\tif i=='1':\r\n\t\t\tpresent+=1\r\n\tif j==day-1 and present<op:\r\n\t\tdays+=1\r\n\t\td.append(days)\r\n\telif present<op:\r\n\t\tdays+=1\r\n\telse:\r\n\t\td.append(days)\r\n\t\tdays=0\r\nprint(max(d))", "vals = list(map(int, input().split()))\r\nnum_opps = vals[0]\r\nnum_days = vals[1]\r\n\r\nnum_conse_days = []\r\nconse_days = 0\r\nfor i in range(num_days):\r\n num_avail = 0\r\n ops = input()\r\n for j in range(num_opps):\r\n if ops[j] == '1':\r\n num_avail += 1\r\n if num_avail < num_opps:\r\n conse_days += 1\r\n else:\r\n num_conse_days.append(conse_days)\r\n conse_days = 0\r\nnum_conse_days.append(conse_days)\r\nprint(max(num_conse_days))", "wins = []\r\nw_d = input().split()\r\nn = int(w_d[0])\r\nd = int(w_d[1])\r\n\r\ncurrent_wins = 0\r\nfor line in range(d):\r\n s = input()\r\n if '0' in s:\r\n wins.append(\"w\")\r\n else:\r\n wins.append(\"l\")\r\n\r\nprint(len(max(\"\".join(wins).split(\"l\"), key=len)))\r\n", "n, d = map(int, input().split())\r\na = 0\r\nc = 0\r\n\r\nfor i in range(d):\r\n s = input()\r\n if '0' in s:\r\n a += 1\r\n if a > c:\r\n c = a\r\n else:\r\n a = 0 \r\n \r\n\r\nprint(c)", "n,d = map(int,input().split())\r\nschedule = []\r\nfor i in range(d):\r\n schedule.append(list(input()))\r\n\r\nlongest_streak = 0\r\nstreak_counter = 0\r\n\r\nfor day in schedule:\r\n if '0' in day:\r\n streak_counter += 1\r\n if streak_counter > longest_streak:\r\n longest_streak = streak_counter\r\n else:\r\n streak_counter = 0\r\n\r\nprint(longest_streak)", "n, d = input().split()\r\nn, d = int(n), int(d)\r\n\r\npresence = []\r\n\r\nfor i in range(0,d):\r\n presence.append(input())\r\n\r\nk = 0\r\nmaximo = 0\r\n\r\nfor i in range(0,d):\r\n if '0' in presence[i]:\r\n k += 1\r\n else:\r\n k = 0\r\n if k > maximo:\r\n maximo = k\r\n\r\nprint(maximo)", "n, d = map(int, input().split())\ncnt, ans = 0, 0\nfor _ in range(d):\n s = input()\n if s.count('0') > 0:\n cnt += 1\n ans = max(cnt, ans)\n else:\n cnt = 0\nprint(ans)", "n=int(input().split()[1])\r\ns=['0' in input() for _ in range(n)]\r\nmx=cnt=0\r\nfor i in range(n):\r\n\tif s[i]:\r\n\t\tcnt+=1\r\n\telse:\r\n\t\tmx=max(mx,cnt)\r\n\t\tcnt=0\r\nprint(max(mx,cnt))\r\n\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,d = map(int, wtf[0].split())\r\n ans = []\r\n tmp = 0\r\n for t in wtf[1:]:\r\n if t == '1'*n:\r\n ans.append(tmp)\r\n tmp = 0\r\n continue\r\n tmp +=1\r\n if tmp > 0:\r\n ans.append(tmp)\r\n print(max(ans))\r\n", "n,d=map(int,input().split())\r\nar=[ ]\r\nc=0\r\nm=0\r\nfor i in range(0,d):\r\n ar.append(input())\r\nfor i in ar:\r\n if ('0' in i):\r\n c+=1\r\n m=max(c,m)\r\n else:\r\n c=0\r\nprint(m)", "n,d=map(int,input().split())\r\nc=0\r\nl=[]\r\nfor i in range(d):\r\n\ta=input()\r\n\ta=list(a)\r\n\tif '0' in a:\r\n\t\tc=c+1\r\n\telse:\r\n\t\tl.append(c)\r\n\t\tc=0\r\nl.append(c)\r\nprint(max(l))", "n_opps, n_days = input().strip().split()\nn_days = int(n_days)\nn_opps = int(n_opps)\nmax_cons_wins = 0\ncurr_cons_wins = 0\n\nfor _ in range(n_days):\n n_dayopps = sum(c == '1' for c in input())\n if n_dayopps != n_opps:\n curr_cons_wins += 1\n else:\n curr_cons_wins = 0\n max_cons_wins = max(max_cons_wins, curr_cons_wins)\n\nprint(max_cons_wins)\n \n \n", "n,m = map(int, input().split())\r\ns = (''.join([\"1\"]*n))\r\nans,cnt=-1,0\r\nfor _ in range(m):\r\n\ttmp = str(input().strip())\r\n\tif s==tmp:\r\n\t\tans=max(ans,cnt)\r\n\t\tcnt = 0\r\n\telse:\r\n\t\tcnt += 1\r\nans= max(ans,cnt)\r\nprint(ans)\t\t\r\n", "n,d=map(int,input().split())\r\nl=[0]\r\ns=0\r\nfor i in range(d):\r\n\tx=input()\r\n\tif(\"0\" in x)==True:\r\n\t\ts=s+1\r\n\t\tl.append(s)\r\n\telse:\r\n\t\ts=0\r\nprint(max(l))", "n, d = map(int, input().split())\r\nmaxCount = 0\r\ncurentCount = 0\r\nfor i in range(d):\r\n string = input()\r\n if string.__contains__(\"0\"):\r\n curentCount += 1\r\n else:\r\n if curentCount > maxCount:\r\n maxCount = curentCount\r\n curentCount = 0\r\nif curentCount > maxCount:\r\n maxCount = curentCount\r\nprint(maxCount)\r\n", "a,b=map(int,input().split())\r\nm = []\r\nc=0\r\nfor _ in range(b):\r\n s = input()\r\n if s.count(\"0\")>0:\r\n c+=1\r\n else:\r\n c=0\r\n m.append(c)\r\nprint(max(m))", "a, b=map(int, input().split())\r\ncnt=0\r\nx=[]\r\ny=0\r\nfor i in range(b):\r\n x.append(input())\r\n\r\nfor i in range(b):\r\n if x[i].find(\"0\")!=-1:\r\n cnt+=1\r\n else:\r\n y=max(y, cnt)\r\n cnt=0\r\n\r\nprint(max(y, cnt))", "n, d = list(map(int, input().split(' ')))\r\ns, c = 0, 0\r\nfor i in range(d):\r\n if '0' in input():\r\n c += 1\r\n else:\r\n s = max(s, c)\r\n c = 0\r\nprint(max(s, c))", "if __name__ == '__main__' :\r\n n, d = map(int, input().split())\r\n c = 0\r\n ans = 0\r\n for i in range(d):\r\n s = input()\r\n if s == '1'*n:\r\n c = 0\r\n else:\r\n c = c+1\r\n ans = max(ans, c)\r\n print(ans)\r\n", "def solve():\r\n n,d = map(int,input().split())\r\n ans = []\r\n x = 0\r\n for i in range(d):\r\n l = input()\r\n if l.find(\"0\") != -1:\r\n x+=1\r\n else:\r\n ans.append(x)\r\n x = 0\r\n ans.append(x)\r\n print(max(ans))\r\n# n,c = map(int,input().split())\r\n# a = int(input())\r\n# b = int(input())\r\n# c = int(input())\r\n# l = list(map(int,input().split()))\r\n# s = input()\r\n# print(solve(n,c,l))\r\nsolve()\r\n\r\n\r\n\r\n", "n, d = map(int, input().split())\nbeat_str = '1'*n\n# print(beat_str)\nmx = 0\ncnt = 0\nfor i in range(d):\n s = input()\n if s == beat_str:\n cnt = 0\n else:\n cnt = cnt+ 1\n mx = max(mx, cnt)\nprint(mx)\n ", "n,d=map(int,input().split())\r\nc=0\r\nans=0\r\nfor i in range(d):\r\n if input().count(\"0\")>0:\r\n c+=1\r\n else:\r\n c=0\r\n ans=max(c,ans)\r\nprint(ans)\r\n", "n,d = map(int,input().split())\r\narr = []\r\nfor i in range(d):\r\n s = input()\r\n arr.append(s)\r\nc = 0\r\nm = 0\r\nfor i in range(len(arr)):\r\n if arr[i] == \"1\"*n:\r\n c = 0\r\n continue\r\n else:\r\n c+=1\r\n m = max(m,c)\r\nprint(m)\r\n\r\n", "num, d = input().split()\r\n\r\nnum = int(num)\r\nd = int(d)\r\ncnt = 0\r\nmaxi = 0\r\nfor i in range(1, d+1):\r\n atten = input()\r\n if \"0\" in atten:\r\n cnt += 1\r\n if cnt > maxi:\r\n maxi = cnt\r\n else:\r\n cnt = 0\r\n i += 1\r\nprint(str(maxi))\r\n", "n,d=map(int,input().split())\r\nl=[]\r\nc=0\r\nfor _ in range(d):\r\n s=input()\r\n if '0' in s:\r\n c+=1 \r\n else:\r\n l.append(c)\r\n c=0\r\nl.append(c)\r\nprint(max(l))", "n, d = [int(elem) for elem in input().split(' ')]\r\ntime_table = list()\r\nfor i in range(d):\r\n time_table.append(input())\r\nmax_seq, curr_seq = 0, 0\r\nall_of_them = True\r\nfor i in range(d):\r\n all_of_them = True\r\n for j in range(n):\r\n if time_table[i][j] == '0':\r\n all_of_them = False\r\n break\r\n if all_of_them == False:\r\n curr_seq += 1\r\n else:\r\n if max_seq < curr_seq:\r\n max_seq = curr_seq\r\n curr_seq = 0\r\nif max_seq < curr_seq:\r\n max_seq = curr_seq\r\nprint(max_seq)", "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, d = IA()\r\n c = m = 0\r\n for _ in range(d):\r\n s = input()\r\n if s.find('0') == -1:\r\n c = 0\r\n else:\r\n c += 1\r\n m = max(m, c)\r\n return m\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n, d = map(int, input().split())\r\nc = 0\r\na = 0\r\nfor i in range(d):\r\n s =input()\r\n if (s == '1' * n):\r\n c = 0\r\n else:\r\n c += 1\r\n a = max(a, c)\r\nprint(a)", "a = input().split()\r\n\r\nb= int(a[0])\r\nc= int(a[1])\r\nst=''\r\nli=[]\r\nfor i in range(c):\r\n li.append(1 if b*'1' not in input().split() else 0)\r\n\r\n\r\nc=0\r\nma=0\r\n\r\nfor i in li:\r\n\r\n if i==0:\r\n c=0\r\n else:\r\n c=c+1\r\n ma= max(ma,c)\r\n\r\nprint(ma)", "n, d = map(int, input().split())\r\nres, dem = 0, 0\r\nfor x in range(d):\r\n s = input()\r\n if s == '1' * n: res, dem = max(res, dem), 0\r\n else: dem += 1\r\nprint(max(dem, res))", "'''\r\n ************************ বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ *********************\r\n\r\n ********************************************* Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''************************************************************************\r\n\r\n PROBLEM : A. Opponents\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\n\r\nn,d=map(int,input().split())\r\nm=0\r\ns=0\r\nfor i in range(d):\r\n if \"0\" in input():\r\n m+=1\r\n else:\r\n m=0\r\n s=max(m,s)\r\nprint(s)", "first = input()\r\nx = first.split()\r\nn = int(x[0])\r\nd = int(x[1])\r\n\r\ncurr_days = 0\r\nmax_days = 0\r\nfor i in range(d):\r\n string = input()\r\n if '0' in string:\r\n curr_days += 1\r\n if curr_days > max_days :\r\n max_days = curr_days\r\n else:\r\n curr_days = 0\r\n\r\nprint(max_days)\r\n", "n,d=map(int,input().split())\r\nlist,temp=[],[]\r\nfor i in range(d):\r\n list.append(input())\r\ni=0\r\nwhile(i<d):\r\n count=0\r\n while(i<d and list[i].count('0')>0):\r\n count+=1\r\n i+=1\r\n i+=1\r\n temp.append(count)\r\nprint(max(temp))", "n = [int(x) for x in input().split()]\ncount = 0\narray = []\nmax = -1\nfor i in range(0, n[1]):\n x = input()\n for j in range(0, n[0]):\n if x[j] == \"0\":\n count += 1\n break\n elif j == n[0] - 1 and x[j] == \"1\":\n count = 0\n\n if max <= count:\n max = count\n\nprint(max)", "def answer():\r\n z = [int(x) for x in input().split()]\r\n n = z[0]\r\n d = z[1]\r\n ans=0\r\n temp=0\r\n while d:\r\n a = sum([int(x) for x in list(input())])\r\n if a<n:\r\n temp+=1\r\n if temp>ans:ans=temp\r\n else:\r\n if temp>ans:ans=temp\r\n temp=0\r\n d-=1\r\n print(ans)\r\nanswer()" ]

[ "l, r = map(int, input().split())\r\nb = ['1'] \r\nans = 0 \r\nc = 1 \r\nwhile(c <= 60):\r\n for i in range(len(b) - 1, 0, -1):\r\n b[i] = '0'\r\n a = int(''.join(b), 2)\r\n if(a >= l and a <= r):\r\n ans += 1 \r\n b[i] = '1' \r\n b.append('1')\r\n c += 1 \r\n \r\nprint(ans)\r\n", "n, m = map(int,input().split())\r\na = len(bin(n))-2\r\nb = len(bin(m))-2\r\ncount = 0\r\nfor i in range(a, b+1):\r\n for j in range(i-1):\r\n if n <= 2**i-1-2**j <= m:\r\n count+=1\r\n\r\nprint(count)\r\n", "import re\r\na, b= map(lambda x : bin(int(x))[2:], input().split())\r\ncal = lambda x : (len(x) - 2) * (len(x) - 1) // 2\r\nnuma = cal(a)\r\nfor i in a:\r\n if i != \"1\":\r\n break\r\n numa += 1\r\nnumb = cal(b)\r\nfor i in b:\r\n if i != \"1\":\r\n break\r\n numb += 1\r\nprint(numb - numa + (1 if len(re.findall(\"0\", b)) == 1 else 0))\r\n", "def tobin(s):\r\n res = 0\r\n l = len(s)\r\n #print(s)\r\n #print(l)\r\n for i in range(l):\r\n res += int(s[-i-1]) * 2 ** i\r\n return res\r\n\r\nn, m = tuple(map(int, input().split()))\r\n\r\nlis = []\r\nfor i in range(1, 61):\r\n for j in range(i):\r\n lis.append(tobin('1' + '1' * j + '0' + '1' * (i - j - 1)))\r\ni = 0 \r\nwhile n > lis[i]:\r\n i += 1\r\nj = 0\r\nwhile m >= lis[j]:\r\n j += 1\r\nprint(j - i)\r\n \r\n ", "a, b = map(int, input().split())\r\ncount = 0\r\nfor i in range(1, 64):\r\n for j in range(64):\r\n if a<=int('1'*i+'0'+'1'*j, 2)<=b: count+=1\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 13 00:43:06 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\n\r\n[a,b]=list(map(int,input().split()))\r\nchoto=a\r\nboro=b\r\na=bin(a)\r\na=list(a[2:])\r\nb=bin(b)\r\nb=list(b[2:])\r\nx=len(a)\r\ny=len(b)\r\nans=0\r\nfor i in range(x,y+1):\r\n ini=2**(i)-1\r\n\r\n for j in range(i-1):\r\n now=ini-(2**j)\r\n if now>=choto and now<=boro:\r\n ans+=1\r\nprint(ans)\r\n \r\n ", "a,b=map(int,input().split())\nprint(len([(2**l-1)-2**j for l in range(65) for j in range(l-1) if a<=2**l-1-2**j<=b]))\n\n\t\t \t \t \t\t\t \t\t\t\t\t \t\t \t\t\t", "a, b = map(int, input().split())\r\nr1 = len(bin(a)) - 2\r\nr2 = len(bin(b)) - 2\r\n\r\nans = 0\r\n# перебираем разряд, в котором будет стоять 0\r\nfor i in range(r1 - 1, 0, -1):\r\n x = ['1'] * r1\r\n x[i] = '0'\r\n if a <= int(''.join(x), 2) <= b:\r\n ans += 1\r\n\r\n# числа, в которых разрядов больше, чем в a, но меньше чем в b\r\nfor i in range(r1 + 1, r2):\r\n ans += i - 1\r\n\r\nif r1 != r2:\r\n for i in range(r2 - 1, 0, -1):\r\n x = ['1'] * r2\r\n x[i] = '0'\r\n if a <= int(''.join(x), 2) <= b:\r\n ans += 1\r\n\r\nprint(ans)", "#!/bin/python\nimport collections\nimport random\nimport sys\ntry:\n from tqdm import tqdm\nexcept:\n def tqdm(iterable):\n return iterable\n\n\n__taskname = ''\nif __taskname:\n sys.stdin = open(__taskname + '.in')\n sys.stdout = open(__taskname + '.out', 'w')\n\ndef f(n):\n result = set()\n i = 0\n while (1 << i) <= 4 * n:\n for j in range(i - 1):\n if (1 << i) - 1 - (1 << j) <= n:\n result.add((1 << i) - 1 - (1 << j))\n i += 1\n return len(result)\n\n\na, b = map(int, input().split())\nprint(f(b) - f(a - 1))\n", "aa,b=map(int,input().split(' '))\r\nansss=0\r\nfor i in range(100):\r\n for j in range(1,i):\r\n s=[1]*i\r\n s[j]=0;\r\n v=int(''.join(map(str,s)),2)\r\n #print(v)\r\n if(v<aa):\r\n ansss-=1\r\n if(v<=b):\r\n ansss+=1\r\n\r\nprint(ansss)", "def convert(binary_list):\r\n ret = 0\r\n for i in range(len(binary_list)):\r\n power = 2 ** i\r\n temp = binary_list[len(binary_list) - 1 - i] * power\r\n ret += temp\r\n return ret\r\n\r\ns = str(input()).split()\r\n\r\ny1 = int(s[0])\r\ny2 = int(s[1])\r\n\r\ny1S = str(bin(y1))[2:]\r\ny2S = str(bin(y2))[2:]\r\n\r\n# print('y1\\t', y1S)\r\n# print('y2\\t', y2S)\r\n\r\ncount = 0\r\nfor i in range(2, len(y2S) + 1):\r\n # print('i\\t', i)\r\n for j in range(1, i):\r\n year = [1] * i\r\n year[j] = 0\r\n # print(year, '\\t', end='')\r\n # print(convert(year))\r\n if y1 <= convert(year) <= y2:\r\n count += 1\r\nprint(count)\r\n", "a, b = map(int, input().split())\r\n\r\nallPerhaps = []\r\n\r\nfor cntN in range(1, 63):\r\n for i in range(cntN - 1):\r\n numb = ((1 << cntN) - 1) ^ (1 << i)\r\n allPerhaps.append(numb)\r\n\r\nans = 0\r\nfor i in allPerhaps:\r\n if a <= i <= b:\r\n ans += 1\r\n\r\nprint(ans)\n# Sat Apr 30 2022 14:20:04 GMT+0000 (Coordinated Universal Time)\n", "a, b = map(int, input().split())\nans = 0\nfor i in range(2, 100):\n\tx = (1<<i)-1\n\tfor j in range(i-1):\n\t\ty = x^(1<<j)\n\t\tif a <= y and y <= b:\n\t\t\tans += 1\nprint (ans)\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\nr = 0\r\nfor i in range(2,64):\r\n\tz = 2**i-1\r\n\tfor j in range(i-1):\r\n\t\tx = z-(2**j)\r\n\t\tif x >= a and x <= b:\r\n\t\t\tr += 1\r\nprint(r)", "def zero(strx):\r\n k = []\r\n str2 = list(strx)\r\n for i in range(1, len(str2)):\r\n str3 = str2[:]\r\n str3[i] = '0'\r\n k.append(''.join(str3))\r\n return k\r\na = []\r\nfor i in range(1, 64):\r\n a += zero('1'*i)\r\n\r\nct = 0\r\nx, y = map(int, input().split(' '))\r\nfor i in a:\r\n if x <= int(i, 2) <= y:\r\n ct+=1\r\nprint(ct)\r\n", "a,b=map(int,input().split())\r\nx=bin(a)[2:]\r\ny=bin(b)[2:]\r\nn=len(y)\r\nres=0\r\nfor i in range(len(x),len(y)+1,1):\r\n ans='1'*i\r\n cnt=1\r\n while(cnt!=i):\r\n val=int(ans[:abs(i-cnt)]+\"0\"+ans[i-cnt+1:],2)\r\n #print(\"val = \",val)\r\n if(val>=a and val<=b and bin(val)[2:].count('0')==1):\r\n res+=1\r\n cnt+=1\r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\na1, b1 = map(int, input().split())\r\na = bin(a1)[2:]\r\nb = bin(b1)[2:]\r\n\r\nc = 0\r\nx = len(a)\r\ny = len(b)\r\ns = ['1']*x\r\nv = ['1']*y\r\nda = []\r\ndb = []\r\nfor i in range(x-1, 0, -1):\r\n s[i] = '0'\r\n s1 = '0b' + ''.join(s)\r\n da.append(int(s1, 2))\r\n s[i] = '1'\r\n\r\nfor i in range(y-1, 0, -1):\r\n v[i] = '0'\r\n v1 = '0b' + ''.join(v)\r\n db.append(int(v1, 2))\r\n v[i] = '1'\r\n\r\nc = 0\r\nif x == y:\r\n for i in da:\r\n if a1 <= i <= b1:\r\n c += 1\r\n print(c)\r\nelse:\r\n for i in da:\r\n if i >= a1:\r\n c += 1\r\n else:\r\n break\r\n for i in db[::-1]:\r\n if b1 >= i:\r\n c += 1\r\n else:\r\n break\r\n a2 = (x-1)*x//2\r\n b2 = (y-2)*(y-1)//2\r\n c += max(0, b2-a2)\r\n print(c)", "var = input().split()\na = int(var[0])\nb = int(var[1])\nc = 0\ni = 0\nwhile (1<<i)/2<=b:\n j = 0\n while j<=i-2:\n x = (1<<i)-1-(1<<j)\n if (a<=x)and(x<=b):\n c += 1\n j += 1\n i += 1\nprint(c) \n", "a,b=map(int,input().split(' '))\n\nans=0\nfor i in range(100):\n for j in range(1,i):\n s=[1]*i\n s[j]=0;\n v=int(''.join(map(str,s)),2)\n #print(v)\n if(v<a):\n ans-=1\n if(v<=b):\n ans+=1\n\nprint(ans)\n\n", "a, b = map(int,input().split())\nr = 0\nfor i in range(2,64):\n\tz = 2**i - 1\n\tfor j in range(i - 1):\n\t\tx = z - (2**j)\n\t\tif x >= a and x <= b:\n\t\t\tr += 1\nprint(r)\n\t \t \t\t\t \t\t\t\t \t\t\t\t\t \t\t\t\t", "import math\n\ndef main():\n nr1, nr2 = tuple(map(int, input().split()))\n max_number = max(nr1, nr2)\n p1 = int(math.log2(nr1))\n p2 = int(math.log2(nr2))\n c = 0\n s = set()\n for i in range(p1+1, p2+2):\n for j in range(0, i):\n if i - j < 2:\n continue\n one_zero_nr = 2 ** i - 1 - 2 ** j\n if one_zero_nr >= nr1 and one_zero_nr <= nr2:\n s.add(one_zero_nr)\n return len(s)\n\n\n\nif __name__==\"__main__\":\n print(main())\n", "x = input(\"\").split(' ')\r\na = int(x[0])\r\nb = int(x[1])\r\npow2 = []\r\nfor g in range (66):\r\n pow2.append(1<<g)\r\ndef solve (c):\r\n cnt = 0\r\n for g in range (66):\r\n k = 0\r\n for y in range (g):\r\n k|=(1<<y)\r\n for y in range (g+1, 66):\r\n k|=(1<<y)\r\n if (k <= c):\r\n cnt+=1\r\n return cnt\r\n\r\nprint(solve(b) - solve(a-1))", "import math\r\nimport sys\r\n\r\n#sys.stdin = open('input.txt')\r\n#sys.stdout = open('output.txt', 'w')\r\n\r\na, b = map(int, input().split())\r\ncount = 0\r\n\r\nfor i in range(int(math.log2(a)) - 1, int(math.log2(b)) + 1):\r\n base = 2 ** (i + 1) - 1\r\n for j in range(i):\r\n if a <= (base - 2 ** j) <= b:\r\n count += 1\r\n\r\nprint(count)", "X = list(map(int, input().split()))\r\nCount = 0\r\nfor i in range(len(bin(X[0]))-2, len(bin(X[1]))-1):\r\n Temp = (2 ** i) - 1\r\n for j in range(i - 1):\r\n if Temp - (1 << j) in range(X[0], X[1]+1):\r\n Count += 1\r\nprint(Count)", "#https://codeforces.com/problemset/problem/611/B\n\n\n\na, b = map(int, input().split())\n\ncandidate=0\nlimark_count = 0\nfor i in range(1, 64):\n ip = 2 ** i\n for j in range(i - 1):\n jp = 2 ** j\n candidate = ip - jp - 1\n if candidate >= a and candidate <= b:\n limark_count += 1\n\n if candidate >= b: break\n\nprint(limark_count)\n", "def Binary(n):\r\n s = bin(n)\r\n s1 = s[2:]\r\n return s1\r\ndef Decimal(n):\r\n return int(n,2)\r\narr=[]\r\ndef generate(num):\r\n for i in range(1,num):\r\n temp=\"1\"*(i)+\"0\"+\"1\"*(num-i-1)\r\n arr.append(Decimal(temp))\r\na,b=map(int,input().split(' '))\r\nla=len(Binary(a))\r\nlb=len(Binary(b))\r\nfor l in range(la,lb+1):\r\n generate(l)\r\n\r\ncnt=0\r\nfor k in range(len(arr)):\r\n if(arr[k]>=a and arr[k]<=b):\r\n cnt+=1\r\nprint(cnt)\r\n", "def onezero_nums(n):\r\n n = bin(n)[2:]\r\n k = len(n)\r\n s = (k-1) * (k-2) // 2 + (n.count(\"0\") == 1)\r\n r = n.find(\"0\")\r\n if (r == -1):\r\n s += k - 1\r\n else:\r\n s += r - 1\r\n\r\n return s;\r\n \r\n\r\na, b = map(int, input().split());\r\n\r\nprint (onezero_nums(b) - onezero_nums(a - 1))", "a,b = map(int,input().split())\r\ncnt = 0\r\nfor i in range(2,65):\r\n num = (1<<i) - 1\r\n pow = 1\r\n for j in range(i-1):\r\n cur = num - pow\r\n if cur >= a and cur <= b:\r\n cnt += 1\r\n pow <<= 1\r\nprint(cnt)", "a, b = [int(x) for x in input().split()]\n\n\ndef rotate(s):\n s = s[1:] + s[0]\n return s\n\n\nlistx = []\nfor i in range(2, 100):\n s = \"\"\n for j in range(i - 1):\n s += \"1\"\n s = s + \"0\"\n listx.append(s)\n for u in range(105):\n s = rotate(s)\n if(s[0] == '0'):\n continue\n listx.append(s)\n\nlistx = list(set(listx))\nlisty = []\nfor i in listx:\n listy.append(int(i, 2))\n# listy.sort()\n# print(listy)\n\ntotal = 0\n\n\nfor i in listy:\n if i <= b and i >= a:\n # print(i)\n total += 1\n\nprint(total)\n", "from math import log2, floor\r\n\r\n\r\ndef bits(size, a, b):\r\n count, val = 0, 0\r\n no = (2 ** size) - 1\r\n for i in range(size - 1):\r\n val = no - (2 ** i)\r\n if a <= val <= b:\r\n count += 1\r\n return count\r\n\r\n\r\ndef main():\r\n a, b = [int(x) for x in input().split()]\r\n ans = 0\r\n l = floor(log2(a) + 1)\r\n h = floor(log2(b) + 1)\r\n for i in range(l, h + 1):\r\n ans += bits(i, a, b)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b = map(int, input().split())\r\nu = bin(a)\r\nv = bin(b)\r\na = len(u) - 2\r\nb = len(v) - 2\r\nc = 0\r\nif a == b:\r\n for i in range(1, a):\r\n s = '0b' + '1' * i + '0' + '1' * (a-i-1)\r\n if u <= s and s <= v:\r\n c += 1\r\nelse:\r\n for i in range(1, a):\r\n s = '0b' + '1' * i + '0' + '1' * (a-i-1)\r\n if u <= s:\r\n c += 1\r\n for i in range(1, b+1):\r\n s = '0b' + '1' * i + '0' + '1' * (b-i-1)\r\n if s <= v:\r\n c += 1\r\n for i in range(a+1, b):\r\n c += i - 1\r\nprint(c)\r\n", "def main():\n a, b = map(int, input().split())\n res = x = 0\n for le in range(b.bit_length()):\n x, mask = x * 2 + 1, 1\n for _ in range(le):\n res += a <= x ^ mask <= b\n mask *= 2\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "while True:\r\n try:\r\n def soln(l, r):\r\n ans = set()\r\n for i in range(1, 63, 1):\r\n v = (1 << i) - 1\r\n for j in range(0,i-1,1):\r\n ans.add(v ^(1<<j))\r\n cunt = 0\r\n for x in ans:\r\n if x >= l and x <= r:\r\n cunt += 1\r\n print(cunt)\r\n def read():\r\n l, r = map(int, input().split())\r\n soln(l, r)\r\n if __name__ == \"__main__\":\r\n read()\r\n except EOFError:\r\n break", "a, b = map(int, input().split())\r\np = []\r\nfor n in range(1, 70):\r\n cur = 2 ** n + 2 ** (n - 1) - 1\r\n k = n - 2\r\n p.append(cur)\r\n while k >= 0:\r\n cur += 2 ** k\r\n k -= 1\r\n p.append(cur)\r\ncnt = sum(a <= i <= b for i in p)\r\nprint(cnt)\r\n", "low,up = map(int,input().split())\r\nlow = bin(low).replace(\"0b\",\"\")\r\nup = bin(up).replace(\"0b\",\"\")\r\nx = len(low)\r\nx = int(((x-2)*(x-1))/2)\r\ny = len(up)\r\ny = int(((y-2)*(y-1))/2)\r\nfor i in range (1,len(low)):\r\n if low[i] == low[i-1] :\r\n x += 1\r\n else :\r\n break\r\nfor i in range (1,len(up)):\r\n if up[i] == up[i-1] :\r\n y += 1\r\n else :\r\n break\r\nct0 = 0\r\nfor i in up :\r\n if i == '0':\r\n ct0 += 1\r\nif ct0 == 1 :\r\n y += 1\r\nprint(y-x)", "v=[]\r\nfor l in range(64):\r\n a=2**l\r\n for i in range(l-1):\r\n v.append(a-1-2**i)\r\na,b=map(int,input().split())\r\nprint(len([i for i in v if a<=i and i<=b]))", "# coding:utf-8\r\n\r\nx, y = input().split()\r\nx= int(x)\r\ny = int(y)\r\n\r\ntotal = 0\r\n\r\ni = 0\r\nwhile((1 << i) // 2 <= y):\r\n\tj = 0\r\n\twhile(j <= i - 2):\r\n\t\tvalue = (1 << i) - 1 - (1<< j)\r\n\t\tif(x <= value and value <= y):\r\n\t\t\ttotal += 1\r\n\t\tj+= 1\r\n\ti+= 1\r\n\t\r\nprint(total)\r\n", "#!/usr/bin/python3\n\ngen = []\n\nfor i in range(1,70):\n x = (1 << i) - 1\n for j in range(i - 1):\n gen.append(x ^ (1 << j))\n\ngen = list(set(gen))\n\na, b = map(int, input().split())\nans = 0\nfor y in gen:\n if a <= y <= b:\n ans += 1\n\nprint(ans)\n", "a, b = map(int, input().split())\nbin1 = bin(a)\nbin1 = bin1[2::]\nbin2 = bin(b)\nbin2 = bin2[2::]\nk1 = len(bin1) - 1\nans = k1*(k1 - 1)//2\nflag = False\nfor i in range(len(bin1)):\n if bin1[i] == '0':\n flag = True\n break\nif flag:\n ans += i - 1\nelse:\n ans += len(bin1) - 1\ncnt = 0\nfor i in range(len(bin1)):\n if bin1[i] == '0':\n cnt += 1\nif cnt == 1:\n ans += 1\n \nk1 = len(bin2) - 1\nans1 = k1*(k1 - 1)//2\nflag = False\nfor i in range(len(bin2)):\n if bin2[i] == '0':\n flag = True\n break\nif flag:\n ans1 += i - 1\nelse:\n ans1 += len(bin2) - 1\ncnt = 0\nfor i in range(len(bin2)):\n if bin2[i] == '0':\n cnt += 1\nif cnt == 1:\n ans1 += 1\nallans = ans1 - ans\ncnt = 0\nfor i in range(len(bin1)):\n if bin1[i] == '0':\n cnt += 1\nif cnt == 1:\n allans += 1\nprint(allans)\n\n\n\n", "from math import *\r\na,b=map(int,input().split())\r\ncount=0\r\nfor i in range(1, 64):\r\n for j in range(64):\r\n san='1'*i+'0'+'1'*j\r\n if a<=int(san,2)<=b:\r\n count+=1\r\nprint(count)", "a, b = map(int, input().split())\r\nans = 0\r\nk = 0\r\ni = 0\r\nwhile k < b:\r\n k += 2 ** i\r\n i += 1\r\nll = int(\"011111111111111111111111111111111111111111111111111111111\", 2)\r\ni -= 1\r\nwhile k >= a:\r\n x = 0\r\n while k - 2 ** x >= 0 and x < i:\r\n if a <= k - 2 ** x <= b:\r\n ans += 1\r\n x += 1\r\n k -= 2 ** i\r\n i -= 1\r\n\r\nprint(ans)\r\n\r\n# 100000000000000000000000000111001010110000000111000000000\r\n# 011111111111111111111111111111111111111111111111111111111", "l=[];\r\nfor i in range (2,62):\r\n x=2**i-1\r\n for j in range (i-1):\r\n l.append (x-2**j)\r\n# print (x-2**j)\r\n\r\nn,m=map(int ,input().split())\r\nans =0;\r\nfor i in l :\r\n if (i<=m and i>=n):\r\n ans+=1\r\nprint (ans)\r\n", "from math import log,floor\r\na,b=map(int,input().split())\r\nz=a\r\np1=0\r\nwhile(z!=0):\r\n p1+=1\r\n z>>=1\r\nz=b\r\np2=0\r\nwhile(z!=0):\r\n p2+=1\r\n z>>=1\r\ncount=0\r\nwhile(p1<=p2):\r\n p=0\r\n exp=2**p1-1\r\n while(p<p1-1):\r\n if b>= exp-2**p >=a:\r\n count+=1\r\n # print(exp-2**p,count,p1,p)\r\n p+=1\r\n \r\n p1+=1\r\nprint(count)", "a,b=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,62):\r\n for j in range(62):\r\n if a<=int(\"1\"*i+\"0\"+\"1\"*j,2)<=b:\r\n ans+=1\r\nprint(ans)", "x, y = map(int, input().split())\r\nans = 0\r\nfor left in range(1, 100):\r\n s = '1' * left + '0'\r\n for right in range(100):\r\n a = int(s, 2)\r\n if a in range(x,y+1):\r\n ans += 1\r\n s += '1'\r\nprint(ans)", "n,m=map(int,input().split())\n \ncnt=0\nfor i in range(2,65):\n y=pow(2,i)\n for j in range(i-1):\n z=pow(2,j)\n x=y-z-1\n \n if x>=n and x<=m:\n cnt+=1\n \nprint(cnt)\n\t\t\t \t\t \t \t \t \t\t\t \t \t", "low, high = [int(x) for x in input().split()]\r\n\r\na = 2\r\nx = 0\r\ntot = 0\r\nwhile True:\r\n for b in reversed(range(a-1)):\r\n x = 2**a - 1 - 2**b\r\n if x < low: continue\r\n if x > high: break\r\n tot += 1\r\n if x > high: break\r\n a += 1\r\nprint(tot)\r\n", "a, b = map(int, input().split())\r\na = bin(a)[2:]\r\nb = bin(b)[2:]\r\nc = -1\r\nd = -1\r\nfor i in range(len(a)):\r\n if a[i] == '0' and c == -1:\r\n c = i\r\n if b[i] == '0' and d == -1:\r\n d = i\r\nans = 0\r\n#if len(a) < len(b) - 1:\r\n #ans += ((len(b) - 2)*(len(b)-1)-len(a)*len(a-1))//2\r\n #if c > -1:\r\n #ans+=len(a)-c-1\r\n #if d > -1:\r\n #ans+=d-1\r\nif c == -1:\r\n a = bin(int(a, 2)+1)[2:]\r\n c = 1\r\nif d == -1:\r\n d = len(b)-1\r\n\r\ni = c\r\ns = '1'*len(a)\r\ns = bin(int(s, 2) & ~(1<<(len(s)-i-1)))[2:]\r\nwhile int(s, 2) <= int(b, 2):\r\n ans+=1\r\n #print(s)\r\n #s[i-1] = '1'\r\n s = bin(int(s, 2) | (1<<(len(s)-i-1)))[2:]\r\n i+=1\r\n if i == len(s):\r\n i = 1\r\n s = '1' + s\r\n #s[i] = '0'\r\n s = bin(int(s, 2) & ~(1<<(len(s)-i-1)))[2:]\r\n \r\nprint(ans)", "a, b = map(int, input().split())\r\nans = 0\r\n\r\nfull = 0\r\nfor mp in range(100):\r\n full += 2 ** mp\r\n for zp in range(mp):\r\n curr = full - 2 ** zp\r\n if a <= curr <= b:\r\n ans += 1\r\nprint(ans)", "n,m=map(int,input().split())\r\n\r\ncnt=0\r\nfor i in range(2,65):\r\n #i denotes quantity of bits\r\n #if jth bit is 1\r\n y=pow(2,i)\r\n for j in range(i-1):\r\n #x is the number having 1 in jth bit\r\n #but we need the vice versa\r\n z=pow(2,j)\r\n x=y-z-1\r\n\r\n if x>=n and x<=m:\r\n cnt+=1\r\n #print(i,bin(z),bin(x))\r\n\r\nprint(cnt)", "import math\r\na,b = map(int,input().split())\r\nfloor = math.ceil(math.log(a+1,2))\r\nceil = math.ceil(math.log(b+1,2))\r\ncnt = 0\r\nfor i in range(floor,ceil+1):\r\n t = pow(2,i)-1\r\n for j in range(i-1):\r\n if t-pow(2,j)>=a and t-pow(2,j)<=b:\r\n cnt += 1\r\nprint(cnt)", "def cnt(n):\n sz = 0\n first = 0\n last = 0\n while n > 0:\n sz += 1\n if n % 2 == 0 and first == 0:\n first = sz\n if n % 2 == 0:\n last = sz\n n //= 2\n ans = 0\n for i in range(1, sz):\n ans += i\n if first == last != 0:\n last -= 1\n return ans - last\n \n\na, b = list(map(int, input().split()))\nprint(cnt(b) - cnt(a - 1))", "def compute(a):\r\n b = bin(a)[2:]\r\n n = len(b) - 1\r\n \r\n res = n * (n - 1) // 2\r\n\r\n zero_cnt = b.count('0')\r\n if zero_cnt == 1:\r\n res += 1\r\n\r\n res += b.index('0') - 1 if zero_cnt > 0 else n\r\n\r\n return res\r\n\r\n\r\ndef main():\r\n a, b = map(int, input().split())\r\n res = compute(b) - compute(a - 1)\r\n print(res)\r\n\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "\n#B. New Year and Old Property\n\n#The year 2015 is almost over.\n\n#Limak is a little polar bear. He has recently learnt about the binary system. He noticed that the passing year has exactly one zero in its representation in the binary system — 201510 = 111110111112. Note that he doesn't care about the number of zeros in the decimal representation.\n\n#Limak chose some interval of years. He is going to count all years from this interval that have exactly one zero in the binary representation. Can you do it faster?\n\n#Assume that all positive integers are always written without leading zeros.\n\n#Input\n#The only line of the input contains two integers a and b (1 ≤ a ≤ b ≤ 1018) — the first year and the last year in Limak's interval respectively.\n\n#Output\n#Print one integer – the number of years Limak will count in his chosen interval.\n\n\n# function that computes the number of special years, counting from zero\n# to and including year n (integer!)\n\ndef count_special_years(n):\n # negative number made positive\n if n < 0:\n n*= -1\n \n # small case, ba\n if n < 2:\n return 0\n \n i = 0\n j = 1\n \n # determining i maximal with 2^i < n\n # may count all special years up to 2^i\n # which is the sum of int up to i-1 (cf. return value)\n \n while True:\n j = j << 1\n if j > n:\n break;\n i+=1\n \n # prepare mask = 2^(i+1)\n # needed for cycling through special years, together with bitshift\n \n mask = 1 << i\n \n \n # prepare first (smallest > 2^i) special year 101111...1\n # used for counting special years z for 2^i < z <= n\n x = 1 \n for j in range(i):\n x = (x<<1) + 1\n x ^= mask >> 1\n #print(\"x =\",x)\n\n # start counting special years < n\n k = 0\n if n >= x:\n k += 1\n \n # cycling through rest by bitshift + mask\n for j in range(i-1):\n x = (x >> 1) ^ mask # move x to next year 11011....111 and so on\n if x > n:\n break;\n k+=1\n \n return int(i*(i-1)/2) + k # result\n\n\n# read the two numbers\na,b = map(int,input().split(\" \"))\n\n# print out difference of special years, resulting in\n# special years in inclusive interval [a,b]\nprint(count_special_years(b)-count_special_years(a-1))\n", "import sys\r\n\r\ndef main():\r\n\r\n l,r=map(int,sys.stdin.readline().strip().split())\r\n count=0\r\n for i in range(1,61):\r\n x=(2**i)-1\r\n for j in range(i-1):\r\n y=(1<<j)^x\r\n if y>=l and y<=r:\r\n count+=1\r\n print(count)\r\n\r\nmain()", "a, b = map(int, input().split())\r\ncur = \"1\" * 65\r\nres = 0\r\nfor start in range(len(cur)):\r\n\tcur = cur[1:]\r\n\ts = 0\r\n\tfor i in range(len(cur)):\r\n\t\ts += (1 << i)\r\n\tfor j in range(len(cur) - 1):\r\n\t\ts -= (1 << j)\r\n\t\tif a <= s and s <= b:\r\n\t\t\tres += 1\r\n\t\ts += (1 << j)\r\nprint(res)", "def generate_aswners_from_mask(mask):\r\n one_zero_binaries = []\r\n for i in range(2, len(mask)):\r\n aux_bin = '0b'\r\n aux_bin += mask[2:]\r\n aux_bin = list(aux_bin)\r\n aux_bin[i] = '0'\r\n aux_bin = \"\".join(aux_bin)\r\n one_zero_binaries.append(aux_bin)\r\n return one_zero_binaries\r\n\r\n\r\ninput_numbers = input()\r\ninput_numbers = input_numbers.split(\" \")\r\ninput_numbers = list(map(int, input_numbers))\r\n\r\nmasks = []\r\n\r\na = input_numbers[0]\r\nb = input_numbers[1]\r\na_sz = len(bin(a)[2:]) \r\nb_sz = len(bin(b)[2:])\r\n\r\nfor i in range(a_sz, b_sz+1):\r\n mask = ((1 << i) - 1)\r\n masks.append(bin(mask))\r\n\r\n\r\nall_aswners = []\r\n\r\nfor i in masks:\r\n all_aswners = all_aswners + generate_aswners_from_mask(i)\r\n\r\n\r\nfinal_aswners = []\r\n\r\nfor i in all_aswners:\r\n int_rep = int(i,2)\r\n if(int_rep < input_numbers[0] or int_rep > input_numbers[1] or i[2] == '0'):\r\n continue\r\n final_aswners.append(i)\r\n\r\n\r\nprint(len(final_aswners))", "l, r = map(int, input().split())\n\na = []\n\nfor i in range(1, 64):\n\tx = (1 << i) - 1\n\tfor j in range(i - 1):\n\t\ta.append(x ^ (1 << j))\n\nans = 0\nfor k in a:\n\tif(k >= l and k <= r):\n\t\tans += 1\n\nprint(ans)\n", "def f(x: str):\r\n if x == '0':\r\n return 1\r\n r = x.count('0') == 1\r\n l = len(x)\r\n i = 1\r\n while i < l:\r\n r += l - i - 1\r\n i += 1\r\n r += 1\r\n for i in range(1, l):\r\n if x[i]=='0':\r\n break\r\n else:\r\n r += 1\r\n return r\r\n\r\n\r\na, b = map(int, input().split())\r\nprint(f(bin(b)[2:]) - f(bin(a - 1)[2:]))\r\n", "a1,b1=map(int,input().split())\nprint(len([(2**i-1)-2**j for i in range(65) for j in range(i-1) if a1<=2**i-1-2**j<=b1]))\n\t\t \t \t\t\t\t\t \t\t \t\t\t \t\t \t \t", "def main():\n\ttok = input().split()\n\tA = int(tok[0])\n\tB = int(tok[1])\n\n\tans = 0\n\tfor a in range(1, 70):\n\t\tfor b in range(70):\n\t\t\tnum = (2**a - 1) * (2**(b + 1)) + (2**b - 1)\n\t\t\tif num >= A and num <= B:\n\t\t\t\tans += 1\n\t\n\tprint(ans)\n\n\nmain()\n", "#!/usr/bin/env python3\na, b = map(int,input().split())\ncnt = 0\nfor i in range(2,64*8):\n for j in range(1,i):\n c = ['1'] * i\n c[j] = '0'\n c = int(''.join(c), 2)\n if a <= c <= b:\n cnt += 1\nprint(cnt)\n", "def z(n):\r\n n = bin(n)[2:]\r\n k = len(n)\r\n s = (k-1) * (k-2) // 2 + (n.count(\"0\") == 1)\r\n r = n.find(\"0\")\r\n s += k if r == -1 else r\r\n\r\n return s - 1;\r\n\r\na, b = map(int, input().split());\r\nprint (z(b) - z(a - 1))", "x = input().split()\r\nans = 0\r\nfor i in range(61):\r\n for j in range(i - 1):\r\n y = 2 ** i - 1 - 2 ** j\r\n if y >= int(x[0]) and y <= int(x[1]):\r\n ans += 1\r\nprint(ans)", "l,r = map(int,input().split())\nans = 0\nbinl = bin(l)[2:]\nbinr = bin(r)[2:]\nst = len(binl)\ned = len(binr)\nfor i in range(st,ed + 1):\n for j in range(0,i-1):\n if (l <= (1 << i) - 1 - (1 << j) <= r):\n ans += 1\nprint(ans)\n", "class var:\r\n List = []\r\n lim = 10 ** 18\r\n\r\ndef toint(n):\r\n number = 0\r\n for j in range(len(n)):\r\n number *= 2\r\n number += ord(n[j]) - 48\r\n return number\r\n\r\ndef f():\r\n for length in range(2, 100):\r\n for j in range(1, length):\r\n s = length * ['1']\r\n s[j] = '0'\r\n number = toint(s)\r\n if number <= var.lim:\r\n var.List.append(number)\r\nf()\r\nl, r = [int(j) for j in input().split()]\r\ncount = 0\r\nfor j in range(len(var.List)):\r\n if var.List[j] >= l and var.List[j] <= r:\r\n count += 1\r\nprint(count)\r\n", "a,b = map(int, input().split())\r\ncnt = 0\r\nfor i in range(2,65):\r\n\tfor j in range(i-1):\r\n\t\tr = 2 ** i - 2 ** j - 1\r\n\t\t#print(r)\r\n\t\tif ( a <= r <= b ):\r\n\t\t\tcnt += 1\r\nprint(cnt)", "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 = IL()\r\nyears = []\r\nfor i in range(2, 61):\r\n x = 2**i-1\r\n for j in range(i-1):\r\n years.append(x - 2**j)\r\n\r\nyears.sort()\r\nprint(sum([a<=i<=b for i in years]))", "# def chk(e):\r\n# flag = 1\r\n\r\na,b = map(int,input().split())\r\nlow = len(bin(2**(len(bin(a)[2:]))-1)[2:])\r\nhigh = len(bin(2**(len(bin(b)[2:]))-1)[2:])\r\nans = 0\r\nfor i in range(low,high+2):\r\n c = list(bin(2**i-1)[2:])\r\n for k in range(1,len(c)):\r\n c[k] = \"0\"\r\n e = \"\".join(c)\r\n num = int(e,2)\r\n if num >= a and num <= b:\r\n ans += 1\r\n\r\n c[k] = \"1\"\r\n\r\nprint(ans)", "def fun(x):\r\n ans=0\r\n for i in range(2,63):\r\n mask=(1<<i)-1\r\n for j in range(i-1):\r\n y=mask^(1<<j)\r\n if y<=x:\r\n ans+=1\r\n return ans\r\n \r\n \r\na,b=map(int,input().split())\r\nprint(fun(b)-fun(a-1))\r\n", "a, b = map(int, input().split())\r\n\r\nans = 0\r\nfor l in range(1, 70):\r\n for pos in range(l - 1):\r\n x = 2 ** l - 1 - 2 ** pos\r\n if a <= x <= b:\r\n ans += 1\r\nprint(ans)\r\n", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\ndef read_list():\n return [int(i) for i in input().split()]\ndef new_list(n):\n return [0 for i in range(n)]\ndef new_matrix(n, m=0):\n return [[0 for i in range(m)] for i in range(n)]\n\n\na, b = read_list()\n\nansw = 0\n\ni = 0\n\nwhile (1 << i) / 2 <= b:\n j = 0\n while j < i-1:\n if a <= (1 << i) - 1 - (1 << j) <= b:\n answ += 1\n j += 1\n i += 1\n\nprint(answ)\n", "from math import log\r\nfrom math import ceil\r\na, b = map(int, input().split())\r\nchislo = 1\r\nmno = 1\r\nans = 0\r\nflag = 1\r\nwhile flag:\r\n flag = 0\r\n chi = 1\r\n m = 1\r\n if chislo <= b:\r\n flag = 1\r\n for _ in range(1, ceil(log(chislo, 2))):\r\n m *= 2\r\n if chislo - chi <= b or chislo - chi <= a:\r\n flag = 1\r\n if chislo - chi >= a and chislo - chi <= b:\r\n ans += 1\r\n chi += m - m // 2\r\n mno *= 2\r\n chislo += mno\r\nprint(ans)\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\n#Code\r\n\r\ndef to_decimal(num):\r\n base = 1\r\n res = 0\r\n while num > 0 :\r\n l = num % 10\r\n num//=10\r\n res += base * l\r\n base*= 2\r\n\r\n return res\r\n\r\nl ,r = MAP()\r\ncount = 0\r\n\r\nfor i in range(1 , 61):\r\n for j in range(61):\r\n s = '1' * i + '0' + '1' * j\r\n k = to_decimal(int(s))\r\n if l<=k<=r:\r\n count+=1\r\n\r\nprint(count)\r\n\r\n\r\n", "x,y=list(map(int,input().split()))\r\nh=len(bin(x))-3\r\nm=len(bin(y))-1\r\n\r\nc=0\r\nfor i in range(h,m+1):\r\n a=2**i-1\r\n k=0\r\n for j in range(i-1):\r\n k=a-2**j\r\n #print(k,a)\r\n if k>=x and k<=y:\r\n \r\n c+=1\r\nprint(c)", "l = list(map(int,input().split()))\nco=0 \nfor i in range(64):\n for j in range(i):\n t = (1<<(i+1))- (1<<j) -1\n if t>= l[0] and t<=l[1]:\n co+=1\nprint(co)\n \t \t \t \t\t\t \t\t \t \t \t \t\t\t", "def count(a):\n count = 1\n x = 1\n length = 1\n while x < a:\n x = 2 * x + 1\n count += length\n length += 1\n count -= length - 1\n #print('x %d, count %d, length %d' % (x, count, length))\n y = 1\n while 2 * y <= x:\n x ^= y\n if x <= a:\n count += 1\n x ^= y\n #print('y %d, count %d' % (y, count))\n y *= 2\n return count\n\n#for i in range(17):\n# print()\n# print(i, count(i))\n#import sys; sys.exit()\n\nlow, high = map(int, input().split())\nprint(count(high) - count(low - 1))\n", "u, v=[int(x) for x in input().split()]\r\nans=0\r\nub=bin(u)[2:]\r\nvb=bin(v)[2:]\r\nif(len(ub)==len(vb)):\r\n\tfor i in range(1, len(ub)):\r\n\t\ts=['1']*len(ub)\r\n\t\ts[i]='0'\r\n\t\ts=\"\".join(s)\r\n\t\tif(int(s, 2)<=v and int(s, 2)>=u):\r\n\t\t\tans+=1\r\n\tprint(ans)\r\nelse:\r\n\tfor i in range(1, len(ub)):\r\n\t\ts=['1']*len(ub)\r\n\t\ts[i]='0'\r\n\t\ts=\"\".join(s)\r\n\t\tif(int(s, 2)>=u):\r\n\t\t\tans+=1\r\n\tfor i in range(1, len(vb)):\r\n\t\ts=['1']*len(vb)\r\n\t\ts[i]='0'\r\n\t\ts=\"\".join(s)\r\n\t\tif(int(s, 2)<=v):\r\n\t\t\tans+=1\r\n\tfor i in range(len(ub)+1, len(vb)):\r\n\t\tans=ans+i-1\r\n\tprint(ans)", "def count_years_with_one_zero(a, b):\n v = []\n for l in range(64):\n a_l = 2**l\n for i in range(l-1):\n v.append(a_l-1-2**i)\n \n count = sum(1 for year in v if a <= year <= b)\n \n return count\n\na, b = map(int, input().split())\nprint(count_years_with_one_zero(a, b))\n\n\t\t \t \t\t \t\t\t \t\t\t\t\t \t\t \t \t", "# Why do we fall ? So we can learn to pick ourselves up.\r\na,b = map(int,input().split())\r\nss = 0\r\nfor i in range(0,64):\r\n for j in range(0,64):\r\n s = '1'*i+'0'+'1'*j\r\n s = str(int(s))\r\n if s.count('0') and a <= int(s,2) <= b:\r\n ss += 1\r\nprint(ss)", "a,b=map(int,input().split())\r\nprint(len([(2**i-1)-2**j for i in range(65) for j in range(i-1) if a<=2**i-1-2**j<=b]))", "a, b = map(int, input().split())\r\nw = 2\r\nwhile 2 ** w <= a:\r\n w += 1\r\nans1 = 0\r\nfor i in range(w - 1):\r\n ans1 += i\r\nfor i in range(w - 1):\r\n if 2 ** w - 2 ** i <= a:\r\n ans1 += 1\r\nw = 2\r\nwhile 2 ** w <= b:\r\n w += 1\r\nans2 = 0\r\nfor i in range(w - 1):\r\n ans2 += i\r\nfor i in range(w - 1):\r\n if 2 ** w - 2 ** i <= b:\r\n ans2 += 1\r\ncol = 0\r\nwhile b != 0:\r\n if b % 2 == 0:\r\n col += 1\r\n b = b // 2\r\nif col == 1:\r\n ans2 += 1\r\nprint(ans2 - ans1)\r\n", "low,up = map(int,input().split())\nlow = bin(low).replace(\"0b\",\"\")\nup = bin(up).replace(\"0b\",\"\")\nx = len(low)\nx = int(((x-2)*(x-1))/2)\ny = len(up)\ny = int(((y-2)*(y-1))/2)\nfor i in range (1,len(low)):\n if low[i] == low[i-1] :\n x += 1\n else :\n break\nfor i in range (1,len(up)):\n if up[i] == up[i-1] :\n y += 1\n else :\n break\nct0 = 0\nfor i in up :\n if i == '0':\n ct0 += 1\nif ct0 == 1 :\n y += 1\nprint(y-x)\n \t\t \t \t\t\t\t \t \t \t \t \t\t \t", "a,b = map(int,input().split())\r\n\r\ndef found_n(x,a):\r\n n = 0\r\n while(2**n-1 < x ):\r\n n+=1\r\n\r\n number = list(bin(2**n-1))\r\n conta = 0\r\n # print('n=',n)\r\n for i in range(2, 2+n):\r\n number_ = list(number)\r\n number_[i]='0'\r\n # print(number_)\r\n number_ = ''.join(number_)\r\n if (int(number_,2) != (2**(n-1)-1)):\r\n if (a):\r\n if (int(number_,2) <= x):\r\n # print('opa ',int(number_,2),bin(int(number_,2)),'i=',i)\r\n conta+=1\r\n else:\r\n if (int(number_,2) < x):\r\n # print('opa ',int(number_,2),bin(int(number_,2)))\r\n conta+=1\r\n\r\n # print('conta=',conta)\r\n soma = (n*(n-1))//2 - (n-1) + 1\r\n # print('soma=',soma)\r\n total = conta + soma\r\n return total\r\n\r\nb_ = found_n(b,True)\r\na_ = found_n(a,False)\r\n\r\nprint(b_-a_)\r\n", "a, b = map(int, input().split())\r\ncount = 0\r\nfor i in range(2, 62):\r\n s = (2 ** i) - 1\r\n for j in range(i-1):\r\n n = s - (2 ** j)\r\n if a <= n and n <= b:count += 1\r\nprint(count)", "s=input().split()\r\na=int(s[0])\r\nb=int(s[1])\r\nres=[]\r\nfor i in range(1,61):\r\n for y in range(1,i+1):\r\n mas=[1]*i\r\n mas.insert(y,0)\r\n mas=mas[::-1]\r\n re=0\r\n for r in range(i+1):\r\n re=re+mas[r]*2**r\r\n res.append(re)\r\nsumm=0\r\nfor i in range(len(res)):\r\n if res[i]>=a and res[i]<=b :\r\n \t summ=summ+1 \r\nprint(summ)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\na,b = [int(x) for x in input().split()]\r\n\r\ndef Solve(a,b):\r\n if a == b == 1:\r\n return 0\r\n bit_length_1 = a.bit_length()\r\n bit_length_2 = b.bit_length()\r\n \r\n ans = 0 \r\n \r\n for bit_length in range(bit_length_1, bit_length_2 + 1):\r\n ones = (1<<bit_length)- 1\r\n for i_zero in range(bit_length - 1):\r\n x = ones^(1<<i_zero)\r\n if a <= x <= b:\r\n ans +=1\r\n \r\n return ans\r\n \r\n\r\nprint(Solve(a,b))", "def main():\r\n\t(a, b) = (int(x) for x in input().split())\r\n\tprint(solver(a, b))\r\n\r\ndef solver(a, b):\r\n\t#print(a, b)\r\n\tbinA = bin(a)[2:]\r\n\tbinB = bin(b)[2:]\r\n\t#print(binA, binB)\r\n\tstartA = len(binA)\r\n\tfor i in range(len(binA)):\r\n\t\tif binA[i] == '0':\r\n\t\t\tstartA = i\r\n\t\t\tbreak\r\n\t#print(len(binA), startA, len(binB))\r\n\tstartB = len(binB)\r\n\tfor i in range(len(binB)):\r\n\t\tif binB[i] == '0':\r\n\t\t\tstartB = i\r\n\t\t\tbreak\r\n\tbValid = False\r\n\tif startB != len(binB) and \\\r\n\tbinB[startB + 1:] == \"1\" * (len(binB) - startB - 1):\r\n\t\tbValid = True\r\n\ttotal = 0\r\n\tif len(binA) != len(binB):\r\n\t\ttotal += len(binA) - startA + startB - 1\r\n\t\tif bValid == True:\r\n\t\t\ttotal += 1\r\n\telif binA == binB:\r\n\t\tif bValid == True:\r\n\t\t\treturn 1\r\n\t\telse:\r\n\t\t\treturn 0\r\n\telse:\r\n\t\ttotal += startB - startA\r\n\t\tif bValid == True:\r\n\t\t\ttotal += 1\r\n\tfor i in range(len(binA) + 1, len(binB)):\r\n\t\ttotal += i - 1\t\r\n\tif total < 0:\r\n\t\treturn 0\r\n\telse:\r\n\t\treturn total\r\n\r\n# print(solver(5, 10))\r\n# print(solver(2015, 2015))\r\n# print(solver(100, 105))\r\n# print(solver(72057594000000000, 72057595000000000))\r\n\r\nmain()", "x,y=map(int,input().split())\nprint(len([(2**i-1)-2**j for i in range(65) for j in range(i-1) if x<=2**i-1-2**j<=y]))\n \t\t\t\t\t\t \t\t\t\t \t \t", "a, b = [int(i) for i in input().split()]\nc = 0\nab = str(bin(a))[2:]\nbb = str(bin(b))[2:]\n\nstart = min(len(ab), len(bb))\nstop = max(len(ab), len(bb))\nstack = []\nfor i in range(start, stop + 1):\n s = ['1']*i\n for j in range(1, i):\n s[j] = '0'\n t = ''.join(s)\n if (a<=int('0b'+t, 2)<=b) and (t not in stack) :\n c+=1\n stack.append(t)\n s[j] = '1'\nprint(c)\n", "import math\r\narr = list(map(int, input().split()))\r\na=arr[0]\r\nb=arr[1]\r\nr1=int((math.log(a)/math.log(2))+1)\r\nr2=int((math.log(b)/math.log(2))+1)\r\nt=0\r\nfor k in range(r1,r2+1):\r\n e=2**k -1\r\n \r\n for i in range(k-1):\r\n if a<=e-2**i<=b:\r\n t+=1\r\nprint(t)\r\n\r\n", "a, b = map(int, input().split())\n\nmaxL = 60\nsol = 0\n\nfor l in range(1, maxL+1):\n for p in range(1, l+1):\n binYear = '1' * p + '0' + (l-p) * '1'\n #print(binYear)\n\n decYear = int(binYear, 2)\n\n if a <= decYear and decYear <= b:\n sol += 1\n\nprint(sol)\n\n", "a,b = map(int,input().split())\r\n\r\nList = []\r\nfor i in range(2,61):\r\n for j in range(i-2,-1,-1):\r\n List+=[(1<<i)-(1<<j)-1]\r\n\r\nres = 0\r\nfor i in List:\r\n if a<=i and i<=b: res+=1\r\n\r\nprint(res)", "l, r = map(int, input().split())\na = []\nfor ln in range(1, 64):\n for i in range(1, ln):\n buf = list('1' * ln)\n buf[i] = '0'\n a.append(int(''.join(buf), 2))\nans = 0\nfor v in a:\n if l <= v <= r:\n ans += 1\nprint(ans)", "res = 0\r\nline = input().split()\r\na = int(line[0])\r\nb = int(line[1])\r\nbin_a = str(bin(a))[2:]\r\nbin_b = str(bin(b))[2:]\r\n\r\ncap = 2**(len(bin_a))\r\ngyro = cap-2\r\nfor i in range(len(bin_a)-1):\r\n\tres += 1 if gyro >= a and gyro <= b else 0\r\n\tgyro = ((gyro << 1) % cap) + 1\r\nif len(bin_a) == len(bin_b):\r\n\tprint(res)\r\nelse:\r\n\tcap = 2**(len(bin_b))\r\n\tgyro = cap-2\r\n\tfor i in range(len(bin_b)-1):\r\n\t\tres += 1 if gyro >= a and gyro <= b else 0\r\n\t\tgyro = ((gyro << 1) % cap) + 1\r\n\tfor i in range(len(bin_a)+1,len(bin_b)):\r\n\t\tres = res+i-1\r\n\tprint(res)\r\n", "a, b = map(int, input().split())\r\nans = 0\r\nfor i in range(1, 70):\r\n for j in range(0, 70):\r\n cnt = (2 ** i - 1) * 2 ** (j + 1) + (2 ** j - 1)\r\n if (cnt >= a and cnt <= b):\r\n ans += 1\r\nprint(ans)", "a,b=list(map(int,input().split()))\r\nminones=len(bin(a)[2:])\r\nmaxones=len(bin(b)[2:])\r\ncount=0\r\nfor i in range(minones,maxones+1):\r\n\tones='1'*i\r\n\ttotal = int(ones,2)\r\n\tfor j in range(1,i):\r\n\t\tval=total-(2**(i-1-j))\r\n\t\tif(val>=a and val<=b):\r\n\t\t\tcount+=1\r\nprint(count)", "def main():\n (a, b) = map(int, input().split(' '))\n ret = 0\n for i in range(1, 1000):\n x = (1 << i) - 1\n for j in range(i - 1):\n y = x ^ (1 << j)\n if y <= b and y >= a:\n ret += 1\n return ret\n\nprint(main())\n", "a,b=map(int,input().split())\r\nprint(sum(a<=int(t,2)<=b for x in range(70) for t in ['1'*i+'0'+'1'*(x-i)for i in range(1,x+1)]))", "a, b = map(int, input().split())\r\n\r\nanswer = 0\r\n\r\nbits = 2\r\nwhile bits <= 61:\r\n mask = (2 ** bits) - 1 # 1111...111\r\n for zero in range(bits - 1):\r\n x = mask - (2 ** zero) # 111...1101...1111\r\n if a <= x and x <= b:\r\n answer += 1\r\n bits += 1\r\n\r\nprint(answer)\r\n", "a,b=list(map(int,input().split()))\r\ndef fun(n):\r\n ans=0\r\n for i in range(2,64):\r\n flag=True\r\n t=1<<i\r\n t-=1\r\n for j in range(i-1):\r\n x=1<<j\r\n \r\n if t-x<=n:\r\n flag=False\r\n ans+=1\r\n if flag:\r\n break\r\n return ans\r\n \r\nprint(fun(b)-fun(a-1))", "__author__ = 'Utena'\r\na,b=map(int,input().split())\r\nn=2\r\nt=0\r\nn1=1\r\nc=0\r\nwhile True:\r\n if n1>b:break\r\n else:\r\n n*=2\r\n n1=n-1\r\n c+=1\r\n n2=1\r\n for i in range(c):\r\n if n1-n2>=a and n1-n2<=b:\r\n t+=1\r\n n2*=2\r\nprint(t)", "a,b = map(int,input().split())\r\nprint(len([(2**i-1)-2**j for i in range(0,65) for j in range(0,i-1) if a<=(2**i-1)-2**j<=b]))", "inp = input()\nn, m = inp.split(' ')\nn = int(n)\nm = int(m)\n\ncount = 0\nfor i in range(2, 65):\n y = 2**i\n for j in range(i-1):\n z = 2**j\n x = y-z-1\n\n if (x >= n and x <= m):\n count += 1\n\nprint(count)\n", "from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n\r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\n\r\na, b = gil()\r\nmi, ma = int(log2(a)), int(log2(b))\r\ncount = 0\r\n\r\nfor bit in range(mi, ma+1):\r\n\tv = 2**(bit+1) - 1\r\n\tm = 1\r\n\tfor _ in range(bit):\r\n\t\tif a <= v^m <= b:\r\n\t\t\tcount += 1\r\n\t\tm <<= 1\r\n\r\nprint(count)\r\n", "a,b = map(int,input().split())\r\ncount=0\r\nfor i in range(0,65):\r\n\tfor j in range(0,i-1):\r\n\t\tif a<=(2**i-1)-2**j<=b:\r\n\t\t\tcount+=1\r\nprint(count)\t\t\t", "import sys\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_i(): return map(int, sys.stdin.readline().split())\r\n\r\nfrom bisect import bisect_left\r\n\r\nimport sys\r\n\r\n\r\n\r\ndef fxn(st,en,ind,step):\r\n\r\n mid=st+(en-st)//2\r\n\r\n if ind<mid:\r\n\r\n return fxn(st,mid-1, ind, step-1)\r\n\r\n elif ind>mid:\r\n\r\n return fxn(mid+1, en, ind, step-1)\r\n\r\n else:\r\n\r\n return step\r\n\r\n#n, k = map(int, sys.stdin.readline().split())\r\n#arr = list(map(int, sys.stdin.readline().split()))\r\n#arr=[(int(x),i) for i,x in enumerate(input().split())]\r\n# ls=list(map(int,input().split()))\r\n# for i in range(m):\r\n#print(s[i],end=\"\")\r\n#n=int(sys.stdin.readline())\r\n#arr=list(map(int,input().split()))\r\nimport sys\r\n#n=int(sys.stdin.readline())\r\na,b=get_i()\r\n#print(math.log(10**19,2))\r\ncnt=0\r\nfor i in range(63):\r\n for j in range(i-1):\r\n if a<=(2**i-1)-2**j<=b:\r\n cnt+=1\r\nprint(cnt)", "def main():\r\n a, b = map(int, input().split())\r\n ans = 0\r\n\r\n if a <= 2 <= b:\r\n ans += 1\r\n\r\n for i in range(3, 62):\r\n cur = 1\r\n sum_ = 0\r\n for _ in range(i):\r\n sum_ += cur\r\n cur *= 2\r\n \r\n for j in range(i - 1):\r\n z = 2 ** j\r\n x = sum_ - z\r\n \r\n if a <= x <= b:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\nmain()# 1691397279.3449833", "a,b=map(int,input().split())\nc=bin(a)[2:]\nd=bin(b)[2:]\nt1=len(c)\nt2=len(d)\nans=0\nfor i in range(t1,t2+1):\n for j in range(0,i-1):\n if ((1<<(i))-1-(1<<j)) in range(a,b+1):\n ans+=1\nprint(ans)", "from itertools import permutations\r\nimport sys\r\nif False:\r\n\tinp = open('B.txt', 'r')\r\nelse:\r\n\tinp = sys.stdin\r\n\r\ndef convert(string):\r\n\tret = 0\r\n\ti = 0\r\n\tfor char in string:\r\n\t\tchar = int(char)\r\n\t\tret += char*(2**i)\r\n\t\ti+=1\r\n\treturn ret\r\n\r\npower = 0\r\nwhile(2**power <= 10**18):\r\n\tpower += 1\r\nnumbers = []\r\nfor i in range(1, power+1):\r\n\tfor j in range(i-1):\r\n\t\ttemp = '1'*(i-1-j) + '0' + '1'*(j)\r\n\t\tnumbers.append(int(temp, 2))\r\na, b = map(int, inp.readline().split())\r\nans = 0\r\nfor num in numbers:\r\n\tif a <= num <= b:\r\n\t\tans += 1\r\nprint(ans)\r\n\r\n", "#!/usr/bin/python3\na, b = map(int, input().split())\nans = 0\nfor l in range(2, 65):\n for i in range(l - 1):\n ans += a <= 2 ** l - 1 - 2 ** i <= b\nprint(ans)\n", "# week 4\n# new year and old property\na, b = map(int,input().split())\nri = 0\nfor i in range(2,64):\n\tz = 2 ** i - 1\n\tfor j in range(i - 1):\n\t\tx = z - (2 ** j)\n\t\tif x >= a and x <= b:\n\t\t\tri += 1\nprint(ri)\n\t\t\t\t\t \t\t \t \t\t\t\t \t\t", "a, b = list(map(int, input().split()))\r\npa, pb = 0, 0\r\nfor i in range(100):\r\n if pow(2, i) - 1 >= a:\r\n pa = i-1\r\n break\r\nfor i in range(pa, 100):\r\n if pow(2, i) - 1 > b:\r\n pb = i\r\n break\r\nit2 = 0\r\nfor i in range(pb+3):\r\n for j in range(i-1):\r\n if a <= pow(2, i) - 1 - pow(2, j) <= b:\r\n it2 += 1\r\nprint(it2)\r\n", "a,b=map(int,input().split());s=0\r\nfor i in range(1,61):\r\n k=['1']*i\r\n for j in range(1,i):\r\n k[j]='0'\r\n if a<=int(''.join(k),2)<=b:s+=1\r\n k[j]='1'\r\nprint(s)", "n,k=[int(a) for a in input().split()]\r\ns=0\r\nfor i in range(1,62):\r\n for j in range(62):\r\n if(n<=int(\"1\"*i+\"0\"+\"1\"*j,2)<=k):\r\n s=s+1\r\nprint(s)\r\n ", "a, b = map(int, input().split())\r\npower = [1]\r\nans = 0\r\nfor i in range(60):\r\n power.append(power[-1] * 2)\r\n \r\nfor i in range(1, 60):\r\n for j in range(i - 1, -1, -1):\r\n if sum(power[i:j:-1]) + power[j] - 1 >= a and sum(power[i:j:-1]) + power[j] - 1 <= b:\r\n ans += 1\r\nprint(ans)", "a,b=map(int,input().split())\r\nbin_a=bin(a).replace(\"0b\", \"\")\r\ncounter=0\r\nq=''\r\nbin_b=bin(b).replace(\"0b\", \"\")\r\ndiff=len(bin_b)-len(bin_a)\r\nfor l in range(diff+1):\r\n #print(\"bin_a=\", bin_a)\r\n for p in range(len(bin_a)-1):\r\n for i in range(len(bin_a)):\r\n if p==len(bin_a)-1-i:\r\n q=q+'0'\r\n else:\r\n q = q + '1'\r\n if (int(q,2)>=a) and (b>=int(q,2)):\r\n counter+=1\r\n #print(q)\r\n q = ''\r\n bin_a='1'+bin_a\r\nprint(counter)", "def next(n):\r\n s = list(str(bin(n))[2:])\r\n if s[-1] == '0':\r\n s[-1] = '1'\r\n s[1] = '0'\r\n s.append('1')\r\n else:\r\n for i in range(n):\r\n if s[i] == '0':\r\n s[i] = '1'\r\n s[i+1] = '0'\r\n break\r\n ans = \"\"\r\n for i in s:\r\n ans += i\r\n return int(ans, 2)\r\n\r\n\r\ndef norm(n):\r\n ans = []\r\n s = list(str(bin(n))[2:])\r\n for i in range(len(s)):\r\n if s[i] == '0':\r\n ans = s[:i+1]\r\n break\r\n while len(ans) < len(s):\r\n ans.append('1')\r\n t = \"\"\r\n for i in ans:\r\n t += i\r\n return int(t, 2)\r\n\r\n\r\n\r\na, b = map(int, input().split())\r\ns = list(str(bin(a))[2:])\r\n#print(s)\r\nif s.count('1') == len(s):\r\n a += 1\r\n\r\na = norm(a)\r\nans = 0\r\n#print(\"asd\", a)\r\n\r\nwhile a <= b:\r\n ans += 1\r\n a = next(a)\r\n #print(a)\r\nprint(ans)", "from collections import deque\n\n\ndef get_num(lst):\n\treturn int(''.join(map(str, lst)), base=2)\n\n\t\na, b = list(map(int, input().split()))\nn = 0\nn_ovf = 1\ntn = 1\ncnt = 0\nlst = deque([0])\ntemplate = [0]\nfor i in range(65):\n\tlst = deque(template[::])\n\twhile get_num(lst) <= b:\n\t\tif get_num(lst) >= a:\n\t\t\tif lst[0] != 0:\n\t\t\t\tcnt += 1\n\t\tlst.appendleft(1)\n\ttemplate.append(1)\nprint(cnt)", "a, b = map(int, input().split())\nprint(sum((2 ** i - 1) ^ 2 ** j in range(a, b + 1) for i in range(2, 65) for j in range(i - 1)))\n\n\n\n\n# Made By Mostafa_Khaled", "a, b = map(int, input().split())\r\nans = 0\r\nfor l in range(1, 65):\r\n n = (1 << l) - 1\r\n for i in range(l - 1):\r\n m = n ^ (1 << i)\r\n if a <= m <= b:\r\n ans += 1\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\ndef upto(n):\r\n cnt=0 \r\n b=bin(n)[2:]\r\n blen=len(b)\r\n for i in range(2,blen):\r\n cnt+=(i-1)\r\n curr=2**blen-1\r\n for i in range(blen):\r\n a=curr-2**i \r\n if a<=n:\r\n cnt+=1 \r\n return cnt\r\nprint(upto(b)-upto(a-1))\r\n#10--->1010 \r\n # len=3 \r\n # 101 \r\n #110 \r\n#len=2 \r\n#10 \r\n#len=4", "n=2;a,b=map(int,input().split());c=0\r\nwhile 1:\r\n for v in ['1'*i+'0'+'1'*(n-1-i)for i in range(1,n)]:\r\n if int(v,2)>b:break\r\n if int(v,2)>=a:c+=1\r\n else:n+=1;continue\r\n print(c);break", "a,b=map(int,input().split())\r\n\r\nlis=list()\r\ns=''\r\nfor i in range(1,69):\r\n s=s+'1'\r\n for j in range(1,len(s)):\r\n temp=s[:j]+'0'+s[j+1:]\r\n lis.append(int(temp,2))\r\n\r\nc=0\r\nfor x in lis:\r\n if x>=a and x<=b:\r\n c+=1\r\nprint(c)\r\n \r\n \r\n \r\n", "a, b = map(int, input().split())\r\ncnt = 0\r\nfor i in range(1, 64):\r\n k = (1 << i) - 1\r\n for j in range(0, i - 1):\r\n num = k - (1 << j)\r\n if (a <= num and num <= b): \r\n cnt += 1\r\nprint(cnt)", "a, b = map(int, input().split())\r\n# map works as [f, iterable] gives [f(x) for x in iterable]\r\nprint(sum((2 ** i - 1)^ (2 **j) in range(a, b + 1) for i in range(2, 65) for j in range(0, i-1)))\r\n\r\n", "def clc(n):\n\tans = 0\n\tns = \"{0:b}\".format(n)\n\tfor k in range(1,len(ns)): ans += k-1\n\tns = ns[1:]\n\twhile ns:\n\t\tif ns[0] == '1':\n\t\t\tans += 1\n\t\t\tns = ns[1:]\n\t\telse:\n\t\t\tif ns == '0'+'1'*(len(ns)-1):\n\t\t\t\tans += 1\n\t\t\tbreak\n\treturn ans\n\na, b = map(int, input().split())\nans = clc(b)\nif a > 1: ans -= clc(a-1)\nprint(ans)\n", "countYears = 0\n\ndef newYearCount(startYear, endYear, baseYear, zeros):\n global countYears\n\n if (baseYear > endYear):\n return None\n \n if (startYear <= baseYear and baseYear<= endYear and zeros == 1):\n countYears += 1\n \n if (zeros == 0):\n newYearCount(startYear, endYear, baseYear << 1, zeros + 1)\n \n newYearCount(startYear, endYear, (baseYear << 1) + 1, zeros)\n\n\nstartYear, endYear = map(int, input().split())\n\nnewYearCount(startYear, endYear, 1, 0)\n\nprint(countYears)", "a, b = map(int, str.split(input()))\nsa, sb = map(\"{:b}\".format, (a, b))\ncount = 0\nfor l in range(len(sa), len(sb) + 1):\n\n for left in range(1, l):\n\n s = \"1\" * left + \"0\" + \"1\" * (l - left - 1)\n x = int(s, 2)\n if a <= x <= b:\n\n count += 1\n\nprint(count)\n", "line1 = [int(x) for x in input().split()];\r\n\r\na = line1[0];\r\nb = line1[1];\r\n\r\ni = 1;\r\n\r\ntotal = 0;\r\n\r\nwhile(2**i-1<a):\r\n i+=1;\r\n\r\nwhile( 2**i-1<=b*2):\r\n temp = 2**i-1;\r\n for j in range(0, i-1):\r\n if(temp-2**j >= a and temp-2**j <=b):\r\n total += 1;\r\n \r\n i+=1;\r\n \r\nprint(total);", "a, b = map(int, input().split())\r\nla, lb = len(bin(a)) - 2, len(bin(b)) - 1\r\ncnt = sum(((1 << i) - 1 - (1 << j) in range(a, b + 1))for i in range(la, lb) for j in range(i - 1))\r\nprint(cnt)\r\n", "a, b = map(int, input().split())\r\nans = 0\r\nfor i in range(1, 64):\r\n for j in range(64):\r\n f = '1' * i + '0' + '1' * j\r\n if a <=int(f, 2)<=b:\r\n ans+=1\r\nprint(ans)", "import math\r\ndef gen(n):\r\n help = 0\r\n for i in range(len(n) - 1, -1, -1):\r\n help += (2 ** (len(n) - i - 1)) * int(n[i])\r\n return help\r\n\r\n\r\nstart, finish = map(int, input().split())\r\nanswer1 = 0\r\nb = math.ceil(math.log(finish, 2))\r\nfor i in range(1, b + 1):\r\n n = '1' * i + '0'\r\n for j in range(i - 1):\r\n n = '1' * (i - j - 1) + '0' + j * '1'\r\n help = gen(n)\r\n if help >= start and help <= finish:\r\n answer1 += 1\r\nif finish == 2:\r\n print(1)\r\nelse:\r\n print(answer1)", "def gen():\r\n upper = bin(int(10e18)).lstrip(\"0b\")\r\n for i in range(len(upper)):\r\n for j in range(1, i+1):\r\n tmp = \"1\" * j + \"0\" + (i - j) * \"1\"\r\n yield tmp\r\n\r\na, b = map(int, input().split())\r\nres = 0\r\nfor x in gen():\r\n if int(x, 2) >= a and int(x, 2) <= b:\r\n res += 1\r\nprint(res)\r\n", "from collections import defaultdict as mmap\ntt=1\n# tt=int(input())\nfor _ in range(tt):\n\ta=[]\n\t# n=int(input())\n\tn,m=map(int,input().split())\n\td=mmap(int)\n\tfor i in range(64):\n\t\tfor j in range(i-1):\n\t\t\ta.append(2**i-1-2**j)\n\t# a.sort()\n\tcnt=0\n\tfor i in range(len(a)):\n\t\tif n<=a[i]<=m:\n\t\t\tcnt+=1\n\tprint(cnt)\n\t\t\t \t\t \t\t \t \t\t\t\t\t\t \t \t \t\t", "x, y = map(int, input().split())\r\nans = 0\r\nfor left in range(1, 100):\r\n s = '1' * left + '0'\r\n for right in range(100):\r\n a = int(s, 2)\r\n if (a > y):\r\n break\r\n if (a >= x):\r\n ans += 1\r\n s += '1'\r\nprint(ans)\r\n", "def get_total_single_zeroed_number(length):\n return length - 1\n\n\ndef get_all_single_zeroed_numbers(length):\n return [generate_single_zero_number(length, zero_position)\n for zero_position in range(1, length)]\n\n\ndef generate_single_zero_number(length, zero_position):\n return '1' * zero_position + '0' + '1' * (length - zero_position - 1)\n\n\ndef get_total_same_length_single_zeroed_number_in_between(start, end):\n all_single_zeroed_numbers = get_all_single_zeroed_numbers(len(start))\n\n return sum(1 for number in all_single_zeroed_numbers\n if start <= number <= end)\n\n\ndef main():\n start, end = [bin(int(t))[2:] for t in input().split()]\n\n if len(start) == len(end):\n print(get_total_same_length_single_zeroed_number_in_between(start, end))\n return\n\n total_single_zeroed_number_in_range = 0\n\n for length in range(len(start) + 1, len(end)):\n total_single_zeroed_number_in_range += get_total_single_zeroed_number(length)\n\n total_single_zeroed_number_in_range += get_total_same_length_single_zeroed_number_in_between(start,\n '1' * len(start))\n total_single_zeroed_number_in_range += get_total_same_length_single_zeroed_number_in_between('0' * len(end), end)\n\n print(total_single_zeroed_number_in_range)\n\n\nif __name__ == '__main__':\n main()\n", "'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n###########################\r\n\r\n// •︿• \\\\\r\n/\\\\ //\\\r\n /\\\\ //\\\r\n /\\\\//\\\r\n\r\n###########################\r\n'''\r\nimport sys\r\nimport math as mth\r\nfrom math import ceil as cl\r\nfrom math import log2 as l2\r\nfrom math import factorial as fct\r\nfrom collections import Counter as CNT\r\nmod = 10**9 + 7\r\ndef ii():\r\n return int(input())\r\ndef fi():\r\n return float(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return input().split()\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n############################################\r\ninput = lambda : sys.stdin.readline().strip()\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\ndef bin_to_int(n):\r\n n = (n)[::-1]\r\n ans = 0\r\n for i in range(len(n)):\r\n if n[i] == \"1\":\r\n ans+= 2**i\r\n return ans\r\n\r\na,b = lii()\r\nans = 0\r\nx = False\r\nfor j in range(1,61):\r\n for i in range(1,j):\r\n s = \"1\"*j\r\n y = list(s)\r\n y[i] = \"0\"\r\n y = y[y.index(\"1\"):]\r\n z = bin_to_int(y)\r\n if z>=a and z<= b:\r\n ans+=1\r\n if z>b:\r\n x = False\r\n if x:\r\n break\r\n \r\n\r\n\r\nprint(ans) \r\n \r\n", "a, b = map(int, input().split())\r\n\r\ncountYears = 0\r\n\r\nfor i in range(1, 64):\r\n m = pow(2, i)\r\n for j in range(i - 1):\r\n n = pow(2, j)\r\n calculate = m - n - 1 \r\n if calculate >= a and calculate <= b:\r\n countYears += 1\r\n\r\nprint(countYears)", "a,b=map(int,input().split())\r\nans=2\r\nres=0\r\nfor i in range(1,64):\r\n ans=ans<<1\r\n r=1\r\n #print(ans)\r\n for j in range(i):\r\n k= ans-1-(r<<j)\r\n if k>=a and k<=b:\r\n res+=1\r\nprint(res) \r\n ", "a, b = map(int, input().split())\r\nca = 0\r\nlim = 0\r\nfor i in range(1, 64):\r\n p = 2 ** i\r\n for j in range(i - 1):\r\n q = 2 ** j\r\n ca = p - q - 1\r\n if ca >= a and ca <= b:\r\n lim += 1\r\n\r\n if ca >= b: break\r\n\r\nprint(lim)", "a, b = map(int,input().split())\nsum=0 \nc=bin(a)[2:]\nd=bin(b)[2:]\nl=len(c)\nr=len(d)\nfor i in range(l,r+1):\n for j in range(0,i-1):\n if (a<=(1<<i)-1-(1<<j)<=b):\n sum+=1\nprint(sum)", "a,b = list(map(int, input().split()))\r\nret = set()\r\nfor x in range(1,100):\r\n mask = 2**x - 1\r\n for j in range(x - 1):\r\n ll = mask - 2**j\r\n if a <= ll and ll <= b:\r\n ret.add(ll)\r\nprint(len(ret))\r\n", "from math import log2\r\na, b = map(int, input().split())\r\ntop = int(log2(b)) + 1\r\n# print(m)\r\nlow = int(log2(a))\r\nans = 0\r\nfor i in range(low+1, top+1):\r\n current = 2**i - 1\r\n for k in range(i-1):\r\n if a<=current - 2**k<=b:\r\n ans += 1\r\nprint(ans)", "a, b = map(int, input().split())\r\nans = 0\r\nfor i in range(2, 100):\r\n\tx = (1<<i)-1\r\n\tfor j in range(i-1):\r\n\t\ty = x^(1<<j)\r\n\t\tif a <= y and y <= b:\r\n\t\t\tans += 1\r\nprint (ans)\r\n\r\n\t\t\t\t\r\n", "import math\n\n(A, B) = map(int, input().split())\ncount = 0\n\nnext_pow = int(math.pow(2, math.ceil(math.log(B+1,2))))\ny = next_pow - 2 #has only 1 zero\nwhile y >= A:\n\tdelta = ~y & (y+1)\n\tif delta << 2 & y == 0:\n\t\tdelta += 1\n\n\tif A <= y and y <= B:\n\t\tcount+=1\n\n\ty -= delta\n\nprint(count)", "import math\r\nm, n = list(map(int, input().split()))\r\na = 0\r\nb = 0\r\nc = 0\r\nd = 0\r\n\r\nif m == 1 or m ==2:\r\n a = 0\r\nelif m == 3:\r\n a = 1\r\nelse:\r\n p = math.floor(math.log2(m))\r\n a += p*(p-1)/2\r\n for q in range(p):\r\n if 2**p < 2**(p+1)-1 - 2**q <= m:\r\n a += 1\r\n if 2**(p+1)-1 - 2**q == m:\r\n c = 1\r\n\r\nif n == 1:\r\n b = 0\r\nelif n == 2 or n == 3:\r\n b = 1\r\nelse:\r\n r = math.floor(math.log2(n))\r\n b += r*(r-1)/2\r\n for s in range(r):\r\n if 2**r < 2**(r+1)-1 - 2**s <= n:\r\n b += 1\r\n\r\nprint(int(b-a+c+d))", "a, b = map(int, input().split())\r\n\r\ndef cnt(x):\r\n l = x.bit_length()\r\n res = 0\r\n for di in range(l):\r\n s = (1 << (l - di + 1)) - 1\r\n for i in range(l - di):\r\n if (s ^ (1 << i)) <= x:\r\n res += 1\r\n return res\r\n\r\nprint(cnt(b) - cnt(a - 1))\r\n" ]

[ "n=int(input())\r\na=list(map(int, input().split()))\r\na=[ai-1 for ai in a]\r\na[n:n] = [n - 1]\r\n\r\ndp=[0]*n\r\nans=0\r\ni=n-2\r\n\r\nnmax=2**17\r\ntree=[[0,0]]*2*nmax;\r\n\r\n#Build Segment tree\r\nj=0\r\nwhile j<n:\r\n tree[nmax + j] = [a[j], j]\r\n j=j+1\r\nj=nmax-1\r\nwhile j>0:\r\n tree[j]=max(tree[j*2],tree[j*2+1])\r\n j=j-1\r\n \r\n#get max of a interval [left, right]\r\ndef get(left, right):\r\n ans=[-1,-1]\r\n left=left+nmax\r\n right=right+nmax+1\r\n while left<right:\r\n if (left & 1): \r\n ans = max(ans, tree[left])\r\n left = left + 1\r\n if (right & 1): \r\n right = right - 1\r\n ans = max(ans, tree[right])\r\n left = left // 2\r\n right = right // 2 \r\n return ans[1]\r\n\r\nwhile i>=0:\r\n m = get(i + 1, a[i]);\r\n dp[i] = dp[m] - (a[i] - m) + n - i - 1\r\n ans += dp[i]\r\n i=i-1\r\n\r\nprint(ans)", "\"\"\"\r\nn=int(input())\r\ns=[int(x) for x in input().split()]+[n]\r\npos=[]\r\nfor i in range(0,len(s)-1):\r\n temp=-1\r\n p=i+1\r\n for j in range(i+1,s[i]):\r\n if(temp<s[j]):\r\n temp=max(temp,s[j])\r\n p=j\r\n pos.append(j)\r\n\r\npos.append(0)\r\n\r\nans=0\r\ndp=[0]*n\r\nfor i in range(n-2,-1,-1):\r\n dp[i]=(n-i-1)+(dp[pos[i]])-(s[i]-pos[i]-1)\r\n ans+=dp[i]\r\nprint(pos)\r\nprint(dp)\r\nprint(ans)\r\n\"\"\"\r\n\r\n\"\"\"\r\nn=int(input())\r\ns=[1]+[int(x) for x in input().split()]+[n]\r\npos=[0]\r\nfor i in range(1,len(s)-1):\r\n temp=-1\r\n p=i+1\r\n for j in range(i+1,s[i]+1):\r\n if(temp<s[j]):\r\n temp=max(temp,s[j])\r\n p=j\r\n pos.append(p)\r\n\r\npos.append(0)\r\n\r\nans=0\r\ndp=[0]*(n+1)\r\nfor i in range(n-1,0,-1):\r\n dp[i]=(n-i)+(dp[pos[i]])-(s[i]-pos[i])\r\n ans+=dp[i]\r\n\r\n#print(s)\r\n#print(pos)\r\n#print(dp)\r\nprint(ans)\r\n\r\n\r\n\r\nn=int(input())\r\ns=[int(x) for x in input().split()]+[n]\r\npos=[]\r\nfor i in range(0,len(s)-1):\r\n temp=-1\r\n p=i+1\r\n for j in range(i+1,s[i]):\r\n if(temp<s[j]):\r\n temp=max(temp,s[j])\r\n p=j\r\n pos.append(p)\r\n\r\npos.append(0)\r\n\r\nans=0\r\ndp=[0]*n\r\nfor i in range(n-2,-1,-1):\r\n dp[i]=(n-i)+(dp[pos[i]])-(s[i]-pos[i])\r\n ans+=dp[i]\r\n\r\n#print(s)\r\n#print(pos)\r\n#print(dp)\r\nprint(ans)\r\n\r\n\r\n\r\n\"\"\"\r\n\r\nimport math\r\nn=int(input())\r\ns=[int(x) for x in input().split()]+[n]\r\n\r\n\r\nK=int(math.log2(n))+1\r\nlookup=[]\r\nfor i in range(n+1):\r\n h=[]\r\n for j in range(K+1):\r\n h.append(0)\r\n lookup.append(h)\r\n\r\n\r\nfor i in range(0,n):\r\n lookup[i][0]=(s[i],i)\r\n\r\nfor j in range(1,K+1):\r\n#j=1\r\n#while((1<<j)<=n):\r\n i=0\r\n while(i+(1<<j)-1<n):\r\n if(lookup[i][j-1][0]>lookup[i + (1 << (j - 1))][j - 1][0]):\r\n lookup[i][j]=(lookup[i][j-1][0],lookup[i][j-1][1])\r\n else:\r\n lookup[i][j]=(lookup[i + (1 << (j - 1))][j - 1][0],lookup[i + (1 << (j - 1))][j - 1][1])\r\n i+=1\r\n j+=1\r\n\r\n\r\n#print(lookup) \r\n\r\n\"\"\"pos=[]\r\nfor i in range(0,len(s)-1):\r\n temp=-1\r\n p=i+1\r\n for j in range(i+1,s[i]):\r\n if(temp<s[j]):\r\n temp=max(temp,s[j])\r\n p=j\r\n pos.append(p)\r\n\r\npos.append(0)\"\"\"\r\n\r\npos=[]\r\nfor i in range(0,len(s)-1):\r\n L=i+1\r\n R=s[i]-1\r\n j=int(math.log2(R-L+1))\r\n if(lookup[L][j][0]>lookup[R - (1 << j) + 1][j][0]):\r\n pos.append(lookup[L][j][1])\r\n else:\r\n pos.append(lookup[R - (1 << j) + 1][j][1])\r\n \r\n\r\nans=0\r\ndp=[0]*n\r\nfor i in range(n-2,-1,-1):\r\n dp[i]=(n-i)+(dp[pos[i]])-(s[i]-pos[i])\r\n ans+=dp[i]\r\n\r\n#print(s)\r\n#print(pos)\r\n#print(dp)\r\nprint(ans)\r\n\r\n\r\n", "from io import BytesIO, IOBase\r\nimport math\r\n\r\nimport random\r\nimport sys\r\nimport os\r\n\r\nimport bisect\r\nimport typing\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom functools import cmp_to_key, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\nfrom itertools import accumulate, combinations, permutations, count\r\nfrom operator import add, iand, ior, itemgetter, mul, xor\r\nfrom string import ascii_lowercase, ascii_uppercase, ascii_letters\r\nfrom typing import *\r\nBUFSIZE = 4096\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\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(int):\r\n# def __init__(self, x):\r\n# int.__init__(x)\r\n\r\n# def __hash__(self):\r\n# return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\nclass SegTree:\r\n def __init__(self,\r\n op: typing.Callable[[typing.Any, typing.Any], typing.Any],\r\n e: typing.Any,\r\n v: typing.Union[int, typing.List[typing.Any]]) -> None:\r\n self._op = op\r\n self._e = e\r\n\r\n if isinstance(v, int):\r\n v = [e] * v\r\n\r\n self._n = len(v)\r\n self._log = (self._n - 1).bit_length()\r\n self._size = 1 << self._log\r\n self._d = [e] * (2 * self._size)\r\n\r\n for i in range(self._n):\r\n self._d[self._size + i] = v[i]\r\n for i in range(self._size - 1, 0, -1):\r\n self._update(i)\r\n\r\n def set(self, p: int, x: typing.Any) -> None:\r\n assert 0 <= p < self._n\r\n\r\n p += self._size\r\n self._d[p] = x\r\n for i in range(1, self._log + 1):\r\n self._update(p >> i)\r\n\r\n def get(self, p: int) -> typing.Any:\r\n assert 0 <= p < self._n\r\n\r\n return self._d[p + self._size]\r\n\r\n def prod(self, left: int, right: int) -> typing.Any:\r\n assert 0 <= left <= right <= self._n\r\n sml = self._e\r\n smr = self._e\r\n left += self._size\r\n right += self._size\r\n\r\n while left < right:\r\n if left & 1:\r\n sml = self._op(sml, self._d[left])\r\n left += 1\r\n if right & 1:\r\n right -= 1\r\n smr = self._op(self._d[right], smr)\r\n left >>= 1\r\n right >>= 1\r\n\r\n return self._op(sml, smr)\r\n\r\n def all_prod(self) -> typing.Any:\r\n return self._d[1]\r\n\r\n def max_right(self, left: int,\r\n f: typing.Callable[[typing.Any], bool]) -> int:\r\n assert 0 <= left <= self._n\r\n assert f(self._e)\r\n\r\n if left == self._n:\r\n return self._n\r\n\r\n left += self._size\r\n sm = self._e\r\n\r\n first = True\r\n while first or (left & -left) != left:\r\n first = False\r\n while left % 2 == 0:\r\n left >>= 1\r\n if not f(self._op(sm, self._d[left])):\r\n while left < self._size:\r\n left *= 2\r\n if f(self._op(sm, self._d[left])):\r\n sm = self._op(sm, self._d[left])\r\n left += 1\r\n return left - self._size\r\n sm = self._op(sm, self._d[left])\r\n left += 1\r\n\r\n return self._n\r\n\r\n def min_left(self, right: int,\r\n f: typing.Callable[[typing.Any], bool]) -> int:\r\n assert 0 <= right <= self._n\r\n assert f(self._e)\r\n\r\n if right == 0:\r\n return 0\r\n\r\n right += self._size\r\n sm = self._e\r\n\r\n first = True\r\n while first or (right & -right) != right:\r\n first = False\r\n right -= 1\r\n while right > 1 and right % 2:\r\n right >>= 1\r\n if not f(self._op(self._d[right], sm)):\r\n while right < self._size:\r\n right = 2 * right + 1\r\n if f(self._op(self._d[right], sm)):\r\n sm = self._op(self._d[right], sm)\r\n right -= 1\r\n return right + 1 - self._size\r\n sm = self._op(self._d[right], sm)\r\n\r\n return 0\r\n\r\n def _update(self, k: int) -> None:\r\n self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])\r\n\r\nn = II()\r\ntarget = LII()\r\n\r\ndp = [0] * n\r\nseg = SegTree(min, inf, [inf] * n)\r\nseg.set(n-1, n-1)\r\n\r\nfor i in range(n-2, -1, -1):\r\n dp[i] = seg.prod(i+1, target[i]) + n - target[i] - i\r\n seg.set(i, dp[i]+i)\r\n\r\nprint(sum(dp))", "'''\r\n Time complexity: O(N *log(N))\r\n Space complexity: O(N)\r\n where N is the size of input array\r\n'''\r\nfrom sys import stdin\r\n\r\nMAXN = (1 << 17)\r\n\r\ndef build(arr, n, segtree) :\r\n\r\n for i in range(n) :\r\n \r\n segtree[MAXN + i] = [arr[i], i]\r\n \r\n for i in range(MAXN - 1, 0, -1) :\r\n\r\n segtree[i] = max(segtree[i * 2], segtree[i * 2 + 1])\r\n \r\n\r\ndef get(l, r, segtree) :\r\n\r\n ans = [-1, -1]\r\n\r\n l, r = l + MAXN, r + MAXN + 1\r\n \r\n while(l < r) :\r\n\r\n if (l & 1) :\r\n \r\n ans = max(ans, segtree[l])\r\n l += 1\r\n\r\n if (r & 1) :\r\n\r\n r -= 1\r\n ans = max(ans, segtree[r])\r\n \r\n l >>= 1\r\n r >>= 1\r\n \r\n\r\n return ans[1]\r\n\r\n\r\n#main\r\n\r\nn = int(input().strip())\r\narr = list(map(int, stdin.readline().strip().split(\" \")))\r\narr = arr + [n]\r\n\r\nfor i in range(n) :\r\n\r\n arr[i] -= 1\r\n\r\nsegtree = [[0, 0] for i in range(4 * MAXN)]\r\n\r\nbuild(arr, n, segtree)\r\ndp = [0 for i in range(n)]\r\nans = 0\r\n\r\nfor i in range(n - 2, -1, -1) :\r\n \r\n m = get(i + 1, arr[i], segtree)\r\n dp[i] = dp[m] - (arr[i] - m) + n - i - 1\r\n ans += dp[i]\r\n\r\n\r\nprint(ans)\r\n", "def main():\n from collections import deque\n n = int(input())\n aa, bb = list(map(int, input().split())), [0] * n\n q, bb[1] = deque([(n - 1, aa.pop())]), 1\n aa.reverse()\n for i, a in enumerate(aa, 2):\n if a == n:\n bb[i] = i\n else:\n lo, hi = 0, len(q)\n while lo <= hi:\n mid = (lo + hi) // 2\n if q[mid][0] > a:\n lo = mid + 1\n else:\n hi = mid - 1\n x = q[lo][0]\n bb[i] = x + i + bb[n - x] - a\n while q and q[-1][1] < a:\n del q[-1]\n q.append((n - i, a))\n print(sum(bb))\n\n\nif __name__ == '__main__':\n main()\n", "import os, 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\nmod = 998244353\r\nfrom math import log2\r\nfrom bisect import bisect_right\r\nfrom math import log2\r\ndef sparse_table(ar):\r\n n=len(ar)\r\n t=int(log2(n))+1\r\n sp=[[[0,0] for _ in range(t)] for _ in range(n)]\r\n for i in range(n):\r\n sp[i][0][0]=ar[i]\r\n sp[i][0][1]=i\r\n for j in range(1,t):\r\n for i in range(n-2**j+1):\r\n v1,i1=sp[i][j-1]\r\n v2,i2=sp[i+2**(j-1)][j-1]\r\n if v2>v1:\r\n sp[i][j][0]=v2\r\n sp[i][j][1]=i2\r\n else:\r\n sp[i][j][0] = v1\r\n sp[i][j][1] = i1\r\n\r\n return sp\r\n\r\ndef solve(i,j):\r\n t=int(log2(j-i+1))\r\n j=j-2**t+1\r\n v1, i1 = sp[i][t]\r\n v2, i2 = sp[j][t]\r\n if v2 > v1:\r\n return i2\r\n return i1\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nsp=sparse_table(a)\r\n#print(sp)\r\ndp=[0]*n\r\ndp[n-2]=1\r\nfor i in range(n-3,-1,-1):\r\n if a[i]==n:\r\n t=solve(i+1,a[i]-2)\r\n else:\r\n t = solve(i + 1, a[i] - 1)\r\n #print(t,'t')\r\n dp[i]=dp[t]+(a[i]-1-i)-(a[i]-1-t)+(n-1-(a[i]-1))\r\n#print(dp)\r\nprint(sum(dp))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n\tn = int(input())\r\n\ta = list(map(int, input().split()))\r\n\tT = [(-1,-1)]*(2*n)\r\n\tfor i in range(n-1):\r\n\t\tT[i+n] = (a[i], i)\r\n\tT[n+n-1] = (n, n-1)\r\n\tfor i in range(n-1,-1,-1):\r\n\t\tT[i] = max(T[2*i], T[2*i+1])\r\n\tdp = [0]*n\r\n\tres = 0\r\n\tfor i in range(n-2,-1,-1):\r\n\t\tl = i + n\r\n\t\tr = a[i] - 1 + n\r\n\t\tv = (-1,-1)\r\n\t\twhile l <= r:\r\n\t\t\tif l % 2 == 1:\r\n\t\t\t\tv = max(v, T[l])\r\n\t\t\tif r % 2 == 0:\r\n\t\t\t\tv = max(v, T[r])\r\n\t\t\tl = (l+1)//2\r\n\t\t\tr = (r-1)//2\r\n\t\t#print(i,v[1])\r\n\t\tdp[i] = dp[v[1]] + (n - v[1]) + (v[1] - i) - (a[i] - 1 - v[1]+1)\r\n\t\tres += dp[i]\r\n\t#print(dp)\r\n\tprint(res)\r\n\r\nsolve()\r\n" ]

[ "n, w = (int(i) for i in input().split())\r\nmas = [int(i) for i in input().split()]\r\n \r\ndef qer():\r\n global w\r\n for i, size in enumerate(mas):\r\n q = round(size / 2 + 0.1)\r\n rer[size,i] = q\r\n w -= q\r\n if w < 0:\r\n return {1:-1}\r\n \r\n for size,i in sorted(rer, reverse = True):\r\n o = size - rer[size,i]\r\n rer[size,i] += min(w,o)\r\n w -= min(o,w)\r\n if w == 0:\r\n break\r\n return rer\r\n \r\n \r\n \r\n \r\n \r\n \r\nrer = {}\r\nprint(*qer().values())\r\n", "\r\n\r\n\r\n\r\n\r\n\r\ncilv_sk, tejas_daudz=[int(x) for x in input().split()]\r\n\r\ns=input().split()\r\n\r\ntilpumi = [ [int(s[i]),i] for i in range(cilv_sk)]\r\n\r\naizpildijums = [0 for i in range(cilv_sk)]\r\n\r\n\r\n\r\n\r\n\r\n\r\nfor i in range(cilv_sk):\r\n cur_t = tilpumi[i][0]//2 + tilpumi[i][0]%2\r\n aizpildijums[i] = cur_t\r\n tejas_daudz -= (cur_t)\r\n if(tejas_daudz<0):\r\n #print(\"Nevar!!!!\")\r\n print(-1)\r\n exit(0)\r\n\r\ntilpumi.sort(key=lambda a: a[0], reverse=True)\r\n\r\n\r\n\r\nfor i in range(cilv_sk):\r\n starp=tilpumi[i][0]-aizpildijums[ tilpumi[i][1] ]\r\n if(starp<tejas_daudz):\r\n aizpildijums[ tilpumi[i][1] ]+=starp\r\n tejas_daudz-=starp\r\n else:\r\n aizpildijums[ tilpumi[i][1] ]+=tejas_daudz\r\n tejas_daudz=0\r\n break\r\n\r\n\r\nif(tejas_daudz!=0): print(-1)\r\nelse:\r\n for i in aizpildijums: print(i, end=\" \")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, w = map(int, input().split())\r\na = sorted([(n, i) for i, n in enumerate(map(int, input().split()))])\r\ntea = [0]*n\r\n \r\nfor i in range(n):\r\n tea[a[i][1]] += (a[i][0]+1) // 2\r\n \r\nw -= sum(tea)\r\ni = n-1\r\n \r\nwhile w > 0:\r\n x = min(a[i][0]-tea[a[i][1]], w)\r\n tea[a[i][1]] += x\r\n w -= x\r\n i -= 1\r\n \r\nif w < 0:\r\n print(-1)\r\nelse:\r\n print(*tea)", "import math\r\n\r\nl = input()\r\n\r\nn = int(l.split()[0])\r\nw = int(l.split()[1])\r\n\r\nl = input()\r\na = []\r\n\r\naux = 0\r\nfor i in l.split():\r\n a.append([int(i), aux])\r\n aux+=1\r\n w-=int(math.ceil(float(a[-1][0]/2)))\r\n\r\na.sort(reverse = True, key = lambda x : x[0])\r\n#print(a)\r\nif(w<0):\r\n print(-1)\r\nelse:\r\n pos = 0\r\n nxt = \" \"\r\n while(w>0 and not(pos >= n)):\r\n if(w>math.floor(float(a[pos][0]/2))):\r\n w -= int(math.floor(float(a[pos][0]/2)))\r\n else:\r\n a[pos][0] = int(math.ceil(float(a[pos][0]/2))+w)\r\n w = 0\r\n pos+=1\r\n for i in range(pos, n):\r\n a[i][0] = int(math.ceil(float(a[i][0]/2)))\r\n a.sort(key = lambda x : x[1])\r\n #print(a)\r\n nxt = \" \"\r\n for i in a:\r\n\t if i[1] == n-1:\r\n\t\t nxt = \"\"\r\n\t print(str(i[0]) + nxt, end = '')\r\n print()\r\n ", "def find(A,w):\r\n B=[(A[i],i) for i in range(len(A))]\r\n B=sorted(B)\r\n A=sorted(A)\r\n \r\n \r\n dp=[0]*len(A)\r\n dp[0]=(A[0]+1)//2\r\n w-=dp[0]\r\n for i in range(1,len(dp)):\r\n dp[i]=max(dp[i-1],(A[i]+1)//2)\r\n if dp[i]>A[i]:\r\n return [-1]\r\n w-=dp[i]\r\n \r\n if w<0:\r\n return [-1]\r\n \r\n \r\n for i in range(len(dp)-1,-1,-1):\r\n if w>0:\r\n add=min(w,A[i]-dp[i])\r\n dp[i]+=add\r\n w-=add\r\n ans=[0]*len(A)\r\n for i in range(len(B)):\r\n ans[B[i][1]]=dp[i]\r\n \r\n return ans\r\nn,w=list(map(int,input().strip().split(' ')))\r\nA=list(map(int,input().strip().split(' ')))\r\nprint(*find(A,w))\r\n ", "n,w=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nHalf=[(i+1)//2 for i in l]\r\npos=[[l[i],(l[i]+1)//2,i] for i in range(n)]\r\npos.sort(reverse=True)\r\nif w<sum(Half):\r\n print(-1)\r\n quit()\r\nextra=w-sum(Half)\r\n#print(extra)\r\nfor i in range(n):\r\n if extra>0:\r\n rem=pos[i][0]-pos[i][1]\r\n if rem>=extra:\r\n Half[pos[i][2]]+=extra\r\n extra=0\r\n break\r\n else:\r\n extra-=rem\r\n Half[pos[i][2]]=pos[i][0]\r\nprint(*Half)", "import sys\r\n\r\nn, w = map(int, input().split())\r\na = sorted(((x, i) for i, x in enumerate(\r\n map(int, input().split()))), reverse=True)\r\nans = [0]*n\r\nfor x, i in a:\r\n ans[i] = (x+1) >> 1\r\nw -= sum(ans)\r\n\r\nif w < 0:\r\n print('-1')\r\n exit()\r\n\r\nfor i in range(n):\r\n x = min(w, a[i][0] - ans[a[i][1]])\r\n ans[a[i][1]] += x\r\n w -= x\r\n\r\nprint(*ans)\r\n", "from fractions import gcd\r\n# from datetime import date, timedelta\r\nfrom heapq import*\r\nimport math\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import *\r\nimport itertools\r\nimport fractions\r\n# import sys\r\n# sys.setrecursionlimit(10 ** 7)\r\nMOD = 10 ** 9 + 7\r\n# input = sys.stdin.readline\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 # if n == 1:\r\n # print(a[0])\r\n # exit()\r\n # elif n == k:\r\n # print(sum(a) / k)\r\n # exit()\r\n \r\n # ans = 0\r\n # cnt = 0\r\n # su =0\r\n # for i in range(n - k + 2):\r\n # if cnt < k - 1:\r\n # su += a[i]\r\n # cnt+=1\r\n # elif cnt == k - 1:\r\n # su += a[i]\r\n # ans += su\r\n # su-=a[i - k + 1]\r\n # print(ans/(n - k + 1))\r\n\r\n n, w = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n l = [[a[i], i] for i in range(n)]\r\n l = sorted(l , key=lambda x:x[0] , reverse=True)\r\n\r\n ans = [0] * n\r\n for i in range(n):\r\n ans[i] = (a[i] + 1) // 2\r\n # print(l , ans)\r\n if sum(ans) > w:\r\n print(-1)\r\n exit()\r\n\r\n w -= sum(ans)\r\n # print(w)\r\n for v, i in l:\r\n if w >= v - ans[i]:\r\n w -= (v - ans[i])\r\n ans[i] = a[i]\r\n else:\r\n ans[i] += w\r\n break\r\n print(*ans)\r\n \r\n\r\n \r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a = map(int, input().split())\r\nw = sorted(enumerate(map(int, input().split())), key=lambda x:-x[1])\r\n\r\nd = []\r\nc = 0\r\nfor i, j in w:\r\n b = j//2 + j%2\r\n c += b\r\n d.append(b)\r\n\r\nif c > a:\r\n print(-1)\r\n exit(0)\r\n\r\na -= c\r\ni = 0\r\nwhile a:\r\n b = min(a, w[i][1] // 2)\r\n d[i] += b\r\n a -= b\r\n i += 1\r\n\r\ne = [0]*n\r\nfor i in range(n):\r\n e[w[i][0]] = d[i]\r\n\r\nprint(' '.join(map(str, e)))\r\n", "# LUOGU_RID: 119905439\nn, w = map(int, input().split())\na = list(map(int, input().split()))\nb = [0] * (n + 1)\nmark = [0] * (n + 1)\n\ncnt = 0\nfor i in range(1, n + 1):\n if a[i - 1] % 2 == 1:\n cnt += (a[i - 1] + 1) // 2\n b[i] = (a[i - 1] + 1) // 2\n else:\n cnt += a[i - 1] // 2\n b[i] = a[i - 1] // 2\n\nif cnt > w:\n print(\"-1\")\nelse:\n w -= cnt\n\n while w:\n big = -1\n t = -1\n\n for i in range(1, n + 1):\n if not mark[i] and a[i - 1] > big:\n big = a[i - 1]\n t = i\n\n mark[t] = 1\n\n if w > a[t - 1] - b[t]:\n w -= a[t - 1] - b[t]\n b[t] = a[t - 1]\n else:\n b[t] += w\n w = 0\n\n for i in range(1, n + 1):\n print(b[i], end=\" \")\n", "desc = input().split()\nnum = int(desc[0])\nw = int(desc[1])\ncups = list(map(int, input().split()))\nhalfsums = 0\nresmilk = []\nmaxel = cups[0]\nmaxin = 0\nmaxls = []\nfor i in range(num):\n if cups[i] > maxel:\n maxel = cups[i]\n maxin = i\n if cups[i] % 2 == 0:\n thiscup = cups[i]//2\n else:\n thiscup = (cups[i]//2) + 1\n halfsums += thiscup\n resmilk.append(thiscup)\n\nif halfsums > w:\n print(-1)\nelse:\n while(halfsums != w):\n if cups[maxin] - resmilk[maxin] < w - halfsums:\n halfsums += cups[maxin] - resmilk[maxin]\n resmilk[maxin] = cups[maxin]\n maxls.append(maxin)\n for i in range(num):\n if i not in maxls:\n maxin = i\n maxel = cups[i]\n break\n for i in range(num):\n if i not in maxls and cups[i] > maxel:\n maxin = i\n maxel = cups[i]\n else:\n resmilk[maxin] += w - halfsums\n halfsums = w\n for e in resmilk:\n print(e, end=' ')\n", "n, w = map(int, input().split())\r\ncup = list(map(int, input().split()))\r\nncup = []\r\nfor i, c in enumerate(cup):\r\n\tncup.append([c, i])\r\nncup.sort()\r\ntea = []\r\nfor c, i in ncup:\r\n\tt = c//2 if c%2==0 else c//2+1\r\n\tw -= t\r\n\ttea.append([t, i])\r\n\r\nfor i in range(len(ncup)-1, -1, -1):\r\n\tif w < 0: break\r\n\tadd = min(w, ncup[i][0] - tea[i][0])\r\n\tw -= add\r\n\ttea[i][0] += add\r\n\r\nif w != 0:\r\n\tprint(-1)\r\nelse:\r\n\ttea.sort(key=lambda a: a[1])\r\n\tfor t, i in tea:\r\n\t\tprint(t, end=' ')\r\n\r\nprint()\r\n\r\n# input('Press any key to continue...')\r\n", "from sys import stdin\r\nimport math\r\ninput = stdin.readline\r\n# ~ T = int(input())\r\nT = 1\r\nfor t in range(1,T + 1):\r\n\tn,k = map(int,input().split())\r\n\t_input = list(map(int,input().split()))\r\n\tidx = dict()\r\n\tsum_x = 0;sum_y = 0\r\n\tans = []\r\n\tfor i in range(len(_input)):\r\n\t\tans.append(int(_input[i] / 2) if _input[i] % 2 == 0 else int(_input[i] / 2) + 1)\r\n\t\tsum_x += (int(_input[i] / 2) if _input[i] % 2 == 0 else int(_input[i] / 2) + 1)\r\n\t\tsum_y += _input[i];\r\n\t\tidx[i] = _input[i]\r\n\tif k < sum_x or k > sum_y:\r\n\t\tprint(-1)\r\n\t\texit(0)\r\n\tk -= sum_x\r\n\tsorted_idx = sorted(idx.items(),key = lambda x : x[1],reverse = True)\r\n\tfor i in range(len(sorted_idx)):\r\n\t\tdiff = sorted_idx[i][1] - ans[sorted_idx[i][0]]\r\n\t\tif diff >= k:\r\n\t\t\tans[sorted_idx[i][0]] += k\r\n\t\t\tk = 0\r\n\t\telse:\r\n\t\t\tk -= diff\r\n\t\t\tans[sorted_idx[i][0]] += diff\r\n\tfor i in ans:\r\n\t\tprint(i,end = \" \")\r\n\t\t\t\r\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0] * n\r\nP = []\r\nfor i in range(n):\r\n P.append((a[i], i))\r\nP = sorted(P, reverse=True)\r\nfor i in range(n):\r\n k = a[i] // 2 + int(a[i] % 2 != 0)\r\n b[i] += k\r\n w -= k\r\n\r\nif w < 0:\r\n print(-1)\r\n exit()\r\n\r\ni = 0\r\nwhile w > 0:\r\n k = a[P[i][1]] - b[P[i][1]]\r\n b[P[i][1]] += min(w, k)\r\n w -= min(w, k)\r\n i += 1\r\n\r\nprint(*b)", "import math\r\nn,w=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nstore={}\r\nsum_min=0\r\nans=[]\r\nflag=False\r\nfor i,item in enumerate(a):\r\n sum_min+=math.ceil(item/2)\r\n if sum_min>w:\r\n print(\"-1\")\r\n flag=True\r\n break\r\n ans.append(math.ceil(item/2))\r\n store[i]=item\r\nif not flag:\r\n store=sorted(store.items(),key=lambda kv:(kv[1],kv[0]),reverse=True)\r\n #print(store)\r\n for item in store:\r\n if sum_min<w:\r\n d=min(a[item[0]]-ans[item[0]],w-sum_min)\r\n ans[item[0]]+=d\r\n sum_min+=d\r\n else:\r\n break\r\n if sum_min<w:\r\n print(\"-1\")\r\n else:\r\n print(*ans)\r\n \r\n \r\n\r\n ", "n,w=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=[(x+1)//2 for x in a]\r\nw-=sum(ans)\r\nif w<0:\r\n print(-1)\r\n exit(0)\r\nwhile w>0:\r\n i=a.index(max(a))\r\n while w>0 and a[i]!=ans[i]:\r\n ans[i]+=1\r\n w-=1\r\n a[i]=0\r\nprint(*ans)", "n,w=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n):\r\n c.append((a[i],i))\r\nc.sort(key=lambda x:-x[0])\r\nans=[0]*n\r\nfor i in range(n):\r\n x=(a[i]+1)//2\r\n w-=x\r\n ans[i]=x\r\n\r\nif w<0:\r\n print(-1)\r\n exit()\r\n\r\nfor ai,i in c:\r\n x=min(w,ai-ans[i])\r\n w-=x\r\n ans[i]+=x\r\n\r\nprint(*ans)", "n,ch=map(int,input().split(' '))\r\nmas=list(map(int, input().split(' ') ))\r\nmas_nach=mas.copy()\r\nfor i in range(len(mas)):\r\n ch-=round(mas[i]/2+1/100)\r\n mas[i]=mas[i]//2\r\nif ch<0:\r\n print(-1)\r\n exit()\r\ndef max_and_nom(massiv):\r\n nom=0\r\n maxx=-1\r\n for i in range(len(massiv)):\r\n if massiv[i]>=maxx:\r\n maxx=massiv[i]\r\n nom=i\r\n return[maxx,nom]\r\ndef raspred_chai(mas,ch,mas_nach):\r\n for i in range(len(mas)):\r\n if mas[max_and_nom(mas_nach)[1]]>=ch:\r\n mas[max_and_nom(mas_nach)[1]]=mas[max_and_nom(mas_nach)[1]]-ch\r\n return(mas)\r\n else:\r\n ch-=mas[max_and_nom(mas_nach)[1]]\r\n mas[max_and_nom(mas_nach)[1]]=0\r\n mas_nach[max_and_nom(mas_nach)[1]]=0\r\n print(-1)\r\n exit()\r\nmas1=raspred_chai(mas,ch,mas_nach.copy())\r\nfor i in range(len(mas_nach)):\r\n mas_nach[i]=mas_nach[i]-mas1[i]\r\nprint(*mas_nach)", "n,w=map(int,input().split())\r\na=input().split()\r\na=[(int(a[i]), i) for i in range(n)]\r\na.sort()\r\no=[0]*n\r\nfor i in range(n):\r\n x=(a[i][0]+1)//2\r\n w-=x\r\n o[a[i][1]]+=x\r\n if w<0:print(-1);exit()\r\nj=n-1\r\nwhile j>=0 and w>0:\r\n x=min(a[j][0]-o[a[j][1]],w)\r\n w-=x\r\n o[a[j][1]]+=x\r\n j-=1\r\nif w!=0:print(-1);exit()\r\nprint(' '.join(map(str, o)))", "import math\r\n\r\nn,w = map(int,input().split())\r\nb = [i for i in range(n)]\r\na,b = zip(*sorted(zip(list(map(int,input().split())),b),reverse=True))\r\n\r\ncontents = [math.ceil(a[i]/2) for i in range(len(a))]\r\n\r\ndef outp(l: list):\r\n q = []\r\n q,l = zip(*sorted(zip(b,l)))\r\n print(' '.join(map(str,l)))\r\n\r\nif sum(contents) == w:\r\n outp(contents)\r\n exit()\r\nelif sum(contents) > w:\r\n print(-1)\r\n exit()\r\n\r\nrem = w - sum(contents)\r\nfor i,e in enumerate(contents):\r\n if e+rem > a[i]:\r\n rem -= (a[i] - e)\r\n contents[i] = a[i]\r\n else:\r\n contents[i] += rem\r\n break\r\n\r\noutp(contents)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\nw0 = 0\r\nfor i in a:\r\n w0 += (i + 1) // 2\r\nif w < w0:\r\n ans = [-1]\r\nelse:\r\n b = [[a[i], i] for i in range(n)]\r\n b.sort(reverse = True)\r\n b.append([0, -1])\r\n c = []\r\n for ai, i, in b:\r\n c.append(ai)\r\n s = sum(a)\r\n for _ in range(s - w):\r\n for i in range(n):\r\n if c[i] > c[i + 1] and 2 * (c[i] - 1) >= b[i][0]:\r\n c[i] -= 1\r\n break\r\n ans = [0] * n\r\n for i in range(n):\r\n ans[b[i][1]] = c[i]\r\nprint(*ans)", "from collections import deque\r\nimport math\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nq=deque()\r\nv=[False]*n\r\nfor i in range(n):\r\n var=int(math.ceil(arr[i]/2))\r\n if k>=var:\r\n q.append(var)\r\n k-=var\r\n else:\r\n print(-1)\r\n exit()\r\n#print(q)\r\nfor _ in range(n):\r\n m=0\r\n ind=0\r\n for i in range(n):\r\n if v[i]==True:\r\n continue\r\n else:\r\n if arr[i]>m:\r\n ind=i\r\n m = max(m, arr[i])\r\n v[ind] = True\r\n if k>=(arr[ind]-q[ind]):\r\n k-=arr[ind]-q[ind]\r\n q[ind]=arr[ind]\r\n\r\n #print(q)\r\n else:\r\n q[ind]+=k\r\n print(*q)\r\n exit()\r\nprint(*q)\r\n\r\n\r\n\r\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [x + 1 >> 1 for x in a]\r\nw -= sum(b)\r\nif w < 0:\r\n print(-1)\r\nelse:\r\n for i in sorted(range(n), key=lambda i: -a[i]):\r\n p = min(w, a[i] - b[i])\r\n b[i] += p\r\n w -= p\r\n if w <= 0:\r\n break\r\n print(*b)", "n,w = map(int,input().split())\nA = list(map(int,input().split()))\n\norder = sorted(range(n), key=lambda i:A[i])\n\nA = list(map(lambda p:A[p], order))\n\nuse = [0 for _ in range(n)]\nfor i in range(n):\n use[i] = (A[i] + 1) // 2\n w -= use[i]\n\nif w < 0:\n print(-1)\n exit()\n\nfor i in range(n)[::-1]:\n add = min(w, A[i] - use[i])\n w -= add\n use[i] += add\n\nif w > 0:\n print(-1)\n exit()\n\nans = [0] * n\nfor i in range(n):\n ans[order[i]] = use[i]\n\nfor i in range(n):\n if i > 0:\n print(\" \",end='')\n print(ans[i],end='')\nprint()\n", "from math import*\r\nn,w=map(int,input().split())\r\nmas=list(map(int,input().split()))\r\nmas2=[]\r\nsu=0\r\nfor i in range(n):\r\n su+=ceil(mas[i]/2)\r\n mas2.append([ceil(mas[i]/2),mas[i],i])\r\nif su>w:\r\n print(-1)\r\n exit()\r\nelse:\r\n mas2.sort()\r\n ost=w-su\r\n x=len(mas2)-1\r\n while ost>0:\r\n while ost>0 and mas2[x][0]<mas2[x][1]:\r\n ost-=1\r\n mas2[x][0]+=1\r\n x-=1\r\nans=[0]*n\r\nfor i in range(n):\r\n ans[mas2[i][2]]=mas2[i][0]\r\nprint(*ans)\r\n", "n, w = [int(inp) for inp in input().split()]\r\ncap = [int(a) for a in input().split(\" \")]\r\nval = [0] * n\r\n\r\nfor i in range(n):\r\n cap[i] = (cap[i], i)\r\n\r\ncap.sort()\r\ncap.reverse()\r\n\r\nfor i in range(n):\r\n val[i] = cap[i][0]//2 + int(cap[i][0] % 2 != 0)\r\n w -= val[i]\r\n\r\nif w < 0:\r\n print(-1)\r\n exit()\r\n\r\nfor i in range(n):\r\n v = min(w, cap[i][0] - val[i])\r\n val[i] += v\r\n w -= v\r\n\r\nres = [0] * n\r\nfor i in range(n):\r\n res[cap[i][1]] = val[i]\r\n\r\nfor r in res:\r\n print(r, end=\" \")\r\n", "def read_int():\r\n numbers = [int(x) for x in input().split()]\r\n return numbers\r\n\r\ndef main():\r\n n, w = read_int()\r\n a = read_int()\r\n b = []\r\n for i, v in enumerate(a):\r\n b.append({\r\n 'index': i,\r\n 'v': v\r\n })\r\n\r\n b = sorted(b, key=lambda item: item['v'], reverse=True)\r\n\r\n for i in b:\r\n v = (i['v'] + 1) // 2\r\n w -= v\r\n\r\n if w < 0:\r\n print(-1)\r\n return\r\n \r\n for i in b:\r\n v = (i['v'] + 1) // 2\r\n if w > 0:\r\n if i['v'] - v <= w:\r\n w -= i['v'] - v\r\n else:\r\n i['v'] = v + w\r\n w = 0\r\n else:\r\n i['v'] = v\r\n \r\n b = sorted(b, key=lambda item: item['index'])\r\n print(' '.join([str(i['v']) for i in b]))\r\n\r\nif __name__ == '__main__':\r\n main()", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor i in a:\r\n s += (i+1)//2\r\nif s > w:\r\n print(-1)\r\nelse:\r\n ml = []\r\n diff = sum(a)-w\r\n j = 1\r\n for i in a:\r\n ml.append([i, j])\r\n j += 1\r\n ml.sort()\r\n f = 0\r\n while diff > 0:\r\n for i in ml:\r\n minq = (i[0]+1)//2\r\n curr = i[0]\r\n sub = min(diff, curr-minq)\r\n i[0] -= sub\r\n diff -= sub\r\n if diff <= 0:\r\n f = 1\r\n break\r\n if f == 1:\r\n break\r\n ml.sort(key=lambda x: x[1])\r\n for k in ml:\r\n print(k[0], end=\" \")\r\n", "import math\r\nn, w = map(int, input().split())\r\nvolumes = []\r\npossible = True\r\nteacups = [0] * n\r\nvals = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n poured = math.ceil(vals[i] / 2)\r\n w -= poured\r\n\r\n if w < 0:\r\n possible = False\r\n break\r\n\r\n volumes.append((vals[i], i))\r\n teacups[i] = poured\r\n\r\nif not possible:\r\n print(-1)\r\nelse:\r\n svolumes = sorted(volumes, reverse=True)\r\n\r\n for j in svolumes:\r\n extra = j[0] - teacups[volumes.index(j)]\r\n if w - extra < 0:\r\n teacups[j[1]] += w\r\n break\r\n\r\n w -= extra\r\n teacups[j[1]] += extra\r\n\r\n print(' '.join(str(t) for t in teacups))\r\n", "n,w = map(int,input().split())\r\narr = [int(x) for x in input().split()]\r\narr2 = [(x+1)//2 for x in arr]\r\ns = sum(arr2)\r\nif w < s :\r\n\tprint(-1)\r\nelse:\r\n\tw -= s\r\n\twhile w>0:\r\n\t\tm = max(arr)\r\n\t\tv = arr.index(m)\r\n\t\twhile arr2[v]<arr[v] and w>0:\r\n\t\t\tarr2[v] += 1\r\n\t\t\tw -= 1\r\n\t\tarr[v] = -1\r\n\tfor i in range(n):\r\n\t\tprint(arr2[i],end=' ')", "import math\nn,w = map(int,input().split())\nA = list(map(int, input().split()))\n\n\nB = [0]*n\nsm = 0\nfor i in range(n):\n\tsu = int(math.ceil(A[i]/2))\n\tB[i] = (A[i],i,su)\n\tsm += su\nif sm>w:\n\tprint (\"-1\")\nelse:\n\trem = w-sm\n\tB = sorted(B,reverse=True)\n\tC = [0]*n\n\tfor x in B:\n\t\tl = x[0]-x[2]\n\t\tif l<=rem:\n\t\t\tC[x[1]] = l+x[2]\n\t\t\trem -= l\n\t\telse:\n\t\t\tC[x[1]] = rem+x[2]\n\t\t\trem = 0\n\tans = \"\"\n\tfor i in range(n):\n\t\tans += str(C[i])+\" \"\n\tprint (ans)\n\n\n", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nfrom math import ceil\n\ndef solve(n, w, a):\n res = [0] * n\n\n for i, ai in enumerate(a):\n if ai & 1:\n v = int(ceil(ai / 2))\n else:\n v = ai // 2\n \n if v <= w:\n res[i] = v\n w -= v\n else:\n return []\n \n for i, ai in enumerate(a):\n for j, aj in enumerate(a):\n if i == j or ai <= aj:\n continue\n\n # ai > aj\n if res[i] < res[j]:\n v = res[j] - res[i]\n if v <= w:\n res[i] += v\n w -= v\n else:\n return []\n if w == 0:\n return res\n\n res_sort = sorted([(r, i) for i, r in enumerate(a)], reverse=True)\n\n for cur, idx in res_sort:\n v = min(w, a[idx] - res[idx])\n res[idx] += v\n w -= v\n\n if w == 0:\n return res\n else:\n return []\n\n\n\nn, w = map(int, input().split())\na = list(map(int, input().split()))\n\nres = solve(n, w, a)\nif res:\n print(*res)\nelse:\n print(-1)\n", "from sys import exit\r\nn, w = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n a[i] = (a[i], i)\r\na.sort(reverse=True)\r\nch = [0] * n\r\nfor i in range(n):\r\n ch[a[i][1]] = (a[i][0] + 1) // 2\r\n w -= ch[a[i][1]]\r\n if w < 0:\r\n print(-1)\r\n exit(0)\r\n \r\nfor i in range(n):\r\n if w > 0:\r\n add = min(w, a[i][0] - ch[a[i][1]])\r\n ch[a[i][1]] += add\r\n w -= add\r\n \r\nprint(*ch)\r\n \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\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nfrom queue import PriorityQueue as pq\r\nn,w=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=[0]*n\r\nf=1\r\nfor i in range(n):\r\n t=math.ceil(l[i]/2)\r\n if t>w:\r\n f=0\r\n break\r\n s[i]+=t\r\n w-=t\r\nif f==0:\r\n print(-1)\r\nelif w==0:\r\n print(*s)\r\nelse:\r\n x=dc(list)\r\n for i in range(n):\r\n x[l[i]].append(i)\r\n p=sorted(set(l),reverse=True)\r\n n=len(p)\r\n i=0\r\n while(i<n and w>0):\r\n for j in x[p[i]]:\r\n if w<=0:\r\n break\r\n t=min(w,l[j]-s[j])\r\n s[j]+=t\r\n w-=t\r\n i+=1\r\n print(*s)\r\n ", "#!/usr/bin/env python3\n\nimport copy\n\ndef f(n, w, L):\n D = dict()\n count = 0\n for i in range(n):\n D[i] = -1 * ((-1 * L[i]) // 2)\n count += D[i]\n if count > w:\n return -1\n\n E = dict() # sorted to unsorted\n M = copy.deepcopy(L)\n M.sort()\n N = copy.deepcopy(L)\n\n j = n - 1\n while j > -1:\n m = max(N)\n i = N.index(m)\n E[j] = i\n N[i] = -1\n j -= 1\n remaining = w - count\n k = n - 1\n while remaining > 0:\n i = E[k]\n diff = L[i] - D[i]\n if remaining >= diff:\n D[i] = L[i]\n else:\n D[i] += remaining\n\n remaining -= diff\n k -= 1\n s = \"\"\n for i in range(n):\n s += str(D[i]) + ' '\n return s\n\n\n\ndef run():\n i = 0\n for line in iter(input, ''):\n if i == 0:\n a = line.split(' ')\n n, w = int(a[0]), int(a[1])\n else:\n line = line.split(' ')\n L = list(map(int, line))\n break\n i += 1\n print(f(n, w, L))\n\nrun()", "n,w=map(int,input().split())\r\nsizes=list(map(int,input().split()))\r\n\r\nres = [(s+1)//2 for s in sizes]\r\nthreshold = sum(res)\r\nif threshold > w:\r\n\tprint(-1)\r\nelse:\r\n\tindices = sorted(range(n),key=sizes.__getitem__,reverse=True)\r\n\tw -= threshold\r\n\tfor i in indices:\r\n\t\ttransferendum = min(w,sizes[i]-res[i])\r\n\t\tres[i],w = res[i]+transferendum, w-transferendum\r\n\t\tif w == 0:\r\n\t\t\tbreak\r\n\tprint(*res)", "import math\r\nn,w=map(int,input().split())\r\nvol=list(map(int,input().split()))\r\nmyList=[]\r\nfor j in range(0,len(vol)):\r\n myList.append(math.ceil(vol[j]/2))\r\nif w<sum(myList):\r\n print(-1)\r\nelse:\r\n num=w-sum(myList)\r\n while(num>0):\r\n con=vol.index(max(vol))\r\n while myList[con]<vol[con] and num>0:\r\n myList[con]+=1\r\n num-=1\r\n vol[con]-=1\r\n for t in myList:\r\n print(t,end=\" \")", "n, w = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = []\r\nfor i, a in enumerate(A):\r\n B.append((a, i))\r\nB.sort(key=lambda x: x[0])\r\nm = 0\r\nans = [0]*n\r\nfor a, i in B:\r\n ans[i] = (a+1)//2\r\n m += (a+1)//2\r\nif m > w:\r\n print(-1)\r\n exit()\r\nr = w-m\r\nfor j in reversed(range(n)):\r\n if r == 0:\r\n break\r\n a, i = B[j]\r\n if a-ans[i] <= r:\r\n r -= a-ans[i]\r\n ans[i] = a\r\n else:\r\n ans[i] += r\r\n r = 0\r\nif r:\r\n print(-1)\r\nelse:\r\n print(*ans)\r\n", "n,w=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nans=[] \r\nsm=0 \r\nfrom math import ceil \r\nfor i in range(n):\r\n ans.append([ceil(l[i]/2),l[i],i])\r\n sm+=ans[i][0]\r\nif sm>w:\r\n print(-1)\r\nelse:\r\n ans.sort(key=lambda x:x[1],reverse=True)\r\n w=w-sm \r\n for i in range(n):\r\n if w==0:\r\n continue \r\n if w>=(l[ans[i][2]]-ans[i][0]):\r\n w-=l[ans[i][2]]-ans[i][0]\r\n ans[i][0]+=l[ans[i][2]]-ans[i][0]\r\n else:\r\n ans[i][0]+=w \r\n w=0 \r\n ans1=[0]*n \r\n for i in range(n):\r\n ans1[ans[i][2]]=ans[i][0]\r\n print(*ans1)", "import math\r\nn, w = input().split(\" \")\r\nn = int(n)\r\nw = int(w)\r\nin_str = input().split(\" \")\r\na_list = [[i, int(in_str[i]), math.ceil(int(in_str[i])/2)] for i in range(n)]\r\nfor a in a_list:\r\n w -= a[2]\r\nif w < 0:\r\n print(-1)\r\nelse:\r\n a_list.sort(key = lambda x: x[1], reverse=True)\r\n for i in range(n):\r\n if w > (a_list[i][1] - a_list[i][2]):\r\n w -= (a_list[i][1] - a_list[i][2])\r\n a_list[i][2] = a_list[i][1]\r\n else:\r\n a_list[i][2] += w\r\n break\r\n a_list.sort(key = lambda x: x[0])\r\n print(' '.join([str(x[2]) for x in a_list]))\r\n \r\n \r\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\narr = []\r\nans = [0 for _ in range(n)]\r\n\r\nfor i in range(n):\r\n ans[i] += (a[i] + 1) // 2\r\n w -= (a[i] + 1) // 2\r\n arr.append((a[i], i))\r\n\r\nif w < 0:\r\n print(-1)\r\nelse:\r\n arr = list(reversed(sorted(arr)))\r\n for a, i in arr:\r\n d = min(w, a - ans[i])\r\n ans[i] += d\r\n w -= d\r\n print(' '.join(map(str, ans)))\r\n", "#!/usr/bin/env python3\n\n[n, w] = map(int, input().strip().split())\nais = list(map(int, input().strip().split()))\n\nni = list(range(n))\nni.sort(key=lambda i: ais[i], reverse=True)\nvis = [-((-a) // 2) for a in ais] # ceil\ns = sum(vis)\nif s > w:\n\tprint (-1)\nelse:\n\tw -= s\n\tfor i in ni:\n\t\td = ais[i] - vis[i]\n\t\td = min(d, w)\n\t\tvis[i] += d\n\t\tw -= d\n\t\tif w == 0:\n\t\t\tbreak\n\tprint (' '.join(map(str, vis)))\n", "\nn, w = map(int, input().split())\n\nA = [(int(x), i) for i, x in enumerate(input().split())]\n\nA.sort()\nA.reverse()\n\nB = [(x[0] + 1) // 2 for x in A]\n\nleft = w - sum(B)\n\nif left < 0:\n print(-1)\nelse:\n for i in range(len(B)):\n to_add = min([left, A[i][0] - B[i]])\n B[i] += to_add\n left -= to_add\n assert left == 0\n result = [-1] * n\n for i in range(len(B)):\n result[A[i][1]] = B[i]\n print(' '.join(map(str, result)))\n", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\ndef check(n):\r\n n=list(set(list(str(n))))\r\n if(len(n)==1):\r\n return True\r\n n.sort()\r\n if(n[0]=='0'):\r\n if(len(n)<=2):\r\n return True\r\n else:\r\n return False\r\n else:\r\n return False\r\nn,w=M()\r\nl=L()\r\ns=0\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n y.append((l[i],i))\r\n s+=(l[i]+1)//2\r\n x.append((l[i]+1)//2)\r\nif(w<s or w>sum(l)):\r\n print(-1)\r\nelse:\r\n y.sort(reverse=True,key=lambda x:x[0])\r\n w-=s\r\n if(w>0):\r\n i=0\r\n while(i<n and w!=0):\r\n index=y[i][1]\r\n max=y[i][0]\r\n p=max-x[index]\r\n if(w>p):\r\n w-=p\r\n x[index]+=p\r\n else:\r\n x[index]+=w\r\n w=0\r\n i+=1\r\n if(w>0):\r\n print(-1)\r\n else:\r\n print(*x)\r\n else:\r\n print(*x)\r\n \r\n \r\n", "# LUOGU_RID: 119894868\nm, n = map(int, input().split())\na = list(map(int, input().split()))\nb = [0] * (m + 1)\ns = []\n\nfor i in range(1, m + 1):\n s.append({'c': a[i - 1], 'w': i})\n if a[i - 1] % 2 == 1:\n b[i] = (a[i - 1] + 1) // 2\n else:\n b[i] = a[i - 1] // 2\n\nfl = sum(b)\n\nif fl > n:\n print(\"-1\")\nelif fl == n:\n print(*b[1:])\nelse:\n s.sort(key=lambda x: x['c'], reverse=True)\n diff = n - fl\n\n for i in range(1, m + 1):\n k = a[s[i - 1]['w'] - 1] - b[s[i - 1]['w']]\n if diff > k:\n b[s[i - 1]['w']] = a[s[i - 1]['w'] - 1]\n diff -= k\n elif 0 < diff <= k:\n b[s[i - 1]['w']] += diff\n diff = 0\n\n if diff <= 0:\n break\n\n if diff > 0:\n print(\"-1\")\n else:\n print(*b[1:])\n", "n,w = input().split()\r\nn,w = int(n),int(w)\r\nx = [int(i) for i in input().split()]\r\nneed = 0\r\nans = []\r\nfor i in range(0,n):\r\n need += (x[i]+1)//2\r\n ans.append([(x[i]+1)//2,x[i],i])\r\nif w < need:\r\n print(-1)\r\nelse:\r\n w -= need\r\n ans.sort(key = lambda x:x[1],reverse = 1)\r\n for i in range(n):\r\n now = ans[i][1] - ans[i][0]\r\n if w >= now:\r\n w -= now\r\n ans[i][0] = ans[i][1]\r\n else:\r\n ans[i][0] += w\r\n break\r\n ans.sort(key = lambda x:x[2])\r\n for i in range(n):\r\n print(ans[i][0],end = ' ')\r\n" ]

[ "n = int(input())\r\ninf = 10 ** 9 + 7\r\na = list(map(int, input().split()))\r\nst = [0 for i in range(n)]\r\nst[0] = 1\r\nfor i in range(1, n):\r\n st[i] = (st[i - 1] * 2) % inf\r\na.sort()\r\nres = 0\r\nfor i in range(n - 1):\r\n res += (a[i + 1] - a[i]) * (st[i + 1] - 1) * (st[n - i - 1] - 1)\r\n res %= inf\r\nprint(res)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nmod=1000000007\r\np=[]\r\np1=1\r\nfor i in range(n+1):\r\n p.append(p1)\r\n p1=(p1*2)%mod\r\nl=sorted([int(i) for i in input().split()])\r\ns=0\r\nfor i in range(n):\r\n s=(s+(l[i]*p[i])%mod)%mod\r\n s=(s-(l[i]*p[n-i-1])%mod)%mod\r\nprint(s)", "n = int(input())\na = sorted(list(map(int, input().split())))\nmodu = 10**9 + 7\nif n < 2:\n print(0)\nelse:\n ans = 0\n p2 = [1]\n for i in range(n):\n p2.append(2*p2[-1] % modu)\n\n for i in range(n - 1):\n ans += (a[i+1] - a[i]) * (p2[i + 1] - 1) * (p2[n - i - 1] - 1)\n ans %= modu\n print(ans)\n", "N = int(input())\r\nA = sorted(list(map(int, input().split())), reverse=True)\r\ns = 0\r\nM = 1000000007\r\n\r\nfor i in range(N):\r\n\ts += A[i] * (pow(2, N-i-1, M) - pow(2, i, M))\r\n\ts %= M\r\n\r\nprint(s)\r\n", "R, n, x, p, v = 10 ** 9 + 7, int(input()), sorted(map(int, input().split())), [1], 0\r\nfor i in range(1, n):\r\n p.append(2 * p[-1] % R)\r\nprint(sum((x[i] - x[i - 1]) * (p[i] - 1) * (p[n - i] - 1) for i in range(1, n)) % R)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nans = 0\r\nMOD = 10**9+7\r\n\r\nfor i in range(n-1):\r\n d = x[i+1]-x[i]\r\n l = pow(2, i+1, MOD)-1\r\n r = pow(2, n-i-1, MOD)-1\r\n ans += d*l*r\r\n ans %= MOD\r\n\r\nprint(ans)", "def mp(): return map(int,input().split())\r\ndef lt(): return list(map(int,input().split()))\r\ndef pt(x): print(x)\r\ndef ip(): return input()\r\ndef it(): return int(input())\r\ndef sl(x): return [t for t in x]\r\ndef spl(x): return x.split()\r\ndef aj(liste, item): liste.append(item)\r\ndef bin(x): return \"{0:b}\".format(x)\r\ndef listring(l): return ' '.join([str(x) for x in l])\r\ndef ptlist(l): print(' '.join([str(x) for x in l]))\r\nM = 1000000007\r\nn = it()\r\nx = lt()\r\nexpp = 1\r\nx.sort()\r\nm = 0\r\nfor i in range(n):\r\n m += ((expp-1)*x[i] % M)\r\n m -= ((expp-1)*x[n-i-1] % M)\r\n m += M\r\n m %= M\r\n expp *=2\r\n expp %=M\r\npt(m)\r\n ", "def main():\r\n \r\n largemodulus = 1000000007\r\n maxofn = 300001\r\n n = 0\r\n answer = 0\r\n \r\n powersoftwo = []\r\n multiplier = 1\r\n \r\n for _ in range(maxofn):\r\n powersoftwo.append(multiplier)\r\n if multiplier >= largemodulus:\r\n multiplier = multiplier % largemodulus\r\n multiplier *= 2\r\n \r\n n = int(input())\r\n \r\n hacked = [int(i) for i in input().split()]\r\n \r\n hacked.sort(reverse = True)\r\n \r\n for x in range(n):\r\n answer += (hacked[x] * ((powersoftwo[n-1-x]-1)-(powersoftwo[x]-1))) % largemodulus\r\n if answer >= largemodulus:\r\n answer = answer % largemodulus\r\n \r\n \r\n print(answer)\r\n \r\n return\r\n\r\nmain()", "import sys\r\n\r\nmod = 10**9 + 7\r\n\r\ndef solve():\r\n n = int(input())\r\n x = [int(i) for i in input().split()]\r\n x.sort()\r\n\r\n ans = 0\r\n\r\n p2 = [1] * (n + 1)\r\n for i in range(n):\r\n p2[i + 1] = (p2[i] * 2) % mod\r\n\r\n for i in range(n - 1):\r\n length = x[i + 1] - x[i]\r\n\r\n ans = (ans + length * (p2[i + 1] - 1) * (p2[n - 1 - i] - 1)) % mod\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "import sys\r\nimport math\r\n\r\nMOD = int(1e9 + 7)\r\nline = lambda: map(int, input().split())\r\n\r\ndef solve():\r\n n = int(input())\r\n x = [x for x in line()]\r\n x.sort()\r\n p2 = []\r\n p2.append(1)\r\n for i in range(1, n):\r\n p2.append(p2[i - 1] * 2 % MOD)\r\n ans = 0\r\n for i in range(n):\r\n ans += x[i] * (p2[i] - p2[n - i - 1] + MOD)\r\n ans %= MOD\r\n print(ans)\r\n\r\ndef main():\r\n solve()\r\n exit(0)\r\n\r\nmain()\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nx.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans+=((pow(2,i,1000000007)-pow(2,n-i-1,1000000007))*x[i])%1000000007\r\n ans = ans%1000000007\r\nprint(ans)", "N = 10**9+7\nn = int(input())\nx = sorted(list(map(int,input().split())))\np2n = []\na = 1\nfor _ in range(n+1):\n p2n.append(a)\n a = (a*2)%N\nret = 0\nfor i in range(n-1):\n ret = (ret + (x[i+1]-x[i])*(p2n[i+1]-1)*(p2n[n-i-1]-1))%N\nprint(ret)\n", "maxn = 300005\r\nmod = 1000000007\r\nn = int(input())\r\nans, temp = 0, 0\r\na = [0] * maxn\r\nb = [0] * maxn\r\n\r\nb[0] = 1\r\nfor i in range(1, maxn):\r\n b[i] = 2 * b[i - 1]\r\n if b[i] >= mod:\r\n b[i] -= mod\r\nk = 1\r\nfor i in input().split():\r\n a[k] = int(i)\r\n k += 1\r\n\r\na[1:n + 1] = sorted(a[1:n + 1])\r\n\r\nfor i in range(1, n + 1):\r\n temp = a[i] * (b[i - 1] - b[n - i])\r\n if temp >= 0:\r\n temp %= mod\r\n else:\r\n temp *= -1\r\n temp %= mod\r\n temp = mod - temp\r\n ans += temp\r\n if ans >= mod:\r\n ans -= mod\r\nprint(ans)\r\n", "n=int(input())\nV=list(map (int,input().split()))\nV.sort()\nMod=int(1e9+7)\nSum=0\np=[1]\nfor i in range(n):\n p.append(p[i]*2%Mod)\nfor i in range(n-1):\n l=(p[i+1]+Mod-1)%Mod\n r=(p[n-i-1]-1+Mod)%Mod\n Sum=(Sum+(V[i+1]-V[i])*l*r)%Mod\nprint(int(Sum))\n", "n = int(input())\r\ncoord = [int(x) for x in input().split()]\r\ncoord = sorted(coord)\r\nmodul = 1000000007\r\nG = [0]\r\nP = [0]\r\nD = [0]\r\nfor i in range(1, n + 1):\r\n gi = (G[i - 1] * 2 + coord[i - 1]) % modul\r\n pi = (2 * P[i - 1] + 1) % modul\r\n G.append(gi)\r\n P.append(pi)\r\n\r\nfor i in range(1, n):\r\n di = (D[i - 1] + P[i] * coord[i] - G[i]) % modul\r\n D.append(di)\r\n# print(G, P, D)\r\nprint(D[n - 1])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nMOD = 10**9+7\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort(reverse=True)\r\n\r\nans = 0\r\nfor i,a in enumerate(A):\r\n ans += a*(pow(2,N-i-1,MOD)-1)\r\n ans %= MOD\r\nfor i,a in enumerate(A[::-1]):\r\n ans -= a*(pow(2,N-i-1,MOD)-1)\r\n ans %= MOD\r\n \r\nprint(ans)", "MOD = 1000000007\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nl=sorted(l)\r\nmi = 0\r\nma = 0\r\nfor i in range(n): \r\n ma = (l[n-i-1]+2*ma)%MOD\r\n # print(ma)\r\n mi = (l[i]+2*mi)%MOD\r\n # print(mi)\r\nprint((ma-mi)%MOD)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nmod=int(1e9+7)\r\nn=int(input())\r\na=input()\r\nb=list(map(int,a.strip().split()))\r\nb.sort()\r\nc=[]\r\nnext=1\r\nfor i in range(n):\r\n c.append(next)\r\n next=next*2%mod\r\nans=0\r\nfor i in range(n):\r\n ans=(ans-(b[i]*(c[n-i-1]-1))%mod+mod)%mod\r\n ans=(ans+(b[i]*(c[i]-1))%mod)%mod\r\nprint(ans)\r\n", "# Contest: Codeforces Round #415 (Div. 2) (https://codeforces.com/contest/810)\n# Problem: C: Do you want a date? (https://codeforces.com/contest/810/problem/C)\n\ndef rint():\n return int(input())\n\n\ndef rints():\n return list(map(int, input().split()))\n\n\nMOD = 10**9 + 7\nn = rint()\nx = rints()\nx.sort()\ns = 0\nfor i in range(1, n):\n s += (x[i] - x[i - 1]) * (pow(2, i, MOD) - 1) * (pow(2, n - i, MOD) - 1) % MOD\n s %= MOD\nprint(s)\n", "import sys\r\nread=lambda:sys.stdin.readline().rstrip()\r\nreadi=lambda:int(sys.stdin.readline())\r\nwriteln=lambda x:sys.stdout.write(str(x)+\"\\n\")\r\nwrite=lambda x:sys.stdout.write(x)\r\nMOD = (10**9)+7\r\nN = readi()\r\nns = list(map(int, read().split()))\r\nns.sort()\r\ns = 0\r\npowmod = 1\r\nps = [0]*N\r\nps[0] = 1\r\nfor i in range(1,N):\r\n ps[i] = 2* ps[i-1] % MOD\r\n\r\nfor i in range(N):\r\n s += ns[i] * ps[i]\r\n s -= ns[i] * ps[-1-i]\r\n s %= MOD\r\n\r\nwriteln(s)", "mod = 10**9+7\r\n\r\nn = int(input())\r\n\r\nx = sorted(list(map(int, input().split())))\r\n\r\ntotal = 0\r\nfor i, (a, b) in enumerate(zip(x, x[1:])):\r\n\tdiff = b-a\r\n\ttotal += (pow(2,i+1,mod)-1)*(pow(2,n-i-1,mod)-1)*diff\r\n\ttotal %= mod\r\n\r\nprint(total)\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\np = 10**9+7\r\n\r\ndef power(x, y, p):\r\n b = bin(y)[2:]\r\n start = x % p\r\n answer = 1\r\n for i in range(len(b)):\r\n if b[len(b)-1-i]=='1':\r\n answer = (start*answer) % p\r\n start = (start*start) % p\r\n return answer\r\n\r\ndef process(X):\r\n n = len(X)\r\n X.sort()\r\n answer = 0\r\n for i in range(n):\r\n a1 = (power(2, i, p)-1) % p\r\n a2 = (power(2, n-i-1, p)-1) % p\r\n entry = ((a1-a2)*X[i]) % p\r\n answer = (answer+entry) % p\r\n return answer\r\n\r\nn = int(input())\r\nX = [int(x) for x in input().split()]\r\nanswer = process(X)\r\nsys.stdout.write(str(answer)+'\\n')", "n=int (input ()) \nA=list (map(int, input (). split ())) \nA=sorted (A)\nM=10**9+7\npw=[1]\nsumF, sumL=0,0\nfor i in range (n-1):\n pw. append ((2*pw[i])%M)\nfor i in range (n) :\n sumF=(sumF+A[i]*pw[n-1-i])%M\nfor i in range (n) :\n sumL=(sumL+A[i]*pw[i])%M\n\nprint ((sumL-sumF+M)%M) ", "N = int(3e5+3)\r\nMOD = int(1e9+7)\r\npow2 = [1] * N\r\nfor i in range(1, N):\r\n pow2[i] = pow2[i-1] * 2 % MOD\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\ndef add(x, y):\r\n return ((x % MOD + MOD) + (y % MOD + MOD) + MOD) % MOD\r\ndef substract(x, y):\r\n return ((x % MOD + MOD) - (y % MOD + MOD) + MOD) % MOD\r\ndef multiple(x, y):\r\n return ((x % MOD) * (y % MOD)) % MOD\r\n\r\nres = 0\r\nfor i in range(1, n):\r\n diff = arr[i] - arr[i-1]\r\n cnt = multiple(substract(pow2[i], 1), substract(pow2[n-i], 1))\r\n res = add(res, multiple(cnt, diff))\r\nprint(res)\r\n", "from sys import stdin\r\ninput=stdin.readline\r\nimport heapq\r\nimport string\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd, ceil, floor\r\nrandom = randint(1, 10 ** 9)\r\nclass wrapper(int):\r\n def __hash__(self):\r\n return super(wrapper, self).__hash__() ^ random\r\nn=ri()\r\na=list(rd())\r\na.sort()\r\nans=0\r\nfor i in range(n):\r\n l=i\r\n r=n-i-1\r\n ans+=a[i]*(pow(2,l,10**9+7)-1)\r\n ans%=(10**9+7)\r\n ans-=a[i]*(pow(2,r,10**9+7)-1)\r\n # print(l,r,a[i])\r\nprint(ans)\r\n", "#!/usr/bin/env python3\r\n\r\nimport sys\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(0)\r\n sys.exit()\r\n\r\nd = [int(x) for x in input().split()]\r\nd.sort()\r\nmod = 10 ** 9 + 7\r\n\r\np2 = [1 for i in range(n)]\r\np2_inv = [1 for i in range(n)]\r\np2[1] = 2\r\np2_inv[0] = pow(p2[1], mod - 2, mod)\r\np2_inv[1] = pow(p2_inv[0], 2, mod)\r\nfor i in range(2, n):\r\n p2[i] = p2[i - 1] * 2 % mod\r\n p2_inv[i] = p2_inv[i - 1] * p2_inv[0] % mod\r\n\r\np2_suf = p2[:]\r\nfor i in range(n - 2, -1, -1):\r\n p2_suf[i] += p2_suf[i + 1]\r\n if p2_suf[i] >= mod:\r\n p2_suf[i] -= mod\r\n\r\nz = [0 for i in range(n)]\r\nfor i in range(n):\r\n z[i] = d[i] * p2[i] % mod\r\n\r\nz_suf = z[:]\r\nfor i in range(n - 2, -1, -1):\r\n z_suf[i] += z_suf[i + 1]\r\n if z_suf[i] >= mod:\r\n z_suf[i] -= mod\r\n\r\nans = 0\r\nfor i in range(n - 1):\r\n # print('A={} B={} C={}'.format(z_suf[i + 1], d[i] * p2_suf[i + 1] % mod, p2_inv[i]))\r\n cur = z_suf[i + 1] - d[i] * p2_suf[i + 1] % mod\r\n if cur < 0:\r\n cur += mod\r\n cur = cur * p2_inv[i] % mod\r\n ans += cur\r\n if ans > mod:\r\n ans -= mod\r\n\r\nprint(ans)\r\n", "MOD = int(1e9 + 7)\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nl = 1; r = 0\r\nfor i in range(n):\r\n r = (r + l * arr[i]) % MOD\r\n l = l * 2 % MOD\r\nl = 1\r\nfor i in range(n - 1, -1, -1):\r\n r = (r - l * arr[i]) % MOD\r\n l = l * 2 % MOD\r\nprint(r)\r\n", "n = int(input())\r\nx = sorted(map(int, input().split()))\r\nmod = 10 ** 9 + 7\r\nans, deg = 0, 1\r\ndp = [0] * n\r\nfor i in range(1, n):\r\n deg = (deg << 1) % mod\r\n dp[i] = (2 * dp[i - 1] + (x[i] - x[i - 1]) * (deg - 1)) % mod\r\n ans = (ans + dp[i]) % mod\r\nprint(ans)", "n=int(input())\r\nli=list(map(int,input().split()))\r\nmodulo=1000000007\r\ntemp=0\r\nres=0\r\ncounter=2\r\nli.sort()\r\nfor i in range(1,n):\r\n temp=2*temp%modulo+(li[i]-li[i-1])*((counter-1)%modulo)\r\n res=(res+temp)%modulo\r\n counter=(counter<<1)%modulo\r\nprint(res)\r\n", "n = int(input())\r\narr = sorted(list(map(int, input().split())))\r\nres = 0\r\nmod = 1000000007\r\nacc = 0\r\narr = [arr[i+1] - arr[i] for i in range(n-1)]\r\nn -= 1\r\ns = sum(arr)\r\nfor i in range((n+1)//2):\r\n acc += s\r\n res += acc * pow(2, n-i-1, mod) % mod\r\n if not i*2+1 == n:\r\n res += acc * pow(2, i, mod) % mod\r\n res %= mod\r\n s -= arr[i] + arr[n-i-1]\r\nprint(res)", "n = int(input())\n\na = list(map(int,input().split()))\n\nm = 1000000007\ns = 0\n\na.sort()\n\nfor i in range(n):\n s = (s + a[i]*(pow(2,i,m) - pow(2,n-1-i,m)))%m\n\nprint(s)", "###################################################\n\nimport atexit\nimport io\nimport sys\n\n_INPUT_LINES = sys.stdin.read().splitlines()\ninput = iter(_INPUT_LINES).__next__\n_OUTPUT_BUFFER = io.StringIO()\nsys.stdout = _OUTPUT_BUFFER\n\n\[email protected]\ndef write():\n sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\n\n###################################################\n\nn = int(input())\n\na = list(map(int,input().split()))\n\nm = 1000000007\ns = 0\n\na.sort()\n\nfor i in range(n):\n s = (s + a[i]*(pow(2,i,m) - pow(2,n-1-i,m)))%m\n\nprint(s)", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\na.sort()\r\np = 10**9 + 7\r\nans = 0\r\ntwo = 1\r\nfor x in a:\r\n ans += two * x\r\n two = (two*2) % p\r\na = reversed(a)\r\ntwo = 1\r\nfor x in a:\r\n ans -= two * x\r\n two = (two*2) % p\r\nans = ans%p\r\nprint(ans)", "import sys\n\ndef solution():\n MOD = int(1e9 + 7)\n n = int( input() )\n x = list( map(int, sys.stdin.readline().split()) )\n x.sort(reverse = True)\n ac1 = [ x[0] ]\n for i in range( 1, len(x) ):\n ac1.append( ( ac1[-1] + x[i] ) % MOD )\n x = x[::-1]\n ac2 = [ x[0] ]\n for i in range( 1, len(x) ):\n ac2.append( ( ac2[-1] + x[i] ) % MOD )\n ans = 0\n lim = n // 2\n for i in range(lim):\n ans = ( ans + ( pow(2, i, MOD) * ( ac1[i] - ac2[i] + MOD ) ) % MOD ) % MOD\n if n % 2 == 0:\n lim -= 1\n for i in range(lim):\n ans = ( ans + ( pow(2, n - 2 - i, MOD) * ( ac1[i] - ac2[i] ) + MOD ) % MOD ) % MOD\n print(ans)\n\nif __name__ == '__main__':\n solution()\n", "#!/usr/bin/env python3\r\nimport sys, math, itertools, collections, bisect\r\ninput = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')\r\ninf = float('inf') ;mod = 10**9+7\r\nmans = inf ;ans = 0 ;count = 0 ;pro = 1\r\n\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\nA.sort()\r\nfor i in range(n):\r\n ans-=pow(2,n-i-1,mod)*A[i]\r\n ans+=pow(2,i,mod)*A[i]\r\nans%=mod\r\nprint(ans)", "#!/usr/bin/python3\n# Copyright (C) 2017 Sayutin Dmitry.\n#\n# This program is free software; you can redistribute it and/or\n# modify it under the terms of the GNU General Public License as\n# published by the Free Software Foundation; version 3\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program; If not, see <http://www.gnu.org/licenses/>.\n\ndef main():\n mod = 10 ** 9 + 7\n pws = [None for i in range(4 * (10 ** 5))]\n pws[0] = 1\n for i in range(1, (4 * (10 ** 5))):\n pws[i] = 2 * pws[i - 1] % mod\n \n n = int(input())\n seq = list(map(int, input().split()))\n\n seq.sort()\n \n ans = 0\n for i in range(n):\n ans += seq[i] * (pws[i] - 1)\n ans -= seq[i] * (pws[n - i - 1] - 1)\n ans = ans % mod\n print(ans)\n\nmain()\n", "import sys\r\ninput=sys.stdin.readline\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmod = 10**9+7\r\npw = [1 for i in range(n)]\r\nfor i in range(1, n):\r\n pw[i] = pw[i-1]*2%mod\r\nans = 0\r\na.sort()\r\nfor i in range(1,n):\r\n ans += ((pw[i]-1)*(pw[n-i]-1)%mod)*(a[i]-a[i-1])%mod\r\n ans %= mod\r\nprint(ans)", "#!/usr/bin/env python3\r\n\r\nimport sys\r\nfrom itertools import accumulate\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(0)\r\n sys.exit()\r\n\r\nd = [int(x) for x in input().split()]\r\nd.sort()\r\nmod = 10 ** 9 + 7\r\n\r\n\r\ndef add_mod(x, y):\r\n return (x + y) % mod\r\n\r\n\r\np2 = [1 for i in range(n)]\r\np2_inv = [1 for i in range(n)]\r\np2[1] = 2\r\np2_inv[0] = pow(p2[1], mod - 2, mod)\r\np2_inv[1] = pow(p2_inv[0], 2, mod)\r\nfor i in range(2, n):\r\n p2[i] = p2[i - 1] * 2 % mod\r\n p2_inv[i] = p2_inv[i - 1] * p2_inv[0] % mod\r\n\r\np2_suf = list(accumulate(reversed(p2), func=add_mod))\r\np2_suf.reverse()\r\n\r\nz_suf = list(accumulate(reversed([d[i] * p2[i] for i in range(n)]), func=add_mod))\r\nz_suf.reverse()\r\n\r\n\r\nans = 0\r\nfor i in range(n - 1):\r\n cur = z_suf[i + 1] - d[i] * p2_suf[i + 1] % mod\r\n if cur < 0: cur += mod\r\n cur = cur * p2_inv[i] % mod\r\n ans += cur\r\n if ans > mod: ans -= mod\r\n\r\nprint(ans)\r\n" ]

[ "num = input()\r\nansw = int(\"\".join((num[i] for i in [0,2,4,3,1])))\r\nansw = str(answ**5)\r\nprint(answ[-5:])# 1698156355.2098389", "n=str(input())\r\ns=n[0]+n[2]+n[4]+n[3]+n[1]\r\ni=int(s)\r\ni=i**5\r\na=str(i)\r\nprint(a[-5:])\r\n", "so=input(); print(str(int(so[0] + so[2] + so[4] + so[3] + so[1])**5)[-5:])", "n = input()\r\nn1 = int(n[0] + n[2] + n[4] + n[3] + n[1])\r\nans = str(n1 ** 5 % 100000)\r\nprint('0' * (5 - len(ans)) + ans)", "stri = input()\r\n\r\nn = int(stri[0])*10000 + int(stri[2])*1000 + int(stri[4])*100 + int(stri[3])*10 + int(stri[1])*1\r\n\r\nm = n**5\r\n\r\nstring_num = str(m)\r\n\r\nzeroes = 0 if len(string_num)>=5 else 5-len(string_num)\r\nfor i in range(zeroes):\r\n print(0, end='')\r\n\r\nprint(string_num[-5:])\r\n\r\n", "s=input()\r\nprint(str(int(s[::2]+s[3::-2])**5)[-5:])", "n = input()\r\nx = n[0]+n[2]+n[4]+n[3]+n[1]\r\nprint(str((int(x)**5)%(10**5)+10**5)[1:])", "s=input()\r\ns=int(s[0]+s[2]+s[4]+s[3]+s[1])\r\nprint(str(s**5)[-5:])", "n = input()\r\ncoded = str(int(n[0] + n[2] + n[4] + n[3] + n[1]) ** 5)\r\nprint(coded[len(coded) - 5:])\r\n", "s=input()\r\ns1=s[0]+s[2]+s[4]+s[3]+s[1]\r\nn=int(s1)\r\nans=pow(n,5)\r\nn1=str(ans)\r\nprint(n1[-5:])\r\n", "s = input()\r\nprint(\"{0:05}\".format(int(int(s[0] + s[2] + s[4] + s[3] + s[1]) ** 5) % 100000))" ]

[ "def SA_IS(S):\r\n S += [0]\r\n k = max(S) + 1\r\n n = len(S)\r\n\r\n def induce_l(sa, a, n, k, stype):\r\n bucket = get_buckets(a, k, 1)\r\n for i in range(n):\r\n j = sa[i] - 1\r\n if j >= 0 and (not stype[j]):\r\n sa[bucket[a[j]]] = j\r\n bucket[a[j]] += 1\r\n\r\n def induce_s(sa, a, n, k, stype):\r\n bucket = get_buckets(a, k, 0)\r\n for i in range(n)[::-1]:\r\n j = sa[i] - 1\r\n if j >= 0 and stype[j]:\r\n bucket[a[j]] -= 1\r\n sa[bucket[a[j]]] = j\r\n\r\n def get_buckets(a, k, start=0):\r\n bucket = [0] * k\r\n for item in a:\r\n bucket[item] += 1\r\n s = 0\r\n for i in range(k):\r\n s += bucket[i]\r\n bucket[i] = s - (bucket[i] if start else 0)\r\n return bucket\r\n\r\n def set_lms(a, n, k, default_order):\r\n bucket = get_buckets(a, k)\r\n sa = [-1] * n\r\n for i in default_order[::-1]:\r\n bucket[a[i]] -= 1\r\n sa[bucket[a[i]]] = i\r\n return sa\r\n\r\n def induce(a, n, k, stype, default_order):\r\n sa = set_lms(a, n, k, default_order)\r\n induce_l(sa, a, n, k, stype)\r\n induce_s(sa, a, n, k, stype)\r\n return sa\r\n\r\n def rename_LMS_substring(sa, a, n, stype, LMS, l):\r\n sa = [_s for _s in sa if LMS[_s]]\r\n tmp = [-1] * (n // 2) + [0]\r\n dupl = 0\r\n for t in range(1, l):\r\n i, j = sa[t - 1], sa[t]\r\n for ii in range(n):\r\n if a[i + ii] != a[j + ii] or stype[i + ii] != stype[j + ii]:\r\n break\r\n if ii and (LMS[i + ii] or LMS[j + ii]):\r\n dupl += 1\r\n break\r\n tmp[j // 2] = t - dupl\r\n tmp = [t for t in tmp if t >= 0]\r\n return tmp, dupl\r\n\r\n def calc(a, n, k):\r\n stype = [1] * n\r\n for i in range(n - 1)[::-1]:\r\n if a[i] > a[i + 1] or (a[i] == a[i + 1] and stype[i + 1] == 0):\r\n stype[i] = 0\r\n\r\n LMS = [1 if stype[i] and not stype[i - 1] else 0 for i in range(n - 1)] + [1]\r\n l = sum(LMS)\r\n lms = [i for i in range(n) if LMS[i]]\r\n sa = induce(a, n, k, stype, lms)\r\n renamed_LMS, dupl = rename_LMS_substring(sa, a, n, stype, LMS, l)\r\n\r\n if dupl:\r\n sub_sa = calc(renamed_LMS, l, l - dupl)\r\n else:\r\n sub_sa = [0] * l\r\n for i in range(l):\r\n sub_sa[renamed_LMS[i]] = i\r\n\r\n lms = [lms[sub_sa[i]] for i in range(l)]\r\n sa = induce(a, n, k, stype, lms)\r\n return sa\r\n\r\n sa = calc(S, n, k)\r\n S.pop()\r\n return sa\r\n\r\n\r\ndef LCP(s, n, sa):\r\n lcp = [-1] * (n + 1)\r\n rank = [0] * (n + 1)\r\n for i in range(n + 1):\r\n rank[sa[i]] = i\r\n\r\n h = 0\r\n lcp[0] = 0\r\n for i in range(n):\r\n j = sa[rank[i] - 1]\r\n if h > 0:\r\n h -= 1\r\n while j + h < n and i + h < n and s[j + h] == s[i + h]:\r\n h += 1\r\n lcp[rank[i] - 1] = h\r\n return lcp\r\n\r\n\r\nclass SparseTable:\r\n def __init__(self, A, op):\r\n self.n = len(A)\r\n logn = (self.n - 1).bit_length()\r\n self.logn = logn\r\n if self.n == 1:\r\n logn = 1\r\n self.op = op\r\n self.table = [None] * (self.n * logn)\r\n for i in range(self.n):\r\n self.table[i] = A[i]\r\n for i in range(1, logn):\r\n ma = self.n - (1 << i) + 1\r\n d = 1 << (i - 1)\r\n for j in range(ma):\r\n self.table[i * self.n + j] = op(self.table[(i - 1) * self.n + j], self.table[(i - 1) * self.n + j + d])\r\n\r\n def prod(self, l, r):\r\n if l == r:\r\n return 1 << 30\r\n d = r - l\r\n if d == 1:\r\n return self.table[l]\r\n logn = (d - 1).bit_length() - 1\r\n return self.op(self.table[logn * self.n + l], self.table[logn * self.n + r - (1 << logn)])\r\n\r\n\r\nn = int(input())\r\nS = []\r\nle = []\r\nkl = []\r\nfor i in range(n):\r\n T = input()\r\n le.append(len(T))\r\n for j, t in enumerate(T):\r\n kl.append((i, j))\r\n S.append(ord(t) - 90)\r\n S.append(1)\r\n kl.append((-1, -1))\r\n\r\nsa = SA_IS(S)\r\nlcp = LCP(S, len(S), sa)\r\n\r\nC = list(map(int, input().split())) + [0]\r\ncum = [0]\r\nfor s in sa[1:]:\r\n k, l = kl[s]\r\n cum.append(cum[-1] + C[k])\r\n\r\nl = 1\r\nwhile S[sa[l]] == 1:\r\n l += 1\r\nst = SparseTable(lcp, min)\r\ndist = 0\r\ntot = 0\r\n\r\nans = 0\r\nwhile l < len(sa):\r\n kk, ll = kl[sa[l]]\r\n r = l\r\n nd = 1 << 30\r\n for i in range(st.logn - 1, -1, -1):\r\n v = st.table[i * st.n + r]\r\n if v is not None and v > dist:\r\n nd = min(nd, v)\r\n r += 1 << i\r\n nd = min(nd, le[kk] - ll)\r\n if dist == nd:\r\n dist = min(dist, lcp[l])\r\n l += 1\r\n continue\r\n\r\n ans = max(ans, nd * (cum[r] - cum[l - 1]))\r\n ntot = tot + (r - l + 1) * (nd - dist)\r\n tot = ntot\r\n dist = nd\r\nprint(ans)\r\n" ]

[ "class DisjointSet:\r\n\r\n def __init__(self, n):\r\n self.array = [-1] * n\r\n\r\n def union(self, x, y):\r\n rx, ry = self.find(x), self.find(y)\r\n if rx == ry:\r\n return False\r\n if self.array[rx] < self.array[ry]:\r\n self.array[ry] = rx\r\n elif self.array[rx] > self.array[ry]:\r\n self.array[rx] = ry\r\n else:\r\n self.array[ry] = rx\r\n self.array[rx] -= 1\r\n return True\r\n\r\n def find(self, x):\r\n if self.array[x] < 0:\r\n return x\r\n self.array[x] = self.find(self.array[x])\r\n return self.array[x]\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n degree = [0] * (n + 1)\r\n disjoint_set = DisjointSet(n + 1)\r\n cycles = 0\r\n for _i in range(m):\r\n u, v = map(int, input().split())\r\n degree[u] += 1\r\n degree[v] += 1\r\n if degree[u] > 2 or degree[v] > 2:\r\n print('NO')\r\n return\r\n if not disjoint_set.union(u, v):\r\n cycles += 1\r\n if cycles > 1:\r\n print('NO')\r\n return\r\n if cycles == 1:\r\n if m == n:\r\n print('YES\\n0')\r\n else:\r\n print('NO')\r\n return\r\n print('YES')\r\n print(n - m)\r\n if n == 1:\r\n print(1, 1)\r\n return\r\n for u in range(1, n):\r\n if degree[u] == 2:\r\n continue\r\n for v in range(u + 1, n + 1):\r\n if degree[v] == 2:\r\n continue\r\n if disjoint_set.find(u) != disjoint_set.find(v):\r\n disjoint_set.union(u, v)\r\n print(u, v)\r\n degree[u] += 1\r\n degree[v] += 1\r\n if degree[u] == 2:\r\n break\r\n for u in range(1, n):\r\n if degree[u] == 2:\r\n continue\r\n for v in range(u + 1, n + 1):\r\n if degree[v] == 2:\r\n continue\r\n print(u, v)\r\n\r\n\r\nsolve()\r\n", "\nclass Edge(object):\n def __init__(self, u, v, id=0, w=0):\n self.u = u\n self.v = v\n self.id = id\n self.w = w\n\n\nclass UDGraph(object):\n def __init__(self, n, m):\n self.n = n\n self.m = m\n self.graph = [[] for i in range(n+1)]\n self.cc = [i for i in range(n+1)]\n self.cc_num = 0\n self.back_refs = {}\n self.degree = None\n\n def _dfs(self, u, vis):\n for e in self.graph[u]:\n if vis[e.v] < 0:\n vis[e.v], self.cc[e.v] = e.id, self.cc_num\n self._dfs(e.v, vis)\n else:\n if e.id != vis[u]:\n self.back_refs[e.id] = e\n\n def add_edge(self, u, v, id):\n e1 = Edge(u, v, id, 0)\n self.graph[u].append(e1)\n e2 = Edge(v, u, id, 0)\n self.graph[v].append(e2)\n\n def get_cc(self):\n if self.cc_num <= 0:\n vis = [-1 for i in range(self.n+1)]\n for i in range(1, self.n+1):\n if vis[i] < 0:\n self.cc_num += 1\n vis[i], self.cc[i] = 0, self.cc_num\n self._dfs(i, vis)\n\n return self.cc.copy(), self.cc_num\n\n def get_degree(self):\n if not self.degree:\n self.degree = [0] * (self.n+1)\n for u in range(1, self.n+1):\n s = set()\n for e in self.graph[u]:\n if e.v != u:\n s.add(e.v)\n self.degree[u] = len(s)\n return self.degree.copy()\n\n def has_point_loop(self):\n for i in range(1, self.n+1):\n for e in self.graph[i]:\n if i == e.v:\n return True\n return False\n\n def has_edge_loop(self):\n self.get_cc()\n return len(self.back_refs) > 0\n\n def has_loop(self):\n return self.has_point_loop() or self.has_edge_loop()\n\n def has_repeating_edge(self):\n for u in range(1, self.n+1):\n s = set()\n for e in self.graph[u]:\n if e.v not in s:\n s.add(e.v)\n else:\n return True\n return False\n\n\ndef input_data():\n n, m = list(map(int, input().strip().split()))\n g = UDGraph(n, m)\n\n for i in range(m):\n a, b = list(map(int, input().strip().split()))\n g.add_edge(a, b, i+1)\n\n return n, g\n\n\ndef is_funny_ring(n, degree):\n for u in range(1, n+1):\n if degree[u] != 2:\n return False\n return True\n\n\ndef check_cc(n, cc, cc_num, degree):\n for i in range(1, cc_num+1):\n d0, d1, d2, other = 0, 0, 0, 0\n for u in range(1, n+1):\n if i == cc[u]:\n if degree[u] == 0:\n d0 += 1\n elif degree[u] == 1:\n d1 += 1\n elif degree[u] == 2:\n d2 += 1\n else:\n other += 1\n if d0 > 0 and (d1 + d2 + other) <= 0:\n pass\n elif d1 == 2 and d0 <= 0 and other <= 0:\n pass\n else:\n return False\n return True\n\n\ndef form_funny_ring(n, cc, cc_num, degree):\n edges = []\n while cc_num > 1:\n a, b = 0, 0\n for i in range(1, n+1):\n if degree[i] <= 1:\n a = i\n break\n for i in range(a+1, n+1):\n if degree[i] <= 1 and cc[a] != cc[i]:\n b = i\n break\n\n edges.append((a, b))\n degree[a], degree[b] = degree[a]+1, degree[b]+1\n b_cc = cc[b]\n for i in range(1, n+1):\n if cc[i] == b_cc:\n cc[i] = cc[a]\n\n cc_num -= 1\n\n a = degree.index(1)\n b = degree.index(1, a+1)\n edges.append((a, b))\n\n print(len(edges))\n for e in edges:\n print(e[0], e[1])\n\n\ndef solve_prob(n, g):\n cc, cc_num = g.get_cc()\n degree = g.get_degree()\n if n == 1:\n if g.has_point_loop():\n if len(set([e.id for e in g.graph[1]])) > 1:\n print(\"NO\")\n else:\n print(\"YES\\n0\")\n else:\n print(\"YES\\n1\\n1 1\")\n elif n == 2:\n if g.has_point_loop():\n print(\"NO\")\n return\n if g.has_edge_loop():\n if len(g.graph[1]) > 2:\n print(\"NO\")\n else:\n print(\"YES\\n0\")\n return\n if cc_num == 1:\n print(\"YES\\n1\\n1 2\")\n else:\n print(\"YES\\n2\\n1 2\\n1 2\")\n else:\n if g.has_point_loop():\n print(\"NO\")\n return\n if g.has_edge_loop():\n if g.has_repeating_edge():\n print(\"NO\")\n else:\n if cc_num == 1 and is_funny_ring(n, degree):\n print(\"YES\\n0\")\n else:\n print(\"NO\")\n return\n if check_cc(n, cc, cc_num, degree):\n print(\"YES\")\n form_funny_ring(n, cc, cc_num, degree)\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n n, g = input_data()\n solve_prob(n, g)\n", "m, n = map(int, input().split())\r\ndegree = [0] * (m + 1)\r\npath = []\r\nres = True\r\n\r\nfather = [i for i in range(m + 1)]\r\ndef find(i):\r\n if i == father[i]:\r\n return i\r\n father[i] = find(father[i])\r\n return father[i]\r\ndef union(x, y):\r\n father[find(y)] = find(x)\r\ndef next1():\r\n for i in range(1, m + 1):\r\n if degree[i] < 2:\r\n return i\r\n return 0\r\ndef next2(to):\r\n for i in range(1, m + 1):\r\n if degree[i] < 2 and find(to) != find(i):\r\n return i\r\n return 0\r\nfor _ in range(n):\r\n v1, v2 = map(int, input().split())\r\n degree[v1] += 1\r\n degree[v2] += 1\r\n union(v1, v2)\r\n if degree[v1] > 2 or degree[v2] > 2:\r\n res = False\r\n\r\nif res:\r\n while True:\r\n left = next1()\r\n if left == 0:\r\n break\r\n degree[left] += 1 \r\n right = next2(left)\r\n if right == 0:\r\n right = next1()\r\n else:\r\n union(left, right)\r\n degree[right] += 1\r\n path.append([left, right])\r\nfor i in range(1, m + 1):\r\n if find(i) != find(1):\r\n res = False\r\n break\r\nprint(\"%s\" %(res and \"YES\" or \"NO\"))\r\nif res:\r\n print(len(path))\r\n for value in path:\r\n print(\"%d %d\" %(value[0], value[1]))" ]

[ "s=input()\r\nn=len(s)\r\nf=0\r\nfor i in range(n-2):\r\n if(ord(s[i])+ord(s[i+1])+ord(s[i+2])==198 and s[i]!=s[i+1]):\r\n f=1\r\n break\r\nif(f==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s=input()\r\nl=['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\r\ndef f(l,s):\r\n\tfor i in l:\r\n\t\tif i in s:\r\n\t\t\treturn \"Yes\"\r\n\treturn \"No\"\r\nprint(f(l,s))", "a = input()\r\n\r\nlength = len(a)\r\nfor i in range(length-2):\r\n dilim = a[i:i+3]\r\n if ('A' in dilim and 'B' in dilim and 'C' in dilim):\r\n print('Yes')\r\n exit()\r\nprint('No')\r\n\r\n\r\n", "s = input()\n\nres = False\nfor i in range(1, len(s) - 1):\n res = res or set(s[i-1 : i+2]).issuperset(set(['A', 'B', 'C']))\nprint(['No', 'Yes'][res])", "# LUOGU_RID: 101744204\ns = input()\r\nprint(any(x in s for x in ['ABC', 'ACB', 'CAB', 'CBA', 'BCA', 'BAC']) and 'Yes' or 'No')", "def process(S):\r\n n = len(S)\r\n for i in range(n-2):\r\n if S[i] != '.' and S[i+1] != '.' and S[i+2] != '.' and S[i] != S[i+1] and S[i] != S[i+2] and S[i+1] != S[i+2]:\r\n print('Yes')\r\n return\r\n print('No')\r\n \r\nS = input()\r\nprocess(S)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\ndef main():\r\n s = input()\r\n ans = False\r\n for t in itertools.permutations('ABC', 3):\r\n if ''.join(t) in s:\r\n ans = True\r\n if ans:\r\n print('Yes')\r\n else:\r\n print('No')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x = input()\r\n\r\nif 'ABC' in x:\r\n print('Yes')\r\nelif 'ACB' in x:\r\n print('Yes')\r\nelif 'BAC' in x:\r\n print('Yes')\r\nelif 'BCA' in x:\r\n print('Yes')\r\nelif 'CAB' in x:\r\n print('Yes')\r\nelif 'CBA' in x:\r\n print('Yes')\r\nelse:\r\n print('No')", "a = input()\n\nfor i in range(len(a)-2):\n if a[i] != a[i + 1] and a[i] != a[i + 2] and a[i + 1] != a[i + 2] and a[i] != '.' and a[i + 1] != '.' and a[i + 2] != '.':\n print(\"Yes\")\n exit(0)\n\nprint(\"No\")\n", "s=input()\r\ncg={'.':3,'A':0,'B':1,'C':2}\r\ndef _(x) :\r\n return cg[x]\r\na=list(map(_,s))\r\nif len(a)<3 :\r\n print('No')\r\n exit()\r\ncnt=[0,0,0,0]\r\nfor i in range(len(a)) :\r\n cnt[a[i]]=cnt[a[i]]+1\r\n if i-3>=0 :\r\n cnt[a[i-3]]=cnt[a[i-3]]-1\r\n if cnt[0] and cnt[1] and cnt[2] :\r\n print('Yes')\r\n exit()\r\n # print(cnt)\r\nprint('No')\r\n", "n = input()\r\nprint('YES' if 'ABC' in n or 'ACB' in n or 'BCA' in n or 'BAC' in n or 'CAB' in n or 'CBA' in n else 'NO')\r\n", "s = input()\r\n\r\nans = 'No'\r\n\r\nfor i in range(1, len(s)-1):\r\n if s[i] == 'A':\r\n if (s[i-1] == 'B' and s[i+1] == 'C') or (s[i-1] == 'C' and s[i+1] == 'B'):\r\n ans = 'Yes'\r\n break\r\n\r\n elif s[i] == 'B':\r\n if (s[i-1] == 'A' and s[i+1] == 'C') or (s[i-1] == 'C' and s[i+1] == 'A'):\r\n ans = 'Yes'\r\n break\r\n\r\n elif s[i] == 'C':\r\n if (s[i-1] == 'B' and s[i+1] == 'A') or (s[i-1] == 'A' and s[i+1] == 'B'):\r\n ans = 'Yes'\r\n break\r\n\r\n\r\nprint(ans)", "s=input()\r\nss=['ABC','BAC','CAB','BCA','CBA','ACB']\r\nans='NO'\r\nfor i in ss:\r\n if i in s:ans='YES';break\r\nprint(ans)", "s = input()\r\nif s.find('ABC') != -1 or s.find('ACB') != -1 or s.find('BAC') != -1 or s.find('BCA') != -1 or s.find('CAB') != -1 or s.find('CBA') != -1:\r\n print('YES')\r\nelse:\r\n print('NO')", "F = input()\r\n\r\nfrom itertools import permutations\r\n\r\nP =list(permutations('ABC'))\r\n\r\nfor p in P:\r\n\r\n if p[0]+p[1]+p[2] in F:\r\n print('Yes')\r\n break\r\n\r\nelse:\r\n print('No')\r\n", "data = input(\"\")\nif 'ABC' in data or 'ACB' in data or 'BAC' in data or 'BCA' in data or 'CAB' in data or 'CBA' in data:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "s = input()\nans = 'No'\nfor i in range(1, len(s)-1):\n if sorted(s[i-1:i+2]) == ['A','B','C']:\n ans = 'Yes'\n break\nprint(ans)", "# your code goes here\r\ns = input()\r\nif len(s) < 3:\r\n\tprint('No')\r\n\texit()\r\nfor x, y, z in zip(s, s[1:], s[2:]):\r\n\tif set([x, y, z]) == set('ABC'):\r\n\t\tprint('Yes')\r\n\t\texit()\r\nprint('No')", "s = input()\r\nt = 0\r\nfor i in 'ABC':\r\n for j in 'ABC':\r\n for k in 'ABC':\r\n if i != j and j != k and i != k:\r\n if s.find(i+j+k) >= 0:\r\n print('Yes')\r\n t = 1\r\n break \r\n if t:\r\n break\r\n if t:\r\n break\r\nelse:\r\n print('No')", "s = input()\r\n\r\nflag = 0\r\nfor i in range(1, len(s) - 1):\r\n if ord(s[i]) != ord(\".\") and ord(s[i - 1]) != ord(\".\") and ord(s[i + 1]) != ord(\".\"):\r\n if s[i] != s[i + 1] and s[i] != s[i -1] and s[i-1] != s[i + 1]:\r\n flag = 1\r\nif flag == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "ch=input()\r\nif \"ABC\" in ch or \"ACB\" in ch or \"BAC\" in ch or \"BCA\" in ch or \"CAB\" in ch or \"CBA\" in ch:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "s = input()\r\nf = 0\r\nfor i in range(len(s)):\r\n if(i!=0 and i!=len(s)-1):\r\n if(s[i]==\"A\"):\r\n if((s[i-1]=='B' and s[i+1]=='C') or (s[i-1]=='C' and s[i+1]=='B')):\r\n f=1\r\n elif(s[i]==\"B\"):\r\n if((s[i-1]=='A' and s[i+1]=='C') or (s[i-1]=='C' and s[i+1]=='A')):\r\n f=1\r\n elif(s[i]==\"C\"):\r\n if((s[i-1]=='B' and s[i+1]=='A') or (s[i-1]=='A' and s[i+1]=='B')):\r\n f=1\r\nif(f):\r\n print('yes')\r\nelse:\r\n print('no')", "string=input()\r\nc=0\r\na=['ABC','ACB','BCA','BAC','CAB','CBA']\r\nfor i in a:\r\n c+=string.find(i)\r\nif c==-6:\r\n print('No')\r\nelse:\r\n print('Yes')", "b= input()\r\nif 'BAC' in b or 'BCA' in b or 'CAB' in b or 'CBA' in b or 'ABC' in b or 'ACB' in b:\r\n print('Yes')\r\nelse:\r\n print('No')", "from itertools import permutations\r\n\r\nflag = 0\r\na = input()\r\na_list = list(permutations(\"ABC\"))\r\na_list = [ \"\".join(x) for x in a_list]\r\nfor x in a_list:\r\n if x in a:\r\n flag = 1\r\nif flag==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=input()\r\na='ABC'\r\nb='ACB'\r\nc='BAC'\r\nd='BCA'\r\ne='CAB'\r\nf='CBA'\r\nx=n.split('.')\r\nif a in n:\r\n\tprint('Yes')\r\nelif b in n:\r\n\tprint('Yes')\r\nelif c in n:\r\n\tprint('Yes')\r\nelif d in n:\r\n\tprint('Yes')\r\nelif e in n:\r\n\tprint('Yes')\r\nelif f in n:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "def solve(s):\n x = ['ABC','ACB', 'BAC','BCA','CAB', 'CBA']\n for i in range(0,len(s)-2):\n if ''.join(s[i:i+3]) in x:\n return 'Yes'\n return 'No'\n \n \n\n\ndef main() :\n # r,c = list(map(int, input().soo-oooplit(' ')))\n # n = int(input())\n # arr = input().split(' ')\n s = input()\n # res=''\n # arr = []\n # for _ in range(r):\n # i = list(input())\n # arr.append(i)\n print(solve(s))\nmain()\n", "flowers = list(str(input()))\r\ni=0\r\nthreePetals = False\r\nlimit = len(flowers) - 2\r\nwhile(i<limit):\r\n petals = [ord(x) for x in [flowers[i],flowers[i+1],flowers[i+2]]]\r\n c = max(petals)\r\n petals.remove(c)\r\n b = max(petals)\r\n petals.remove(b)\r\n a = petals.pop()\r\n\r\n if a == 65 and b == 66 and c == 67:\r\n print('YES')\r\n exit()\r\n i += 1\r\nprint('NO')", "def main():\n flowers = input()\n possible = False\n\n for i in range(len(flowers) - 2):\n a = flowers[i]\n b = flowers[i + 1]\n c = flowers[i + 2]\n\n if '.' not in [a, b, c] and a != b and b != c and c != a:\n possible = True\n break\n\n print('Yes' if possible else 'No')\n\n\nif __name__ == '__main__':\n main()\n", "a=['ABC','ACB','BAC','BCA','CAB','CBA']\r\nb=input()\r\nfor i in a:\r\n if i in b:\r\n exit(print('Yes'))\r\nprint('No')", "k =input()\r\nif \"ABC\" in k or \"ACB\" in k or \"CAB\" in k or \"BCA\" in k or \"BAC\" in k or \"CBA\" in k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\ns = input()\n\nss = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\n\nfor i in ss:\n if s.find(i) != -1:\n print('Yes')\n sys.exit()\n\nprint('No')\n", "\n\ns = input()\n\ndef check(i):\n\tglobal s\n\tif i in s:\n\t\treturn True\n\na = ['ABC','ACB','BAC','BCA','CAB','CBA']\nfor i in a:\n\tif check(i):\n\t\tprint('YES')\n\t\texit()\nprint('NO')", "s = input()\r\nlt = ['ABC','ACB','BAC','BCA','CAB','CBA']\r\nflag = 0\r\nfor x in lt:\r\n if x in s:\r\n flag=1\r\n break\r\nif(flag == 1):\r\n print('Yes')\r\nelse:\r\n print('No') \r\n \r\n ", "# a, b = [int(x) for x in input().split()]\n#\n# aa = a**b\n# bb = b**a\n#\n# if aa > bb:\n# print(\">\")\n# elif aa < bb:\n# print(\"<\")\n# else:\n# print(\"=\")\n\ninp = input()\nfor x in [\"ABC\", \"ACB\", \"BAC\", \"BCA\", \"CAB\", \"CBA\"]:\n if x in inp:\n print(\"Yes\")\n exit()\nprint(\"No\")\n", "a=input()\r\nb=['ABC','BAC','ACB','BCA','CBA','CAB']\r\nc=0\r\nfor i in range(6):\r\n if b[i] in a:\r\n c=1\r\n print('Yes')\r\n break\r\n\r\nif c!=1:\r\n print('No')\r\n", "s=input()\r\nif s.count('ABC')+s.count('ACB')+s.count('BAC')+s.count('BCA')+s.count('CAB')+s.count('CBA')==0:\r\n print('No')\r\nelse:\r\n print('Yes')", "import sys\r\n\r\ns = input()\r\nb = [\"ABC\", \"ACB\", \"BAC\", \"BCA\", \"CAB\", \"CBA\"]\r\nfor i in b:\r\n if s.find(i) != -1:\r\n print(\"Yes\")\r\n sys.exit()\r\nprint(\"No\")\r\n", "a=input()\r\nprint('YNEOS'[all(sorted(a[i:i+3])!=[*'ABC']for i in range(len(a)-2))::2])", "str1 = input()\r\nif \"BAC\" in str1:\r\n print(\"Yes\")\r\nelif(\"CAB\" in str1): \r\n print(\"Yes\")\r\nelif(\"ABC\" in str1): \r\n print(\"Yes\") \r\nelif(\"CBA\" in str1): \r\n print(\"Yes\") \r\nelif(\"ACB\" in str1): \r\n print(\"Yes\") \r\nelif(\"BCA\" in str1): \r\n print(\"Yes\") \r\nelse:\r\n print(\"No\") ", "#author: Adyasha\r\n\r\ns=input()\r\nl=len(s)\r\nflag=False\r\nfor x in range(l-2):\r\n if (s[x]!='.' and s[x+1]!='.' and s[x+2]!='.' and s[x]!=s[x+1] and s[x+1]!=s[x+2] and s[x]!=s[x+2]):\r\n flag=True\r\nif (flag==True):\r\n print('Yes')\r\nelse:\r\n print('No')", "s=input()\r\nn=len(s)\r\nans=0\r\nfor i in range(n-2):\r\n if(s[i]=='.'):\r\n continue\r\n t=[]\r\n for j in range(i,i+3):\r\n if(s[j]=='.'):\r\n break\r\n t.append(s[j])\r\n if(len(set(t))==3 and '.' not in t):\r\n print(\"YES\")\r\n ans=1\r\n break\r\nif(ans==0):\r\n print(\"NO\")\r\n\r\n", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\n\ns = input()\n\nif \"ABC\" in s or \"ACB\" in s or \"BAC\" in s or \"BCA\" in s or \"CAB\" in s or \"CBA\" in s:\n print(\"Yes\")\nelse:\n print(\"No\")", "s = input()\r\nfor i in range(1, len(s) - 1):\r\n if set([s[i], s[i - 1], s[i + 1]]) == {'A', 'B', 'C'}:\r\n print('Yes')\r\n break\r\nelse:\r\n print('No')\r\n", "s=input()\r\nx=0\r\nfor i in range(len(s)-2):\r\n if (s[i] != '.' and s[i + 1] != '.' and s[i + 2] != '.'):\r\n if (s[i] != s[i + 1] and s[i + 1] != s[i + 2] and s[i] != s[i + 2] ):\r\n x = 1\r\n break\r\nif(1 == x):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n", "l=input()\r\nf=0\r\nfor i in range(1,len(l)-1):\r\n if(l[i-1]!=l[i] and l[i+1]!=l[i] and l[i-1]!=l[i+1] and l[i]!='.' and l[i-1]!='.' and l[i+1]!='.'):\r\n print(\"Yes\")\r\n f=1\r\n break\r\nif(f==0):\r\n print(\"No\")", "str=input()\r\np=0\r\nfor i in range(1,len(str)-1):\r\n ss = [str[i-1],str[i],str[i+1]]\r\n #print(i)\r\n ss.sort()\r\n if ss[0]=='A' and ss[1]=='B'and ss[2]=='C':\r\n p=1\r\n\r\nif p==1:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "dc=['ABC','ACB','BAC','BCA','CAB','CBA']\nfor s in input().split('.'):\n for d in dc:\n if s.find(d)!=-1:\n print('Yes')\n exit()\nprint('No')", "a = input()\r\nif a.count(\"ABC\") or a.count(\"ACB\") or a.count(\"BAC\") or\\\r\n a.count(\"BCA\") or a.count(\"CAB\") or a.count(\"CBA\"):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "X = input()\r\nif len(X) <= 2:\r\n print(\"NO\")\r\n exit()\r\nfor i in range(0, len(X) - 2):\r\n Temp = X[i:i + 3]\r\n if \"A\" in Temp and \"B\" in Temp and \"C\" in Temp:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "s = list(str(input()))\r\nfound = False\r\nfor i in range(1, len(s)-1):\r\n if s[i] == 'A':\r\n if (s[i-1] == 'B' and s[i+1] == 'C') or (s[i-1] == 'C' and s[i+1] == 'B'):\r\n print(\"Yes\")\r\n found = True\r\n break\r\n elif s[i] == 'B':\r\n if (s[i-1] == 'A' and s[i+1] == 'C') or (s[i-1] == 'C' and s[i+1] == 'A'):\r\n print(\"Yes\")\r\n found = True\r\n break\r\n elif s[i] == 'C':\r\n if (s[i-1] == 'A' and s[i+1] == 'B') or (s[i-1] == 'B' and s[i+1] == 'A'):\r\n print(\"Yes\")\r\n found = True\r\n break\r\nif not found:\r\n print(\"No\")\r\n", "s=input()\r\nx=s.lower()\r\nif \"abc\" in x or \"acb\" in x or \"bac\" in x or \"cab\" in x or \"cba\" in x or \"bca\" in x:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n \r\n", "s = input()\r\nfor i in range(1,len(s)-1):\r\n if (s[i]!='.') and (s[i-1]!='.') and (s[i+1]!='.') and (s[i]!=s[i-1]) and (s[i]!=s[i+1]) and (s[i-1]!=s[i+1]):\r\n print('YES')\r\n exit()\r\nprint('NO')", "s=input()\r\ns=list(s)\r\nflag=0\r\nref=['A','B','C']\r\nfor i in range(len(s)-2):\r\n lis = s[i:i+3]\r\n lis.sort()\r\n for j in range(3):\r\n if(ref[j]!=lis[j]):\r\n break\r\n else:\r\n j+=1\r\n if j==3:\r\n flag=1\r\n break\r\nif flag==1:\r\n print('Yes')\r\nelse:\r\n print('No') ", "s = input()\r\nl = len(s)\r\n\r\nposs = 0\r\nfor i in range(1, l - 1):\r\n\tcolors = set()\r\n\tcolors.add(s[i])\r\n\tcolors.add(s[i - 1])\r\n\tcolors.add(s[i + 1])\r\n\tif \"B\" in colors and \"C\" in colors and \"A\" in colors:\r\n\t\tposs = 1\r\n\r\nif poss:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "s = input()\r\nl = []\r\nans = \"NO\"\r\ncomb = ['ABC','ACB','BAC','BCA','CAB','CBA'] \r\nfor i in comb:\r\n if i in s:\r\n ans = \"YES\"\r\n break\r\nprint(ans)\r\n", "s = input()\r\nif s.count('BAC') > 0 or s.count('CAB') > 0 or s.count('BCA') > 0 or s.count('ACB') > 0 or s.count('CBA') > 0 or s.count('ABC') > 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "x = list(input())\ncount = 0\nj = 0\nwhile len(x):\n if count == len(x):\n print('No')\n break\n else:\n sub_str = x[j:j + 3]\n if 'A' in sub_str and 'B' in sub_str and 'C' in sub_str:\n print('Yes')\n break\n else:\n j = j + 1\n count = count + 1\n sub_str = []\n\n", "a = input()\r\n\r\ngo = False\r\nfor i in range(1, len(a) - 1):\r\n if len(set(a[i] + a[i - 1] + a[i + 1])) == 3 and '.' not in set(a[i] + a[i - 1] + a[i + 1]):\r\n go = True\r\n break\r\nif go:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s=input()\r\nif(s.__contains__(\"ABC\") or s.__contains__(\"BAC\") or s.__contains__(\"CAB\") or s.__contains__(\"ACB\") or s.__contains__(\"BCA\") or s.__contains__(\"CBA\")):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ni = 0\r\ndict_now = {'A': 1, 'B': 2, 'C': 4, '.': 8}\r\nfin_ans = False\r\nsum_now = 0\r\nfor idx in range(0, len(s)):\r\n if idx < 3:\r\n sum_now += dict_now[s[idx]]\r\n else:\r\n sum_now -= dict_now[s[idx - 3]]\r\n sum_now += dict_now[s[idx]]\r\n if sum_now == 7:\r\n fin_ans = True\r\nif fin_ans:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "a = input()\r\nl = [\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"]\r\nfor x in l:\r\n if x in a:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "s=input()\r\nprint('NYOE S'['ABC' in s or 'ACB' in s or 'BAC' in s or 'BCA' in s or 'CAB' in s or 'CBA' in s::2])", "s=input()\r\nprint('Yes'if any(sorted(s[i:i+3])==['A','B','C'] for i in range(len(s)))else'No')", "a= input()\r\nfl = 0\r\nfor i in range(1,len(a)-1):\r\n f = a[i-1:i+2]\r\n #print(f)\r\n if ('A' in f) and ('B' in f) and ('C' in f):\r\n fl = 1\r\nif fl :print('Yes')\r\nelse:print('No')\r\n", "string = input()\r\n\r\npossible = False\r\nfor i in range(len(string)-2):\r\n\tsubstring = string[i:i+3]\r\n\tif substring=='ABC' or substring=='ACB' or substring=='BAC' or substring=='BCA' or substring=='CAB' or substring=='CBA':\r\n\t\tpossible = True\r\n\t\tbreak\r\n\r\n\r\nif possible == True:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "s=input()\r\na,b,c=0,0,0\r\nf=0\r\nif 'BAC' in s or 'ABC' in s or 'ACB' in s or 'BCA' in s or 'CAB' in s or 'CBA' in s:\r\n f=1\r\nif f:\r\n print('Yes')\r\nelse:\r\n print('No')", "a=input()\r\nfor i in range(len(a)-2):\r\n if(len(set(a[i:i+3]))==3 and '.' not in a[i:i+3]):\r\n print(\"Yes\")\r\n exit(0)\r\nprint(\"No\")\r\n", "s=input()\r\nst=\".\"+s+\".\"\r\ncount=[0 for i in range(len(s))]\r\nfor i in range(1,len(st)-1):\r\n if(st[i]=='A' or st[i-1]=='A' or st[i+1]=='A'): count[i-1]+=1\r\n if(st[i]=='B' or st[i-1]=='B' or st[i+1]=='B'): count[i-1]+=2\r\n if(st[i]=='C' or st[i-1]=='C' or st[i+1]=='C'): count[i-1]+=3\r\n \r\nflag=0\r\nfor i in count:\r\n if(i==6):\r\n flag=1\r\n break\r\nif(flag==1): print(\"Yes\")\r\nelse: print(\"No\")\r\n \r\n \r\n ", "n = list(input())\r\n\r\nset_target = {'A', 'B', 'C'}\r\n\r\nfor i in range(len(n) - 2):\r\n new = n[i:i+3]\r\n new = set(new)\r\n if new == set_target:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nsub = [\"ABC\",\"ACB\",\"BCA\",\"BAC\",\"CAB\",\"CBA\"]\r\ncount = 0\r\nfor i in sub:\r\n if i in s:\r\n count+=1 \r\n break \r\nif count==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n ", "str = list(input())\r\nlst = [\"ABC\", \"ACB\", \"BAC\", \"BCA\", \"CAB\", \"CBA\"]\r\nfound = False\r\nfor i in range(len(str) - 2):\r\n temp = \"\"\r\n temp += str[i]\r\n temp += str[i + 1]\r\n temp += str[i + 2]\r\n if(lst.count(temp) > 0):\r\n found = True\r\n break\r\nprint(\"Yes\" if found else \"No\")", "s = input().strip()\r\nn = len(s)\r\n\r\nfor i in range(n - 2):\r\n t = list(s[i:i+3])\r\n t.sort()\r\n t = ''.join(map(str, t))\r\n if t == 'ABC':\r\n print('Yes')\r\n exit(0)\r\nprint('No')", "ans = ['ABC','BAC','ACB','BCA','CAB','CBA']\r\ns = input()\r\nfor i in ans : \r\n if i in s : \r\n print('YES')\r\n exit()\r\nprint('NO')", "import sys\r\ns = sys.stdin.readline().strip()\r\nres = 'No'\r\nfor i in range (len(s) - 2):\r\n t = s[i:i+3]\r\n if 'A' in t and 'B' in t and 'C' in t:\r\n res = 'Yes'\r\nprint(res)\r\n", "s = str(input())\n\nflag = False\n\nfor i in range(1, len(s)-1):\n\tif s[i] == '.' or s[i-1] == '.' or s[i+1] == '.':\n\t\tcontinue\n\telse:\n\t\tif s[i] != s[i-1] and s[i] != s[i+1] and s[i-1] != s[i+1]:\n\t\t\tprint(\"Yes\")\n\t\t\tflag = True\n\t\t\tbreak\n\nif not flag:\n\tprint(\"No\")", "s=input()\r\nprint('YES' if s.find('ABC')!=-1 or s.find('ACB')!=-1 or s.find('BAC')!=-1 or s.find('BCA')!=-1 or s.find('CAB')!=-1 or s.find('CBA')!=-1 else 'NO')\r\n", "s = input()\r\nS = s.lower()\r\nif 'abc' in S or 'bac' in S or 'cab' in S or 'cba' in S or 'acb' in S or 'bca' in S:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input().strip()\nf = False\nfor i in range(len(s) - 2):\n if s[i] != s[i + 1] and s[i] != s[i + 2] and s[i + 1] != s[i + 2] and s[i] != '.' and s[i + 1] != '.' and s[i + 2] != '.':\n f = True\nif (f):\n print(\"Yes\")\nelse:\n print(\"No\")", "import itertools\r\nseq = input()\r\nfor subseq in itertools.permutations('ABC'):\r\n if ''.join(subseq) in seq:\r\n print('Yes')\r\n quit()\r\nprint('No')", "flower=str(input())\r\n#print(flower)\r\ncount=0\r\nchecklis=[\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"]\r\nfor i in checklis:\r\n if i in flower:\r\n print(\"Yes\")\r\n count=1\r\n break\r\nif count==0:\r\n print(\"No\")", "def solve():\r\n s=input()\r\n for i in range(len(s)-2):\r\n if sorted([s[i],s[i+1],s[i+2]])==[\"A\",\"B\",\"C\"]:print(\"YES\");break\r\n else:print(\"NO\")\r\nsolve()", "s=str(input())\nl=-1\ncnt=0\nl=s.find(\"ABC\")\nif(l!=-1):\n\tcnt=cnt+1\nl=s.find(\"BAC\")\nif(l!=-1):\n\tcnt=cnt+1\nl=s.find(\"ACB\")\nif(l!=-1):\n\tcnt=cnt+1\nl=s.find(\"BCA\")\nif(l!=-1):\n\tcnt=cnt+1\nl=s.find(\"CAB\")\nif(l!=-1):\n\tcnt=cnt+1\nl=s.find(\"CBA\")\nif(l!=-1):\n\tcnt=cnt+1\nif(cnt>0):\n\tprint(\"Yes\")\nelse :\n\tprint(\"No\")", "s = input()\r\n\r\nfor i in range(len(s) - 2):\r\n\r\n flowers = set()\r\n\r\n for j in range(i, i+3):\r\n if s[j] != '.':\r\n flowers.add(s[j])\r\n\r\n if len(flowers) == 3:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")\r\n", "s = input()\r\nfor i in range(len(s)-2):\r\n if '.' not in s[i:i+3] and len(set(s[i:i+3]))==3:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "st = input()\r\nc = st.count('BAC') + st.count('CAB') + st.count('ABC') + st.count('CBA') + st.count('ACB') + st.count('BCA')\r\nif c == 0:\r\n print('No')\r\nelse:\r\n print('Yes')", "\r\nli=['ABC','ACB','BAC','BCA','CBA','CAB']; kaj=input()\r\n\r\n\r\n\r\n\r\nfor ii in li:\r\n if ii in kaj:\r\n print('Yes')\r\n exit(0)\r\n \r\n\r\n\r\nprint('No'); exit(0)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s=input()\r\nflag=0\r\nfor i in range(1,len(s)-1):\r\n\tif(s[i]=='.'):\r\n\t\tcontinue\r\n\telif (s[i]=='A' and ((s[i-1]=='B'and s[i+1]=='C') or (s[i-1]=='C' and s[i+1]=='B'))):\r\n\t\tflag=1\r\n\t\tbreak\r\n\telif (s[i]=='B' and((s[i-1]=='A' and s[i+1]=='C') or (s[i-1]=='C' and s[i+1]=='A'))):\r\n\t\tflag=1\r\n\t\tbreak\r\n\telif (s[i]=='C'and ((s[i-1]=='A'and s[i+1]=='B') or (s[i-1]=='B' and s[i+1]=='A'))):\r\n\t\tflag=1\r\n\t\tbreak\r\nif(flag==1):\r\n\tprint(\"Yes\")\r\nelif(len(s)<3):\r\n\tprint(\"No\")\r\nelif(flag==0):\r\n\tprint(\"No\")", "s = input()\r\na, b, c, d, e, f = \"ABC\", \"ACB\", \"BAC\", \"BCA\", \"CAB\", \"CBA\"\r\nif a in s or b in s or c in s or d in s or e in s or f in s:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "S = input()\nl = len(S)\nans = 0\ndef mask(x) :\n if(x == 'A') :\n return 1\n if(x == 'B') :\n return 2\n if(x == 'C') :\n return 4\n return 0\nfor i in range (1, l - 1) :\n if(mask(S[i - 1]) + mask(S[i]) + mask(S[i + 1]) == 7) :\n ans = 1\nif (ans == 1) :\n print (\"yEs\")\nelse :\n print (\"nO\")\n", "s = input()\r\nn = len(s)\r\n\r\nif n < 3:\r\n print('No')\r\nelse:\r\n res = False\r\n\r\n for i in range(2, n):\r\n if s[i-2] != '.' and s[i-1] != '.' and s[i] != '.':\r\n if s[i-2] != s[i-1] and s[i-1] != s[i] and s[i-2] != s[i]:\r\n res = True\r\n break\r\n\r\n if res:\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "def fxn() : \n # arr = list(map(isalpha, input().split()))\n # isalpha is not global function \n # split doesn't split by character \n # split turned it into a list for consumption ??\n # low confindence around zip \n # right calibration, small problem itna time le raha hoon ? \n # list wront defintion \n # when using check if apples to apples comparison or not \n # ordering doesn't matter comparison use set \n\n # arr = [i in 'ABC' for i in input().split()[0]]\n\n # arr = input() \n # print('Yes' if set('ABC') in map(set, zip(a, a[1:], a[2:])) else 'No') \n # print(list(map(set, zip(a, a[1:], a[2:]))))\n \n\n arr = [i for i in input().split()[0]] \n # print(arr)\n # print(set(a[1]+a[2]+a[3]))\n # print(set('ABC'))\n # print(set('BAC'))\n # print(set('ABC') in set('BAC'))\n\n # s = set(list([2,5]))\n # print(s)\n # p = set(list([2,5,6,98]))\n # print(p)\n\n # print(s in p)\n # print(p in s )\n\n # print(set(list([2,5])) in set(list([2,5,6,98])))\n\n for i in range (len(arr)-2):\n #if (arr[i] and arr[i+1] and arr[i+2]) :\n if set('BAC') == set(arr[i]+arr[i+1]+arr[i+2]):\n return \"Yes\"\n\n return \"No\"\n\nprint(fxn())\n", "s = input().strip()\r\nans = 'No'\r\nfor i in range(1, len(s) - 1):\r\n if ord(s[i]) + ord(s[i - 1]) + ord(s[i + 1]) == 198 and s[i] != s[i - 1] and s[i] != s[i + 1] and s[i - 1] != s[i + 1]:\r\n ans = 'Yes'\r\nprint(ans)\r\n", "s = input().strip()\na = [False for i in range(len(s))]\nb = [False for i in range(len(s))]\nc = [False for i in range(len(s))]\n\nfor i in range(len(s)):\n arr = None\n if s[i] == 'A': arr = a\n elif s[i] == 'B': arr = b\n elif s[i] == 'C': arr = c\n else:\n continue\n if i > 0:\n arr[i-1] = True\n arr[i] = True\n if i < len(s)-1:\n arr[i+1] = True\n\nfound = False\nfor i in range(len(s)):\n if a[i] and b[i] and c[i]:\n print(\"YES\")\n found = True\n break\nif not found: print(\"NO\")\n", "#!python3\r\n\r\ns = input().strip()\r\nc = ['ABC','ACB','BAC','BCA','CAB','CBA']\r\nfor i in range(len(s)):\r\n if s[i:i+3] in c:\r\n print('Yes')\r\n exit()\r\nprint('No')\r\n", "s=input()\r\nfor i in range(0,len(s)):\r\n cnt=0\r\n se=set()\r\n if i-1>=0:\r\n if not s[i-1] in se and s[i-1]!='.':\r\n se.add(s[i-1])\r\n cnt+=1\r\n if not s[i] in se and s[i]!='.':\r\n se.add(s[i])\r\n cnt+=1\r\n if i+1<len(s):\r\n if not s[i+1] in se and s[i+1]!='.':\r\n cnt+=1\r\n if cnt==3:\r\n print(\"YES\")\r\n break\r\n\r\nelse:\r\n print(\"NO\")", "s = input()\r\nprint(('No', 'Yes')[any(set(s[i:i+3]) == set('ABC') for i in range(len(s) - 2))])", "s=input()\r\nif ('BAC' in s) or ('BCA' in s) or ('ACB' in s) or ('ABC' in s) or ('CBA' in s) or ('CAB' in s):\r\n print ('Yes')\r\nelse:\r\n print('No')\r\n", "s=input()\r\nl=len(s)\r\nflag=0\r\nli=[\"ABC\", \"ACB\", \"BAC\", \"BCA\", \"CBA\", \"CAB\"]\r\nfor i in range(l-2):\r\n if s[i:i+3] in li:\r\n print(\"Yes\")\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"No\") ", "\ndef get_next_three(row):\n\n for j in range(2, len(row)):\n i = j - 2\n word = row[i:j+1]\n yield word\n\n\nif __name__ == '__main__':\n\n data = input()\n\n if len(data) < 3:\n print('No')\n else:\n possible = {'ABC','ACB', 'BCA', 'BAC', 'CAB', 'CBA'}\n\n for w in get_next_three(data):\n if w in possible:\n print('Yes')\n break\n else:\n print('No')\n", "#https://codeforces.com/problemset/problem/989/A\r\n\r\ns = input()\r\n\r\nok = False\r\nfor i in range(len(s)-2):\r\n if 'A' in s[i:i+3] and 'B' in s[i:i+3] and 'C' in s[i:i+3]:\r\n ok = True\r\n print(\"YES\")\r\n break\r\nif not ok:\r\n print(\"NO\")", "a = input()\nif 'ABC'in a or 'ACB'in a or'BCA'in a or 'BAC'in a or 'CBA'in a or'CAB'in a :\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n'''\nn,k= map(int,input().split())\nw = 0\nif n == 999983 and k == 1000:\n\tprint(999983001)\n\texit()\nelif n ==994009 and k ==997:\n\tprint(991026974)\n\texit()\nelif n ==999883 and k ==200:\n\tprint(199976601)\n\texit()\nelif n ==199942 and k ==1000:\n\tprint(99971002)\n\texit()\nelif n ==999002 and k ==457:\n\tprint(228271959)\n\texit()\nelif n ==999995 and k ==1000:\n\tprint(199999005)\n\texit()\nwhile 1:\n\tw+=1\n\tif (w//k)*(w%k)==n:\n\t\tprint(w)\n\t\tbreak\n'''\n'''\n'''\t\n'''\n#n,k= map(int,input().split())\n#w = 0\n#while 1:\n#\tw+=1\n#\tif (w//k)*(w%k)==n:\n#\t\tprint(w)\n#\t\tbreak\n'''\n'''\nn=int(input())\nm=list(map(int,input().split()))\nprint(m.count(1))\nfor j in range(n-1):\n\tif m[j+1]==1:\n\t\tprint(m[j],end=' ')\nprint(m[-1])\n'''\n'''\na = int(input())\nf1 = 1\nf2 = 1\nif a < 3:\n\tprint(1)\n\texit()\ncnt = 2\nfor i in range(a - 2):\n\ta = f2\n\tf2 += f1\n\tf1 = a\n\tcnt += f2\nprint(cnt)\n'''\n", "_str = input()\nflag = False\nif \"ABC\" in _str:\n\tflag = True\n\nif \"ACB\" in _str:\n\tflag = True\n\t\nif \"BAC\" in _str:\n\tflag = True\n\t\nif \"BCA\" in _str:\n\tflag = True\n\t\nif \"CAB\" in _str:\n\tflag = True\n\t\nif \"CBA\" in _str:\n\tflag = True\n\t\nif flag:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")", "test = input()\r\nbull = True\r\n\r\ndef summString(a, b, c):\r\n return a+b+c\r\n\r\nfor i in range(1, len(test)-1):\r\n partString = summString(test[i-1], test[i], test[i+1])\r\n if (partString == 'ABC' or\r\n partString == 'BAC' or\r\n partString == 'BCA' or\r\n partString == 'CBA' or\r\n partString == 'ACB' or\r\n partString == 'CAB'):\r\n print('Yes')\r\n bull = False\r\n break\r\n\r\nif bull:\r\n print('No')", "def fun(s):\r\n\treturn 'ABC' in s or 'ACB' in s or 'BAC' in s or 'BCA' in s or 'CAB' in s or 'CBA' in s\r\ns=str(input())\r\nprint('YES' if fun(s) else 'NO')", "s = input()\r\nst = ['ABC','ACB','BCA','BAC','CAB','CBA']\r\nfor i in range(len(s)-2):\r\n if s[i:i+3]in st:\r\n print(\"Yes\")\r\n exit(0)\r\nprint(\"No\")\r\n", "# Codeforces Round #487 (Div. 2)import collections\r\nfrom functools import cmp_to_key\r\n#key=cmp_to_key(lambda x,y: 1 if x not in y else -1 )\r\n\r\nimport sys\r\ndef getIntList():\r\n return list(map(int, input().split())) \r\n\r\n \r\n \r\n \r\ns = input()\r\n\r\nn = len(s)\r\nfor i in range(1,n-1):\r\n if s[i] != s[i-1] and s[i] != s[i+1] and s[i-1] != s[i+1]:\r\n if s[i-1]!= '.' and s[i] !='.' and s[i+1]!='.':\r\n print('YES')\r\n sys.exit()\r\nprint('NO')\r\n", "#problem56\r\ns = input()\r\nif(s.find('ABC')>=0 or s.find('ACB')>=0 or s.find('BAC')>=0 or s.find('BCA')>=0 or s.find('CAB')>=0 or s.find('CBA')>=0):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "s = input()\r\ny = 0\r\nfor i in range(len(s) -2):\r\n if s[i] != '.' and s[i+1] != '.' and s[i+2] != '.':\r\n if s[i] != s[i+1] and s[i] != s[i+2] and s[i+1] != s[i+2]:\r\n y += 1\r\n i += 1\r\nif y == 0:\r\n print('No')\r\nelse:\r\n print('Yes')", "a = input()\r\nif \"ABC\" in a or \"BAC\" in a or \"ACB\" in a or \"BCA\" in a or \"CAB\" in a or \"CBA\" in a:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "s = input()\r\nfor i in [\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CBA\",\"CAB\"]:\r\n if s.count(i) > 0:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "s = input()\r\nbits = ['ABC','ACB','BAC','BCA','CAB','CBA']\r\noutput = 'NO'\r\nfor x in bits:\r\n if x in s:\r\n output = 'YES'\r\nprint(output)", "def solve(garden):\n n = len(garden)\n\n for i in range(1, n-1):\n hashSet = set()\n\n hashSet.add(garden[i-1])\n hashSet.add(garden[i])\n hashSet.add(garden[i+1])\n\n if \"A\" in hashSet and 'B' in hashSet and 'C' in hashSet: return \"Yes\"\n \n return \"No\"\n\n\ngarden = input()\n\nprint(solve(garden))", "s = input()\r\nfor i in range(len(s) - 2):\r\n ss = set(s[i:i+3])\r\n if '.' not in ss and len(ss) == 3:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "x=input()\r\nif ('ABC' in x) or ('ACB' in x) or ('BAC' in x) or ('BCA' in x) or ('CAB' in x) or ('CBA' in x) :\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "def char_to_num(c):\n if c == 'A':\n return 1\n elif c == 'B':\n return 5\n elif c == 'C':\n return 23\n else:\n return 0\n\ns = input()\nf = False\nfor i in range(1, len(s) - 1):\n r = char_to_num(s[i - 1]) + char_to_num(s[i]) + char_to_num(s[i + 1])\n if (r == 29):\n f = True\n break\nif f:\n print('Yes')\nelse:\n print('No')\n", "s, d = input(), {'.': 0, 'A': 1, 'B': 2, 'C': 4}\nprint(('No', 'Yes')[any(sum(map(d.get, e)) == 7 for e in zip(s, s[1:], s[2:]))])", "n = input()\r\nflag = 0\r\nfor i in range(1,len(n)-1):\r\n if n[i-1] != n[i] and n[i] != n[i+1] and n[i-1] != n[i+1] and n[i] != '.' and n[i-1] != '.' and n[i+1] != '.':\r\n print(\"Yes\")\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(\"No\")", "n=list(input())\r\npo=[\"A\",\"B\",\"C\"]\r\nto=0\r\nfor x in range(len(n)-2):\r\n tan=n[x:x+3]\r\n tan.sort()\r\n if \"\".join(tan)==\"\".join(po):\r\n print(\"Yes\")\r\n to=1\r\n break\r\n else:\r\n pass\r\nif to==0:\r\n print(\"NO\")", "__file__ = __file__.startswith('/home/a_farazei')\r\n\r\n\r\ndef input_():\r\n global __file__\r\n\r\n if not __file__:\r\n return input()\r\n\r\n if not hasattr(__file__, 'readline'):\r\n __file__ = open('input.txt', 'r')\r\n\r\n return __file__.readline()\r\n\r\n\r\ns = input_()\r\n\r\nif 'ABC' in s or 'ACB' in s or 'BAC' in s or 'BCA' in s or 'CAB' in s or 'CBA' in s:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\np=['ABC','ACB','BAC','BCA','CAB','CBA']\nfor i in p:\n\tif(i in s):\n\t\tprint('Yes')\n\t\texit()\nprint('No')\n", "###########################\n## A Blend of Springtime ##\n###########################\n\n\ndef main():\n\tflowers = input()\n\taux = 0;\n\n\tfor i in range(len(flowers)-2):\n\t\tif(flowers[i] == 'A' and flowers[i+1] == 'B' and flowers[i+2] == 'C'):\n\t\t\tprint('Yes')\n\t\t\taux = 1\n\t\t\tbreak\n\t\telif(flowers[i] == 'A' and flowers[i+1] == 'C' and flowers[i+2] == 'B'):\n\t\t\tprint('Yes')\n\t\t\taux = 1\n\t\t\tbreak\n\t\telif(flowers[i] == 'B' and flowers[i+1] == 'A' and flowers[i+2] == 'C'):\n\t\t\tprint('Yes')\n\t\t\taux = 1\n\t\t\tbreak\n\t\telif(flowers[i] == 'B' and flowers[i+1] == 'C' and flowers[i+2] == 'A'):\n\t\t\tprint('Yes')\n\t\t\taux = 1\n\t\t\tbreak\n\t\telif(flowers[i] == 'C' and flowers[i+1] == 'A' and flowers[i+2] == 'B'):\n\t\t\tprint('Yes')\n\t\t\taux = 1\n\t\t\tbreak\n\t\telif(flowers[i] == 'C' and flowers[i+1] == 'B' and flowers[i+2] == 'A'):\n\t\t\tprint('Yes')\n\t\t\taux = 1\n\t\t\tbreak\n\tif(aux == 0):\n\t\tprint('No')\n\n\nif __name__ == \"__main__\":\n\tmain()\n", "str1 = input()\r\na = list(str1.split(\".\"))\r\nb = [\"ABC\", \"ACB\", \"CAB\", \"CBA\", \"BAC\", \"BCA\"]\r\nfor ele in b:\r\n if ele in str1:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "a=input()\r\nfor i in ('ABC','ACB','BAC','BCA','CBA','CAB'):\r\n if i in a:\r\n print(\"Yes\")\r\n quit()\r\nprint('No')\r\n", "import math\r\nimport sys\r\nimport re\r\ndef func(s1):\r\n for x in s1:\r\n if len(x) >= 3 and ('ABC' in x or 'ACB' in x or 'BAC' in x or 'BCA' in x or 'CAB' in x or 'CBA' in x):\r\n return 'YES'\r\n return 'NO'\r\ns = input()\r\ns1 = s.split('.')\r\nprint(func(s1))", "# import sys\n# sys.stdin = open('input', 'r')\nstrings = input()\n# print(strings)\n\ncondition = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\nanswer = 'No'\nfor i in condition:\n\tif i in strings:\n\t\tanswer = 'Yes'\n\nletters = ['A', 'B', 'C']\npositions = []\npositions2 = []\nfor i in letters:\n\tpositions.append([pos for pos, char in enumerate(strings) if char == i])\n# print(positions)\n\nfor element in positions:\n\t# print(element)\n\tif isinstance(element, list):\n\t\tfor element2 in element:\n\t\t\tpositions2.append(element2-1)\n\t\t\tpositions2.append(element2+1)\n\telse:\n\t\tpositions2.append(element-1)\n\t\tpositions2.append(element+1)\n\n# print(positions2)\n# print(len(positions2))\n# print(len(set(positions2)))\n\nsortpositions = sorted(positions2)\n\nfor i in range(2,len(sortpositions)-1):\n\tif sortpositions[i-1] == sortpositions[i] and sortpositions[i] == sortpositions[i+1]:\n\t\tanswer = 'Yes'\n\nprint(answer)", "import sys,re\r\nj = sys.stdin.readline().strip()\r\n\r\nif 'ABC' in j or \"ACB\" in j or \"BAC\" in j or \"BCA\" in j or \"CAB\" in j or \"CBA\" in j:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\n@Project : CodeForces\r\n@File : 1.py \r\n@Time : 2018/6/11 21:33\r\n@Author : Koushiro \r\n\"\"\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n seq = input()\r\n dic={}\r\n dic =dic.fromkeys([\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"],1) # !\r\n result = \"No\"\r\n for i in range(len(seq)-2):\r\n if seq[i:i+3] in dic:\r\n result=\"Yes\"\r\n break\r\n print(result)\r\n", "s=input()\r\nf=1\r\nfor i in range(len(s)):\r\n if sorted(s[i:i+3])==['A','B','C']:\r\n print('Yes')\r\n f=0\r\n break\r\n \r\nif f==1:\r\n print(\"NO\")\r\n", "s = input()\r\n\r\nfor i in range(1, len(s) - 1):\r\n if set(s[i - 1 : i + 2]) == set('ABC'):\r\n print(\"Yes\")\r\n exit()\r\n\r\nprint(\"No\")\r\n", "import sys\ns = input()\nn = len(s)\nfor i in range(1, n - 1):\n if sorted([s[i - 1], s[i], s[i + 1]]) == ['A', 'B', 'C']:\n print('Yes')\n sys.exit(0)\nprint('No')\n", "word = str(input())\r\nif \"BAC\" in word:\r\n print(\"Yes\")\r\nelif \"ABC\" in word:\r\n print(\"Yes\")\r\nelif \"BCA\" in word:\r\n print(\"Yes\")\r\nelif \"ACB\" in word:\r\n print(\"Yes\")\r\nelif \"CAB\" in word:\r\n print(\"Yes\")\r\nelif \"CBA\" in word:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "s = list(input())\r\na = ['A', 'B', 'C']\r\nm = set(a)\r\nf = False\r\nfor i in range(1, len(s) - 1):\r\n a = [s[i], s[i - 1], s[i + 1]]\r\n if set(a) == m:\r\n print('Yes')\r\n f = True\r\n break\r\nif not f:\r\n print('No')", "from itertools import permutations\r\n\r\n\r\ns = input()\r\nprint(('No', 'Yes')[any([''.join(t) in s for t in permutations('ABC', 3)])])\r\n\r\n", "x=input()\r\nz=['A','B','C']\r\nlenn=len(x)\r\nfor i in range(lenn-2):\r\n\tl=list(x[i:i+3])\r\n\tl.sort()\r\n\tif l==z:\r\n\t\tprint (\"Yes\")\r\n\t\texit(0)\r\nprint (\"No\")", "inp = str(input())\n\nnicu = False\n\nfor i, char in enumerate(inp):\n try:\n if inp[i] == 'A' and inp[i+1] == 'B' and inp[i+2] == 'C' or inp[i] == 'B' and inp[i+1] == 'C' and inp[i+2] == 'A' or inp[i] == 'C' and inp[i + 1] == 'B' and inp[i + 2] == 'A' or inp[i] == 'B' and inp[i + 1] == 'A' and inp[\n i + 2] == 'C' or inp[i] == 'C' and inp[i+1] == 'A' and inp[i+2] == 'B' or inp[i] == 'A' and inp[i+1] == 'C' and inp[i+2] == 'B':\n nicu = True\n except:\n pass\n\nif nicu:\n print('Yes')\nelse:\n print('No')\n", "def sv():\n\tS = input()\n\tfor i in range(1, len(S)-1):\n\t\ta = {S[i-1], S[i], S[i+1]}\n\t\tif a == {'A', 'B', 'C'}:\n\t\t\treturn True\n\treturn False\n\nprint('Yes' if sv() else 'No')\n", "class CodeforcesTask989ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.landscape = ''\r\n\r\n def read_input(self):\r\n self.landscape = input()\r\n\r\n def process_task(self):\r\n if \"ABC\" in self.landscape:\r\n self.result = \"Yes\"\r\n elif \"ACB\" in self.landscape:\r\n self.result = \"Yes\"\r\n elif \"BAC\" in self.landscape:\r\n self.result = \"Yes\"\r\n elif \"BCA\" in self.landscape:\r\n self.result = \"Yes\"\r\n elif \"CAB\" in self.landscape:\r\n self.result = \"Yes\"\r\n elif \"CBA\" in self.landscape:\r\n self.result = \"Yes\"\r\n else:\r\n self.result = \"No\"\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask989ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "string = input()\r\nif 'ABC' in string:\r\n\tprint('Yes')\r\nelif 'ACB' in string:\r\n\tprint('Yes')\r\nelif 'BAC' in string:\r\n\tprint('Yes')\r\nelif 'BCA' in string:\r\n\tprint('Yes')\r\nelif 'CAB' in string:\r\n\tprint('Yes')\r\nelif 'CBA' in string:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "s = input()\r\nn = len(s)\r\ny = [[] for i in range(n)]\r\nfor i in range(n):\r\n\tif s[i] != \".\":\r\n\t\tif s[i] not in y[i]:\r\n\t\t\ty[i].append(s[i])\r\n\t\tif i >= 1 and s[i] not in y[i - 1]:\r\n\t\t\ty[i - 1].append(s[i])\r\n\t\tif i < n - 1 and s[i] not in y[i + 1]:\r\n\t\t\ty[i + 1].append(s[i])\r\nind = False\t\t\r\nfor j in y:\r\n\tif len(j) == 3:\r\n\t\tprint(\"Yes\")\r\n\t\tind = True\r\n\t\tbreak\r\nif not ind:\r\n\tprint(\"No\")\r\n", "a = input()\r\nb = 'No'\r\n\r\na = '.' + a + '.'\r\n\r\nfor i in range(1, len(a) - 1):\r\n if ''.join(sorted(a[i-1 : i+2])) == 'ABC':\r\n b = 'Yes'\r\n\r\nprint(b)", "arr = [\"ABC\",\"BCA\",\"CAB\",\"BAC\",\"ACB\",\"CBA\"]\r\ns = input()\r\nfor data in arr:\r\n if data in s :\r\n print(\"YES\")\r\n exit()\r\n \r\nprint(\"NO\")", "# t=int(input())\r\n# n=0\r\n# k=0\r\n#\r\n# def judge2(x,i,i_good,j,j_good):\r\n# if ((x>>i)&1)==i_good and ((x>>j)&1)!=j_good: # only case that is contrast to description\r\n# return False\r\n# return True\r\n# def check2(i,i_good,j,j_good):\r\n# maxx=-1\r\n# for x in range(2**k):\r\n# if judge2(x,i,i_good,j,j_good):\r\n# maxx=max(maxx, )\r\n# def judge1(x,i,i_good):\r\n# if ((x>>i)&1)==i_good:\r\n# return False\r\n# return True\r\n#\r\n# for _ in range(t):\r\n# n,k=[int(x)for x in input().split()]\r\n# for i in range(2,n+1):\r\n# s=input().split(':')[1]\r\n# c=s[1]\r\n# if c=='I':\r\n# s=s.split(',')\r\n# s0=s[0].split()\r\n# s1=s[1].split()\r\n# print('s0', s0)\r\n# print('s1', s1)\r\n# x=int(s0[2])\r\n# if s0[5][0]=='g':\r\n# x_good=1\r\n# else:\r\n# x_good=0\r\n# y=int(s1[1])\r\n# if s1[4][0]=='g':\r\n# y_good=1\r\n# else:\r\n# y_good=0\r\n#\r\n# print(x,y,x_good,y_good)\r\n# else: # c is 'P'\r\n#\r\n#\r\n#\r\n# print(s)\r\n\r\n\r\n\r\n\r\n\r\n# n=int(input())\r\n# Ans=[int(x)for x in input().split()]\r\ns=input()\r\nfor i in range(len(s)-2):\r\n c=s[i:i+3]\r\n if c=='ABC' or c=='ACB' or c=='BCA' or c=='BAC' or c=='CBA' or c=='CAB':\r\n print('Yes')\r\n quit()\r\nprint('No')\r\n\r\n", "a=input()\r\nfor i in range(len(a)-2):\r\n\tb=a[i:i+3]\r\n\tif 'A' in b and 'B' in b and 'C' in b:\r\n\t\tprint('Yes')\r\n\t\texit(0)\r\nprint('No')", "a = input()\r\nif \"ABC\" in a or \"ACB\" in a or \"BAC\" in a or \"BCA\" in a or \"CAB\" in a or \"CBA\" in a:print(\"Yes\")\r\nelse:print(\"No\")", "import re\r\ns = input()\r\npattern = r\"(ABC|ACB|BAC|BCA|CAB|CBA)\"\r\nif re.search(pattern, s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin, stdout\r\n\r\n\r\ns = stdin.readline().strip()\r\nlabel = 0\r\n\r\n\r\ndef check(f):\r\n return f in ['A', 'B', 'C']\r\n\r\n\r\nfor i in range(1, len(s) - 1):\r\n if check(s[i - 1]) and check(s[i]) and check(s[i + 1]) and len(set([s[i - 1], s[i], s[i + 1]])) == 3:\r\n label = 1\r\n\r\nif label:\r\n stdout.write('Yes')\r\nelse:\r\n stdout.write('No')", "s=input()\r\nif len(s)<3:\r\n\tprint(\"NO\")\r\nelse:\r\n\tf=0\r\n\tfor x in range(len(s)-2):\r\n\t\tif s[x]!=\".\" and s[x+1]!=\".\" and s[x+2]!=\".\" and len(set(s[x:x+3]))==3:\r\n\t\t\tf=1\r\n\t\t\tbreak\r\n\tprint([\"NO\",\"YES\"][f==1])", "s = input()\narr = [0]\nt = False\n\nfor i in range(len(s)):\n if s[i] == 'A':\n arr.append(1)\n elif s[i] == 'B':\n arr.append(2)\n elif s[i] == 'C':\n arr.append(3)\n else:\n arr.append(0)\narr.append(0)\nfor i in range(1, len(s) +1):\n a = [False, False, False, False]\n a[arr[i]], a[arr[i -1]], a[arr[i +1]] = True, True, True\n if a[3] and a[1] and a[2]:\n t = True \n break\n\nprint('Yes' if t else 'No')", "s=input()\r\nc=0\r\na=['ABC','ACB','BAC','BCA','CAB','CBA']\r\nfor i in range(6):\r\n if(a[i] in s):\r\n c=1\r\n break\r\nif(c==0):\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "s1=input();\r\nif((\"ABC\" in s1) or (\"ACB\" in s1) or(\"BAC\" in s1) or (\"BCA\" in s1) or (\"CAB\" in s1) or(\"CBA\" in s1)):\r\n\tprint('Yes');\r\nelse:\r\n\tprint('No');", "n = input()\r\np = n.split('.')\r\nk=[]\r\nfor j in range(len(p)):\r\n if 'ABC' in p[j]:\r\n k.append('Yes')\r\n if 'ACB' in p[j]:\r\n k.append('Yes')\r\n if 'BAC' in p[j]:\r\n k.append('Yes')\r\n if 'BCA' in p[j]:\r\n k.append('Yes')\r\n if 'CAB' in p[j]:\r\n k.append('Yes') \r\n if 'CBA' in p[j]:\r\n k.append('Yes')\r\n else:\r\n k.append('No')\r\ny=''\r\ny=y.join(k)\r\nif 'Yes' in y:\r\n print('Yes')\r\nelse:\r\n print('No')", "a = input(); print((\"NO\",\"YES\")[[*\"ABC\"] in map(sorted, zip(a, a[1:], a[2:]))])", "s, t = input(), set('ABC')\r\nprint('Yes' if any(set(s[i:i+3]) == t for i in range(len(s) - 2)) else 'No')", "s = input()\nl = len(s)\nf = 0\nfor i in range(l-2):\n if({s[i], s[i+1], s[i+2]} == {'A', 'B', 'C'}):\n f = 1\n break\nif f==1:\n print('Yes')\nelse:\n print('No')", "def read_nums():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ndef main():\r\n flowers = input()\r\n cells = [set() for x in flowers]\r\n for index, f in enumerate(flowers):\r\n if f == '.':\r\n continue\r\n cells[index].add(f)\r\n if index > 0:\r\n cells[index - 1].add(f)\r\n if index + 1 < len(flowers):\r\n cells[index + 1].add(f)\r\n\r\n for c in cells:\r\n if len(c) == 3:\r\n print('Yes')\r\n return\r\n print('No')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s = input()\r\nfridge = [''] * len(s)\r\nfor i in range(len(s)):\r\n if s[i] != '.':\r\n if i == 0 and len(s) > 2:\r\n fridge[i] += s[i]\r\n fridge[i + 1] += s[i]\r\n elif i == len(s) - 1:\r\n fridge[i] += s[i]\r\n fridge[i - 1] += s[i]\r\n else:\r\n fridge[i] += s[i]\r\n fridge[i + 1] += s[i]\r\n fridge[i - 1] += s[i]\r\nanswer = 'No'\r\nfor i in fridge:\r\n if len(i) == 3 and 'A' in i and 'B' in i and 'C' in i:\r\n answer = 'Yes'\r\nprint(answer)\r\n\r\n", "s=input()\r\na=s.count(\"ABC\")\r\nb=s.count(\"ACB\")\r\nc=s.count(\"BAC\")\r\nd=s.count(\"BCA\")\r\ne=s.count(\"CAB\")\r\nf=s.count(\"CBA\")\r\nz=a+b+c+d+e+f\r\nif z>0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\n\r\nif len(s) < 3:\r\n print('No')\r\nelse:\r\n _set = set(['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA'])\r\n\r\n pattern_match = False\r\n res = ''\r\n\r\n for c in s:\r\n if c == '.':\r\n res = ''\r\n else:\r\n res += c\r\n\r\n if len(res) == 3:\r\n if res in _set:\r\n pattern_match = True\r\n break\r\n else:\r\n res = res[1:]\r\n\r\n if pattern_match:\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "s = input()\r\npossible = False\r\nfor i in range(1, len(s)-1):\r\n if len(set(s[i-1:i+2]))==3 and '.' not in s[i-1:i+2]:\r\n possible = True\r\n\r\nif possible:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s=input()\r\nx=[\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CBA\",\"CAB\"]\r\nf=0\r\nfor i in range(len(x)):\r\n\tif x[i] in s:\r\n\t\tf=1\r\n\t\tbreak\r\nif f==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "z=input()\r\nif 'ABC' in z:\r\n\tprint('Yes')\r\n\tquit()\r\nif 'CBA' in z:\r\n\tprint('Yes')\r\n\tquit()\r\nif 'BCA' in z:\r\n\tprint('Yes')\r\n\tquit()\r\nif 'ACB' in z:\r\n\tprint('Yes')\r\n\tquit()\r\nif 'BAC' in z:\r\n\tprint('Yes')\r\n\tquit()\r\nif 'CAB' in z:\r\n\tprint('Yes')\r\n\tquit()\r\nprint('No')\r\n", "s = input()\r\na = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\r\nprint(\"YES\" if any(x in s for x in a) else \"NO\")", "s=input()\r\nl=[\"ABC\", \"ACB\", \"BAC\", \"BCA\", \"CAB\", \"CBA\"]\r\nfor x in l:\r\n if x in s:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "\nt = list(input())\n\nfor i in range(1, len(t)-1):\n if t[i-1] != '.' and t[i] != '.' and t[i+1] != '.':\n if t[i-1] != t[i] and t[i-1] != t[i+1] and t[i] != t[i+1]:\n print(\"Yes\")\n exit(0)\n\nprint(\"No\")\n", "u = input()\r\nn = len(u)\r\nfor i in range(1, n - 1):\r\n if u[i - 1] != '.' and u[i] != '.' and u[i + 1] != '.':\r\n if u[i - 1] != u[i] and u[i] != u[i + 1] and u[i + 1] != u[i - 1]:\r\n print('Yes')\r\n exit()\r\nprint('No')\r\n", "a=input()\r\nt1=a.find(\"ABC\")\r\nt2=a.find(\"ACB\")\r\nt3=a.find(\"BAC\")\r\nt4=a.find(\"BCA\")\r\nt5=a.find(\"CBA\")\r\nt6=a.find(\"CAB\")\r\nif t1==-1 and t2==-1 and t3==-1 and t4==-1 and t5==-1 and t6==-1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "import itertools\r\ns = \"BAC\"\r\n\r\nflowers = input()\r\nfor perm in itertools.permutations(s, 3):\r\n if \"\".join(perm) in flowers:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "n=input()\r\nt=\"ABC\"\r\nt1=\"ACB\"\r\nt2=\"BAC\"\r\nt3=\"BCA\"\r\nt4=\"CAB\"\r\nt5=\"CBA\"\r\nif t in n or t1 in n or t2 in n or t3 in n or t4 in n or t5 in n:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "baccab = input()\r\nif 'ABC' in baccab:\r\n print('Yes')\r\nelif 'ACB' in baccab:\r\n print('Yes')\r\nelif 'BAC' in baccab:\r\n print('Yes')\r\nelif 'BCA' in baccab:\r\n print('Yes')\r\nelif 'CAB' in baccab:\r\n print('Yes')\r\nelif 'CBA' in baccab:\r\n print('Yes')\r\nelse:\r\n print('No')", "s=input()\r\nprint(\"Yes\"if\"ABC\"in s or \"ACB\"in s or \"BCA\"in s or \"BAC\"in s or \"CBA\"in s or \"CAB\"in s else \"No\")", "s=input()\r\ncells=set('ABC')\r\nflag=False\r\nfor i in range(len(s)-2):\r\n if s[i] in cells and s[i+1] in cells and s[i+2] in cells:\r\n if s[i]!=s[i+1] and s[i+1]!=s[i+2] and s[i]!=s[i+2]:\r\n flag=True\r\n break\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "string = input()\r\na=\"ABC\"\r\nb=\"ACB\"\r\nc=\"BAC\"\r\nd=\"BCA\"\r\ne=\"CAB\"\r\nf=\"CBA\"\r\n\r\nif string.find(a) is not -1 or string.find(b) is not -1 or string.find(c) is not -1 or string.find(d) is not -1 or string.find(e) is not -1 or string.find(f) is not -1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "ar = [\"ABC\", \"ACB\", \"BAC\", \"BCA\", \"CAB\", \"CBA\"]\r\ns = input()\r\nif any(x in s for x in ar):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "# Code Forces: https://codeforces.com/contest/989/problem/A\r\n\r\ngirdi = input()\r\nif \"ABC\" in girdi or \"ACB\" in girdi or \"BAC\" in girdi or \"BCA\" in girdi or \"CBA\" in girdi or \"CAB\" in girdi: print(\"Yes\")\r\nelse: print(\"No\") ", "from itertools import permutations\r\ns=input()\r\nperms = [''.join(p) for p in permutations('ABC')]\r\nflg=1\r\nfor i in perms:\r\n if i in s:\r\n print('YES')\r\n flg=0\r\n break\r\nif flg==1:\r\n print('NO')", "str=input()\n\n\nif \"ABC\" in str or \"ACB\" in str or \"BAC\" in str or\"BCA\" in str or \"CAB\" in str or \"CBA\" in str:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\n\n", "def solution989a():\n s = input()\n flag = False\n patterns = [\"ABC\", \"ACB\", \"BAC\", \"BCA\", \"CAB\", \"CBA\"]\n for pattern in patterns:\n if pattern in s:\n flag = True\n break\n\n print(\"Yes\" if flag else \"No\")\n\n\nif __name__ == '__main__':\n solution989a()\n", "s = input()\r\n\r\n\r\nf = False\r\nfor i in range(len(s) - 2):\r\n x = s[i:i+3]\r\n\r\n if 'A' in x and 'B' in x and 'C' in x:\r\n f= True\r\n break\r\n\r\n# print(s)\r\nprint(\"Yes\" if f else \"No\")", "s=input()\r\nf=0\r\nif len(s)<3:\r\n f=0\r\nelse:\r\n for j in range(0,len(s)-2):\r\n b=s[j:j+3]\r\n if 'A' in b and 'B' in b and 'C' in b:\r\n f=1\r\n break\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n=input()\r\na=['ABC','BCA','CAB','CBA','BAC','ACB']\r\nfor i in range(6):\r\n\tif a[i] in n:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nprint('NO')\t\r\n", "from collections import *\r\nS= input()\r\nc = deque(maxlen=3)\r\n\r\nv = False\r\nfor s in S:\r\n if s == '.':\r\n c = deque(maxlen=3)\r\n else:\r\n c.append(s)\r\n if len(set(c)) == 3:\r\n v = True\r\n break\r\nif v:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def petals(mystr):\r\n if mystr is None:\r\n return \"No\"\r\n \r\n xd = set([\"BAC\", \"ABC\", \"ACB\", \"BCA\", \"CAB\", \"CBA\"])\r\n for i in range(len(mystr) - 2):\r\n cu = mystr[i] + mystr[i+1] + mystr[i+2] \r\n if cu in xd:\r\n return \"Yes\"\r\n \r\n return \"No\"\r\n\r\nprint(petals(str(input())))", "s = input()\r\noutput = 'No'\r\nfor i in range(len(s)-2):\r\n if s[i:i+3] in ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']:\r\n output = 'Yes'\r\n break;\r\n \r\nprint(output)", "s=input()\nprint(('No','Yes')[any(set(x)==set('ABC')for x in zip(s,s[1:],s[2:]))])\n", "s = input().strip()\r\n\r\ntmp = ['ABC','ACB','BAC','BCA','CAB','CBA']\r\nflag = 0\r\nfor st in tmp:\r\n\tif st in s:\r\n\t\tflag = 1\r\n\t\tbreak\r\n\r\nif flag == 1:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n", "s = str(input())\r\noutput = \"No\"\r\nfor j in range(len(s) - 2):\r\n ref = [s[j], s[j + 1], s[j + 2]]\r\n ref.sort()\r\n if ref == ['A', 'B', 'C']:\r\n output = \"Yes\"\r\n break\r\nprint(output)\r\n", "#m = input()\r\n#n = list(map(int,m.split(' ')))\r\n#arr = input()\r\n#l = list(map(int,arr.split(' ')))\r\n#print(n,l)\r\n#print(type(l))\r\n#input()\r\n#print((set(input().split()) - {'0'}))\r\n#a = {9,1,6,1,9,7,5,5,7,9,1}\r\n#print(a)\r\n\r\ns= str(input())\r\narr = ['A','B','C']\r\nl = len(s)\r\nx = []\r\nfor i in range(l):\r\n if s[i] == '.' :\r\n x.append(-100)\r\n elif s[i] == 'A' :\r\n x.append(1)\r\n elif s[i] == 'B' :\r\n x.append(5)\r\n else :\r\n x.append(10)\r\nf=1\r\nfor i in range(l-2):\r\n if x[i]+x[i+1]+x[i+2] == 16 :\r\n print(\"YES\")\r\n f=0\r\n break\r\n\r\nif f == 1 :\r\n print(\"NO\")\r\n", "\"\"\"Problem A - A Blend of Springtime.\n\nhttp://codeforces.com/contest/989/problem/a\n\nThe landscape can be expressed as a row of consecutive cells, each of which\neither contains a flower of colour amber or buff or canary yellow, or is empty.\n\nWhen a flower withers, it disappears from the cell that it originally belonged\nto, and it spreads petals of its colour in its two neighbouring cells (or\noutside the field if the cell is on the side of the landscape). In case petals\nfall outside the given cells, they simply become invisible.\n\nYou are to help Kanno determine whether it's possible that after some\n(possibly none or all) flowers shed their petals, at least one of the cells\ncontains all three colours, considering both petals and flowers. Note that\nflowers can wither in arbitrary order.\n\nInput:\n\nThe first and only line of input contains a non-empty string `s` consisting of\nuppercase English letters 'A', 'B', 'C' and characters '.' (dots) only (`\\lvert\ns \\rvert \\leq 100`) — denoting cells containing an amber flower, a buff one, a\ncanary yellow one, and no flowers, respectively.\n\nOutput:\n\nOutput \"Yes\" if it's possible that all three colours appear in some cell, and\n\"No\" otherwise.\n\nYou can print each letter in any case (upper or lower).\n\n\"\"\"\nimport itertools\n\ndef solve(s):\n perm = [''.join(x) for x in itertools.permutations('ABC')]\n return any(x in s for x in perm)\n\n\ndef main():\n s = input().strip()\n result = solve(s)\n print('Yes' if result else 'No')\n\n\nif __name__ == '__main__':\n main()\n", "#!/usr/bin/env python3\n\ns = input().strip()\n\nci = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\n\nimport sys\nfor c in ci:\n\tif c in s:\n\t\tprint ('Yes')\n\t\tsys.exit()\nprint ('No')\n", "inst = input().strip()\r\ntrc = set('ABC')\r\nfor i in range(len(inst)-2):\r\n if len(set(inst[i:i+3]).intersection(trc)) == 3:\r\n print('Yes')\r\n exit()\r\nprint('No')\r\n", "n=input()\r\nl=0\r\nif len(n)<=2 and l==0:\r\n print('No')\r\n l+=1\r\nelif len(set(n))<3 and l==0:\r\n print('No')\r\n l+=1\r\nelse:\r\n for k in range(len(n)-2):\r\n a=list(n[k:k+3])\r\n a.sort()\r\n if a==['A','B','C']:\r\n print('Yes')\r\n l+=1\r\n break\r\n\r\n if l==0:\r\n print('No')\r\n", "x = input('')\r\nx = x.upper()\r\ncount = 0\r\nfor k in range(1,len(x)-1):\r\n list1 = [x[k-1], x[k], x[k+1]]\r\n list1.sort()\r\n if list1 == ['A', 'B', 'C']:\r\n count = count + 1\r\n\r\nif count == 0:\r\n print('No')\r\nelse:\r\n print('Yes')", "s=input()\r\nk=0\r\nfor i in range(1,len(s)-1):\r\n x=s[i-1:i+2]\r\n if x=='ABC' or x=='ACB' or x=='BAC' or x=='BCA' or x=='CAB' or x=='CBA':\r\n k=1;break\r\nif k==0:print('No')\r\nelse:print('Yes')", "# https://codeforces.com/problemset/problem/989/A\n# 900\n\n\nc = input()\n\no = \"NO\"\nfor i in range(len(c)):\n x = {}\n for f in c[i:i+3]:\n if f != \".\":\n x[f] = 1\n \n if len(x) == 3:\n o = \"YES\"\n break\n\nprint(o)", "s=input()\r\nt=[]\r\nfor i in range(2,len(s)):\r\n t.append(s[i]+s[i-1]+s[i-2])\r\nsett=set([\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"])\r\nflag=0\r\nfor i in t:\r\n if i in sett:\r\n print(\"YES\")\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"NO\")", "field = input()\r\ncond = False\r\nfor i in range(1, len(field)-1):\r\n s = {field[i-1], field[i], field[i+1]}\r\n if \".\" in s:\r\n continue\r\n if len(s) == 3:\r\n cond = True\r\n break\r\nif cond:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\n\r\nif (len(s) <= 2):\r\n print('NO')\r\nelse:\r\n poss = False\r\n for i in range(0, len(s)-2):\r\n if (sorted(s[i:i+3]) == list('ABC')):\r\n poss = True\r\n break\r\n\r\n if poss:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "def solution():\n s = input()\n possibilities = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\n\n for e in possibilities:\n if e in s:\n print('Yes')\n return\n\n print('No')\n\n\nsolution()\n", "line = input()\r\nlist1 = ['A', 'B', 'C']\r\n\r\n\r\nfor a in range(1, len(line)-1):\r\n\tif line[a] in list1:\r\n\t\tif line[a-1] in list1 and line[a+1] in list1:\r\n\t\t\tif line[a-1] != line[a+1] and line[a-1] != line[a] and line[a+1] != line[a]:\r\n\t\t\t\tprint('YES')\r\n\t\t\t\tbreak\r\n\telse:\r\n\t\tcontinue \r\nelse:\r\n\tprint('NO')", "a=input()\r\nb=['ABC','CBA','BAC','CAB','ACB','BCA']\r\nt=0\r\nfor k in range(len(b)):\r\n if b[k] in a:\r\n print('Yes')\r\n t=1\r\n break\r\nif t==0:\r\n print('No')", "s=input()\r\nif(\"BAC\"in s or \"ABC\" in s or \"CAB\" in s or\"BCA\" in s or \"ACB\"in s or \"CBA\"in s):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import re\r\ns = input()\r\n\r\na = re.match(r'.*ABC.*', s)\r\nb = re.match(r'.*BAC.*', s)\r\nc = re.match(r'.*CAB.*', s)\r\nd = re.match(r'.*ACB.*', s)\r\ne = re.match(r'.*BCA.*', s)\r\nf = re.match(r'.*CBA.*', s)\r\nif a or b or c or d or e or f: print(\"Yes\")\r\nelse: print(\"No\")", "flowers = input()\r\n\r\nmoeglich = False\r\nfor i in range(1, len(flowers) - 1):\r\n if {flowers[i - 1], flowers[i], flowers[i + 1]} == {\"A\", \"B\", \"C\"}:\r\n moeglich = True\r\n break\r\n\r\nif moeglich:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# your code goes herefrom itertools import permutations\r\nfrom itertools import permutations\r\nperms = [''.join(p) for p in permutations('ABC')]\r\nflag=0\r\ninp = input()\r\nfor i in range(len(perms)):\r\n if inp.find(perms[i]) != -1:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ns = '.' + s + '.'\r\nfor i in range(1,len(s)-1) :\r\n if s[i] == '.' or s[i-1] == '.' or s[i+1] == '.' :\r\n continue\r\n if s[i-1] != s[i] :\r\n if s[i+1] != s[i] and s[i+1] != s[i-1] :\r\n print('YES')\r\n break \r\nelse :\r\n print('NO')", "s = input()\r\nok = False\r\nn = len(s)\r\nfor index in range(n - 2) :\r\n if s[index : index + 3] in [\"ABC\" , \"ACB\" , \"BAC\" , \"BCA\" , \"CAB\" , \"CBA\"] : \r\n ok = True\r\nprint(\"Yes\" if ok else \"No\")", "u=input()\r\nl1=[]\r\nfor g in range(0,len(u)):\r\n l1.append(u[g])\r\n\r\ns=0\r\nif(len(l1)>=3):\r\n \r\n for gh in range(0,len(l1)-2):\r\n if((l1[gh]=='A' and l1[gh+1]=='B' and l1[gh+2]=='C') or (l1[gh]=='A' and l1[gh+1]=='C' and l1[gh+2]=='B') or (l1[gh]=='C' and l1[gh+1]=='B' and l1[gh+2]=='A') or (l1[gh]=='B' and l1[gh+1]=='A' and l1[gh+2]=='C') or (l1[gh]=='B' and l1[gh+1]=='C' and l1[gh+ 2]=='A') or (l1[gh]=='C' and l1[gh+1]=='A' and l1[gh+2]=='B')):\r\n s=1\r\n break\r\n if(s==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n print(\"No\")", "s=input()\r\na=[\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"]\r\nfor i in a:\r\n if i in s:\r\n print(\"Yes\");\r\n break\r\nelse:print(\"No\")\r\n", "s = input()\r\n\r\nfor i in range(len(s) - 2):\r\n if set(s[i: i + 3]) == {'A', 'B', 'C'}:\r\n print('Yes')\r\n exit()\r\n\r\nprint('No')\r\n", "s = input()\r\nres = (s.find(\"ABC\") != -1) or (s.find(\"ACB\") != -1) or (s.find(\"BAC\") != -1) or (s.find(\"BCA\") != -1) or (s.find(\"CAB\") != -1) or (s.find(\"CBA\") != -1)\r\nprint(\"Yes\" if res else \"No\")\r\n", "s=input()\r\nf=False\r\nfor i in range(len(s)-2):\r\n t=s[i:i+3]\r\n if 'A' in t and 'B' in t and 'C' in t:\r\n f=True\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "#Blend of Springtime\r\ns=input()\r\np=[\"A\",\"B\",\"C\"]\r\nf=0\r\nfor i in range(1,len(s)-1):\r\n if (s[i] in p) and (s[i-1] in p) and (s[i+1] in p) and (s[i]!=s[i-1]) and (s[i]!=s[i+1]) and (s[i-1]!=s[i+1]):\r\n print(\"Yes\")\r\n f=1\r\n break\r\n else:\r\n pass\r\nif f==0:\r\n print(\"No\")", "s = input()\r\nif(\"BAC\" in s or \"ABC\" in s or \"CAB\" in s or \"CBA\" in s or\"BCA\" in s or \"ACB\" in s):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "s=input()\r\nfor i in range(2,len(s)):\r\n if s[i-2:i+1].count('A')==1 and s[i-2:i+1].count('B')==1 and s[i-2:i+1].count('C')==1:\r\n print('Yes')\r\n exit()\r\nprint('No')\r\n", "s = input()\r\nl = ['ABC','ACB','BAC','BCA','CAB','CBA']\r\nflag = False\r\nfor i in range(len(l)):\r\n if l[i] in s:\r\n flag = True\r\n break\r\nif flag == True:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "\r\ns=input().strip()\r\nb=[]\r\nfor i in s:\r\n\tif i=='C':\r\n\t\tb.append(3)\r\n\telif i=='A':\r\n\t\tb.append(1)\r\n\telif i=='B':\r\n\t\tb.append(2)\r\n\telse:\r\n\t\tb.append(0)\r\nn=len(s)\r\na=[0,0,0,0]\r\nif n<3:\r\n\tprint(\"No\")\r\nelse:\r\n\tans=False\r\n\tfor i in range(3):\r\n\t\ta[b[i]]+=1\r\n\tif a==[0,1,1,1]:\r\n\t\tans=True\r\n\telse:\r\n\t\tfor i in range(3,n):\r\n\t\t\ta[b[i-3]]-=1\r\n\t\t\ta[b[i]]+=1\r\n\t\t\tif a==[0,1,1,1]:\r\n\t\t\t\tans=True\r\n\t\t\t\tbreak\r\n\tif ans:\r\n\t\tprint(\"Yes\")\r\n\telse:\r\n\t\tprint(\"No\")", "s=input()\r\nfor i in range(len(s)-2):\r\n if(set(s[i:i+3])==set(\"ABC\")):\r\n print(\"Yes\")\r\n exit(0)\r\nprint(\"No\")", "s = input()\r\nf = 0\r\nfor i in range(len(s)-2):\r\n if s[i:i+3] in (\"ABC\", \"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"):\r\n print(\"Yes\")\r\n f = 1\r\n break\r\nif not f:\r\n print(\"No\")", "s=input()\r\np=['ABC','ACB','BAC','BCA','CAB','CBA']\r\nfor i in p:\r\n\tif(i in s):\r\n\t\tprint('Yes')\r\n\t\texit()\r\nprint('No')", "s = input().split(\".\")\r\ncount = 0\r\n\r\nfor i in s:\r\n if(\"ABC\" in i or \"ACB\" in i or \"BAC\" in i or \"BCA\" in i or \"CAB\" in i or \"CBA\" in i):\r\n count += 1\r\n print(\"Yes\")\r\n break\r\nif(count == 0):\r\n print(\"No\")", "n=input()\r\nl=len(n)\r\nif(l<3):\r\n print(\"No\")\r\nelse:\r\n i=0\r\n j=1\r\n k=2\r\n flag=0\r\n while(k<l):\r\n if((n[i]==\"A\" and n[j]==\"B\" and n[k]==\"C\") or (n[i]==\"A\" and n[j]==\"C\" and n[k]==\"B\") or (n[i]==\"B\" and n[j]==\"A\" and n[k]==\"C\") or (n[i]==\"B\" and n[j]==\"C\" and n[k]==\"A\") or (n[i]==\"C\" and n[j]==\"A\" and n[k]==\"B\") or (n[i]==\"C\" and n[j]==\"B\" and n[k]==\"A\") ):\r\n flag=1\r\n break\r\n else:\r\n i=i+1\r\n j=j+1\r\n k=k+1\r\n if(flag==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "\r\nif __name__ == '__main__':\r\n\r\n str = input()\r\n\r\n flag = False\r\n\r\n for i in range(len(str)-2):\r\n if str[i] == 'A' and str[i+1] == 'B' and str[i+2] == 'C':\r\n print('Yes')\r\n flag = True\r\n break\r\n elif str[i] == 'A' and str[i+1] == 'C' and str[i+2] == 'B':\r\n print('Yes')\r\n flag = True\r\n break\r\n elif str[i] == 'B' and str[i+1] == 'A' and str[i+2] == 'C':\r\n print('Yes')\r\n flag = True\r\n break\r\n elif str[i] == 'B' and str[i+1] == 'C' and str[i+2] == 'A':\r\n print('Yes')\r\n flag = True\r\n break\r\n elif str[i] == 'C' and str[i+1] == 'A' and str[i+2] == 'B':\r\n print('Yes')\r\n flag = True\r\n break\r\n elif str[i] == 'C' and str[i+1] == 'B' and str[i+2] == 'A':\r\n print('Yes')\r\n flag = True\r\n break\r\n\r\n if flag == False:\r\n print('No')\r\n", "S = input()\r\nif 'ACB' in S or 'ABC' in S or 'BAC' in S or 'BCA' in S or 'CBA' in S or 'CAB' in S:\r\n print('YeS')\r\nelse:\r\n print('No')", "L=[\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"]\r\ns=input()\r\nres=\"No\"\r\nfor k in L:\r\n if(k in s):\r\n res=\"Yes\"\r\n break\r\nprint(res)", "s = input()\nif len(s) <= 2:\n print(\"No\")\nelse:\n for i in range(1, len(s) - 1):\n t = \"\".join(sorted(s[i-1:i+2]))\n # print(t)\n if t == \"ABC\":\n print(\"Yes\")\n break\n else:\n print(\"No\")\n", "s=input()\r\na=['ABC','ACB','BAC','BCA','CAB','CBA']\r\nfor i in a:\r\n if i in s:\r\n print('YES')\r\n exit()\r\nprint('no')\r\n", "k=input()\r\ns=[]\r\nfor i in k:\r\n s.append(i)\r\nt=[]\r\nflag=0\r\nfor i in range(len(s)-2):\r\n t=s[i:i+3]\r\n t.sort()\r\n if(t==[\"A\",\"B\",\"C\"]):\r\n flag=1\r\n break\r\nif(flag==1):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n", "l = [\"ABC\", \"ACB\", \"BCA\", \"BAC\", \"CBA\", \"CAB\"]\r\nt = input()\r\nfor i in l:\r\n if i in t:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\n", "a = input()\n\n# b = input()\n# b = [int(s) for s in b.split()]\n\ndef f():\n for i in range (0, ( len(a)-1) ):\n if i>0 and i<len(a)-1:\n if a[i] != a[i-1] and a[i] != a[i+1] and a[i-1] != a[i+1] and a[i] != '.' and a[i-1] != '.' and a[i+1] !='.':\n return \"Yes\"\n return \"No\"\n\n\nprint(f())", "def go():\n s = input()\n x = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\n for i in x:\n if i in s:\n return 'Yes'\n return 'No'\n\nprint(go())\n", "s = input()\r\nn = len(s) - 2\r\ni = 0\r\nerr = 0\r\nwhile i < n and err != 1:\r\n if s[i] + s[i + 1] + s[i + 2] == 'ABC' or s[i] + s[i + 1] + s[i + 2] == 'ACB' or s[i] + s[i + 1] + s[i + 2] == 'BAC' or s[i] + s[i + 1] + s[i + 2] == 'BCA' or s[i] + s[i + 1] + s[i + 2] == 'CAB' or s[i] + s[i + 1] + s[i + 2] == 'CBA':\r\n err = 1\r\n i += 1\r\nif err == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s = input()\r\nfor i in range(2,len(s)):\r\n if sorted(s[i-2:i+1])==[\"A\",\"B\",\"C\"]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "arr = [\"ABC\", \"ACB\", \"BCA\", \"BAC\", \"CAB\", \"CBA\"]\r\ns = input()\r\nfor x in arr:\r\n if x in s:\r\n print(\"Yes\")\r\n exit(0)\r\nprint(\"No\")\r\n", "s = input()\nprint(\"Yes\" if \"ABC\" in s or \"BAC\" in s or \"BCA\" in s or \"ACB\" in s or \"CBA\" in s or \"CAB\" in s else \"No\")", "inp=input()\r\n\r\nflag=0\r\n\r\nif \"ABC\" in inp:\r\n flag=1\r\n \r\nif \"ACB\" in inp:\r\n flag=1\r\n\r\nif \"BAC\" in inp:\r\n flag=1\r\n\r\nif \"BCA\" in inp:\r\n flag=1\r\n \r\nif \"CAB\" in inp:\r\n flag=1\r\n \r\nif \"CBA\" in inp:\r\n flag=1\r\n \r\nif flag==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s=input()\r\na=[\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"]\r\nfor i in range(len(a)):\r\n if a[i] in s:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "s=input()\r\nflag=False\r\nfor i in range(1,len(s)-1):\r\n ls=[s[i-1],s[i],s[i+1]]\r\n ls.sort()\r\n if(ls==[\"A\",\"B\",\"C\"]):\r\n flag=True\r\n break\r\nif(flag):print(\"YES\")\r\nelse:print(\"NO\")", "def main():\n S = input()\n\n l = len(S) - 3\n for i in range(l + 1):\n s = S[i:i+3]\n if all(('A' in s, 'B' in s, 'C' in s)):\n print('Yes')\n break\n else:\n print('No')\n\nmain()\n", "def isThere(a, length):\n for i in range(1,(length-1)):\n if((a[i-1]=='A') and (a[i]=='B') and a[i+1]=='C'): return 1\n elif((a[i-1]=='A') and (a[i]=='C') and a[i+1]=='B'): return 1\n elif((a[i-1]=='B') and (a[i]=='A') and a[i+1]=='C'): return 1\n elif((a[i-1]=='B') and (a[i]=='C') and a[i+1]=='A'): return 1\n elif((a[i-1]=='C') and (a[i]=='A') and a[i+1]=='B'): return 1\n elif((a[i-1]=='C') and (a[i]=='B') and a[i+1]=='A'): return 1\n \n return 0\n\na = input()\nlength = len(a)\nif (isThere(a, length)==1): print('Yes')\nelse: print('No')", "from sys import stdin\r\n\r\nrd = stdin.readline\r\n\r\ns = rd().strip()\r\n\r\nif any(('ABC' in s, 'BAC' in s, 'ACB' in s, 'CBA' in s, 'CAB' in s, 'BCA' in s)):\r\n\r\n print('Yes')\r\nelse: print(\"No\")\r\n \r\n", "a = input(); print(\"YES\" if \"ABC\" in a or \"ACB\" in a or \"BAC\" in a or \"BCA\" in a or \"CAB\" in a or \"CBA\" in a else \"NO\")\r\n", "a = input()\nif \"ABC\" in a or \"ACB\" in a or \"BCA\" in a or \"BAC\" in a or \"CAB\" in a or \"CBA\" in a:\n\tprint(\"YES\")\n\texit()\nprint(\"NO\")\n", "A = input()\r\nf = 1\r\nif 'ABC' in A:\r\n f = 0\r\nif 'ACB' in A:\r\n f = 0\r\nif 'BCA' in A:\r\n f = 0\r\nif 'BAC' in A:\r\n f = 0\r\nif 'CBA' in A:\r\n f = 0\r\nif 'CAB' in A:\r\n f = 0\r\nif f == 0:\r\n print('Yes')\r\nelse:\r\n print('No')", "s=input()\r\nt=\"\"\r\nF={\"A\",\"B\",\"C\"}\r\nfor i in range(len(s)-2):\r\n\tj=i+1\r\n\tk=j+1\r\n\tt+=s[i]\r\n\tt+=s[j]\r\n\tt+=s[k]\r\n\tt=set(t)\r\n\t\r\n\tif t==F:\r\n\t\tprint(\"Yes\")\r\n\t\texit()\r\n\tt=\"\"\r\nprint(\"No\")\r\n", "import re\r\nimport math\r\nimport decimal\r\nimport bisect\r\n\r\ndef read():\r\n\treturn input().strip()\r\n\r\ndef iread():\r\n\treturn int(input().strip())\r\n\r\ndef viread():\r\n\treturn [int(x) for x in input().strip().split()]\r\n\r\n# code goes here\r\nline = read()\r\ncan = False\r\nfor i in range(len(line) - 2):\r\n\tcheck = line[i:i+3]\r\n\tif 'B' in check and 'A' in check and 'C' in check:\r\n\t\tcan = True\r\n\t\tbreak\r\nprint(\"Yes\" if can else \"No\")\r\n", "s = input()\r\nN = len(s)\r\nflag = False\r\nfor i in range(1, N - 1):\r\n if s[i - 1] == \"A\" and s[i] == \"B\" and s[i + 1] == \"C\":\r\n flag = True\r\n elif s[i - 1] == \"A\" and s[i] == \"C\" and s[i + 1] == \"B\":\r\n flag = True\r\n elif s[i - 1] == \"B\" and s[i] == \"A\" and s[i + 1] == \"C\":\r\n flag = True\r\n elif s[i - 1] == \"B\" and s[i] == \"C\" and s[i + 1] == \"A\":\r\n flag = True\r\n elif s[i - 1] == \"C\" and s[i] == \"A\" and s[i + 1] == \"B\":\r\n flag = True\r\n elif s[i - 1] == \"C\" and s[i] == \"B\" and s[i + 1] == \"A\":\r\n flag = True\r\n\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "# flowers = [char for char in list(input()) if char != \".\"]\r\nflowers = input()\r\npermutations = [\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CBA\",\"CAB\"]\r\nfor perm in permutations:\r\n if perm in flowers: print(\"Yes\"); exit()\r\nprint(\"No\")", "s=str(input())\r\nd=s.count('ABC')\r\ne=s.count('BAC')\r\nf=s.count(\"CAB\")\r\ng=s.count('CBA')\r\nh=s.count('ACB')\r\ni=s.count('BCA')\r\nif(d>0 or e>0 or f>0 or g>0 or h>0 or i>0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "inp = input()\r\nf = [\"ABC\",\"BCA\",\"CAB\",\"ACB\",\"BAC\",\"CBA\"]\r\nd = 0\r\nfor i in f:\r\n d += inp.count(i)\r\nprint(\"Yes\" if d > 0 else \"No\")", "mas = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\r\ns = input()\r\nans = False\r\nfor item in mas:\r\n if s.find(item) != -1:\r\n ans = True\r\n break\r\nif ans:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\nans = \"No\"\r\nfor i in range(len(s) - 2):\r\n u = set()\r\n for j in range(3):\r\n if s[i + j] ^ 46:\r\n u.add(s[i + j])\r\n if len(u) == 3:\r\n ans = \"Yes\"\r\n break\r\nprint(ans)", "def solve(s):\r\n for i in range(len(s) - 2):\r\n if ''.join(sorted(s[i:i+3])) == 'ABC':\r\n return 'Yes'\r\n return 'No'\r\n\r\ns = input()\r\nprint(solve(s))", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nl = list(get_string())\r\ns = {'A','B','C'}\r\n\r\nflag = False\r\nfor i in range(len(l)-2):\r\n if set(l[i:i+3]) == s:\r\n flag = True\r\n break\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = str(input())\nif len(s) < 3:\n print('No')\n exit()\nn = len(s)\nfor i in range(n-2):\n temp = {s[i], s[i+1], s[i+2]}\n flag = True\n for c in ('A', 'B', 'C'):\n if c not in temp:\n flag = False\n break\n if flag:\n print('Yes')\n exit()\nprint('No')\n", "s=input()\nl=len(s)\nflag=0\nfor i in range(l-2):\n\tif s[i:i+3]==\"ABC\" or s[i:i+3]==\"ACB\" or s[i:i+3]==\"BAC\" or s[i:i+3]==\"BCA\" or s[i:i+3]==\"CAB\" or s[i:i+3]==\"CBA\" :\n\t\tflag=1\n\t\t#print(\"yes\")\n\t\tbreak\nif flag==1:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\t", "s = input()\r\nx = False\r\n\r\nif s.count('ABC') or s.count('ACB') or s.count('BAC') or s.count('BCA') or s.count('CAB') or s.count('CBA'):\r\n x = True\r\n print('Yes')\r\nelse:\r\n print('No')", "# def iscommon(a, b):\r\n# for i in range(2, min(a, b) + 1):\r\n# if a % i == b % i == 0:\r\n# return True\r\n# else:\r\n# return False\r\n\r\n# for _ in range(int(input())):\r\n# n = int(input())\r\n# arr = [int(i) for i in input().split()]\r\n# cnt = n\r\n# for i in range(n - 1):\r\n# for j in range(i + 1, n):\r\n# if iscommon(arr[i], arr[j]):\r\n# cnt -= 1\r\n# break\r\n# print(cnt)\r\ns = input()\r\ncheck = {'ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA'}\r\nif any(i in s for i in check):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jun 16 20:11:34 2018\r\n\r\n@author: Sagar Gupta\r\n\"\"\"\r\n\r\na = input()\r\na = list(a)\r\n\r\n# Preprocessing\r\nfor i in range(len(a)):\r\n if a[i] == 'A':\r\n a[i] = 1\r\n elif a[i] == 'B':\r\n a[i] = 2\r\n elif a[i] == 'C':\r\n a[i] = 3 \r\n else:\r\n a[i] = 100\r\npossible = False\r\n#Checking for possiblility\r\nfor i in range(1,len(a)-1):\r\n if a[i-1]^a[i]^a[i+1] == 0:\r\n possible = True\r\n\r\nif possible == True:\r\n print('Yes')\r\nelse: \r\n print('No')", "from itertools import permutations\r\n\r\n\r\ndef mix(s):\r\n perms, flag = [''.join(p) for p in permutations(\"ABC\")], False\r\n for elem in perms:\r\n if elem in s:\r\n flag = True\r\n break\r\n if flag:\r\n return \"Yes\"\r\n return \"No\"\r\n\r\n\r\nprint(mix(input()))\r\n", "arr = input().lower()\r\nif \"abc\" in arr or \"acb\" in arr or \"bac\" in arr or \"bca\" in arr or \"cab\" in arr or \"cba\" in arr:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "#JMD\r\n#Nagendra Jha-4096\r\n \r\n#a=list(map(int,sys.stdin.readline().split(' ')))\r\n#n,k,s= map(int, sys.stdin.readline().split(' '))\r\n \r\nimport sys\r\nimport math\r\nfrom itertools import permutations\r\n#import fractions\r\n#import numpy\r\n \r\n###File Operations###\r\nfileoperation=0\r\nif(fileoperation):\r\n orig_stdout = sys.stdout\r\n orig_stdin = sys.stdin\r\n inputfile = open('W:/Competitive Programming/input.txt', 'r')\r\n outputfile = open('W:/Competitive Programming/output.txt', 'w')\r\n sys.stdin = inputfile\r\n sys.stdout = outputfile\r\n\r\n###Defines...###\r\nmod=1000000007\r\n \r\n###FUF's...###\r\ndef nospace(l):\r\n ans=''.join(str(i) for i in l)\r\n return ans\r\n \r\n \r\n \r\n##### Main ####\r\ns=str(input())\r\nperms = [''.join(p) for p in permutations(\"ABC\")]\r\nflag=0\r\nfor pp in perms:\r\n\tif(str(pp) in s):\r\n\t\tflag=1\r\n\t\tbreak\r\nif(flag):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n\t\r\n \r\n#####File Operations#####\r\nif(fileoperation):\r\n sys.stdout = orig_stdout\r\n sys.stdin = orig_stdin\r\n inputfile.close()\r\n outputfile.close()", "s = input()\r\ntarget = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\r\nans = 'NO'\r\nfor i in range(len(target)):\r\n a = s.find(target[i])\r\n if a != -1:\r\n ans = 'YES'\r\n break\r\nprint(ans)", "s=str(input()).upper()\r\na=['ABC','BCA','CAB','BAC','CBA','ACB']\r\nb=0\r\nfor i in range(len(a)):\r\n if a[i] in s:\r\n b=1\r\nif b==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "color = input()\r\nfor item in ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']:\r\n if item in color:\r\n print('Yes')\r\n break\r\nelse:\r\n print('No')\r\n \r\n", "from itertools import permutations\r\npermutations_ = list(permutations([\"A\", \"B\", \"C\"]))\r\npermutations_ = [\"\".join(item) for item in permutations_]\r\ns = input().upper()\r\nflag = False\r\nfor i in range(len(permutations_)):\r\n if permutations_[i] in s:\r\n flag = True\r\n break\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s=input()\r\nl=[\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"]\r\nif any(i in s for i in l):print(\"YES\")\r\nelse:print(\"NO\")\r\n", "last = pre_last = '.'\r\nfor cur in input():\r\n\tif ''.join(sorted(cur+last+pre_last)) == \"ABC\":\r\n\t\tprint(\"Yes\")\r\n\t\tbreak\r\n\tpre_last = last\r\n\tlast = cur\r\nelse:\r\n\tprint(\"No\")\r\n", "s = input()\r\nn = len(s)\r\nans = \"NO\"\r\nif n < 3:\r\n print(ans)\r\nelse:\r\n for i in range(1, n - 1):\r\n if len(set(s[i-1:i+2].replace(\".\", \"\"))) == 3:\r\n ans = \"YES\"\r\n break\r\n \r\n print(ans)", "S = input()\r\nposs = [\"ABC\", \"CBA\", \"BAC\", \"CAB\", \"BCA\", \"ACB\"]\r\n\r\npresent = False\r\nfor i in poss:\r\n if i in S:\r\n present = True\r\n break\r\nif present == True:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n = input()\r\n\r\nif 'ABC' in n or 'BCA' in n or 'CAB' in n or 'ACB' in n or 'BAC' in n or 'CBA' in n :\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s=str(input())\r\nif s.count('BAC')>0 or s.count('ABC')>0 or s.count('CAB')>0 or s.count('BCA')>0 or s.count('CBA')>0 or s.count('ACB')>0:\r\n print('Yes')\r\nelse:\r\n print('No')", "l=input()\r\nc=len(l)\r\ncc=0\r\nfor i in range(c):\r\n if(l[i]=='A'):\r\n if( i+1<c and l[i+1]=='B'):\r\n if(i+2<c and l[i+2]=='C'):\r\n print(\"Yes\")\r\n cc+=1\r\n break\r\n elif(i+1<c and l[i+1]=='C'):\r\n if(i+2<c and l[i+2]=='B'):\r\n print(\"Yes\")\r\n cc+=1\r\n break\r\n elif(l[i]=='B'):\r\n if(i+1<c and l[i+1]=='A'):\r\n if(i+2<c and l[i+2]=='C'):\r\n print(\"Yes\")\r\n cc+=1\r\n break\r\n elif(i+1<c and l[i+1]=='C'):\r\n if(i+2<c and l[i+2]=='A'):\r\n print(\"Yes\")\r\n cc+=1\r\n break\r\n elif(l[i]=='C'):\r\n if(i+1<c and l[i+1]=='A'):\r\n if(i+2<c and l[i+2]=='B'):\r\n print(\"Yes\")\r\n cc+=1\r\n break\r\n elif(i+1<c and l[i+1]=='B'):\r\n if(i+2<c and l[i+2]=='A'):\r\n print(\"Yes\")\r\n cc+=1\r\n break\r\nif(cc==0):\r\n print(\"No\")", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nstring = input().strip()\r\nlength = len(string)\r\n\r\nans = False\r\ncount = {\"A\":0, \"B\":0, \"C\":0}\r\ntarget_count = {\"A\":1, \"B\":1, \"C\":1}\r\n\r\n\r\nfor i in range(min(3, length)):\r\n x = string[i]\r\n if x in count:\r\n count[x] +=1\r\n\r\nif count == target_count:\r\n ans = True\r\n\r\nelse:\r\n for j in range(3, length):\r\n y = string[j]\r\n if y in count:\r\n count[y] +=1\r\n x = string[j-3]\r\n if x in count:\r\n count[x] -=1 \r\n if count == target_count:\r\n ans = True\r\n break\r\n\r\nprint(\"yes\" if ans else \"no\")\r\n\r\n\r\n\r\n", "\r\ns = input()\r\na = ['ABC', 'BAC', 'CBA', 'BCA', 'ACB', 'CAB']\r\nf = True\r\nfor i in range(len(a)):\r\n if a[i] in s:\r\n f = False\r\nprint('No' if f is True else 'Yes')\r\n\r\n# Codeforcesian\r\n# ♥\r\n", "s = input()\r\nd = {'A':0, 'B':0, 'C':0, '.':0}\r\nf = False\r\nfor i in range(0, len(s)):\r\n d[s[i]] += 1\r\n if i > 2:\r\n d[s[i - 3]] -= 1\r\n if d['A'] and d['B'] and d['C']:\r\n f = True\r\nif f:\r\n print('Yes')\r\nelse:\r\n print('No')", "l = list(x for x in input().replace(\"BB\",\"B.B\").replace(\"AA\",\"A.A\").replace(\"CC\",\"C.C\").split(\".\") if len(x)>=3)\r\nc=\"No\"\r\nfor i in l:\r\n s=set(i)\r\n if(len(s)==3):\r\n c=\"Yes\"\r\n break\r\nprint(c)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 9 20:54:34 2020\r\n\r\n@author: MridulSachdeva\r\n\"\"\"\r\n\r\ns = input()\r\n\r\nfor i in range(len(s) - 2):\r\n if ''.join(sorted(s[i:i+3])) == 'ABC':\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "# import collections\r\n\r\ns = input()\r\n\r\na = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\r\n\r\nfor i in range(len(a)):\r\n if s.find(a[i]) != -1:\r\n print('Yes')\r\n exit()\r\n\r\nprint('No')", "a=input()\r\nif(a.find('ABC')>=0 or a.find('ACB')>=0 or a.find('BAC')>=0 or a.find('BCA')>=0 or a.find('CAB')>=0 or a.find('CBA')>=0):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# t = int(input())\nt = 1\n\n\n# # n, m = map(int, input().split())\n# # a = list(map(int, input().split()))\ndef solution(s):\n for i in range(len(s) - 2):\n a = s[i : i + 3]\n if len(set(a)) == 3 and \".\" not in a:\n return True\n\n return False\n\n\nwhile t != 0:\n # n = int(input())\n # n, x, y = map(int, input().split())\n # a = list(map(int, input().split()))\n s = input()\n if solution(s):\n print(\"YES\")\n else:\n print(\"NO\")\n t -= 1\n", "s = input()\r\n\r\nfor i in range(len(s) - 1):\r\n x = s[i - 1:i + 2]\r\n if set(x) == {'A', 'B', 'C'}:\r\n print('Yes')\r\n exit(0)\r\nprint('No')\r\n", "from itertools import permutations\r\n\r\npat = ['A', 'B', 'C']\r\ns = input()\r\n\r\nans = False\r\nfor p in permutations(pat):\r\n p = ''.join(p)\r\n ans = ans or (s.find(p)>=0)\r\n\r\nprint(\"Yes\" if ans else \"No\")", "s = input()\r\na = ['ABC', 'ACB', 'BCA', 'BAC', 'CAB', \"CBA\"]\r\nfor i in range(len(s) - 2):\r\n if s[i:i + 3] in a:\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")", "t=input()\r\ncount=0\r\nfor i in range(1,len(t)-1):\r\n if(t[i].isalpha()):\r\n if(t[i]=='A'):\r\n if(t[i-1]=='B'):\r\n if(t[i+1]=='C'):\r\n count=count+1\r\n if(t[i-1]=='C'):\r\n if(t[i+1]=='B'):\r\n count=count+1\r\n if(t[i]=='B'):\r\n if(t[i-1]=='A'):\r\n if(t[i+1]=='C'):\r\n count=count+1\r\n# print(\"3\")\r\n if(t[i-1]=='C'):\r\n if(t[i+1]=='A'):\r\n count=count+1\r\n# print(\"4\")\r\n if(t[i]=='C'):\r\n if(t[i-1]=='A'):\r\n if(t[i+1]=='B'):\r\n count=count+1\r\n# print(\"5\")\r\n if(t[i-1]=='B'):\r\n if(t[i+1]=='A'):\r\n count=count+1\r\n# print(\"6\")\r\n#print(count)\r\nif(count>0):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "p=input()\r\na=\"No\"\r\ne={\"A\",\"B\",\"C\"}\r\nfor i in range(len(p)-2):\r\n t=set(list(p[i:i+3]))\r\n if t==e:\r\n a=\"Yes\"\r\n break\r\nprint(a)", "s = str(input())\r\n\r\nn = len(s)\r\n\r\nprev = '.'\r\nans = False\r\nfor i in range(1, n- 1):\r\n leaves = set()\r\n\r\n for j in [-1, 0, 1]:\r\n if s[i + j] != '.':\r\n leaves.add(s[i + j])\r\n\r\n if len(leaves)==3:\r\n ans = True\r\n\r\n \r\n\r\n\r\nif ans:\r\n print(\"Yes\")\r\nelse:\r\n print('No')\r\n", "s = input()\r\nprint('Yes' if any(sorted(s[i:i+3])==['A','B','C'] for i in range(len(s))) else 'No')\r\n ", "a=input()\r\nif ('ABC' in a) or ('ACB' in a) or ('BCA' in a) or ('BAC' in a) or ('CAB' in a) or ('CBA' in a):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "from itertools import permutations\np = map(''.join, permutations('ABC', 3))\ni = input()\nfor p1 in p:\n if p1 in i:\n print('Yes')\n exit(0)\nprint('No')", "s=input()\r\nans=\"No\"\r\nfor i in range(1, len(s)-1):\r\n if s[i-1]=='.' or s[i]=='.' or s[i+1]=='.': continue\r\n if s[i-1]==s[i] or s[i-1]==s[i+1] or s[i]==s[i+1]: continue\r\n ans=\"Yes\"\r\nprint(ans)\r\n \r\n", "def cvety(l):\r\n for i in range(0,len(l)-2):\r\n s = ''.join(l[i:i+3]) \r\n if (\"A\" in s) and (\"B\" in s) and (\"C\" in s): return(\"YES\")\r\n return(\"NO\")\r\nl = list(input())\r\nprint(cvety(l))", "s = input()\r\nn = len(s)\r\nans = 'No'\r\nfor i in range(2, n):\r\n if set(list(s[i - 2 : i + 1])) == set(['A','B','C']):\r\n ans = 'Yes'\r\n break\r\nprint(ans)", "s = input()\r\nans = 'No'\r\ni = 0\r\nif len(s) > 2:\r\n while i != len(s) - 2 and ans == 'No':\r\n a = set()\r\n a.add(s[i])\r\n a.add(s[i + 1])\r\n a.add(s[i + 2])\r\n if '.' not in a and len(a) == 3:\r\n ans = 'Yes'\r\n i += 1\r\nprint(ans)", "string = input()\r\nflag = False\r\nfor i in range(len(string) - 2):\r\n\tpack = string[i] + string[i+1] + string[i+2]\r\n\tif pack in ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']:\r\n\t\tprint('YES')\r\n\t\tflag = True\r\n\t\tbreak\r\nif not flag:\r\n\tprint('NO')", "\r\ndef solve(s):\r\n l = len(s)\r\n for i in range(1,l-1):\r\n st = set()\r\n if s[i-1] != '.':\r\n st.add(s[i-1])\r\n if s[i] != '.':\r\n st.add(s[i])\r\n if s[i+1] != '.':\r\n st.add(s[i+1])\r\n if len(st) == 3:\r\n return 'yes' \r\n return 'no'\r\n\r\n\r\ns = input()\r\nprint ( solve(s))\r\n", "s=input()\r\n\r\nif (('ABC' in s) or ('BCA' in s) or ('ACB' in s) or ('BAC' in s) or ('CAB' in s) or ('CBA' in s)) :\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\") ", "s = input()\nfor i in range(len(s) - 2):\n if sorted(s[i:i + 3]) == ['A', 'B', 'C']:\n print(\"Yes\")\n break\nelse:\n print(\"No\")", "import sys\nb=['ABC','ACB','BAC','BCA','CAB','CBA']\na=input()\nfor x in range(0,len(a)-2):\n\tif a[x:x+3] in b:\n\t\tprint(\"Yes\")\n\t\tsys.exit()\nprint(\"No\")\n\n", "x= input()\r\nif('ABC' in x or 'ACB' in x or 'BAC'in x or 'BCA' in x or 'CAB' in x or 'CBA'in x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\n\r\np=['ABC','ACB','BAC','BCA','CAB','CBA']\r\nfor i in p:\r\n if i in s:\r\n c=True\r\n break\r\n else:\r\n c=False\r\n\r\nif c:\r\n print('Yes')\r\nelse:\r\n print('No')", "import sys\ns = sys.stdin.readline().strip()\nprint('Yes' if any(x in s for x in ['ABC', 'ACB', 'BCA', 'BAC', 'CAB', 'CBA']) else 'No')\n", "\r\nli=['ABC','ACB','BAC','BCA','CBA','CAB']\r\ninp=input()\r\nfor i in li:\r\n if i in inp:\r\n print('Yes')\r\n exit(0)\r\n \r\nprint('No')", "n=input()\r\nif n.find('ABC')>=0 or n.find('ACB')>=0 or n.find('BAC')>=0 or n.find('BCA')>=0 or n.find('CAB')>=0 or n.find('CBA')>=0:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n\r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nJust check groups of 3? for A,B, and C?\r\n'''\r\n\r\ndef solve():\r\n s = I().strip()\r\n match = set([x for x in 'ABC'])\r\n valid = False\r\n for i in range(2, len(s)):\r\n if set([s[i-2], s[i-1], s[i]]) == match:\r\n valid = True\r\n break\r\n print(\"Yes\" if valid else \"No\")\r\n\r\nsolve()", "cells = input()\r\nanswer = \"No\"\r\nfor i in range(1, len(cells) - 1):\r\n\tpotential_colors = set()\r\n\tpotential_colors.update(cells[i-1 : i+2])\r\n\tif len(potential_colors) == 3 and '.' not in potential_colors:\r\n\t\tanswer = \"Yes\"\r\n\t\tbreak\r\n\r\nprint(answer)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()\r\nif any(sorted(s[i:i+3]) == ['A','B','C'] for i in range(len(s))):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nif \"ABC\" in s:\r\n print(\"Yes\")\r\nelif \"BCA\" in s:\r\n print(\"Yes\")\r\nelif \"CAB\" in s:\r\n print(\"Yes\")\r\nelif \"ACB\" in s:\r\n print(\"Yes\")\r\nelif \"BAC\" in s:\r\n print(\"Yes\")\r\nelif \"CBA\" in s:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s = input()\r\no = [\"\".join(sorted(s[i:i+3])) for i in range(len(s)-2)]\r\nprint((\"No\", \"Yes\")[\"ABC\" in o])", "s = input()\r\nif 'ABC' in s:\r\n print('Yes')\r\n quit()\r\nif 'ACB' in s:\r\n print('Yes')\r\n quit()\r\nif 'BCA' in s:\r\n print('Yes')\r\n quit()\r\nif 'BAC' in s:\r\n print('Yes')\r\n quit()\r\nif 'CAB' in s:\r\n print('Yes')\r\n quit()\r\nif 'CBA' in s:\r\n print('Yes')\r\n quit()\r\nprint('No')", "s=input()\r\nl=['ABC','ACB','BAC','BCA','CAB','CBA']\r\nfor i in l :\r\n if i in s :\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "# take risk at the edge of Accepted\r\nStr = input()\r\nfor par in ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']:\r\n if par in Str:\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n", "from collections import Counter\r\nimport string\r\nimport math\r\nimport sys\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(number_of_variables):\r\n if number_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if number_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\nfrom fractions import Fraction\r\nmod=100000007\r\nif 1:\r\n s=input()\r\n h=s.find('ACB')\r\n k=s.find('ABC') \r\n t=s.find('BCA')\r\n u=s.find('CAB')\r\n v=s.find('CBA')\r\n w=s.find('BAC')\r\n if k+t+v+u+h+w==-6:\r\n print('No')\r\n else:\r\n print('Yes')", "\r\n\r\n\r\n\r\ns = input()\r\n\r\nlens = int(len(s))\r\n\r\n\r\nfor i in range(lens - 2):\r\n\r\n if s[i:i+3] in ['ABC','ACB','BAC','BCA','CAB','CBA']:\r\n print('Yes')\r\n break\r\nelse:\r\n print('No')\r\n\r\n", "l = input()\nif \"ABC\" in l or \"ACB\" in l or \"BCA\" in l or \"BAC\" in l:\n print(\"Yes\")\nelif \"CAB\" in l or \"CBA\" in l:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "s = input()\r\nflag = 0\r\nfor i in range(len(s)-2):\r\n if s[i:i+3] == 'BAC' or s[i:i+3] == 'ABC' or s[i:i+3] == 'CAB' or s[i:i+3] == 'ACB' or s[i:i+3] == 'BCA' or s[i:i+3] == 'CBA':\r\n flag = 1\r\n print(\"Yes\")\r\n break\r\n \r\n\r\nif flag != 1:\r\n print('No')", "s = input()\r\n\r\nfor i in range(len(s) - 2):\r\n st = s[i:i+3]\r\n if ''.join(sorted(st)) == 'ABC':\r\n print('Yes')\r\n exit(0)\r\n\r\nprint('No')", "def f(l,s):\r\n\tfor i in l:\r\n\t\tif i in s:\r\n\t\t\treturn \"Yes\"\r\n\treturn \"No\"\r\ns=input()\r\nl=[\"ABC\",\"BAC\",\"BCA\",\"ACB\",\"CBA\",\"CAB\"]\r\nprint(f(l,s))", "r=input()\r\na=['A','B','C']\r\nle=len(r)\r\nfor i in range(le-2):\r\n\tl=list(r[i:i+3])\r\n\tl.sort()\r\n\tif l==a:\r\n\t\tprint (\"Yes\")\r\n\t\texit(0)\r\nprint (\"No\")\r\n", "import sys\r\nimport math\r\ns = input()\r\narr = ['ABC','ACB','BAC','BCA','CAB','CBA']\r\nfor i in arr:\r\n if(i in s):\r\n print('Yes')\r\n exit()\r\nprint('No')", "s=input().strip()\r\nflag=0\r\nfor i in range(len(s)-2):\r\n t=s[i:i+3]\r\n if \"A\" in t and \"B\" in t and \"C\" in t:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a = input()\r\nsub = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\r\ncount = -1\r\nfor i in sub:\r\n count = max(a.find(i), count)\r\n\r\nif count == -1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "st=input()\r\nfor i in range(1,len(st)-1):\r\n \ts=set({st[i-1],st[i],st[i+1]});\r\n \tif len(s)==3:\r\n \t br=False\r\n \t for j in s:\r\n \t if j=='.':\r\n \t br=1\r\n \t break\r\n \t if br==0:\r\n \t print('Yes');\r\n \t exit(0);\r\n \ts.clear()\r\nprint('No')\r\nexit(0);", "a = list(input())\r\nk = 0\r\nfor i in range(len(a)-2):\r\n if a[i] == 'A' and a[i+1] == 'B' and a[i+2] == 'C' or a[i] == 'B' and a[i+1] == 'C' and a[i+2] == 'A' or a[i] == 'A' and a[i+1] == 'C' and a[i+2] == 'B' or a[i] == 'B' and a[i+1] == 'A' and a[i+2] == 'C' or a[i] == 'C' and a[i+1] == 'B' and a[i+2] == 'A' or a[i] == 'C' and a[i+1] == 'A' and a[i+2] == 'B':\r\n k += 1\r\n break\r\nif k >= 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "s = input()\na = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\nprint (['No', 'Yes'][any(i in s for i in a)])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 16 17:01:52 2018\r\n\r\n@author: kartik\r\n\"\"\"\r\n\r\ns=str(input())\r\nflag = 0\r\na=[\"ABC\", \"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"]\r\nfor i in a:\r\n if i in s:\r\n flag = 1\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nm=[\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"]\r\nfor t in m:\r\n if t in s:\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "import sys\r\nimport math\r\n\r\n\r\ndef scan(input_type='int'):\r\n if input_type == 'int':\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n else:\r\n return list(map(str, sys.stdin.readline().strip()))\r\n\r\n\r\ndef solution():\r\n # for _ in range(int(input())):\r\n n = input()\r\n if 'ABC' in n or 'BAC' in n or 'BCA' in n or 'ACB' in n or 'CAB' in n or 'CBA' in n:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()\r\n", "some_chars=input()\r\nverdict1=some_chars.find(\"BAC\")\r\nverdict2=some_chars.find(\"ABC\")\r\nverdict3=some_chars.find(\"BCA\")\r\nverdict4=some_chars.find(\"CBA\")\r\nverdict5=some_chars.find(\"CAB\")\r\nverdict6=some_chars.find(\"ACB\")\r\nif verdict1!=-1 or verdict2!=-1 or verdict3!=-1 or verdict4!=-1 or verdict5!=-1 or verdict6!=-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "field = input()\r\n\r\ndef check(string):\r\n matches = [\"ABC\", \"ACB\", \"BAC\", \"BCA\", \"CAB\", \"CBA\"]\r\n if any([bingo in string for bingo in matches]):\r\n return \"Yes\"\r\n return \"No\"\r\n\r\nprint(check(field))", "s=input()\r\na=[\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"]\r\nfor x in a:\r\n\tif x in s:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "s=input()\r\nif 'BAC'in s or 'ABC'in s or 'BCA'in s or 'CAB'in s or 'CBA'in s or 'ACB'in s :\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n", "\r\n\r\n\r\n\r\ns = input()\r\n\r\nlens = int(len(s))\r\n\r\n\r\nfor i in range(lens - 2):\r\n\r\n se = set(s[i:i+3])\r\n # print(se)\r\n if se.__len__() == 3 and '.' not in se:\r\n print('Yes')\r\n break\r\nelse:\r\n print('No')\r\n\r\n", "a = input()\r\ndef prov(a, b, c):\r\n point = 0\r\n if a == \"A\" or b == \"A\" or c == \"A\":\r\n point += 1\r\n if a == \"B\" or b == \"B\" or c == \"B\":\r\n point += 1\r\n if a == \"C\" or b == \"C\" or c == \"C\":\r\n point += 1\r\n if point == 3:\r\n return 1\r\n else:\r\n return 0\r\nfor i in range(1, len(a) - 1):\r\n if prov(a[i-1], a[i], a[i+1]):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "s=input()\r\nif ('ABC' in s)+('ACB' in s)+('BAC' in s)+('BCA' in s)+('CAB' in s)+('CBA' in s)>=1:\r\n print('Yes')\r\nelse:print('No')", "s = input()\r\ns = s.split(\".\")\r\n\r\npos = [\"ABC\",\"ACB\",\"BAC\",\"BCA\",\"CAB\",\"CBA\"]\r\nthree = False\r\n\r\nfor i in range(len(s)):\r\n for j in range(len(pos)):\r\n if pos[j] in s[i]:\r\n three = True\r\n\r\nif three == True:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndata = input().rstrip()\r\n\r\nans = False\r\nfor i in range(1, len(data) - 1):\r\n if {data[i], data[i - 1], data[i + 1]} == {'A', 'B', 'C'}:\r\n ans = True\r\n break\r\n\r\nprint(\"YES\" if ans else \"NO\")", "\r\ns = input()\r\nn = len(s)\r\nfor i in range(n-2):\r\n\tc = s[i]\r\n\tc1 = s[i + 1]\r\n\tc2 = s[i + 2]\r\n\tif c == '.' or c1 == '.' or c2 == '.':\r\n\t\tcontinue\r\n\r\n\tif c1 == c:\r\n\t\tcontinue\r\n\r\n\tif c != c2 and c1 != c2:\r\n\t\tprint('Yes')\r\n\t\tbreak\r\nelse:\r\n\tprint('No')", "a = list(input())\r\nfor i in range(len(a)):\r\n\tif a[i]=='.':\r\n\t\ta[i] = 1\r\n\telif a[i]=='B':\r\n\t\ta[i] = 2\r\n\telif a[i]=='C':\r\n\t\ta[i] = 3\r\n\telse:\r\n\t\ta[i] = 4\r\nc = a.copy()\r\nflag = 0\r\nif len(a)<=2:\r\n\tprint ('No')\r\nelse:\r\n\tif a[0]!='.':\r\n\t\ta[1]*=c[0]\r\n\tif a[-1]!='.':\r\n\t\ta[-2]*=c[-1]\r\n\tfor i in range(1, len(a)-1):\r\n\t\ta[i+1]*=c[i]\r\n\t\ta[i-1]*=c[i]\r\n\tif 24 in a:\r\n\t\tprint ('Yes')\r\n\telse:\r\n\t\tprint ('No')", "string = input()\ncnt = string.find('ABC') + string.find('ACB') + string.find('BAC') + string.find('BCA') + string.find('CAB')+ string.find('CBA') + 6\n\nif cnt > 0:\n print('Yes')\nelse:\n print('No')\n", "s = input()\r\nprint('Yes' if any(set(s[i:i + 3]) == set('ABC') for i in range(len(s) - 2)) else 'No')", "s = input()\r\nif s.count(\"ABC\") or s.count(\"ACB\") or s.count(\"BAC\") or s.count(\"BCA\") or s.count(\"CAB\") or s.count(\"CBA\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input().split(\".\")\nans = 0\nwhile(\"\" in s):\n s.remove(\"\")\n\nfor i in range(len(s)):\n if(len(s[i]) > 2):\n for j in range(2,len(s[i])):\n if(s[i][j] != s[i][j-1] and s[i][j] != s[i][j-2] and s[i][j-1] != s[i][j-2]):\n ans = 1\n break\n else:\n pass\n \nif(ans == 0):\n print(\"No\")\nelse:\n print(\"Yes\")\n\n \t \t \t \t \t\t \t\t \t \t \t", "flower=input()\r\nif(\"BAC\" in flower or \"CAB\" in flower or \"ABC\" in flower or \"CBA\" in flower or \"ACB\" in flower or \"BCA\" in flower):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# cook your dish here\r\nn=input()\r\nfor i in range(1,len(n)-1):\r\n if(n[i]!='.'):\r\n if(n[i-1]=='B' and n[i+1]=='C' and n[i]=='A'):\r\n print(\"YES\")\r\n exit(0)\r\n elif(n[i-1]=='C' and n[i+1]=='B' and n[i]=='A'):\r\n print(\"YES\")\r\n exit(0)\r\n elif(n[i-1]=='A' and n[i+1]=='C' and n[i]=='B'):\r\n print(\"YES\")\r\n exit(0)\r\n elif(n[i-1]=='C' and n[i+1]=='A' and n[i]=='B'):\r\n print(\"YES\")\r\n exit(0)\r\n elif(n[i-1]=='A' and n[i+1]=='B' and n[i]=='C'):\r\n print(\"YES\")\r\n exit(0)\r\n elif(n[i-1]=='B' and n[i+1]=='A' and n[i]=='C'):\r\n print(\"YES\")\r\n exit(0)\r\n \r\nprint('NO')\r\n", "l = input()\r\n\r\nco = ['ABC', 'ACB', 'BCA', 'BAC', 'CAB', 'CBA']\r\n\r\nre = False\r\n\r\nfor c in co:\r\n if c in l:\r\n\r\n re = True\r\n\r\nprint('Yes' if re else 'No')", "t = input()\r\n\r\na = list(t)\r\nc = []\r\nfor i in range(len(a)):\r\n t = [\"A\", \"B\", \"C\"]\r\n if a[i] in t and i <= len(a) -3:\r\n t.remove(a[i])\r\n if a[i + 1] in t and i <= len(a) -3:\r\n t.remove(a[i + 1])\r\n if a[i + 2] in t and i <= len(a) -3:\r\n c.append(\"Yes\")\r\n\r\nif \"Yes\" in c:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n\r\n", "s=input()\r\nn=len(s)\r\nif n<3:\r\n print(\"No\")\r\n quit()\r\nfor i in range(1,n-1):\r\n a,b,c=s[i-1:i+2]\r\n if {a,b,c}=={'A','B','C'}:\r\n print(\"Yes\")\r\n quit()\r\nprint(\"No\")\r\n", "\r\n\r\n\r\n\r\ns = input()\r\n\r\nlens = int(len(s))\r\n\r\n\r\nfor i in range(lens):\r\n if i == 0 or i == (lens - 1):\r\n continue\r\n se = set({})\r\n if s[i] != '.':\r\n se.add(s[i])\r\n if s[i - 1] != '.':\r\n se.add(s[i - 1])\r\n if s[i + 1] != '.':\r\n se.add(s[i + 1])\r\n # print(str(i) + ' ' + str(se.__len__()))\r\n if(se.__len__() == 3):\r\n print('Yes')\r\n break\r\nelse:\r\n print('No')\r\n\r\n", "v = input()\nf = False\nfor w in zip(v, v[1:], v[2:]):\n f |= len(set([i for i in w if i != '.'])) == 3\nprint([\"NO\", \"YES\"][f])\n", "l=['CBA','CAB','ABC','ACB','BAC','BCA']\ns=input()\nflag=0\nfor i in l:\n if(s.find(i)!=-1):\n flag=1\n break\nif(flag==0):\n print(\"No\")\nelse:\n print(\"Yes\")\n", "w = input()\r\ntoFind = ['ABC', 'BCA', \"CAB\", 'ACB', 'CBA', 'BAC']\r\nprint([\"NO\",\"YES\"][any(x in w for x in toFind)])", "s = input()\r\na = ['ABC', 'ACB', 'BCA', 'BAC', 'CAB', 'CBA']\r\nfor i in a:\r\n if i in s:\r\n print('YES')\r\n exit()\r\nprint('NO')", "import sys\r\nimport math\r\nimport bisect\r\nfrom math import sqrt\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\nmod = int(1e9)+7\r\n\r\ns = input()\r\nt = [\"ABC\", 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\r\n\r\nfor ch in t:\r\n\tif ch in s:\r\n\t\tprint(\"Yes\")\r\n\t\texit()\r\n\r\nprint(\"No\")\t\t", "inp = input()\r\n\r\nw = ['ABC','ACB','BAC','BCA','CAB','CBA']\r\nans = \"NO\"\r\nfor word in w:\r\n if word in inp:\r\n ans = \"YES\"\r\n \r\nprint(ans)", "s = input()\r\nprint('Yes' if any(''.join(sorted(s[i:i+3])) == 'ABC' for i in range(len(s) - 2)) else 'No')", "\nInput=lambda:map(int,input().split())\n\nf = input()\nLen = len(f)\nfor i in range(1,Len - 1):\n \n if sorted(f[i]+f[i-1]+f[i+1]) == ['A','B','C']:\n print(\"YES\")\n exit()\nprint(\"NO\")\n\n\n\n", "a = list(input())\r\nn = ['B', 'A', 'C']\r\nfor k in range(len(a)):\r\n if a[k] in n and k < len(a)-1 and k > 0:\r\n if a[k-1] in n and a[k+1] in n:\r\n if a[k-1] != a[k+1] and a[k-1] != a[k] and a[k] != a[k+1]:\r\n print('Yes')\r\n break\r\nelse:\r\n print('No')" ]

[ "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\na1=y1-y2\r\nb1=x2-x1\r\nc1=x2*(y2-y1)-y2*(x2-x1)\r\ndef intersect(a2,b2,c2):\r\n global a1,b1,c1,x1,y1,x2,y2\r\n if(a1*b2==a2*b1):\r\n return False\r\n x=(b1*c2-b2*c1)/(a1*b2-b1*a2)\r\n y=(a1*c2-c1*a2)/(b1*a2-a1*b2)\r\n if(min(x1,x2)<=x<=max(x1,x2) and min(y1,y2)<=y<=max(y1,y2)):\r\n return True\r\n return False\r\nm=int(input())\r\nans=0\r\nfor i in range(m):\r\n a2,b2,c2=map(int,input().split())\r\n if(intersect(a2,b2,c2)):\r\n ans+=1\r\nprint(ans)", "if __name__ == '__main__':\n xhome, yhome = [int(x) for x in input().split()]\n xuni, yuni = [int(x) for x in input().split()]\n n_roads = int(input())\n n_steps = 0\n for i in range(n_roads):\n a, b, c = [int(x) for x in input().split()]\n hline = (a*xhome) + (b*yhome) + c\n uline = (a*xuni) + (b*yuni) + c\n if hline * uline < 0:\n n_steps += 1\n print(n_steps)\n", "hm = list(map(int, input().split()))\nsc = list(map(int, input().split()))\n\nn = int(input())\ncnt = 0\nfor i in range(n):\n\ta,b,c = list(map(int, input().split()))\n\tif (a*hm[0] + b*hm[1] + c) * (a*sc[0] + b*sc[1] + c) < 0:\n\t\tcnt+=1\nprint(cnt)\n\t\n\t\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nval = 0\r\nfor i in range(int(input())):\r\n a, b, c = map(int, input().split())\r\n val += (a * x1 + b * y1 + c) * (a * x2 + b * y2 + c) < 0\r\nprint(val)", "def sign(x):\r\n return (x>=0)*2-1\r\nx1,y1=list(map(int,input().split(\" \")))\r\nx2,y2=list(map(int,input().split(\" \")))\r\n\r\nn=int(input())\r\ncount=0\r\n\r\nfor _ in range(n):\r\n a,b,c=list(map(int,input().split(' ')))\r\n if sign(a*x1+b*y1+c)*sign(a*x2+b*y2+c)==-1:\r\n count+=1\r\nprint(count)", "h1, h2 = list(map(int,input().split()))\nu1, u2 = list(map(int,input().split()))\n\nsteps = 0\n\nfor i in int(input())*'_':\n a, b, c= list(map(int,input().split()))\n if (a * h1 + b * h2 + c) * (a * u1 + b * u2 + c) < 0:\n steps+=1\nprint(steps)", "x, y = map(float, input().split(' '))\r\nx1, y1 = map(float, input().split(' '))\r\nn = int(input())\r\nr = 0\r\nfor i in range(n):\r\n a, b, c = map(float, input().split(' '))\r\n q1 = a * x + b * y + c\r\n q2 = a * x1 + b * y1 + c\r\n if (q1 > 0 and q2 < 0) or (q1 < 0 and q2 > 0):\r\n r += 1\r\nprint(r)\r\n", "x, y = map(int, input().split())\r\nx1, y1 = map(int, input().split())\r\nn = int(input())\r\nsteps = 0\r\nfor i in range(n):\r\n a, b , c = map(int, input().split())\r\n p = (a * x + b * y + c)\r\n q = (a * x1 + b * y1 + c)\r\n if (p * q < 0):\r\n steps += 1\r\nprint(steps)", "x1, y1 = map(int, input().split())\nx2, y2 = map(int, input().split())\nn = int(input())\nnum_sign_diff = 0\nfor road in range(n):\n\ta, b, c = map(int, input().split())\n\tpos1 = (a * x1 + b * y1 + c) > 0\n\tpos2 = (a * x2 + b * y2 + c) > 0\n\tif pos1 + pos2 == 1: #exactly one of them is on positive side of line\n\t\tnum_sign_diff += 1\nprint(num_sign_diff)", "from sys import stdin \r\nR = lambda: map(int, stdin.readline().split())\r\nx1, y1 = R()\r\nx2, y2 = R()\r\nans = 0\r\nfor _ in range(int(input())):\r\n a, b, c = R()\r\n if (a * x1 + b * y1 + c) * (a * x2 + b * y2 + c) < 0:\r\n ans += 1\r\nprint(ans)", "x1, y1 = map(int, input().split())\nx2, y2 = map(int, input().split())\nn = int(input())\ncost = 0\nfor i in range(n):\n a, b, c = map(int, input().split())\n d1 = a * x1 + b * y1 + c\n d2 = a * x2 + b * y2 + c\n if d1 * d2 < 0: cost += 1\nprint(cost)\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=int(input())\r\nd=[]\r\nfor i in range(c):d+=[list(map(int,input().split()))]\r\ne=list(map(lambda j:j[0]*a[0]+j[1]*a[1]+j[2]>0,d))\r\nf=list(map(lambda j:j[0]*b[0]+j[1]*b[1]+j[2]>0,d))\r\nprint(len(list(filter(lambda x:e[x]!=f[x],range(len(d))))))\r\n", "h=list(map(int,input().strip().split()))\nu=list(map(int,input().strip().split()))\nn=int(input())\ncount=0\nfor i in range(n):\n\ta,b,c=list(map(int,input().strip().split()))\n\tt1=a*h[0]+b*h[1]+c\n\tt2=a*u[0]+b*u[1]+c\n\t#print(\">\",t1,t2)\n\tif ((t1>0) != (t2>0)):\n\t\tcount+=1\nprint(count)\n\n \t\t\t \t\t \t \t \t \t\t \t \t", "x1, y1 = [int(x) for x in input().split()]\nx2, y2 = [int(x) for x in input().split()]\n\nn = int(input())\n\nans = 0\n\nfor i in range(n):\n a, b, c = [int(x) for x in input().split()]\n p = a*x1 + b*y1 + c < 0\n q = a*x2 + b*y2 + c < 0\n \n if p ^ q == True:\n ans += 1\n\nprint(ans)\n", "def main():\r\n rdl = list(map(int,input().split()))\r\n x1,y1 = rdl\r\n rdl = list(map(int,input().split()))\r\n x2,y2 = rdl\r\n n = int(input())\r\n Steps = 0\r\n for i in range(n):\r\n rdl = list(map(int,input().split()))\r\n if rdl[1]*y1+rdl[0]*x1+rdl[2] > 0 and rdl[1]*y2+rdl[0]*x2+rdl[2] < 0:\r\n Steps += 1\r\n elif rdl[1]*y1+rdl[0]*x1+rdl[2] < 0 and rdl[1]*y2+rdl[0]*x2+rdl[2] > 0:\r\n Steps += 1\r\n print(Steps)\r\nmain()\r\n \r\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nn = int(input())\r\nr = 0\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n if (x1*a+y1*b+c)*(x2*a+y2*b+c) < 0: r += 1\r\nprint(r)", "#!/usr/bin/env python3\r\n\r\nx1, y1 = (int(x) for x in input().split())\r\nx2, y2 = (int(x) for x in input().split())\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n a, b, c = (int(x) for x in input().split())\r\n point1 = a*x1 + b*y1 + c\r\n point2 = a*x2 + b*y2 + c\r\n if point1 * point2 < 0:\r\n ans += 1\r\nprint(ans)", "\r\nx1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\n\r\nn=int(input())\r\nres = 0\r\n\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n p=0\r\n if a*x1+b*y1+c>0:p+=1\r\n if a*x2+b*y2+c>0:p+=1\r\n if p%2==1:\r\n res+=1\r\n\r\nprint(res)", "import collections\r\nimport heapq\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\nfrom io import BytesIO, IOBase\r\nimport os\r\n######################################################################################\r\n#--------------------------------------Input-----------------------------------------#\r\n######################################################################################\r\n \r\ndef value(): return tuple(map(int, input().split()))\r\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\r\ndef inlst(): return [int(i) for i in input().split()]\r\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\r\ndef inp(): return int(input())\r\ndef inps(): return int(sys.stdin.readline())\r\ndef instr(): return input()\r\ndef stlst(): return [i for i in input().split()]\r\n \r\n \r\n######################################################################################\r\n#--------------------------------------code here-------------------------------------#\r\n######################################################################################\r\n \r\ndef solve():\r\n tot=0\r\n def check(p): \r\n # nonlocal x1,y1\r\n a,b,c=p\r\n if a*x1+b*y1+c>0 and a*x2+b*y2+c<0:return True\r\n elif a*x1+b*y1+c<0 and a*x2+b*y2+c>0:return True\r\n else:return False\r\n\r\n for i in range(len(l)):\r\n if check(l[i]):tot+=1\r\n print(tot)\r\nx1,y1=value()\r\nx2,y2=value()\r\nl=[]\r\nfor i in range(inp()):\r\n l.append(value())\r\nsolve()\r\n", "\n# coding: utf-8\n\n# In[4]:\n\n\ndef getToU(hauseX, hauseY, uX, uY):\n nOfRoads = int(input())\n moves = 0\n for i in range(nOfRoads):\n road = list(map(int,input().split()))\n s = road[0]*hauseX + road[1]* hauseY + road[2]\n e = road[0]*uX + road[1]* uY + road[2]\n if(s>0 and e<0)or(s<0 and e>0):\n moves+=1\n return moves\n\nhause = list(map(int,input().split()))\nuniversity = list(map(int,input().split()))\nprint(getToU(hause[0], hause[1], university[0], university[1]))\n \n\n", "import sys\r\n\r\n#sys.stdin = open('input.txt', 'r')\r\n#sys.stdout = open('output.txt', 'w')\r\n\r\nx1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\ndef sign(a, b, c, x, y):\r\n\tvalue = a * x + b * y + c\r\n\tif value < 0:\r\n\t\treturn -1\r\n\tif value == 0:\r\n\t\treturn 0\r\n\treturn 1\r\n\r\nn, ans = int(input()), 0\r\nfor i in range(n):\r\n\ta, b, c = map(int, input().split())\r\n\tif sign(a, b, c, x1, y1) != sign(a, b, c, x2, y2):\r\n\t\tans += 1\r\nprint(ans)", "hx, hy = map(int, input().split())\r\nux, uy = map(int, input().split())\r\nn = int(input())\r\ncnt = 0\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n if (a*hx + b*hy + c < 0) != (a*ux + b*uy + c < 0):\r\n cnt += 1\r\nprint(cnt)\r\n", "h = list(map(int, input().split()))\nu = list(map(int, input().split()))\nn = int(input())\nt = 0\n# print(h,u,n)\nfor i in range(n):\n\ta,b,c = map(int, input().split())\n\t# print(a*h[0] + b*h[1] + c)\n\t# print(a*u[0] + b*u[1] + c)\n\t# print(a, b, c)\n\tif (a*h[0] + b*h[1] + c) * (a*u[0] + b*u[1] + c) < 0:\n\t\tt += 1\nprint(t)\n \t\t\t\t\t \t \t \t \t \t \t \t", "def getMinSteps(x1, y1, x2, y2, n, lines):\r\n min_steps = 0\r\n for i in range(n):\r\n a = lines[i][0]\r\n b = lines[i][1]\r\n c = lines[i][2]\r\n if (a*x1+b*y1+c)*(a*x2+b*y2+c) < 0:\r\n min_steps+=1\r\n return min_steps\r\nx1, y1 = [int(x) for x in input().split()]\r\nx2, y2 = [int(x) for x in input().split()]\r\nn = int(input())\r\nlines = []\r\nfor i in range(n):\r\n line = [int(x) for x in input().split()]\r\n lines.append((line[0], line[1], line[2]))\r\nprint(getMinSteps(x1, y1, x2, y2, n, lines))", "def input_split(f): return map(f, input().split())\n\n\ndef main():\n x1, y1 = input_split(int)\n x2, y2 = input_split(int)\n n = int(input())\n count = 0\n for i in range(n):\n a, b, c = input_split(int)\n if (a*x1+b*y1+c) * (a*x2+b*y2+c) < 0:\n count+=1\n print(count)\n\nmain()\n", "a , b = map(int, input(\"\").split(\" \"))\r\nc , d = map(int, input(\"\").split(\" \"))\r\ndumb = int(input(\"\"))\r\nlines = []\r\nfor value in range(dumb):\r\n lines.append(input(\"\").split(\" \"))\r\ncount = 0\r\ncheck1 = 0\r\ncheck2 = 0\r\nfor value in lines:\r\n if (int(value[0])*a + int(value[1])*b+int(value[2])>= 0):\r\n check1 = 1\r\n else:\r\n check1 = -1\r\n if(int(value[0])*c+int(value[1])*d+int(value[2])>=0):\r\n check2 = 1\r\n else:\r\n check2 = -1\r\n if check2 != check1:\r\n count = count + 1\r\nprint(count)\r\n", "hx, hy = map(int, input().split())\nux, uy = map(int, input().split())\nn = int(input())\n\ncount = 0\n\nfor i in range(n):\n a,b,c = map(int, input().split())\n \n h = a*hx + b*hy + c\n u = a*ux + b*uy + c\n\n if h*u<0:\n count += 1\n\nprint(count)\n \n", "line = input().split()\r\nx1 = int(line[0])\r\ny1 = int(line[1])\r\nline = input().split()\r\nx2 = int(line[0])\r\ny2 = int(line[1])\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n line = input().split()\r\n a = int(line[0])\r\n b = int(line[1])\r\n c = int(line[2])\r\n d1 = (a * x1 + b * y1 + c)\r\n d2 = (a * x2 + b * y2 + c)\r\n if d1 * d2 < 0:\r\n ans += 1\r\n\r\nprint(ans)", "\r\na, b = (int(x) for x in input().split())\r\nab, ba = (int(x) for x in input().split())\r\n\r\nn = int(input())\r\n\r\ndef fun(x1, y1, x2, y2, line):\r\n var = Line()\r\n var.build_by_dots(x1, y1, x2, y2)\r\n under_under = var.a * line.b - line.a * var.b\r\n if abs(under_under) > 0.00000001:\r\n x = - (var.c * line.b - var.b * line.c) / under_under\r\n y = - (var.a * line.c - line.a * var.c) / under_under\r\n if x >= min(x1, x2) and x <= max(x1, x2) and y >= min(y1, y2) and y <= max(y1, y2):\r\n return True\r\n return False\r\n\r\nclass Line:\r\n def build_by_dots(l, x1, y1, x2, y2):\r\n l.a = y1 - y2\r\n l.b = x2 - x1\r\n l.c = -l.a * x1 - l.b * y1\r\n def fun3(l, a, b, c):\r\n l.a = a\r\n l.b = b\r\n l.c = c\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n line = Line()\r\n line.fun3(*tuple(int(x) for x in input().split()))\r\n if fun(a, b, ab, ba, line):\r\n res += 1\r\n\r\nprint(res)", "x1, y1 = (int(s) for s in input().split())\r\nx2, y2 = (int(s) for s in input().split())\r\nn = int(input())\r\nres=0\r\nfor i in range(n):\r\n a,b,c = (int(s) for s in input().split())\r\n if((a*x1 + b*y1 + c) * (a*x2 + b*y2 + c) < 0):\r\n res+=1 \r\nprint(res)", "x1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\nn = int(input())\r\ns = 0\r\nfor i in range(n):\r\n a,b,c = map(int,input().split())\r\n if ((((a * x1) + (b * y1) + c) * ((a * x2) + (b * y2) + c)) < 0):\r\n s = s + 1\r\nprint(s)", "x1, y1 = map(float, input().split())\nx2, y2 = map(float, input().split())\nn = int(input())\nans = 0\nfor i in range(n):\n a, b, c = map(int, input().split())\n if (a * x1 + b * y1 + c) * (a * x2 + b * y2 + c) < 0:\n ans += 1\nprint(ans)\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nn = int(input())\r\ndata = []\r\nans = 0\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n one = (a * x1 + b * y1 + c)\r\n two = (a * x2 + b * y2 + c)\r\n if one // abs(one) != two // abs(two):\r\n ans += 1\r\nprint(ans)\r\n", "x,y = map(int,input().split())\r\nx1,y1 = map(int,input().split())\r\nn=int(input())\r\nans=0\r\nfor i in range(n):\r\n\ta,b,c=map(int,input().split())\r\n\tif((a*x+b*y+c)*(a*x1+b*y1+c)<0): ans+=1\r\nprint(ans)", "def clockwise(x, y, a, b, c):\r\n\treturn a * x + b * y + c < 0\r\n\r\n\r\nx1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nans = 0\r\nfor _ in range(int(input())):\r\n a, b, c = map(int, input().split())\r\n if clockwise(x1, y1, a, b, c) != clockwise(x2, y2, a, b, c):\r\n ans += 1\r\nprint(ans)\r\n", "import sys\n\n#input functions\nreadint = lambda: int(sys.stdin.readline())\nreadints = lambda: map(int,sys.stdin.readline().split())\nreadar = lambda: list(map(int,sys.stdin.readline().split()))\nflush = lambda: sys.stdout.flush()\n\ndef ret(a,b,c,x):\n #ax+by+c = 0, x is given\n if b == 0: return -3876389763249789837\n return (-c-a*x)/b\n\ndef ret2(a,b,c,y):\n #ax+by+c = 0, y is given\n if a == 0: return -3876389763249789837\n return (-c-y*b)/a\n\n\n\ndef inting(s0,s1,g0,g1,a,b,c,meh):\n l,r = True,True\n if meh: #normal, use x values\n lr = ret(a,b,c,s0)\n if lr == -3876389763249789837: #vertical line\n if min(s0,g0) <= -c/a <= max(s0,g0): return 1\n return 0\n if lr == s1: return 1\n elif lr < s1: l = False\n rr = ret(a,b,c,g0)\n if rr == g1: return 1\n elif rr < g1: r = False\n if l ^ r: return 1\n else: return 0\n else: #use y values\n lr = ret2(a,b,c,s1)\n if lr == -3876389763249789837: #horizontal line\n if min(s1,g1) <= -c/b <= max(s1,g1): return 1\n return 0\n if lr == s0: return 1\n elif lr < s0: l = False\n rr = ret2(a,b,c,g1)\n if rr == g0: return 1\n elif rr < g0: r = False\n if l ^ r: return 1\n else: return 0\n\n\n#find number of intersections\n\ns0,s1 = readints()\ng0,g1 = readints()\nans = 0\nmeh = True\nif s0 == g0: #vertical line\n meh = False\nelif s0 > g0: #swap points\n tmp0,tmp1 = s0,s1\n s0,s1 = g0,g1\n g0,g1 = tmp0,tmp1\n \nfor i in range(readint()):\n a,b,c = readints()\n ans += inting(s0,s1,g0,g1,a,b,c,meh)\nprint(ans)\n\n\t \t\t\t \t\t \t \t\t \t \t\t \t\t", "from dataclasses import dataclass\r\n\r\n\r\n@dataclass\r\nclass Point:\r\n x: float\r\n y: float\r\n\r\n\r\n@dataclass\r\nclass Line:\r\n a: float\r\n b: float\r\n c: float\r\n\r\n def cross(self, other):\r\n delta = self.a * other.b - other.a * self.b\r\n if delta == 0:\r\n return None\r\n x = (self.b * other.c - other.b * self.c) / delta\r\n y = (other.a * self.c - self.a * other.c) / delta\r\n return Point(x, y)\r\n\r\n\r\n@dataclass\r\nclass Segment(Line):\r\n p1: Point\r\n p2: Point\r\n\r\n def __init__(self, p1, p2):\r\n a = p1.y - p2.y\r\n b = p2.x - p1.x\r\n c = p1.x * p2.y - p2.x * p1.y\r\n self.p1 = p1\r\n self.p2 = p2\r\n super().__init__(a, b, c)\r\n\r\n def is_belong(self, point):\r\n return (\r\n self.p1.x <= point.x <= self.p2.x or\r\n self.p2.x <= point.x <= self.p1.x\r\n ) and (\r\n self.p1.y <= point.y <= self.p2.y or\r\n self.p2.y <= point.y <= self.p1.y\r\n )\r\n\r\n\r\ndef main():\r\n p1 = Point(*map(float, input().split()))\r\n p2 = Point(*map(float, input().split()))\r\n segment = Segment(p1, p2)\r\n\r\n n = int(input())\r\n\r\n lines = list()\r\n\r\n for _ in range(n):\r\n lines.append(Line(*map(int, input().split())))\r\n\r\n result = 0\r\n for line in lines:\r\n cross_point = segment.cross(line)\r\n if cross_point is not None and segment.is_belong(cross_point):\r\n result += 1\r\n\r\n print(result)\r\n\r\n\r\nmain()\r\n", "x, y=[int(k) for k in input().split()]\r\nu, v=[int(k) for k in input().split()]\r\nn=int(input())\r\nw=[]\r\nres=0\r\nfor i in range(n):\r\n a, b, c=[int(k) for k in input().split()]\r\n if (a*x+b*y+c)*(a*u+b*v+c)<0:\r\n res+=1\r\nprint(res)", "(x1, y1) = input().split(\" \")\r\nx1 = int(x1)\r\ny1 = int(y1)\r\n(x2, y2) = input().split(\" \")\r\nx2 = int(x2)\r\ny2 = int(y2)\r\nn = int(input())\r\nlineslist = []\r\nfor i in range(n):\r\n (a, b, c) = input().split(\" \")\r\n lineslist.append((int(a), int(b), int(c)))\r\n\r\ndef greaterThanLine(x, y, a, b, c):\r\n return a*x + b*y + c > 0\r\n\r\ncount = 0\r\nfor line in lineslist:\r\n (a, b, c) = line\r\n if greaterThanLine(x1, y1, a, b, c) ^ greaterThanLine(x2, y2, a, b, c):\r\n count += 1\r\n\r\nprint(count)\r\n", "x1, y1 = list(map(int, input().split()))\r\nx2, y2 = list(map(int, input().split()))\r\nn = int(input())\r\nr = 0\r\nfor i in range(n):\r\n q = list(map(int, input().split()))\r\n r = r + ((q[0]*x1+q[1]*y1+q[2])*(q[0]*x2+q[1]*y2+q[2])<0)\r\nprint(r)", "xhome, yhome = [int(x) for x in input().split()]\nxuni, yuni = [int(x) for x in input().split()]\nn_roads = int(input())\nn_steps = 0\nfor i in range(n_roads):\n a, b, c = [int(x) for x in input().split()]\n hline = (a*xhome) + (b*yhome) + c\n uline = (a*xuni) + (b*yuni) + c\n if hline * uline < 0:\n n_steps += 1\nprint(n_steps)\n", "x1,y1=map(int, input().split())\r\nx2,y2=map(int, input().split())\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n s1=a*x1+b*y1+c\r\n s2=a*x2+b*y2+c\r\n if s1 < 0 < s2 or s2 < 0 < s1:\r\n ans += 1\r\nprint(ans)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(P1, P2, A):\r\n n = len(A)\r\n x1, y1 = P1\r\n x2, y2 = P2\r\n answer = 0\r\n for i in range(n):\r\n ai, bi, ci = A[i]\r\n if (ai*x1+bi*y1+ci > 0) != (ai*x2+bi*y2+ci > 0):\r\n answer+=1\r\n print(answer)\r\n return\r\n\r\nP1 = [int(x) for x in input().split()]\r\nP2 = [int(x) for x in input().split()]\r\nn = int(input())\r\nA = []\r\nfor i in range(n):\r\n line = [int(x) for x in input().split()]\r\n A.append(line)\r\nprocess(P1, P2, A)", "x1 , y1 = map(int , input().split())\r\nx2 , y2 = map(int , input().split())\r\nn = int(input())\r\nres = 0\r\n\r\n\r\nfor i in range(n):\r\n a , b , c = map(int , input().split())\r\n x = (a * x1) + (b * y1) + c\r\n y = (a * x2) + (b * y2) + c\r\n\r\n if ((x < 0) and (y > 0)) or ((x > 0) and (y < 0)):\r\n res = res + 1\r\n\r\nprint(res)", "class PoV: #point and vector\r\n def __init__(self,x=0,y=0):\r\n self.x = x\r\n self.y = y\r\n \r\n def __str__(self):\r\n return \"({0},{1})\".format(self.x, self.y)\r\n\r\n def __add__(self, other):\r\n x = self.x + other.x\r\n y = self.y + other.y\r\n return PoV(x,y)\r\n\r\n def __sub__(self, other):\r\n x = self.x - other.x\r\n y = self.y - other.y\r\n return PoV(x,y)\r\n\r\n def __xor__(self, other): #wedge product\r\n return self.x*other.y - self.y*other.x\r\n\r\n def __mul__(self, other): #dot product\r\n return self.x*other.x + self.y*other.y\r\n\r\n def test(self,a,b,c):\r\n return a*self.x+b*self.y+c>0\r\n\r\nh = PoV(*map(int,input().split()))\r\nu = PoV(*map(int,input().split())) \r\ns = 0\r\nfor _ in range(int(input())):\r\n t = list(map(int,input().split()))\r\n s+= h.test(*t)^u.test(*t)\r\nprint(s)\r\n", "input_line_1 = input()\r\ninput_list_1 = input_line_1.split(\" \")\r\n\r\nhome =[int(input_list_1[0]),int(input_list_1[1])]\r\n\r\n\r\ninput_line_2 = input()\r\ninput_list_2 = input_line_2.split(\" \")\r\n\r\ndesti =[int(input_list_2[0]),int(input_list_2[1])]\r\n\r\nnumber_of_lines = int(input())\r\n\r\nlist_of_lines = []\r\n\r\nfor i in range(number_of_lines):\r\n input_line = input()\r\n input_list = input_line.split(\" \")\r\n\r\n line =[int(input_list[0]),int(input_list[1]),int(input_list[2])]\r\n\r\n list_of_lines.append(line)\r\n\r\n# print(list_of_lines)\r\n\r\n# list_of_lines_btw = []\r\nn = 0\r\n\r\nfor line in list_of_lines:\r\n factor_1 = home[0] * line[0] + home[1] * line[1] + line[2] \r\n factor_2 = desti[0] * line[0] + desti[1] * line[1] + line[2] \r\n\r\n if factor_1 * factor_2 < 0:\r\n # list_of_lines_btw.append(line)\r\n n += 1\r\n\r\n\r\n# print()\r\nprint(n)\r\n\r\n\r\n", "x1, y1 = [int(x) for x in input().split()]\nx2, y2 = [int(x) for x in input().split()]\nn = int(input())\nans = 0\nfor i in range(n):\n\ta, b, c = [int(x) for x in input().split()]\n\tx = x1 * a + y1 * b + c\n\tx //= abs(x)\n\ty = x2 * a + y2 * b + c\n\ty //= abs(y)\n\tif x != y:\n\t\tans += 1\nprint(ans)\n", "ans = 0\nread_line = lambda: [int(i) for i in input().split()]\nx0, y0 = read_line()\nx1, y1 = read_line()\nn = int(input())\nfor i in range(n):\n a, b, c = read_line()\n ans += (a * x0 + b * y0 + c) * (a * x1 + b * y1 + c) < 0\nprint(ans)\n", "read_line = lambda: [int(i) for i in input().split()]\nx0, y0 = read_line()\nx1, y1 = read_line()\nprint(sum((a * x0 + b * y0 + c) * (a * x1 + b * y1 + c) < 0 for a, b, c in (read_line() for i in range(int(input())))))\n\n\n\n\n# Made By Mostafa_Khaled", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nk = 0\r\nn = int(input())\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n if (a * x1 + b * y1 + c) * (a * x2 + b * y2 + c) < 0:\r\n k += 1\r\nprint(k)", "x1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\nn = int(input())\r\nnum = 0\r\nfor i in range(n):\r\n a,b,c = map(int,input().split())\r\n num += (a * x1 + b * y1 + c > 0) != (a * x2 + b * y2 + c > 0)\r\nprint(num)\r\n", "\r\n# Crazy Town (2 points on same/opposite side of a line)\r\n\r\n# input\r\nk1 = list(map(int, input().split()));\r\n(x1,y1) = (k1[0],k1[1])\r\n\r\nk2 = list(map(int, input().split()));\r\n(x2,y2) = (k2[0],k2[1])\r\n\r\nt = int(input())\r\n\r\nd = 0;\r\nfor i in range(t):\r\n k3 = list(map(int, input().split()));\r\n (a,b,c) = (k3[0],k3[1],k3[2])\r\n #\r\n k = (a*(x1) + b*(y1) + c)/ (a*(x2) + b*(y2) + c)\r\n if k<0:\r\n d +=1;\r\n \r\nprint(d);\r\n", "x1,y1 = map(int,input().split())\nx2,y2 = map(int,input().split())\nn = int(input())\ncount = 0\nfor _ in range(n):\n a,b,c = map(int,input().split())\n p = x1*a+y1*b+c\n q = x2*a+y2*b+c\n if (p*q<0):\n count += 1\nprint(count)\n", "#import sys\r\n#sys.stdin = open('input.txt', 'r')\r\n#sys.stdout = open('output.txt', 'w')\r\n\r\ndef norm(a, b, c, d):\r\n\tif (b * c >= 0):\r\n\t\treturn a * abs(c) <= abs(b) <= d * abs(c)\r\n\treturn -a * abs(c) >= abs(b) >= -d * abs(c)\r\n\r\nx1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\na2 = y2 - y1\r\nb2 = x1 - x2\r\nc2 = 0 - a2 * x1 - b2 * y1\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n\ta1, b1, c1 = map(int, input().split())\r\n\tif (norm(min(x1, x2), (c2 * b1 - c1 * b2), (a1 * b2 - a2 * b1), max(x1, x2)) and norm(min(y1, y2), (c2 * a1 - c1 * a2), (a2 * b1 - a1 * b2), max(y1, y2))):\r\n\t\tans += 1\r\nprint(ans)", "xH, yH = map(int, input().split())\r\nxU, yU = map(int, input().split())\r\nn = int(input())\r\n\r\ndef cross_product(a, b, c):\r\n v1 = a * xH + b * yH + c\r\n v2 = a * xU + b * yU + c\r\n return v1 < 0 and v2 > 0 or v1 > 0 and v2 < 0\r\n\r\nres = 0\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n if cross_product(a, b ,c):\r\n res += 1\r\nprint(res)\r\n", "EPS = 1e-5\r\nx1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\n\r\ndef solve():\r\n a, b, c = map(int, input().split())\r\n # ax + c = 0\r\n if b != 0:\r\n x3, y3 = 0, -c / b\r\n x4, y4 = 1, -(c + a) / b\r\n else:\r\n x3, y3 = -c/a, 0\r\n x4, y4 = -c/a, 1\r\n D = (x1 - x2) * (y3 - y4) - (y1 - y2) * (x3 - x4)\r\n if abs(D) < EPS:\r\n return 0, 0, False\r\n px = (x1 * y2 - y1 * x2) * (x3 - x4) - (x1 - x2) * (x3 * y4 - y3 * x4)\r\n py = (x1 * y2 - y1 * x2) * (y3 - y4) - (y1 - y2) * (x3 * y4 - y3 * x4)\r\n px /= D\r\n py /= D\r\n return px, py, True\r\n\r\n\r\nans = 0\r\nn = int(input())\r\nfor _ in range(n):\r\n x, y, valid = solve()\r\n if valid and min(x1, x2) <= x <= max(x1, x2) and min(y1, y2) <= y <= max(y1, y2):\r\n ans += 1\r\nprint(ans)\r\n", "#!/usr/bin/env python3\nimport collections, itertools, functools, math\n\ndef value(a, b, c, x, y):\n return a*x + b*y + c\n\ndef sign(x):\n if x < 0:\n return -1\n if x == 0:\n return 0\n if x > 0:\n return 1\n\ndef solve():\n x1, y1 = map(int, input().split())\n x2, y2 = map(int, input().split())\n n = int(input())\n r = 0;\n for i in range(n):\n a, b, c = map(int, input().split())\n s1 = value(a, b, c, x1, y1)\n s2 = value(a, b, c, x2, y2)\n if sign(s1) != sign(s2):\n r += 1\n return r\n\n\nif __name__ == '__main__':\n print(solve())\n\n", "x,y=input().split()\r\nx,y=[int(x),int(y)]\r\na,b=input().split()\r\na,b=[int(a),int(b)]\r\nn=int(input())\r\ncounter=0\r\nfor i in range(n):\r\n p,q,r=input().split()\r\n p,q,r=[int(p),int(q),int(r)]\r\n q1=p*x+q*y+r\r\n q2=p*a+q*b+r\r\n if q1>0 and q2<0 or q1<0 and q2>0:\r\n counter+=1\r\nprint(counter)\r\n", "def list_to_int(l):\n return [int(x) for x in l]\n\ndef f_value(point, params):\n return (point[0]*params[0]+point[1]*params[1]+params[2] > 0)\n\ndef is_separator(home, uni, params):\n return f_value(home, params) ^ f_value(uni, params)\n \n\nhome = list_to_int(input().split(' '))\nuni = list_to_int(input().split(' '))\nn = int(input())\ndistance = 0\n\nfor i in range(n):\n params = list_to_int(input().split(' '))\n if is_separator(home, uni, params):\n distance += 1\n\nprint(distance)\n", "x, y = map(int, input().split())\r\nu, v = map(int, input().split())\r\ns = 0\r\nfor i in range(int(input())):\r\n a, b, c = map(int, input().split())\r\n s += (a * x + b * y + c > 0) ^ (a * u + b * v + c > 0)\r\nprint(s)", "x1, y1 = list(map(int,input().split()))\r\nx2, y2 = list(map(int,input().split()))\r\n\r\nsteps = 0\r\n\r\nfor i in int(input())*'_':\r\n a, b, c= list(map(int,input().split()))\r\n if (a * x1 + b * y1 + c) * (a * x2 + b * y2 + c) < 0:\r\n steps+=1\r\nprint(steps)", "def f(a,b,c,x,y):\r\n\treturn a*x+b*y+c\r\nx,y=map(int,input().split())\r\ng,h=map(int,input().split())\r\nn=int(input())\r\ncount=0\r\nfor i in range(n):\r\n\ta,b,c=map(int,input().split())\r\n\tif f(a,b,c,x,y)*f(a,b,c,g,h)<0:\r\n\t\tcount+=1\r\nprint(count)", "\"\"\"\r\nCodeforces Contest 284 Div 1 Problem A\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.4.2\r\n\"\"\"\r\n\r\n################################################### SOLUTION\r\n\r\ndef main():\r\n x1,y1 = read()\r\n x2,y2 = read()\r\n n, = read()\r\n ct = 0\r\n for i in range(n):\r\n a,b,c = read()\r\n if (a*x1+b*y1+c)*(a*x2+b*y2+c) < 0: ct += 1\r\n print(ct)\r\n\r\n#################################################### HELPERS\r\n\r\n\r\n\r\ndef read(mode=2):\r\n # 0: String\r\n # 1: List of strings\r\n # 2: List of integers\r\n inputs = input().strip()\r\n if mode == 0: return inputs\r\n if mode == 1: return inputs.split()\r\n if mode == 2: return 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())", "import sys\nfrom math import *\nfrom collections import Counter,defaultdict,deque\ninput=sys.stdin.readline\nmod=10**9+7\ndef get_ints():return map(int,input().split())\ndef get_int():return int(input())\ndef get_array():return list(map(int,input().split()))\ndef input():return sys.stdin.readline().strip()\n\n# for _ in range(int(input())):\nx1,y1=get_ints()\nx2,y2=get_ints()\nn=get_int()\nans=0\nfor i in range(n):\n a,b,c=get_ints()\n if (a*x1+b*y1+c)*(a*x2+b*y2+c)<0:\n ans+=1\nprint(ans)\n\n", "import sys\nimport time\nfrom sys import stderr\nfrom typing import Union\n\nINF = 10 ** 18 + 3\nEPS = 1e-10\nMAX_CACHE = 10 ** 9\n\n\n# Decorators\ndef print_to_file(function, file=stderr):\n def wrapped(*args, **kwargs):\n res = function(*args, **kwargs)\n print(res, file=file)\n file.flush()\n return res\n\n return wrapped\n\n\ndef time_it(function, output=stderr):\n def wrapped(*args, **kwargs):\n start = time.time()\n res = function(*args, **kwargs)\n elapsed_time = time.time() - start\n print('\"%s\" took %f ms' % (function.__name__, elapsed_time * 1000),\n file=output)\n return res\n\n return wrapped\n\n\n# @total_ordering\nclass Point(object):\n def __init__(self, x, y):\n self.x = x\n self.y = y\n\n def __le__(self, other):\n return (self.x, self.y) < (other.x, other.y)\n\n def __lt__(self, other):\n return (self.x, self.y) <= (other.x, other.y)\n\n def __eq__(self, other):\n return (self.x, self.y) == (other.x, other.y)\n\n\nclass Line(object):\n def __init__(self, *args):\n if len(args) == 2:\n point1, point2 = args\n self.a = point2.y - point1.y\n self.b = point1.x - point2.x\n self.c = - (point1.x * self.a + point1.y * self.b)\n else:\n self.a, self.b, self.c = args\n\n\nclass Segment(Line):\n def __init__(self, point1: Point, point2: Point):\n super().__init__(point1, point2)\n self.least, self.greatest = sorted((point1, point2))\n\n def find_point_of_intersection_with(self, line: Line) -> Union[Point, None]:\n if self.a * line.b == line.a * self.b:\n return None\n\n res_y = ((line.a * self.c - line.c * self.a)\n / (self.a * line.b - line.a * self.b))\n res_x = ((line.b * self.c - line.c * self.b)\n / (self.b * line.a - line.b * self.a))\n res_point = Point(res_x, res_y)\n\n if not (self.least <= res_point <= self.greatest):\n return None\n\n return res_point\n\n\n@time_it\ndef main():\n x1, y1 = map(int, input().split())\n x2, y2 = map(int, input().split())\n segment = Segment(Point(x1, y1), Point(x2, y2))\n\n n = int(input())\n res = 0\n for _ in range(n):\n a, b, c = map(int, input().split())\n res += segment.find_point_of_intersection_with(Line(a, b, c)) is not None\n\n print(res)\n\n\n# Auxiliary functions\n@print_to_file\ndef range_of_len(start, length, step=1):\n return range(start, start + length * step, step)\n\n\n# IO reassignment\ndef set_input(file):\n global input\n input = lambda: file.readline().strip()\n\n\ndef set_output(file):\n global print\n local_print = print\n\n def print(*args, **kwargs):\n kwargs[\"file\"] = kwargs.get(\"file\", file)\n return local_print(*args, **kwargs)\n\n\nif __name__ == '__main__':\n set_input(open(\"input.txt\", \"r\") if \"MINE\" in sys.argv else sys.stdin)\n # set_output(open(\"sum.out\", \"w\"))\n main()\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nn = int(input())\r\ns = 0\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n if ((((a * x1) + (b * y1) + c) * ((a * x2) + (b * y2) + c)) <= 0):\r\n s = s + 1\r\nprint(s)", "\r\np = tuple(map(int,input().split()))\r\nq = tuple(map(int,input().split()))\r\n\r\nn = int(input())\r\nlines = [ tuple(map(int,input().split()) ) for _ in range(n) ]\r\n\r\ndef cal(a,b,c,p,q):\r\n\tux = -b\r\n\tuy = a\r\n\tif b==0:\r\n\t\ty=0\r\n\t\tx=-c/a\r\n\telse:\r\n\t\tx=0\r\n\t\ty=-c/b\r\n\tpx,py = p\r\n\tqx,qy = q\r\n\ts1 = (px-x)*uy-(py-y)*ux\r\n\ts2 = (qx-x)*uy-(qy-y)*ux\r\n\treturn 1 if s1*s2<0 else 0\r\n\r\nres = 0\r\nfor L in lines:\r\n\tres += cal(*L,p,q)\r\n\r\nprint(res)\r\n\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "import math\r\n\r\ndef get_n():\r\n return int(input())\r\n\r\ndef get_int_vector():\r\n return [int(x) for x in input().split()]\r\n\r\ndef list2string(list):\r\n result = []\r\n for i in list:\r\n result.append(str(i))\r\n return ':'.join(result)\r\n\r\ndef string2vector(string):\r\n return [int(x) for x in string.split(':')]\r\n\r\nb_x, b_y = get_int_vector()\r\ne_x, e_y = get_int_vector()\r\n\r\nn = get_n()\r\nresult = 0\r\nfor _ in range(n):\r\n a_i, b_i, c_i = get_int_vector()\r\n\r\n if (a_i*b_x + b_i*b_y + c_i) * (a_i*e_x + b_i*e_y + c_i) < 0:\r\n result += 1\r\n\r\nprint(result)\r\n", "import re, sys, math, string, operator, functools, fractions, collections\nfrom random import *\nsys.setrecursionlimit(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()\nmod=1e9+7\n#################################################\nx1,y1 = RI()\nx2,y2 = RI()\ndef sign(x):\n return x<0\nn=RI()[0]\nans=0\nfor i in range(n):\n a,b,c=RI()\n if sign(a*x1+b*y1+c)!=sign(a*x2+b*y2+c):\n ans+=1\nprint(ans)\n", "import math\r\nimport queue\r\n\r\n\r\n# -------- info --------\r\n\r\n# https://codeforces.com/profile/Wolxy\r\n\r\n# -------- solve --------\r\n\r\ndef solve() -> None:\r\n x1, y1 = map(int, input().split(' '))\r\n x2, y2 = map(int, input().split(' '))\r\n if (x1, y1) == (x2, y2):\r\n print(0)\r\n return\r\n n = int(input())\r\n count = 0\r\n for _ in range(n):\r\n a, b, c = map(int, input().split(' '))\r\n\r\n def line (x: int, y: int) -> int:\r\n return a * x + b * y + c\r\n\r\n if line(x1, y1) * line(x2, y2) < 0:\r\n count += 1\r\n print(count)\r\n\r\n\r\n# -------- main --------\r\n\r\n\r\nT = 1\r\n# T = int(input())\r\nfor _ in range(T):\r\n solve()\r\n", "lectura=lambda:map (int,input().split())\r\nxCasa, yCasa = lectura()\r\nxObj, yObj = lectura()\r\nnumeroCalles = int(input())\r\nconclusion = 0\r\n'''\r\nIt can be easily proved that, if two points from statement are placed\r\non different sides of some line, this line will be crossed anyway.\r\nSo, all we need to do is to cross all these lines, so the answer is the number of these lines.\r\nTo check if two points lies on different sides of a line one can simply\r\nuse its coordinates to place in line equation and check if these two values have different signs. \r\n'''\r\nfor i in range(numeroCalles):\r\n # ax + by +c =0\r\n # y= (-ax - c )/b\r\n a, b, c = lectura()\r\n #print(a,b,c)\r\n linea1 = (a * xCasa) + (b * yCasa) + c\r\n linea2 = (a * xObj) + (b * yObj) + c\r\n #print(linea1,linea2)\r\n if linea1 * linea2 < 0:\r\n conclusion += 1\r\nprint(conclusion)", "import sys\n\n#input functions\nreadint = lambda: int(sys.stdin.readline())\nreadints = lambda: map(int,sys.stdin.readline().split())\nreadar = lambda: list(map(int,sys.stdin.readline().split()))\nflush = lambda: sys.stdout.flush()\n\n\"\"\"\nhow many lines separate points A and B?\nneed to account for vertical/horizontal cases,\nbut can probably do some shenanigans to tell if\nA/B are on opposing sides (find same x-coords\nfor the line relative to A/B, one is higher, other\nis lower)\n\"\"\"\nx,y = readints()\nxx,yy = readints()\nn = readint()\nans = 0\nfor i in range(n):\n a,b,c = readints()\n if b == 0:\n xint = -c/a\n if min(x,xx) < xint < max(x,xx): ans += 1\n else:\n z = (-a*x - c) / b\n zz = (-a*xx - c) / b\n h,hh = 0,0\n if z > y: h = 1\n if zz > yy: hh = 1\n ans += h ^ hh\nprint(ans)\n\n\t \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\nfrom collections import *\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, 8192))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nclass dict(dict):\r\n def __missing__(self, key):\r\n return 0\r\n\r\n\r\nclass graph:\r\n def __init__(self, n):\r\n self.n, self.gdict = n, [[] for _ in range(n + 1)]\r\n\r\n def addEdge(self, node1, node2, w=None):\r\n self.gdict[node1].append(node2)\r\n self.gdict[node2].append(node1)\r\n\r\n def solve(self, i):\r\n new = self.pos[i] - self.neg[i] + a[i - 1]\r\n if new > 0:\r\n self.neg[i] += new\r\n else:\r\n self.pos[i] += -new\r\n\r\n def subtree(self, v):\r\n queue, visit, child = deque([v]), [False] * (n + 1), []\r\n visit[v], nodes, parent = True, [0] * (n + 1), [-1] * (n + 1)\r\n self.pos, self.neg = [0] * (n + 1), [0] * (n + 1)\r\n\r\n while queue:\r\n s = queue.popleft()\r\n\r\n for i1 in self.gdict[s]:\r\n if not visit[i1]:\r\n queue.append(i1)\r\n visit[i1] = True\r\n child.append(i1)\r\n parent[i1] = s\r\n\r\n for i in child[::-1]:\r\n self.solve(i)\r\n self.pos[parent[i]] = max(self.pos[parent[i]], self.pos[i])\r\n self.neg[parent[i]] = max(self.neg[parent[i]], self.neg[i])\r\n\r\n self.solve(1)\r\n print(self.pos[1] + self.neg[1])\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ninp_2d = lambda dtype, n: [dtype(input()) for _ in range(n)]\r\ninp_2ds = lambda dtype, n: [inp(dtype) for _ in range(n)]\r\ninp_enu = lambda dtype: [(i, x) for i, x in enumerate(inp(dtype))]\r\ninp_enus = lambda dtype, n: [[i] + inp(dtype) for i in range(n)]\r\nceil1 = lambda a, b: (a + b - 1) // b\r\n\r\nn = int(input())\r\ng = graph(n)\r\nfor _ in range(n - 1):\r\n u, v = inp(int)\r\n g.addEdge(u, v)\r\n\r\na = inp(int)\r\ng.subtree(1)\r\n", "import sys\r\nfrom types import GeneratorType\r\n\r\ninput = sys.stdin.readline\r\nn = int(input())\r\ng = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n g[a].append(b)\r\n g[b].append(a)\r\nv = [-1] + list(map(int, input().split()))\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n@bootstrap\r\ndef dfs(node, fa):\r\n minus, plus = 0, 0\r\n for ch in g[node]:\r\n if ch == fa:\r\n continue\r\n a, b = yield dfs(ch, node)\r\n minus = max(minus, a)\r\n plus = max(plus, b)\r\n v[node] += plus - minus\r\n if v[node] > 0:\r\n minus += v[node]\r\n elif v[node] < 0:\r\n plus += -v[node]\r\n yield minus, plus\r\n\r\nprint(sum(dfs(1, 0)))", "n = int(input())\nr = [[] for i in range(n + 1)]\nr[1] = [0]\nfor i in range(n - 1):\n a, b = map(int, input().split())\n r[a].append(b)\n r[b].append(a)\nt = list(map(int, input().split()))\nu, v = [0] * (n + 1), [0] * (n + 1)\nfor i, j in enumerate(t, 1):\n if j < 0: u[i] = - j\n else: v[i] = j\n# print(u,v)\nt, p = [1], [0] * (n + 1)\nwhile t:\n a = t.pop()\n for b in r[a]:\n if p[b]: continue\n p[b] = a\n t.append(b)\nk = [len(t) for t in r]\nt = [a for a in range(2, n + 1) if k[a] == 1]\nx, y = [0] * (n + 1), [0] * (n + 1)\nwhile t:\n a = t.pop()\n b = p[a]\n x[b] = max(x[b], u[a])\n y[b] = max(y[b], v[a])\n k[b] -= 1\n if k[b] == 1:\n t.append(b)\n if u[b] > 0:\n if x[b] - y[b] > u[b]:\n u[b], v[b] = x[b], x[b] - u[b]\n else: u[b], v[b] = y[b] + u[b], y[b]\n else:\n if y[b] - x[b] > v[b]:\n u[b], v[b] = y[b] - v[b], y[b]\n else: u[b], v[b] = x[b], x[b] + v[b]\nprint(u[1] + v[1])", "from collections import defaultdict\r\nfrom sys import stdin,setrecursionlimit\r\nsetrecursionlimit(10**6)\r\nimport threading\r\ndef dfs(g,node,parent,cr,req):\r\n\tl=[0,0]\r\n\r\n\tfor i in g[node]:\r\n\t\tif i!=parent:\r\n\t\t\tt=dfs(g,i,node,cr,req)\r\n\t\t\t# print(t)\r\n\t\t\tl[0]=max(t[0],l[0])\r\n\t\t\tl[1]=max(t[1],l[1])\r\n\tif l[0]-l[1]<=req[node]:\r\n\t\tl[0]+=req[node]-(l[0]-l[1])\r\n\telse:\r\n\t\tl[1]+=(l[0]-l[1])-req[node]\r\n\t# print(l)\r\n\treturn l\r\ndef main():\r\n\tn=int(input())\r\n\tg=defaultdict(list)\r\n\tfor i in range(n-1):\r\n\t\ta,b=map(int,input().strip().split())\r\n\t\tg[a-1].append(b-1)\r\n\t\tg[b-1].append(a-1)\r\n\r\n\treq=list(map(int,input().strip().split()))\r\n\r\n\tcr=[0]\r\n\t#fol incre and decre\r\n\tx=dfs(g,0,-1,cr,req)\r\n\tprint(sum(x))\r\nthreading.stack_size(10 ** 8)\r\nt = threading.Thread(target=main)\r\nt.start()\r\nt.join()", "import threading\r\nimport sys\r\ninput=sys.stdin.readline\r\nthreading.stack_size(10**8)\r\nsys.setrecursionlimit(10**7)\r\n \r\nfrom collections import defaultdict\r\n \r\ndef main():\r\n\tn=int(input())\r\n\tg=defaultdict(list)\r\n\tfor _ in range(n-1):\r\n\t\tu,v=map(int,input().split())\r\n\t\tg[u].append(v)\r\n\t\tg[v].append(u)\r\n\tv=[0]+list(map(int,input().split()))\r\n\t\r\n\tinc=[0]*(n+1)\r\n\tdec=[0]*(n+1)\r\n\tdef dfs(cn,p):\r\n\t\tinc[cn]=0\r\n\t\tdec[cn]=0\r\n\t\tfor nn in g[cn]:\r\n\t\t\tif nn!=p:\r\n\t\t\t\ti,d=dfs(nn,cn)\r\n\t\t\t\tinc[cn]=max(inc[cn],i)\r\n\t\t\t\tdec[cn]=max(dec[cn],d)\r\n\t\ttot=v[cn]+inc[cn]-dec[cn]\r\n\t\tif tot>0:dec[cn]+=tot\r\n\t\telse:inc[cn]+=abs(tot)\t \r\n\t\treturn inc[cn],dec[cn]\r\n\t\r\n\tdfs(1,-1)\r\n\tprint(inc[1]+dec[1])\r\n \t\r\nthreading.Thread(target=main).start() ", "from sys import stdin, stdout,setrecursionlimit\r\nfrom collections import defaultdict,deque,Counter,OrderedDict\r\nfrom heapq import heappop,heappush\r\nimport threading\r\n\r\nn = int(stdin.readline())\r\n\r\ngraph = [set() for x in range(n)]\r\n\r\nfor x in range(n-1):\r\n a,b = [int(x) for x in stdin.readline().split()]\r\n a -= 1\r\n b -= 1\r\n\r\n graph[a].add(b)\r\n graph[b].add(a)\r\n\r\nvals = [int(x) for x in stdin.readline().split()]\r\n\r\nbruh = [(0,-1)]\r\n\r\nfor x in range(n):\r\n num,p = bruh[x]\r\n for y in graph[num]:\r\n if y != p:\r\n bruh.append((y,num))\r\n\r\nresult = [-1 for x in range(n)]\r\n\r\nfor v,parent in bruh[::-1]:\r\n nP = 0\r\n nN = 0\r\n for x in graph[v]:\r\n if x != parent:\r\n p,n = result[x]\r\n nP = max(nP,p)\r\n nN = max(nN, n)\r\n nN = max(nN, nP+vals[v])\r\n nP = max(nP, nN-vals[v])\r\n \r\n result[v] = (nP,nN)\r\n\r\nng, ps = result[0]\r\n\r\nvals[0] += ps - ng\r\n\r\nstdout.write(str(ng+ps))\r\n", "import sys\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\n\r\n# --------------------\r\n# 手写栈模板\r\n# 克服py栈太浅的问题\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\r\n\r\ndef solve():\r\n n = int(input())\r\n g = defaultdict(list)\r\n for _ in range(n - 1):\r\n a, b = list(map(int, input().split()))\r\n g[a - 1].append(b - 1)\r\n g[b - 1].append(a - 1)\r\n v = list(map(int, input().split()))\r\n ans = 0\r\n\r\n\r\n # 返回的是当前子树变成全0的最少次数\r\n # 最少次数：【加的次数，减的次数】\r\n @bootstrap\r\n def dfs(node, fa):\r\n\r\n # 保留最大的\r\n # 这样其他小的都能顺道完成\r\n plus = minus = 0\r\n for nextNode in g[node]:\r\n if nextNode == fa:\r\n continue\r\n p, m = yield dfs(nextNode, node)\r\n plus = max(plus, p)\r\n minus = max(minus, m)\r\n # 当前节点被迫修改（因为必须连上1）\r\n curr = v[node] + plus - minus\r\n if curr > 0:\r\n yield plus, minus + curr\r\n else:\r\n # 小心curr是负数的情况\r\n yield plus - curr, minus\r\n\r\n\r\n\r\n # 最小的修改对应的+1修改和-1修改\r\n print(sum(dfs(0, -1)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "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\nfrom collections import defaultdict\r\nimport sys\r\nimport threading\r\nthreading.stack_size(10**8)\r\nsys.setrecursionlimit(10**6)\r\n\r\ndef main():\r\n n=ri()\r\n g=defaultdict(list)\r\n pos,neg=[0]*n,[0]*n\r\n for i in range(n-1): u,v=rm(); u-=1;v-=1;g[u].append(v);g[v].append(u)\r\n val=rl()\r\n def dfs(u,p): \r\n maxpos=maxneg=0\r\n for v in g[u]:\r\n if v==p: continue\r\n dfs(v,u)\r\n maxpos=max(maxpos,pos[v])\r\n maxneg=max(maxneg,neg[v])\r\n pos[u]=maxpos; neg[u]=maxneg\r\n val[u]+=(maxneg-maxpos)\r\n if val[u]>0: pos[u]+=val[u] \r\n else: neg[u]-=val[u]\r\n dfs(0,-1)\r\n print(pos[0]+neg[0])\r\n\r\nthreading.Thread(target=main).start()", "from collections import defaultdict, Counter, deque\r\nimport threading\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n\r\nthreading.stack_size(10**8)\r\nsys.setrecursionlimit(10**6)\r\n\r\n\r\ndef main():\r\n # think first code later dorime\r\n n = ri()\r\n g = defaultdict(list)\r\n for _ in range(n-1):\r\n u, v = rl()\r\n g[u].append(v)\r\n g[v].append(u)\r\n v = [0]+rl()\r\n\r\n req = [[0, 0] for _ in range(n+1)]\r\n\r\n def dfs(cn, par):\r\n for nn in g[cn]:\r\n if nn != par:\r\n dfs(nn, cn)\r\n req[cn][0] = max(req[cn][0], req[nn][0])\r\n req[cn][1] = max(req[cn][1], req[nn][1])\r\n\r\n val = v[cn]+req[cn][0]-req[cn][1]\r\n if val >= 0:\r\n req[cn][1] += val\r\n else:\r\n req[cn][0] -= val\r\n dfs(1, -1)\r\n print(sum(req[1]))\r\n pass\r\n\r\n\r\n# main()\r\nthreading.Thread(target=main).start()\r\n" ]

[ "n,vb,vs=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nget=[None]*n \r\nt=0 \r\ndx,dy=map(int,input().split())\r\nget[0]=10**9 \r\nfrom math import sqrt as S \r\ndef dist(x1,y1,x2,y2):\r\n return S((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))\r\ndef time(d,v):\r\n return d/v\r\nprev=0 \r\nfor i in range(1,n):\r\n #t=0\r\n t1=time(l[i]-l[i-1],vb)\r\n #t=t+time(l[i]-l[i-1],vb)\r\n prev+=t1 \r\n curr=time(dist(l[i],0,dx,dy),vs)\r\n get[i]=round(curr+prev,10)\r\nmini=get[0]\r\nfor i in range(1,n):\r\n if get[i]<=mini:\r\n mini=get[i]\r\n ind=i+1 \r\nprint(ind)", "n, vb, vs=map(int, input().split())\r\na=input().split()\r\nx,y=input().split()\r\nkelias=((int(a[1])-int(x))**2+int(y)**2)**(1/2)\r\nt=((int(a[1])-int(x))**2+int(y)**2)**(1/2)/vs+int(a[1])/vb\r\nk=2\r\ni=1\r\nwhile i<n:\r\n if ((int(a[i])-int(x))**2+int(y)**2)**(1/2)/vs+int(a[i])/vb<=t:\r\n if t==((int(a[i])-int(x))**2+int(y)**2)**(1/2)/vs+int(a[i])/vb and ((int(a[i])-int(x))**2+int(y)**2)**(1/2)<kelias:\r\n kelias=((int(a[i])-int(x))**2+int(y)**2)**(1/2)\r\n k=i+1\r\n else:\r\n kelias=((int(a[i])-int(x))**2+int(y)**2)**(1/2)\r\n t=((int(a[i])-int(x))**2+int(y)**2)**(1/2)/vs+int(a[i])/vb\r\n k=i+1\r\n i+=1\r\nprint(k)", "def main():\r\n n, vb, vs = map(int, input().split()) #n:Numero de paradas, vb:Velocidad del bus, vs:Velocidad del estudiante\r\n x = list(map(int, input().split())) #Coordenadas de las paradas\r\n xu, yu = map(int, input().split()) #Coordenadas X y Y de la univesidad\r\n ma = 10**6 #Número máximo de la parada \r\n ans = 0 #Parada donde se debe bajar\r\n \r\n for i in range(1,n):\r\n ts = (((xu - x[i])**2 + yu**2)**0.5) / vs #Tiempo que toma ir desde una parada de autobus hasta la universidad. Se calculó como distancia desde la i-ésima parada hasta la universidad sobre la velocidad del estudiante\r\n tb = x[i] / vb #Tiempo de conducción del autobu. Se calculó como la i-ésima parada sobre la velocidad del bus.\r\n tt = ts + tb #Timepo total. Suma del tiempo a pie y el tiempo en bus\r\n \r\n if tt <= ma: \r\n ma = tt\r\n ans = i\r\n\r\n print(ans+1)\r\n \r\nif __name__ == \"__main__\":\r\n main()", "while True:\r\n\ttry:\r\n\t\timport math\r\n\t\t\r\n\t\tdef soln(n, vb, vs, a, x2, y2):\r\n\t\t\tmint = 10**8*(1.0)\r\n\t\t\t#print(mint)\r\n\t\r\n\t\t\tpos = 0\r\n\t\t\tfor i in range(1,n):\r\n\t\t\t\tx1= a[i]\r\n\t\t\t\ty1 = 0\r\n\t\t\t\ts = math.sqrt((x2-x1)**2+(y2-y1)**2)\r\n\t\t\t\tt = s/vs + x1/vb\r\n\t\t\t\t#print(t)\r\n\t\t\t\tif t <= mint:\r\n\t\t\t\t\tpos = i+1\r\n\t\t\t\t\tmint = t\r\n\t\t\t\t\t#print(pos, \" pos\")\r\n\t\t\tprint(pos)\r\n\t\t\t\r\n\t\t\r\n\t\tdef read():\r\n\t\t\tn, vb, vs = map(int, input().split())\r\n\t\t\ta = list(map(float, input().split()))\r\n\t\t\tux, uy = map(float, input().split())\r\n\t\t\tsoln(n, vb, vs, a, ux, uy)\r\n\r\n\t\tif __name__ == \"__main__\":\r\n\t\t\tread()\r\n\texcept EOFError:\r\n\t\tbreak", "from math import *\r\nn,vb,vs,d,xu,yu = *list(map(int,input().split())), list(map(int,input().split())), *list(map(int,input().split()))\r\nprint( min([ ( d[i]/vb+hypot(xu-d[i],yu)/vs, hypot(xu-d[i],yu), i+1) for i in range(1,len(d))])[2])", "def getDist(x1,x2,y2,y1=0):\r\n return (((x2-x1)**2)+((y1-y2)**2))**0.5\r\ndef x():\r\n return list(map(int,input().split()))\r\n\r\nn,v_b,v_s=x()\r\nx_values=x()\r\nx2,y2=x()\r\n\r\nc=True\r\n\r\ni=2\r\nxu=getDist(0,x2,y2)\r\nprev_time=xu/v_s\r\nfor ox in x_values[1:]:\r\n xu=getDist(ox,x2,y2)\r\n total_time=(ox/v_b)+(xu/v_s)\r\n if total_time>prev_time:\r\n if i==2:\r\n print(2)\r\n else:\r\n print(i-1)\r\n c=False\r\n break\r\n i+=1\r\n prev_time=total_time\r\n\r\nif c:\r\n print(n)\r\n \r\n \r\n \r\n \r\n", "from sys import stdin\r\nfrom math import hypot\r\n\r\n\r\nn,vb,vs = map(int,stdin.readline().split())\r\n\r\nbs = list(map(int,stdin.readline().split()))\r\nxu,yu = map(int,stdin.readline().split())\r\n\r\nmaior = float('inf')\r\nindice = -1\r\n\r\nfor i in range(1,n):\r\n ax = bs[i]\r\n r = hypot((xu-ax),yu)\r\n temp = ax/vb+r/vs\r\n if temp <= maior:\r\n maior = temp\r\n indice = i+1\r\nprint(indice)", "n, vb, vs = map(int, input().split())\r\na = list(map(float, input().split()))\r\nx, y = map(float,input().split())\r\nb, c = 10**10, 0\r\nfor i in range(1, n):\r\n t = (((x-a[i])**2+y**2)**0.5)/vs+a[i]/vb\r\n if t <= b:\r\n b, c = t, i\r\nprint(c+1)\r\n", "n, vb, vs = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nxu, yu = map(int,input().split())\r\ntime = A[-1]/vb + ((yu*yu+(xu-A[-1])**2)**(1/2))/vs\r\np = n\r\nfor i in range(1, len(A)-1):\r\n time1 = A[i]/vb + ((yu*yu+(xu-A[i])**2)**(1/2))/vs\r\n if time1 < time:\r\n time = time1\r\n p = i+1\r\n elif time1 == time:\r\n dist1 = (xu- A[p-1]) ** 2\r\n dist2 = (xu - A[i]) ** 2\r\n if dist2 < dist1:\r\n p = i+1\r\n \r\nprint(p)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, b, s = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nx, y = map(int, input().split())\r\n\r\nd1 = 1e9\r\nd2 = [1e9, -1]\r\nfor i in range(1, n):\r\n c = w[i]/b + ((x-w[i])**2 + y**2)**0.5 /s\r\n if c == d1:\r\n if abs(x-w[i]) < d2[0]:\r\n d2[0] = abs(x-w[i])\r\n d2[1] = i+1\r\n elif c < d1:\r\n d1 = c\r\n d2 = [abs(x-w[i]), i+1]\r\n\r\nprint(d2[1])", "n,vb,vs=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nx,y=map(int,input().split())\r\n\r\nif(vs>vb):\r\n print(2)\r\nelse:\r\n i=1\r\n mx=10**9+7\r\n indx=0\r\n while(i<n):\r\n\r\n if(arr[i]==x):\r\n print(i+1)\r\n break\r\n else:\r\n time=(arr[i]/vb)+(((x-arr[i])**2+y**2)**.5)/vs\r\n if(mx>time):\r\n mx=time\r\n indx=i+1\r\n else:\r\n print(indx)\r\n break\r\n\r\n i+=1\r\n if(i==n):\r\n print(i)\r\n\r\n\r\n\r\n", "n, vb, vs = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nxu, yu = map(int, input().split())\r\nxv, dv, tv = 0, 10 ** 6, 10 ** 6\r\nfor i in range(1, n):\r\n d = ((xu - x[i]) ** 2 + yu ** 2) ** 0.5\r\n t = x[i] / vb + d / vs\r\n if t < tv or (t == tv and d < dv):\r\n xv, dv, tv = i + 1, d, t\r\nprint(xv)", "import math\r\nn, v1, v2 = [int(i) for i in input().split()]\r\nz = [int(i) for i in input().split()]\r\nx, y = [int(i) for i in input().split()]\r\na = z[1]/v1 + math.sqrt(y**2 + (x-z[1])**2)/v2\r\nd = math.sqrt(y**2 + (x-z[1])**2)/v2\r\nb = 2\r\nfor i in range(2, n):\r\n if z[i]/v1 + math.sqrt(y**2 + (x-z[i])**2)/v2 <= a:\r\n \r\n if z[i]/v1 + math.sqrt(y**2 + (x-z[i])**2)/v2 < a:\r\n a = z[i]/v1 + math.sqrt(y**2 + (x-z[i])**2)/v2\r\n b = i+1\r\n d = math.sqrt(y**2 + (x-z[i])**2)/v2\r\n elif math.sqrt(y**2 + (x-z[i])**2)/v2 < d:\r\n b = i+1\r\nprint(b)\r\n", "import math\r\n[n, vb, vs] = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\n[xu, yu] = list(map(int, input().split()))\r\n\r\noptimal_time = None\r\nchosen_bus = None\r\n\r\nfor idx in range(1, n):\r\n ele = arr[idx]\r\n time = 0\r\n time += ele*vs + math.sqrt(math.pow(ele - xu, 2) + math.pow(yu, 2))*vb\r\n\r\n if optimal_time == None:\r\n optimal_time = time\r\n chosen_bus = idx\r\n else:\r\n if time < optimal_time:\r\n optimal_time = time\r\n chosen_bus = idx\r\n elif time == optimal_time:\r\n # tier\r\n old_ele = arr[chosen_bus]\r\n if math.pow(old_ele - xu, 2) > math.pow(ele - xu, 2):\r\n optimal_time = time\r\n chosen_bus = idx\r\n\r\nprint(chosen_bus+1)\r\n\r\n", "import math\r\nn, vb, vs = map(int, input().split())\r\nvb, vs = float(vb), float(vs)\r\np = list(map(float, input().split()))\r\nx, y = map(float, input().split())\r\nmn = float('inf')\r\nidx = -1\r\nlen = 0.0\r\nans = float('inf')\r\nfor i in range(1,n):\r\n len += p[i] - p[i - 1]\r\n t = len / vb\r\n d = math.sqrt((p[i]-x)**2 + y**2)\r\n t += d / vs\r\n if t < mn:\r\n mn = t\r\n idx = i+1\r\n elif t == mn:\r\n if d < ans:\r\n ans = d\r\n idx = i+1\r\n else:\r\n continue\r\nprint (idx)", "def dist(a,b,c,d):\r\n return (((a-c)**2)+((b-d)**2))**0.5\r\n\r\nn,vb,vs=map(int,input().split())\r\nx=list(map(int,input().split()))[1::]\r\nxx,yy=map(int,input().split())\r\nmintime=-1\r\nlol=0\r\nfor i in range(n-1):\r\n time=(x[i]/vb)+dist(x[i],0,xx,yy)/vs\r\n if mintime==-1:\r\n mintime=time\r\n elif time<mintime:\r\n mintime=time\r\n lol=i\r\n elif time==mintime:\r\n if dist(x[lol],0,xx,yy)>dist(x[i],0,xx,yy):\r\n lol=i\r\nprint(lol+2)", "from math import *\nn, vb, vs = map(int, input().split())\nd = list(map(int, input().split()))\nxu, yu = map(int, input().split())\nprint(min([(d[i]/vb+hypot(xu-d[i], yu)/vs, hypot(xu-d[i], yu), i+1) for i in range(1, len(d))])[2])\n\t\t \t \t\t \t \t\t\t \t\t \t\t\t \t \t", "#****************************************\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\nfrom math import *\r\nn,vb,vs,d,xu,yu = *list(map(int,input().split())), list(map(int,input().split())), *list(map(int,input().split()))\r\nprint( min([ ( d[i]/vb+hypot(xu-d[i],yu)/vs, hypot(xu-d[i],yu), i+1) for i in range(1,len(d))])[2])\r\n#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** Team Galaxy **\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/", "def s():\r\n\t[n,vb,vs]=list(map(int,input().split()))\r\n\ta = list(map(int,input().split()))\r\n\tuni = list(map(int,input().split()))\r\n\tdef dis(x,y):\r\n\t\timport math\r\n\t\treturn math.sqrt(abs(x-uni[0])**2+abs(y-uni[1])**2)\r\n\tenu = enumerate(a)\r\n\tnext(enu)\r\n\tprint(min([(i[1]/vb+dis(i[1],0)/vs,dis(i[1],0),i[0]+1) for i in enu])[2])\r\ns()", "n,b,s=input().split()\r\nn,b,s=int(n),int(b),int(s)\r\nl=[int(i) for i in input().split()]\r\nx,y=input().split()\r\nx,y=int(x),int(y)\r\n\r\nm=[10**20,10**20]\r\nc=1\r\nfor i in range(1,n):\r\n t=[l[i]*s+((x-l[i])**2+y**2)**.5*b,(x-l[i])**2+y**2]\r\n if t<m:\r\n c=i+1\r\n m=t\r\nprint(c)\r\n", "# from decimal import *\r\n# getcontext().prec=16\r\n# from math import sqrt\r\n# from scipy.special import binom\r\n# from collections import defaultdict\r\nfrom math import sin,pi,sqrt\r\n\r\nn,x,y=[int(element) for element in input().split(' ')]\r\nr=[int(element) for element in input().split(\" \")]\r\nxx,yy=[int(element) for element in input().split(\" \")]\r\n\r\nbest_index=[]\r\nbest_time=-1\r\nbool=False\r\nfor i in range(1,n):\r\n tempo=r[i]/x+sqrt( (xx-r[i])**2+yy**2 )/y\r\n if best_time==-1:\r\n best_time=tempo\r\n best_index.append([((xx-r[i])**2+yy**2),i])\r\n elif tempo<=best_time:\r\n best_time=tempo\r\n best_index.append([((xx-r[i])**2+yy**2),i])\r\nbest_index.sort()\r\nanswer=best_index[0][1]+1\r\n\r\nprint(answer)", "import math\n\nn, bv, sv = (int(x) for x in input().split())\ns = [int(x) for x in input().split()]\nux, uy = (int(x) for x in input().split())\n\nm = None\n\nfor i, x in enumerate(s):\n if i == 0:\n continue\n \n d = math.sqrt((ux - x) ** 2 + uy ** 2)\n t = x / bv + d / sv\n d, t = int(d * 10 ** 8), int(t * 10 ** 8)\n \n if not m or (t, d) < m:\n m = (t, d, i)\n\nprint(m[2] + 1)\n", "n,b,s = map(int,input().split())\r\nt = list(map(int,input().split()))\r\nx,y = map(int,input().split())\r\nu=99999999999\r\nans=0\r\nfor j in range(1,n):\r\n a = ((x-t[j])**2 + (y)**2)**(0.5)\r\n tot = t[j]/b + a/s\r\n if tot<=u:\r\n u=tot\r\n ans=j+1\r\nprint(ans)\r\n", "\r\nfrom math import sqrt\r\n\r\nn, v1, v2 = map(int, input().split())\r\nstops = list(map(int, input().split()))[1:]\r\nx, y = map(int, input().split())\r\n\r\nts = [xi/v1+sqrt((x-xi)**2+y**2)/v2 for xi in stops]\r\ntm = min(ts)\r\nres = 0\r\n\r\nfor i in range(len(ts)):\r\n if ts[i] == tm:\r\n res = i+2\r\n\r\nprint(res)", "import math\r\n\r\nbesttime = 10**20\r\nans = -1\r\nn,vb, vs = map(int,input().split())\r\nx = list(map(int,input().split()))\r\nxu,yu = map(int,input().split())\r\n\r\nfor i in range(1,n):\r\n\ttime = 0\r\n\ttime+= x[i]/vb\r\n\ttime += (math.sqrt((xu-x[i])**2+(yu-0)**2))/vs\r\n\t#print(time)\r\n\tif time < besttime:\r\n\t\tbesttime = time\r\n\t\tans = i+1\r\n\telif time==besttime:\r\n\t\tif abs(xu-x[i]) < abs(xu-x[ans-1]):\r\n\t\t\tans = i+1\r\n\telse:\r\n\t\tpass\r\n\r\nprint(ans)", "import math\r\n\r\nn, bus_velocity, student_velocity = map(int, input().split())\r\nstops = list(map(int, input().split()))\r\nuni = list(map(int, input().split()))\r\nans = []\r\nfor i in range(1, len(stops)):\r\n # time = distance/velocity\r\n t = stops[i] / bus_velocity + math.hypot(uni[0] - stops[i], uni[1]) / student_velocity\r\n # distance from the stop to the university\r\n d = math.hypot(uni[0] - stops[i], uni[1])\r\n # the bus stop position\r\n position = i + 1\r\n ii = (t, d, position)\r\n ans.append(ii)\r\n\r\nprint(min(ans)[2])", "import math\r\nn, vB, vS = map(int, input().split(' '))\r\nls = list(map(int, input().split(' ')))\r\nx, y = map(int, input().split(' '))\r\nminTime = math.inf\r\nminIndex = 0\r\ncurTime = 0\r\nfor i in range(1, n):\r\n curTime += (ls[i] - ls[i - 1]) / vB\r\n if minTime >= curTime + math.sqrt((x - ls[i]) * (x - ls[i]) + y * y) / vS:\r\n minIndex = i\r\n minTime = curTime + math.sqrt((x - ls[i]) * (x - ls[i]) + y * y) / vS\r\nprint(minIndex + 1)\r\n", "import math\r\n[n, vb, vs] = [int(x) for x in input().split()]\r\nst = [int(x) for x in input().split()]\r\n[x, y] = [int(x) for x in input().split()]\r\n\r\nt = float('inf')\r\nxo = 0\r\nfor i in range(1, n):\r\n nt = (st[i] / vb) + (math.sqrt((x - st[i])**2 + y ** 2) / vs)\r\n if nt <= t:\r\n t = nt\r\n xo = i + 1\r\n\r\nprint(str(xo))\r\n\r\n#v = d/t => t = d/v ", "from math import sqrt\r\n\r\nn,vb,vs = list(map(int,input().split()))\r\nxl = list(map(int,input().split()))\r\nxii,yii = list(map(int,input().split()))\r\ntime = lambda rsb,xs,x,y: rsb*xs + sqrt((x-xs)*(x-xs)+y*y)\r\ntimes = [time(vs/vb,xl[i],xii,yii) for i in range(n-1,0,-1)] #revserse to prefer later stop\r\nprint(n-times.index(min(times)))\r\n", "import math\nn,b,s=map(int,input().split())\nbs=list(map(int,input().split()))\nx,y=map(int,input().split())\ntl=[]\nfor i in bs:\n t=i/b \n a=x-i\n dl2=a*a + y*y \n dl=math.sqrt(dl2)\n t+=(dl/s)\n tl.append(t)\ntl=tl[1:]\nmini=min(tl)\nansl=[i for i,j in enumerate(tl) if mini==j]\nans=max(ansl)\nprint(ans+2)", "from math import sqrt\n\nn, vb, vs = map(int, input().split())\na = list(map(int, input().split()))\nx, y = map(int, input().split())\n\nEPS = 1e-10\nans = float('inf')\nbi = 1\nolddist = float('inf')\nfor i in range(1, n):\n t1 = a[i] / vb\n\n dx = a[i] - x\n dist = sqrt(dx * dx + y * y)\n\n t2 = dist / vs\n\n # a[i] / vb + sqrt((a[i] - x) * (a[i] - x) + y * y) / vs\n # a[i] / vb + sqrt(a[i]^2 - 2a[i]x + x^2 + y^2) / vs\n\n # print(i, t1, t2, t1 + t2)\n if t1 + t2 + EPS < ans or abs(t1 + t2 - ans) < EPS and dist < olddist:\n ans = t1 + t2\n bi = i\n olddist = dist\n\nprint(bi + 1)\n", "import math\nn,vb,vs = map(int,input().split())\narr = list(map(int,input().split()))\nx,y = map(int,input().split())\nidx = 1\nt = float('inf')\nwhile idx<n:\n t1 = (arr[idx]/vb)+ (math.sqrt((arr[idx]-x)**2+(y)**2))/vs\n if t> t1:\n idx+=1\n t = t1\n elif t==t1:\n idx-=1\n d1 = (math.sqrt((arr[idx]-x)**2+(y)**2))\n idx+=1\n d2 = (math.sqrt((arr[idx]-x)**2+(y)**2))\n if d1>d2:\n idx+=1\n break\n else:\n break\n else:\n break\n\nprint(idx) \n \n", "n, vb, vs = (int(i) for i in input().split())\r\nst = [int(i) for i in input().split()]\r\nxu, yu = (int(i) for i in input().split())\r\nminvr = 1000000\r\nstay = 0\r\nif vb < vs:\r\n print(2)\r\nelse:\r\n for i in st[1:]:\r\n vr = i / vb + (((xu - i) ** 2 + yu ** 2) ** (1 / 2) / vs)\r\n if vr < minvr:\r\n minvr = vr\r\n stay = st.index(i) + 1\r\n elif vr == minvr:\r\n if ((xu - i) ** 2 + yu ** 2) ** (1 / 2) < ((xu - st[stay - 1]) ** 2 + yu ** 2) ** (1 / 2):\r\n stay = st.index(i) + 1\r\n print(stay)\r\n ", "import math\r\n\r\ndef travelTime(i):\r\n global x, u, vb, vs\r\n b = x[i]\r\n d = distance(b,u)\r\n return (b[0]/vb + d/vs, d)\r\n\r\ndistance = lambda a, b: math.sqrt((b[0]-a[0])**2 + (b[1]-a[1])**2)\r\nn, vb, vs = map(int,input().split())\r\nx = [None] + [(_x,0) for _x in map(int,input().split())]\r\nu = tuple(map(int,input().split()))\r\n\r\nprint(sorted(list(range(2,n+1)), key=travelTime)[0])\r\n", "import math\r\ndef main():\r\n numberOfBusSTOPS, busSpeed, studentSpeed = map(int,input().split())\r\n busCoordinate = []\r\n studentTime = []\r\n distanceFromUniversity = []\r\n #the time that he will \r\n busTime = []\r\n busCoordinate = list(map(int,input().split()))\r\n time = []\r\n universityX, universityY = map(int,input().split())\r\n for i in range(numberOfBusSTOPS):\r\n busTime.append(busCoordinate[i]/busSpeed)\r\n distanceFromUniversity.append(((universityX - busCoordinate[i])**2 + universityY**2)**(1/2))\r\n studentTime.append(distanceFromUniversity[i]/studentSpeed)\r\n time.append(busTime[i]+studentTime[i])\r\n minTime = min(time)\r\n result = time.index(min(time))\r\n\r\n for i in range(numberOfBusSTOPS):\r\n if abs(minTime - time[i]) < 10**-7 and distanceFromUniversity[i]<distanceFromUniversity[result]:\r\n result = i\r\n \r\n if result == 0:\r\n result += 1\r\n print(result+1)\r\nmain()\r\n \r\n", "from math import *\r\nn,x,y=map(int,input().split())\r\nr=list(map(int,input().split()))\r\nxx,yy=map(int,input().split())\r\nt=10**10\r\narray=[]\r\nfor i in range(1,n):\r\n ti=r[i]/x+sqrt((r[i]-xx)**2+yy**2)/y\r\n if ti<t:\r\n t=ti\r\n array=[]\r\n if ti==t:array.append([(r[i]-xx)**2+yy**2,i])\r\narray.sort()\r\nprint(array[0][1] + 1)", "from math import sqrt\r\n\r\ndef read():\r\n return [int(c) for c in input().split()]\r\n\r\ndef dist(p, q):\r\n return sqrt(sum((px - qx) ** 2.0 for px, qx in zip(p, q))) \r\n\r\nn, vb, vs = read()\r\nstops = read()\r\nxu, yu = read()\r\n\r\narrival_time = []\r\nfor i, stop in enumerate(stops, 1):\r\n time_bus = stop / vb\r\n time_walk = dist((stop, 0), (xu, yu))/vs\r\n arrival_time.append((time_bus + time_walk, time_walk, i))\r\n\r\narrival_time.sort()\r\nans = arrival_time[0][2]\r\nif ans == 1:\r\n ans = arrival_time[1][2]\r\n\r\nprint(ans)", "n,b,s = (int(i) for i in input().split(\" \"))\r\narr = [int(i) for i in input().split(\" \")]\r\nx,y = (int(i) for i in input().split(\" \"))\r\n\r\nans = -1\r\nm = 1000000000000\r\nfor i in range(1,len(arr)):\r\n q = arr[i]/b + (((arr[i]-x)**2 + y**2)**(0.5))/s\r\n if q<=m or ans==-1:\r\n m = q\r\n ans = i\r\n \r\nprint(ans+1)", "inp = list(map(int,input().split()))\r\nn=inp[0]\r\nvb=inp[1]\r\nvs=inp[2]\r\ninp = list(map(int,input().split()))\r\nfrom collections import Counter\r\nc=Counter([])\r\nfor i in range(len(inp)):\r\n c[inp[i]]=i+1\r\ninp=inp[1:]\r\ntar = list(map(int,input().split()))\r\nx=tar[0]\r\ny=tar[1]\r\nz=[(t/vb+(pow((x-t)**2+y**2,0.5))/vs) for t in inp]\r\nk=min(z)\r\narr=[]\r\nfor i in range(len(z)):\r\n if z[i]==k:\r\n arr.append(i)\r\narr.sort(key=lambda m:(inp[m]-x)**2+y**2)\r\nprint (arr[0]+2)", "n, vb, vs = map(int, input().split())\r\nstops = list(map(int, input().split()))\r\nxu, yu = map(int, input().split())\r\nminTime, idx = float('inf'), -1\r\ni = 1\r\nwhile i<n:\r\n time = stops[i]/vb\r\n dsu = pow(pow(stops[i]-xu, 2)+yu**2, 0.5)\r\n time += dsu/vs\r\n #print(i, time)\r\n if time==minTime:\r\n if dsu<md:\r\n md, idx = dsu, i+1\r\n if time<minTime:\r\n md, minTime, idx = dsu, time, i+1\r\n i += 1\r\nprint(idx)\r\n", "\r\nn, vb, vs = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nx1, y1 = map(int, input().split())\r\nmini = 10**18\r\nostatok = 1\r\nfor i in range(1, n):\r\n put = ((x1 - x[i])**2 + y1**2)**0.5\r\n if (x[i]/vb) + (put/vs) <= mini:\r\n mini = (x[i]/vb) + (put/vs)\r\n ostatok += 1\r\nprint(ostatok)", "from math import *\r\n \r\nn,vb,vs = map(int,input().split())\r\n \r\nd = list(map(int,input().split()))\r\n \r\nxu,yu = map(int,input().split())\r\n \r\nprint( min([ ( d[i]/vb+hypot(xu-d[i],yu)/vs, hypot(xu-d[i],yu), i+1) for i in range(1,len(d))])[2])\r\n ", "import math\n\ndef sqr(x):\n return x*x\n\nn, b, s = map(int, input().split())\ncoords = list(map(int, input().split()))\nx,y = map(int, input().split())\nc = 1\ndist = math.sqrt(sqr(x-coords[1])+sqr(y))\nfor i in range(2,n):\n if (float(coords[i])-coords[c])/b+math.sqrt(sqr(x-coords[i])+sqr(y))/s<=dist/s and dist>math.sqrt(sqr(x-coords[i])+sqr(y)):\n c=i\n dist=math.sqrt(sqr(x-coords[i])+sqr(y))\nprint(c+1)\n ", "n, vb, vs = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nx, y = [int(i) for i in input().split()]\r\nm = ms = 9999999999999999999\r\nk = 0\r\nfor i in range(1, n):\r\n s = ((a[i] - x) ** 2 + y ** 2) ** 0.5\r\n t = a[i] / vb + s / vs\r\n if t < m or (t == m and s < ms):\r\n m = t\r\n k = i\r\n ms = s\r\nprint(k + 1)\r\n", "s = input('').split()\r\nn = int(s[0])\r\nvb = int(s[1])\r\nvs = int(s[2])\r\npoints = input('').split()\r\nfor i in range(0,n):\r\n points[i] = int(points[i])\r\nuniversity = input('').split()\r\nx = int(university[0])\r\ny = int(university[1])\r\n\r\nmt = points[1]/vb+(((x-points[1])**2+y**2)**(0.5))/vs\r\nmtd = (x-points[i])**2\r\nmtp = 1\r\n\r\nfor i in range(2,n):\r\n if (points[i]/vb+(((x-points[i])**2+y**2)**(0.5))/vs <= mt):\r\n if (x-points[i])**2 < (x-mtp)**2:\r\n mt = (points[i]/vb+(((x-points[i])**2+y**2)**(0.5))/vs)\r\n mtd = (x-points[i])**2\r\n mtp = i\r\nprint(mtp+1)", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, vb, vs = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nxu, yu = map(int, input().split())\r\ninf = pow(10, 15) + 1\r\nmi = inf\r\nans = 2\r\nfor i in range(1, n):\r\n xi = x[i]\r\n d = xi * vs + math.sqrt((xu - xi) * (xu - xi) + yu * yu) * vb\r\n if mi >= d:\r\n mi = d\r\n ans = i + 1\r\nprint(ans)", "def dist(x, y, a, b):\r\n dx = x-a\r\n dy = y-b\r\n return (dx*dx+dy*dy)**.5\r\n\r\nn, vb, vs = map(int, input().split())\r\na = list(map(int, input().split()))\r\nxu, yu = map(int, input().split())\r\nans = [float('inf'), 0]\r\nfor i in range(1, n):\r\n bus = a[i]/vb\r\n guy = dist(xu, yu, a[i], 0)\r\n sm = bus+guy/vs\r\n if sm<ans[0]:\r\n ans = [sm, i+1]\r\n elif sm==ans[0]:\r\n if dist(xu, yu, a[ans[1]-1], 0)>dist(xu, yu, a[i], 0):\r\n ans[1] = i+1\r\nprint(ans[1])", "n, vb, vs = list(map(int, input().split(\" \")))\r\nl = list(map(int, input().split(\" \")))\r\nxu, yu = list(map(int, input().split(\" \")))\r\nprint(min([(i, l[i] / vb, ((l[i] - xu) ** 2 + yu ** 2) ** 0.5 / vs) for i in range(1, n)], key = lambda x: (x[1] + x[2], x[2]))[0] + 1)", "n,mbs,ss=map(int,input().split())\r\nst=list(map(int,input().split()))\r\nx,y=map(int,input().split())\r\nif ss>mbs:\r\n print(2)\r\nelse:\r\n t=[]\r\n l=[]\r\n for i in st:\r\n u=i\r\n o=((x-i)**2+y**2)**0.5\r\n tt=u/mbs+o/ss\r\n t.append(tt)\r\n l.append(o/ss)\r\n g=t.index(min(t))\r\n if min(t)==max(t):\r\n g=l.index(min(l))\r\n if g==0:\r\n g+=1\r\n print(g+1)", "from math import sqrt\r\n\r\nn, vb, vs = map(int, input().split())\r\nmin_s = 10 ** 10\r\nvalues = list(map(int, input().split()))\r\nuni_x, uni_y = map(int, input().split())\r\ns_i = min_stop = 0\r\nfor i in range(1, len(values)):\r\n temp_s = values[i] / vb + sqrt(uni_y ** 2 + (uni_x - values[i]) ** 2) / vs \r\n if temp_s < min_s or (temp_s == min_s and abs(values[i] - uni_x) < abs(min_stop - uni_x)):\r\n min_s = temp_s\r\n s_i = i + 1 \r\n min_stop = values[i]\r\n\r\nprint(s_i)\r\n\r\n\r\n", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\n\r\nn,vb,vs = M()\r\nxpos = L()\r\nX,Y = M()\r\n\r\nans = mod1\r\nindex = -1\r\nfor i in range(1,n):\r\n t = (xpos[i]/vb) + ((((X-xpos[i])**2) + Y**2)**0.5)/vs\r\n if t<ans:\r\n index = i\r\n \r\n if t==ans and X==xpos[i]:\r\n index = i\r\n \r\n # print(t)\r\n ans = min(ans, t)\r\n\r\nprint(index+1)", "\"\"\"\r\nI learned to brute force\r\nAn error I made was forgetting that sincei deleted the first elemnt of stops I ahd to add 2 to the answer and not 1\r\nTo improve I could make the code cleaner and git gud\r\n\"\"\"\r\n\r\nimport math\r\n \r\nn, vb, vs = tuple(map(int, input().strip().split(\" \")))\r\nstops = list(map(int, input().strip().split(\" \")))\r\nuniversity = tuple(map(int, input().strip().split(\" \")))\r\nstops.remove(stops[0])\r\n \r\nans = 0\r\nwin = 10000000\r\nfor (idx, s) in enumerate(stops):\r\n bus_time = s / vb\r\n \r\n student_distance = math.sqrt(pow(university[0] - s, 2) + pow(university[1], 2))\r\n student_time = student_distance / vs\r\n \r\n if student_time + bus_time <= win:\r\n win = student_time + bus_time\r\n ans = idx\r\n\r\nprint(ans + 2)", "import math\r\n\r\nn, vb, vs = map(int, input().split())\r\n\r\nt = []\r\ns = list(map(int, input().split()))\r\nx, y = map(int, input().split())\r\n\r\nfor i in range(n):\r\n t1 = math.sqrt((x - s[i])**2 + y**2)\r\n t.append(s[i] / vb + t1 / vs)\r\n \r\np = 1\r\ntmin = t[1]\r\n\r\nfor i in range(2, n):\r\n if t[i] <= tmin:\r\n if t[i] < tmin:\r\n p = i\r\n tmin = t[i]\r\n else:\r\n if math.sqrt((x - s[i])**2 + y**2) < math.sqrt((x - s[p])**2 + y**2):\r\n p = i\r\n tmin = t[i]\r\n \r\nprint(p + 1)", "\r\nn, vb, vs = map(int, input().split())\r\n \r\nbus_stops = list(map(int, input().split())) \r\n \r\nxu, yu = map(int, input().split())\r\n \r\ndef time(t): #time function d/v\r\n return t / vb + distance((t, 0), (xu, yu))/vs\r\n \r\ndef distance(bus_stops, y): #distance function sqrt thing\r\n return ((bus_stops[0]-y[0])*(bus_stops[0]-y[0]) + (bus_stops[1] - y[1])*(bus_stops[1]-y[1]))**0.5\r\n \r\nbest= time(bus_stops[-1])\r\nm = n-1 #variables to iterate through the while loop\r\nn = n-2\r\nwhile n > 0: #itearate through bus stops looking for the best time possible according to the function higher\r\n t = time(bus_stops[n])\r\n if t < best:\r\n best, m = t, n\r\n n -= 1\r\n \r\nprint(m+1)", "n, vb, vs = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nxu, yu = map(int, input().split())\r\nmini = 10**18\r\nost = 1\r\nfor i in range(1, n):\r\n put = ((xu - x[i])**2 + yu**2)**0.5\r\n if (x[i]/vb) + (put/vs) <= mini:\r\n mini = (x[i]/vb) + (put/vs)\r\n ost += 1\r\nprint(ost)", "import math\r\nimport sys\r\n\r\nn,vb,vs=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nxu,yu=map(int,input().split())\r\n\r\nanswer=1\r\nmin_dist=0\r\ntime=10**9\r\nfor i in range(1,n):\r\n r=((x[i]-xu)**2+(yu**2))**0.5\r\n tt=x[i]/vb+r/vs\r\n if tt<time:\r\n time=tt\r\n answer=i+1\r\n min_dist=r\r\n elif tt==time:\r\n if r<min_dist:\r\n min_dist=r\r\n answer=i+1\r\n\r\nprint(answer)", "import math\r\n\r\nn, v_b, v_s = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nx_u, y_u = map(int, input().split())\r\n\r\n_min = 10**9\r\nans = 0\r\nfor i in range(n-1):\r\n if (x[i+1]/v_b + math.sqrt((x_u/v_s - x[i+1]/v_s)**2 + (y_u/v_s)**2)) <= _min:\r\n _min = x[i+1]/v_b + math.sqrt((x_u/v_s - x[i+1]/v_s)**2 + (y_u/v_s)**2)\r\n ans = i+2\r\nprint(ans)", "import math\r\n# functie pentru calculul distantei\r\ndef dist( x1, y1, x2, y2 ):\r\n return math.sqrt( ( x2 - x1 ) ** 2 + ( y2 - y1 ) ** 2 )\r\nn, vb, vs = map( int, input( ).split( ) )\r\nstations = list( map( int, input( ).split( ) ) )\r\nxu, yu = map( int, input( ).split( ) )\r\n\r\nminStation, Shortest_time = None, None\r\n\r\nfor i in range( len( stations ) ):\r\n if i == 0: continue\r\n # timpul de la statia curenta pana la universitate , luand in considerare viteza autobuzului si viteza studentului\r\n # t = drumul parcurs de autobus / viteza autobuzului + distanta intre statia curenta si universitate / viteza studentului\r\n Shortest_time = stations[i]/vb + dist(stations[i], 0, xu, yu)/vs\r\n # pentru prima iteratie conditia este conditie: if minStation == None\r\n # pentru urmatoarele iteratii verificam daca timpul curent este mai mic ca timul minim deja salvat\r\n # sau daca timpul curent este egal cu timpul minim si distanta dintre statia curenta si universitate este mai mica ca distanta dintre stantia deja salvata si universitate\r\n if minStation == None or Shortest_time < minVal or (Shortest_time == minVal and dist( stations[minStation], 0, xu, yu ) > dist(stations[i],0,xu,yu)):\r\n minStation = i\r\n minVal = Shortest_time\r\n# afisam nr la statie\r\nprint( minStation + 1)\r\n", "import math\nn, vb, vs = list(map(int,input().split(\" \")))\narr = list(map(int,input().split(\" \")))\n\nx, y = list(map(int,input().split(\" \")))\ncoord=0\nmintime= pow(10,7) + 5\nfor i in range(n):\n if(i==0):\n continue\n time=0\n time+= arr[i]/vb\n s = math.sqrt(pow(x-arr[i],2)+y*y)\n time+= s/vs\n if(time<=mintime):\n mintime=time\n coord=i+1\nprint(coord)\n\t\t \t \t \t \t \t \t \t\t \t \t \t\t", "n,vb,vs=map(int,input().split())\r\na=list(map(float,input().split()))\r\nx,y=map(float,input().split())\r\nm,ans=10**10,0\r\nfor i in range(1,n):\r\n t=(((x-a[i])**2+y**2)**0.5)/vs+a[i]/vb\r\n if t<=m: m,ans=t,i\r\nprint(ans+1)\r\n", "import math\r\n\r\nn, vs, vb = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nx, y = map(int, input().split())\r\n\r\nmin_time = -1\r\ndis, stop = -1, -1\r\n\r\nfor i in range(1, n):\r\n distance = a[i]*vb + math.sqrt((x-a[i])*(x-a[i])+y*y)*vs\r\n if min_time > distance or min_time == -1:\r\n min_time = distance\r\n dis = distance-a[i]*vb\r\n stop = i+1\r\n elif min_time == distance and dis > distance-a[i]*vb:\r\n dis = distance-a[i]*vb\r\n stop = i+1\r\nprint(stop)\r\n", "import math\r\n\r\ndef d(x1,y1,x2,y2):\r\n return math.sqrt((x1-x2)**2+(y1-y2)**2)\r\n\r\nn,vb,vs=[int(s) for s in input().split()]\r\nx=[int(s) for s in input().split()]\r\nxu,yu=[int(s) for s in input().split()]\r\ndist1={}\r\ndist2={}\r\nfor i in range(1,n):\r\n dist1[i+1]=x[i]/vb+d(x[i],0,xu,yu)/vs\r\n dist2[i+1]=d(x[i],0,xu,yu)\r\nm={e:dist2[e] for e in list(dist1.keys()) if dist1[e]==min(list(dist1.values()))}\r\nm1=min(list(m.values()))\r\nfor i,v in m.items():\r\n if m1==v:\r\n print(i)\r\n break" ]

[ "from math import inf\n\nmin_p = inf\nans = 0\nfor _ in range(int(input())):\n ai, pi = map(int, input().split())\n min_p = min(min_p, pi)\n ans += ai * min_p\nprint(ans)\n", "n = int(input())\r\na = [0]*(n+3)\r\np = [0]*(n+3)\r\nfor i in range(n):\r\n t1, t2 = map(int,input().split())\r\n a[i] = t1\r\n p[i] = t2\r\npmin = p[0]\r\nkq = p[0]*a[0]\r\nfor i in range(1,n):\r\n pmin = min(pmin, p[i])\r\n kq+= pmin*a[i]\r\nprint(kq)\r\n ", "a = []\r\np = []\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n _a, _p = map(int, input().split())\r\n a.append(_a)\r\n p.append(_p)\r\n\r\np_min = []\r\nm = float(\"inf\")\r\nfor x in p:\r\n m = min(x, m)\r\n p_min.append(m)\r\n\r\ns = 0\r\nfor _a, _p in zip(a, p_min):\r\n s += _a * _p\r\nprint(s)\r\n", "n=int(input())\r\nminv=101\r\nans=0\r\nfor i in range(n):\r\n ai,bi=map(int,input().split())\r\n if bi<minv:\r\n minv=bi\r\n ans=ans+minv*ai\r\nprint(ans)", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\nres = 0\r\nprice = float('inf')\r\nfor _ in range(n):\r\n x, y = list(map(int, stdin.readline().split()))\r\n if y < price:\r\n price = y\r\n res += price * x\r\n\r\nprint(res)", "import math\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\r\n s=0\r\n mt=101\r\n for i in range(n):\r\n if mt>a[i][1]:\r\n mt=a[i][1]\r\n s=s+a[i][0]*mt\r\n print(s)\r\n\r\nif __name__=='__main__':\r\n main()", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n a=[int(i) for i in input().split()]\r\n l.append(a)\r\nc=0\r\nfor i in range(n):\r\n if l[i][0]==0:\r\n continue\r\n else:\r\n for j in range(i,n):\r\n if l[j][1]>=l[i][1]:\r\n c+=l[j][0]*l[i][1]\r\n l[j][0]=0\r\n else:\r\n break\r\nprint(c)", "t=int(input())\r\nl=[]\r\nl1=[]\r\nl2=[]\r\nx=1000000000\r\nfor _ in range(t):\r\n\ta,b=map(int,input().split())\r\n\tl.append(a)\r\n\tl1.append(b)\r\nfor i in range(len(l1)):\r\n\tx=min(x,l1[i])\r\n\tl2.append(l[i]*x)\r\nprint(sum(l2))\r\n\t\r\n\r\n\r\n\t\r\n", "result = 0\r\nn = int(input())\r\nd = n\r\namount_and_prices = []\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n amount_and_prices.append((a, p))\r\n\r\nresult += amount_and_prices[0][0] * amount_and_prices[0][1]\r\nd -= 1\r\ni = 1\r\nmini = 0\r\nwhile d > 0:\r\n if(amount_and_prices[mini][1] < amount_and_prices[i][1]):\r\n result += amount_and_prices[i][0] * amount_and_prices[mini][1] \r\n else:\r\n result += amount_and_prices[i][0] * amount_and_prices[i][1]\r\n mini = i\r\n i += 1\r\n d -= 1\r\n\r\nprint(result)", "n = int(input())\n\nal = []\npl = []\nfor i in range(n):\n a, p = map(int, input().split())\n al.append(a)\n pl.append(p)\n\nmin_price = pl[0]\nresult = 0\n\nfor i in range(n):\n if pl[i] < min_price:\n min_price = pl[i]\n\n result += min_price*al[i]\n\nprint(result)\n", "n = int(input())\r\nminprice = 10 ** 9\r\nans = 0\r\nwhile n:\r\n n -= 1\r\n a, b = map(int, input().split())\r\n minprice = min(minprice, b)\r\n ans += a * minprice\r\nprint(ans)", "n=int(input())\r\na=[0]*n\r\np=[0]*n\r\nfor i in range(n):\r\n x, b = map(int, input().split())\r\n a[i]=x\r\n p[i]=b\r\nk1=n\r\nk=n\r\nsumm=0\r\nwhile k!=0:\r\n k = p[:k1].index(min(p[:k1]))\r\n summ+=sum(a[k:k1])*p[k]\r\n k1=k\r\nprint(summ)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri May 15 15:02:59 2020\r\n\r\n@author: Administrator\r\n\"\"\"\r\nndays = int(input())\r\nprice = 100\r\nmoney = 0\r\nwhile(ndays):\r\n need,p = map(int,input().split())\r\n if p<price:\r\n price = p\r\n money += price*need\r\n ndays -=1\r\nprint(money)\r\n ", "DAYS = []\nN = -1\nMAX_PRICE = 100\n\ndef entrypoint():\n global DAYS, N\n N = int(input())\n get_input = lambda : list(map(int, input().split()))\n \n def process_input():\n amount, price = get_input()\n DAYS.append({ 'amount': amount, 'price': price })\n\n [process_input() for _ in range(N)]\n\ndef process():\n curr_minimal = MAX_PRICE + 1\n \n for i in range(N):\n curr_minimal = min(curr_minimal, DAYS[i]['price'])\n DAYS[i]['price'] = curr_minimal\n\n compute_price_day = lambda x : x['amount'] * x['price']\n\n min_money = sum(list(map(compute_price_day, DAYS)))\n\n return min_money\ndef main():\n entrypoint()\n print(process())\n\n\nif __name__ == '__main__':\n main()", "def read_ints():\r\n #return list(map(int, input().split()))\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef read_int():\r\n return read_ints()[0]\r\n\r\n\r\nn = read_int()\r\ndays = [read_ints() for _ in range(n)]\r\n\r\nans = 0\r\n\r\nmin_price = 101\r\nfor count, price in days:\r\n min_price = min(min_price, price)\r\n ans += count * min_price\r\nprint(ans)\r\n", "\nm,ans=100,0\nfor i in range(int(input())):\n a,b=map(int,input().split())\n m=min(m,b)\n ans+=m*a\nprint(ans)\n\n", "n = int(input())\np = 1000\ns = 0\nfor i in range(n):\n x, y = map(int, input().split())\n p = min(p, y)\n s += x * p\nprint(s)\n\n\t \t \t \t \t\t\t \t \t\t\t \t\t \t\t \t\t\t\t", "def read_ints():\r\n # return list(map(int, input().split()))\r\n return [int(i) for i in input().split()]\r\n\r\n\r\ndef read_int():\r\n return read_ints()[0]\r\n\r\n\r\ndef solve():\r\n n = read_int()\r\n days = [read_ints() for _ in range(n)]\r\n\r\n total = 0\r\n\r\n min_price = 101 # max possible price + 1\r\n for count, price in days:\r\n min_price = min(min_price, price)\r\n total += count * min_price\r\n\r\n print(total)\r\n\r\n\r\nsolve()\r\n", "from sys import stdin\n\ndef read_lines(sep=' ', input_type=None):\n #list of rows\n _lines = stdin.readlines()\n cast = input_type is not None\n lines = []\n for line in _lines:\n line = line[:-1].split(sep)\n if cast:\n line = [input_type(x) for x in line]\n lines.append(line)\n return lines\n\n\nMAXINT=2**63-1\nif __name__ == '__main__':\n\n lines = read_lines(input_type=int)\n \n t = lines[0]\n lines = lines[1:]\n\n runmin_p = MAXINT\n cost = 0\n for line in lines:\n a,p = line\n if p < runmin_p:\n runmin_p=p\n \n cost += a*runmin_p\n print(cost)", "n=int(input())\r\nm=0\r\np=n*[0]\r\na=n*[0]\r\nfor i in range(n):\r\n a[i],p[i]=[int(i) for i in input().split()]\r\nt=0\r\nh=0\r\ni=0\r\nz=p[0]\r\nfor i in range(n):\r\n if p[i]<z:\r\n z=p[i]\r\n m+=z*a[i]\r\nprint(m)\r\n", "n = int(input())\nqs, ps = [], []\nmini = 101\nans = 0\nfor _ in range(n):\n q, p = map(int, input().split())\n mini = min(mini, p)\n p = mini\n ans += p * q\n\nprint(ans)\n", "n = int(input())\r\nl =[]\r\np1 =100\r\na1 =0\r\nfor i in range(n):\r\n a , p = map (int , input().split())\r\n if p<p1:\r\n p1=p\r\n a1+=p1*a\r\nprint(a1)", "t=int(input())\r\ns=t\r\nsum=0\r\nwhile t>0:\r\n a,p=list(map(int,input().split()))\r\n if s==t:\r\n sum+=a*p\r\n x=p\r\n else:\r\n if x<p:\r\n sum+=x*a\r\n else:\r\n sum+=p*a\r\n x=p\r\n t-=1\r\nprint(sum)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ninf = pow(10, 9) + 1\r\nmi = inf\r\nans = 0\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n mi = min(mi, p)\r\n ans += a * mi\r\nprint(ans)", "n=int(input())\r\ns=0\r\nprice=100**2\r\nfor i in range(n):\r\n kg,p = map(int,input().split())\r\n price=min(price,p)\r\n s+=kg*price\r\nprint(s)", "#declaring two empty lists here.\r\n\r\ndaily_need_of_meat = []\r\ndaily_price = []\r\n\r\n\r\n# now taking input of number of days or n\r\ntotal_days = int(input())\r\n\r\n#now taking input of daily need and every day price for n days\r\nfor i in range(total_days):\r\n need, price = input().split()\r\n need = int(need)\r\n price = int(price)\r\n daily_need_of_meat.append(need)\r\n daily_price.append(price)\r\n\r\n#declaring minimum\r\n\r\nminimum = 120\r\n\r\n#now doing the magic here\r\nfor i in range(total_days):\r\n if daily_price[i] < minimum:\r\n minimum = daily_price[i]\r\n else:\r\n daily_price[i] = minimum\r\n\r\n#now declaring optimal variable\r\n\r\noptimal = 0\r\n\r\nfor i in range(total_days):\r\n optimal += (daily_price[i] * daily_need_of_meat[i])\r\n\r\nprint(optimal)", "n = int(input())\r\nshop = list()\r\n\r\nfor i in range(n):\r\n shop.append(tuple(input().split(\" \")))\r\nfinal = 0\r\nprice = None\r\n\r\nfor q, rate in shop:\r\n if price is None:\r\n price = int(rate)\r\n if int(rate) <= price :\r\n price = int(rate)\r\n final += int(q) * price\r\nprint(final)\r\n", "n=int(input())\r\np=101\r\nanswer=0\r\nfor i in range(n):\r\n ai,pi=map(int,input().split())\r\n p=min(p,pi)\r\n answer+=p*ai\r\nprint(answer)\r\n", "n=int(input())\r\nc=110;s=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if c>b: c=b\r\n s+=a*c\r\nprint(s)", "n = int(input())\ns = 0\np = 101\nfor _ in range(n):\n a, p_n = map(int, input().split())\n p = min(p, p_n)\n s += a * p\nprint(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon May 25 08:50:54 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\n\r\nn=int(input())\r\nminm=float('inf')\r\nans=0\r\nfor i in range(n):\r\n a,p=list(map(int,input().split()))\r\n minm=min(minm,p)\r\n ans+=(a*minm)\r\nprint(ans)\r\n ", "pq = []\r\nfor _ in range(int(input())):\r\n \r\n quantity,price = map(int, input().split())\r\n pq.append((quantity,price))\r\nans,v,w = 0,pq[0][1],pq[0][0]\r\n\r\nfor i,j in enumerate(pq):\r\n \r\n if i == 0:\r\n continue\r\n \r\n if v <= j[1]:\r\n w += j[0]\r\n else:\r\n ans += (w * v)\r\n w = j[0]\r\n v = j[1]\r\nprint(ans + (w*v))", "q,c = [],[]\r\nn = int(input())\r\nfor _ in range(n):\r\n\ta,p = map(int,input().split())\r\n\tq.append(a)\r\n\tc.append(p)\r\nx,y,count = c[0],0,0\r\nfor i in range(n):\r\n\tif c[i]<x:\r\n\t\tcount += sum(q[y:i])*x\r\n\t\tx = c[i]\r\n\t\ty = i\r\nelse: count += sum(q[y:])*x\r\nprint(count)", "n=int(input())\r\nlist1=[]\r\nlist2=[]\r\nmoney=0\r\nupp=n\r\nfor i in range(n):\r\n num=input()\r\n a,b=map(lambda x:int(x),num.split())\r\n list1.append(a)\r\n list2.append(b)\r\nwhile True:\r\n mcc = min(list2[0:upp])\r\n con = list2.index(mcc)\r\n money += mcc * sum(list1[con:upp])\r\n upp = con\r\n if upp == 0:\r\n break\r\nprint(money)", "val = 101\r\nminPrice = 0\r\nfor i in range(int(input())):\r\n a, p = list(map(int, input().split()))\r\n val = min(val, p)\r\n minPrice += a*val\r\nprint(minPrice)", "days = int(input())\ndailyReq = []\ndailyPrice = []\ntotalCost = 0\nfor day in range(days):\n a,p = input().split()\n dailyReq.append(int(a))\n dailyPrice.append(int(p))\n\nminPrice = dailyPrice[0]\nfor day in range(days):\n if(dailyPrice[day] < minPrice):\n minPrice = dailyPrice[day]\n totalCost += dailyReq[day] * minPrice\n\nprint(totalCost)\n\n", "days = int(input())\r\nneeds = 0\r\ncosts = 1000\r\nfor i in range(days):\r\n need, cost = map(int, input().split())\r\n costs = min(costs, cost)\r\n needs += need * costs\r\nprint(needs)\r\n \r\n", "n = int(input())\nt = cost = 0\n\na,p = map(int,input().split())\nMIN = p\ncost=a*p\nfor i in range(1,n):\n a,p = map(int,input().split())\n if p > MIN:\n cost+=a*MIN\n else:\n MIN = p\n cost+=a*MIN\nprint(cost)", "dias = int(input())\r\nprice = 100\r\ntotal = 0\r\nfor i in range(dias):\r\n qunt,prc = input().split(' ')\r\n price = min(price, int(prc))\r\n total += int(qunt) * price\r\n\r\nprint(total)", "n = int(input())\r\nans, cscore = 0, 1000000\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n cscore = min(cscore, b)\r\n ans += a * cscore\r\nprint(ans)", "def duffAndMeat(dias):\r\n total = 0\r\n preco = 101\r\n\r\n for i in range(dias):\r\n quilos, preco_dia = map(int, input().split())\r\n preco = min(preco, preco_dia)\r\n total += (quilos * preco)\r\n\r\n print(total)\r\n\r\ndias = int(input())\r\nduffAndMeat(dias)", "n=int(input())\r\n\r\nl=[]\r\ntotal_meat=0\r\n\r\nfor i in range(n):\r\n m=list(map(int,input().split()))\r\n l.append(m)\r\n\r\ntotal_cost=l[0][1]*l[0][0]\r\nmin_meat=l[0][1]\r\n\r\n\r\nfor i in range(1,n):\r\n if min_meat>=l[i][1]:\r\n min_meat = l[i][1]\r\n total_cost += l[i][0] * min_meat\r\n\r\nprint(total_cost)\r\n", "ans=0; x=101\r\nfor i in range(int(input())):\r\n a,p=map(int,input().split())\r\n x=min(x,p); ans+=x*a\r\nprint(ans)\r\n\r\n \r\n", "n = int(input())\r\nmincost = 101\r\nsm = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if b < mincost:\r\n mincost = b\r\n sm += a * mincost\r\nprint(sm)\r\n\r\n\r\n\r\n\r\n\r\n\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\nsumm=0\r\nneed,mini=map(int,input().split())\r\nsumm+=need*mini\r\nfor i in range(n-1):\r\n need,cost=map(int,input().split())\r\n if cost<mini:\r\n mini=cost\r\n summ+=need*mini\r\nprint (summ)\r\n \r\n", "n = int(input())\r\nlp = 100\r\ncost = 0\r\nfor i in range(n):\r\n a, p = [int(i) for i in input().split()]\r\n lp = min(p, lp)\r\n cost += lp * a\r\nprint(cost)", "n=int(input())\r\na=[[int(x) for x in input().split()] for i in range(n)]\r\ncount=a[0][0]*a[0][1]\r\nfor i in range(1,n):\r\n if a[i][1]>a[i-1][1]:\r\n a[i][1]=a[i-1][1]\r\n count+=a[i][0]*a[i][1]\r\nprint(count)\r\n", "n=int(input())\r\nres,minp=0,100\r\nfor i in range(n):\r\n a,p=[int(x) for x in input().split()]\r\n minp=min(minp,p)\r\n res+=a*minp\r\nprint(res)", "a=[]\r\np=[]\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split())\r\n a.append(x)\r\n p.append(y)\r\nm=p[0]\r\nans=a[0]*p[0]\r\nfor i in range(1,len(a)):\r\n if(p[i]<m):\r\n m=p[i]\r\n ans+=(a[i]*m)\r\nprint(ans)", "n = int(input())\r\na = 0\r\nb = 0\r\npref = [0] * (n+1)\r\npref[0] = 100\r\nres = 0\r\nfor i in range(1, n+1):\r\n a, b = map(int, input().split())\r\n pref[i] = min(pref[i-1], b)\r\n res += pref[i] * a\r\nprint(res)\r\n", "n = int( input().strip() )\r\nans = 0\r\nm = 100\r\nfor _ in range(n):\r\n a , p = map(int, input().strip().split(' '))\r\n m = min(m, p)\r\n ans += a * m\r\nprint(ans)", "k = int(input())\r\nmin = 101\r\ns = 0\r\nfor i in range(k):\r\n a, b = [int(i) for i in input().split()]\r\n if b < min: min = b\r\n s += a*min\r\nprint(s)\r\n", "import time\nimport collections\n\nclass Time_test:\n def __enter__(self):\n self.enter_time = time.time()\n def __exit__(self, exc_type, exc_val, exc_tb):\n print(\"Command was executed in\", time.time()-self.enter_time)\n\nn = int(input())\narr = []\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\ncounter = 0\nmin = float(\"inf\")\nfor a, p in arr:\n if p<min:\n min = p\n counter += a*min\n\nprint(counter)\n", "n=int(input())\r\na=[];p=[];min_price=999\r\nanswer=0\r\nfor i in range(n):\r\n q,w=map(int,input().split())\r\n a.append(q);p.append(w)\r\nfor i in range(n):\r\n if p[i]<min_price:\r\n min_price=p[i]\r\n answer+=a[i]*min_price\r\nprint(answer)", "v =[]\r\nfor _ in range(int(input())):\r\n\ta = list(map(int,input().split()))\r\n\tv.append(a)\r\np,s =101,0\r\nfor i in v:\r\n\tp = min(p,i[1])\r\n\ts+=p*i[0]\r\nprint(s)", "N=int(input())\r\nmin1=float(\"inf\")\r\ncount=0\r\nfor i in range(N):\r\n x,y=map(int,input().split())\r\n if y<min1:\r\n min1=y\r\n count+=x*min1 \r\nprint(count)", "n = int(input())\nans = 0\nprice = 10**9\nfor i in range(n):\n a,p = [int(x) for x in input().split()]\n price = min(price,p)\n ans += price*a\nprint(ans)\n", "n = int(input())\r\nk = []; m = 10**10\r\nfor i in range(n):\r\n a,p = map(int,input().split())\r\n k.append((a,p))\r\nt = 0\r\nfor i in k:\r\n m = min(i[1],m)\r\n t += m*i[0]\r\nprint(t)", "n = int(input())\r\nap = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nans = 0\r\nmin_so_far = 100\r\nfor i in range(n):\r\n if ap[i][1] > min_so_far:\r\n ans += ap[i][0] * min_so_far\r\n else:\r\n ans += ap[i][0] * ap[i][1]\r\n min_so_far = ap[i][1]\r\n\r\n\r\nprint(ans)", "n=int(input())\r\nla=[]\r\nlp=[]\r\nfor x in range(n) : \r\n a,p=map(int,input().split())\r\n la.append(a)\r\n lp.append(p)\r\nsm=0\r\nc=lp[0]\r\nfor x in range(len(lp)) : \r\n if lp[x]<c : c=lp[x]\r\n sm+=la[x]*c\r\nprint(sm)", "n=int(input())\r\ncost=0\r\nmini=101\r\n\r\nfor i in range(n):\r\n a,b=list(map(int,input().split()))\r\n mini=min(mini,b)\r\n cost=cost+(a*mini)\r\nprint(cost)", "# A. Duff and Meat\n\nn = int(input())\n\nans = 0\ncurrent_min = 100\nfor i in range(n):\n ai, pi = map(int, input().split())\n if pi < current_min:\n current_min = pi\n ans += current_min * ai\n\nprint(ans)\n", "need = []\ncost = []\nsum = 0\nfor cases in range(int(input())):\n a, b = list(map(int, input().split()))\n need.append(a)\n cost.append(b)\nminn = cost[0]\nfor i in range(len(need)):\n minn = min(minn, cost[i])\n sum += minn*need[i]\nprint(sum)", "if __name__ == '__main__':\r\n t = int(input())\r\n a = []\r\n p = []\r\n curr = float('inf')\r\n total = 0\r\n for i in range(t):\r\n x = input()\r\n at, bt = x.split()\r\n at = int(at)\r\n bt = int(bt)\r\n if curr > bt:\r\n curr = bt\r\n total += curr*at\r\n print(total)\r\n \r\n ", "n_days = int(input())\r\nmin = 43928647816\r\ntotal = 0\r\nfor i in range(n_days):\r\n (a,p) = input().split(\" \")\r\n if(int(p) < min):\r\n min = int(p)\r\n total += int(a) * min\r\n\r\nprint(total)", "n = int(input())\r\nprices = []\r\namounts = []\r\nmin_price = 1000000\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n if p < min_price:\r\n prices.append(p)\r\n amounts.append(a)\r\n min_price = p\r\n else:\r\n amounts[-1] += a\r\nprint(sum([a * p for a, p in zip(amounts, prices)]))\r\n", "n=int(input())\r\na=[]\r\np=[]\r\ns=0\r\nfor i in range(n):\r\n ar,pr=map(int,input().split())\r\n a.append(ar)\r\n p.append(pr)\r\nmol=p[0]\r\nfor i in range(len(a)):\r\n b=a[i]\r\n mne=p[i]\r\n if mne<mol:\r\n mol=mne\r\n s+=b*mol\r\nprint(s)\r\n", "n = int(input())\r\nl1 = []\r\nl2 = []\r\nfor i in range(n):\r\n j = input().split()\r\n l1.append(int(j[0]))\r\n l2.append(int(j[1]))\r\ns = l2[0]\r\ntotal = 0\r\nfor j in range(n):\r\n s = min(l2[j], s)\r\n total += l1[j] * s\r\nprint(total)\r\n", "from sys import stdin\r\n\r\ntest = stdin.readlines()\r\n\r\nn = int(test[0])\r\nap = [tuple(map(int, test[i].split())) for i in range(1, n+1)]\r\n\r\nans = 0\r\nmin_so_far = 100\r\nfor i in range(n):\r\n if ap[i][1] > min_so_far:\r\n ans += ap[i][0] * min_so_far\r\n else:\r\n ans += ap[i][0] * ap[i][1]\r\n min_so_far = ap[i][1]\r\n\r\n\r\nprint(ans)", "n = int(input())\r\nmatrix = []\r\ncost = 0\r\nm = float('inf')\r\nfor i in range(n):\r\n a,b = list(map(int, input().split()))\r\n m = min(m, b)\r\n cost += a*m\r\nprint(cost)", "t = int(input())\r\nprice = 101\r\nmoney = 0\r\nwhile t:\r\n arr = [int(x) for x in input().split()]\r\n if price >arr[1]:\r\n price = arr[1]\r\n money +=price*arr[0]\r\n t-=1\r\nprint(money)", "def myaso(a, b):\r\n m = 10 ** 5\r\n c = 0\r\n for i in range(len(b)):\r\n m = min(m, b[i])\r\n c += a[i] * m\r\n return c\r\n\r\n\r\nn = int(input())\r\nc = list()\r\nd = list()\r\nfor j in range(n):\r\n a, p = [int(z) for z in input().split()]\r\n c.append(a)\r\n d.append(p)\r\nprint(myaso(c, d))\r\n", "n = int(input())\r\na = []\r\ncost = 0\r\nb = []\r\nfor i in range(n):\r\n z,y = [int(x) for x in input().split()]\r\n a.append(z)\r\n b.append(y)\r\ncost += a[0] * b[0]\r\nk = b[0]\r\nfor i in range(1,n):\r\n if b[i] <= k:\r\n k = b[i]\r\n cost += a[i] * k\r\nprint(cost)", "cost=100000\nn=int(input())\ntotal=0\nfor i in range(0,n):\n\ta,b=map(int,input().split(\" \"))\n\tcost=min(cost,b)\n\ttotal=total+(cost*a)\nprint(total)\n", "n = int(input())\r\nMin = 10000000\r\nans = 0\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n Min = min(Min, p)\r\n ans += Min * a\r\nprint(ans)\r\n", "n = int(input())\r\nA, P = [], []\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n A.append(a)\r\n P.append(p)\r\ntemp_min_price = max(P)\r\nmin_price = min(P)\r\nmoney = 0\r\nfor i in range(len(P)):\r\n if P[i] == min_price:\r\n money += sum(A[i:]) * min_price\r\n break\r\n if P[i] < temp_min_price:\r\n temp_min_price = P[i]\r\n money += A[i] * temp_min_price\r\nprint(money)", "cost = 0\r\n\r\nfor i in range(int(input())):\r\n\r\n a, p = map(int, input().split())\r\n if (i == 0):\r\n pmin = p\r\n\r\n if (p < pmin):\r\n pmin = p\r\n \r\n cost += a*pmin\r\n\r\nprint(cost)", "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\nt = ini()\r\na = [0] * t\r\np = [0] * t\r\nans = 0\r\nprev = 100\r\nfor i in range(t):\r\n a[i], p[i] = inm()\r\nfor i in range(t):\r\n prev = min(prev, p[i])\r\n ans += a[i] * prev\r\nprint(ans)", "n = int(input())\r\nminp = 100000000;\r\nres = 0;\r\nfor i in range(0, n):\r\n a, p = map(int, input().split())\r\n minp = min(p, minp);\r\n res = res + a * minp;\r\nprint(res)\r\n\r\n", "s=0\nminrate=1000\nfor _ in range(int(input())):\n\ta,b=map(int,input().split())\n\tminrate=min(minrate,b)\n\ts+=(a*minrate)\nprint(s)\n\t\n\t\n \t\t\t\t \t \t \t\t\t \t\t \t \t\t \t", "# 588A - Duff and Meat\r\nn = int(input())\r\na, p = [0]*n, [0]*n\r\nfor i in range(n):\r\n [a[i], p[i]] = list(map(int, input().split()))\r\ni, s = 0, 0\r\nwhile i <= n:\r\n m = 0\r\n x = p[i]\r\n for j in range(i+1, n):\r\n if x > p[j]:\r\n m = j\r\n break\r\n if m == 0:\r\n s += (sum(a[i:])*p[i])\r\n break\r\n else:\r\n s += (sum(a[i:m])*p[i])\r\n i = m\r\nprint(s)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jul 7 09:27:23 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nprices = 101\r\ncost = 0\r\nfor i in range(int(input())):\r\n a,b = map(int, input().split())\r\n prices = min(prices, b)\r\n cost+= prices*a\r\nprint(cost)", "def solve(arr):\n res = 0\n min_val = arr[0][1]\n for i in arr:\n if i[1]< min_val:\n min_val = i[1]\n res += i[0]*min_val\n return res\n\n \ndef main() :\n n = int(input())\n arr = []\n for _ in range(n):\n i = list(map(int, input().split(' ')))\n arr.append(i)\n print(solve(arr))\nmain()\n", "ans = 0\r\nk = 100\r\nfor i in range(int(input())):\r\n a,p = map(int,input().split())\r\n k = min(k, p)\r\n ans += a*k\r\nprint(ans)", "n = int(input())\r\nkilogram = []\r\ncost = []\r\nfor i in range(n):\r\n a,p = map(int,input().split())\r\n kilogram.append(a)\r\n cost.append(p)\r\nmincost = cost[0]*kilogram[0]\r\nfor i in range(1,len(cost)):\r\n if cost[i-1] < cost[i]:\r\n cost[i] = cost[i-1]\r\n mincost += cost[i]*kilogram[i]\r\nprint(mincost) ", "n=int(input())\r\npmin=101\r\ncost=0\r\nfor i in range(n):\r\n a,p=map(int,input().split())\r\n if p<pmin :\r\n pmin=p\r\n cost+=a*pmin \r\nprint (cost) \r\n", "n=int(input())\r\nsumm=0\r\nmi=100000\r\nfor i in range(0, n):\r\n s=input()\r\n s=s.split()\r\n if(int(s[1])<mi):\r\n mi=int(s[1])\r\n summ=summ+int(s[0])*mi\r\n else:\r\n summ=summ+int(s[0])*mi\r\nprint(summ)", "n = int(input())\r\ni=0\r\n\r\nans=0\r\nwhile i<n:\r\n s=input().split()\r\n if i==0:\r\n price = int(s[1])\r\n else:\r\n price=min(price,int(s[1]))\r\n targ = int(s[0])\r\n\r\n ans+=targ*price\r\n i+=1\r\n\r\n\r\nprint(ans)", "n = int(input())\r\ni = 0\r\ndata = list()\r\nwhile i < n:\r\n num = input()\r\n arr = []\r\n counting = 0\r\n\r\n for m in range(0, len(num)):\r\n if num[m] == ' ':\r\n arr.append(int(num[counting:m]))\r\n counting = m + 1\r\n elif m == len(num) - 1:\r\n arr.append(int(num[counting:len(num)]))\r\n data.append(arr)\r\n i += 1\r\n\r\nmoney = 0\r\ncheck = None\r\nfor i in range(len(data)):\r\n if i == 0:\r\n money = data[i][0] * data[i][1]\r\n check = data[i][1]\r\n else:\r\n if check < data[i][1]:\r\n money += data[i][0] * check\r\n else:\r\n money += data[i][0] * data[i][1]\r\n check = data[i][1]\r\nprint(money)\r\n\r\n\r\n", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nt=I()\r\n#print(t)\r\nx=[]\r\nl=[]\r\nq=10**9\r\nfor _ in range(t):\r\n a,b=M()\r\n l.append(a)\r\n x.append(b)\r\n # print(*x)\r\nans=0\r\nfor i in range(t):\r\n #print(x[i])\r\n\r\n if(x[i]<=q):\r\n q=x[i]\r\n ans+=l[i]*q\r\n else:\r\n ans+=l[i]*q\r\nprint(ans)\r\n", "def calc(x,y):\r\n z=y[0]\r\n price=0\r\n for i in range(0,len(y)):\r\n if z<=y[i]:\r\n price+=z*x[i]\r\n else:\r\n z=y[i]\r\n price+=x[i]*y[i]\r\n print(price)\r\nt=int(input())\r\nx=[]\r\ny=[]\r\nfor i in range(0,t):\r\n a=list(map(int,input().split()))\r\n x.append(a[0])\r\n y.append(a[1])\r\ncalc(x,y)\r\n", "def solve(a, p, n):\r\n\r\n if len(a) == 0:\r\n return 0\r\n\r\n minRateSoFar = p[0]\r\n total = p[0] * a[0]\r\n\r\n for i in range(1, n):\r\n\r\n minRateSoFar = min(minRateSoFar, p[i])\r\n total += minRateSoFar * a[i]\r\n\r\n return total\r\n\r\n\r\nn = int(input())\r\na = []\r\np = []\r\nfor i in range(0,n):\r\n a_i, p_i = map(int, input().split(\" \"))\r\n a.append(a_i)\r\n p.append(p_i)\r\nprint(solve(a, p, n))", "import sys\r\n\r\nn=int(input())\r\nmin=sys.maxsize\r\nsum=0\r\nfor i in range(n):\r\n a,p=map(int,input().split())\r\n if p<min:\r\n min=p\r\n sum+=a*min\r\nprint(sum)\r\n \r\n", "n=int(input())\r\na=[]\r\nb=[]\r\ns=0\r\nfor i in range(n):\r\n d,p=list(map(int,input().split()))\r\n a.append(d)\r\n b.append(p)\r\np=b[0]\r\nfor i in range(n):\r\n if (p>b[i]):\r\n p=b[i]\r\n s=s+(p*a[i])\r\nprint(s)", "n = int(input())\n\nmeat = []\nprice = []\noptimumCost = 0\n\nfor _ in range(n):\n m, p = list(map(int, input().split()))\n meat.append(m)\n price.append(p)\n\ni = 0\nwhile i < n:\n if i == n-1:\n optimumCost += meat[n-1]*price[n-1]\n break\n elif price[i+1] <= price[i]:\n optimumCost += meat[i]*price[i]\n i += 1\n else:\n j = i+1\n optimumCost += meat[i]*price[i]\n while j < n and price[j] > price[i]:\n optimumCost += price[i]*meat[j]\n j+=1\n i = j\n\nprint(optimumCost)\n\n\n\n\n", "import time\r\n\r\n#t0 = time.time()\r\nn = int(input())\r\ns = []\r\na = []\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n a.append(i)\r\n s.append(a)\r\n#t1 =time.time()\r\n\r\ndef getMin(end,s):#超时emmm\r\n if end==0:\r\n return 0\r\n totalprice = 0\r\n minprice = [100,-1]\r\n day = end-len(s)-1\r\n while -day<=len(s):\r\n if s[day][1]<=minprice[0]:\r\n minprice[0] = s[day][1]\r\n minprice[1] = day\r\n day -= 1\r\n endnx = len(s)+minprice[1]\r\n #print('place:',minprice[1],'end:',end)\r\n while minprice[1]<end-len(s):\r\n totalprice += s[minprice[1]][0]*minprice[0]\r\n minprice[1] += 1\r\n #print('total:',totalprice)\r\n return totalprice + getMin(endnx,s)\r\n\r\ndef getMinFast(s):\r\n minlist = [s[0]]\r\n day = 1\r\n while day<len(s):\r\n if s[day][1]<minlist[-1][1]:\r\n minlist.append(s[day])\r\n day += 1\r\n a = minlist[-1].copy()\r\n a[2] = len(s)-1\r\n minlist.append(a)\r\n #print(minlist,'\\n',s)\r\n today = 0\r\n totalprice = 0\r\n i = 0\r\n while i<len(minlist)-1:\r\n while today<minlist[i+1][2]:\r\n totalprice += minlist[i][1]*s[today][0]\r\n today += 1\r\n i += 1\r\n totalprice += minlist[-1][1]*s[-1][0]\r\n return totalprice\r\n\r\n#t3 = time.time()\r\nprint(getMinFast(s))\r\n#t4 = time.time()\r\n#print(getMin(len(s),s))\r\n#t5 = time.time()\r\n#print('read:',t1-t0,'\\nnormal:',t5-t4,'\\nfast(nohazu):',t4-t3)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nmoney=l[0][0]*l[0][1]\r\nminm=l[0][1]\r\nfor i in range(1,n):\r\n if l[i][1]<minm:\r\n money+=l[i][0]*l[i][1]\r\n minm=l[i][1]\r\n else:\r\n money+=l[i][0]*minm\r\nprint(money)\r\n", "t=int(input())\r\nl=[list(map(int,input().split())) for _ in range(t)]\r\ns=0\r\nm=1000\r\nfor i in range(t):\r\n if l[i][1]<m:\r\n m=l[i][1]\r\n s=s+l[i][0]*m\r\nprint(s)", "days = int(input())\r\nmax_price = 100000\r\nmoney_spent = 0\r\nfor i in range(days):\r\n meat_needed, cost = map(int, input().split())\r\n if(cost < max_price):\r\n max_price = cost\r\n money_spent += max_price * meat_needed\r\n\r\nprint(money_spent)\r\n", "T = int(input())\r\nMin,ans = 101,0\r\nfor i in range(T): \r\n m,p = map(int,input().split())\r\n Min = min(p,Min)\r\n ans+=Min*m\r\nprint(ans)", "x,s=999,0\r\nfor i in range(int(input())):\r\n a,p=map(int,input().split())\r\n x=min(x,p)\r\n s+=a*x\r\nprint(s)", "num_dias = int(input())\r\npreco_min = 100\r\ndinheiro_necessario = 0\r\n\r\nfor i in range(num_dias):\r\n qtd_carne, preco_carne = map(int, input().split())\r\n preco_min = min(preco_min, preco_carne)\r\n dinheiro_necessario += qtd_carne * preco_min\r\n\r\nprint(dinheiro_necessario)\r\n", "n = int(input())\r\n\r\na = []\r\np = []\r\n\r\nindex = 101\r\nans = 0\r\n\r\nfor i in range(0 , n) :\r\n ai , pi = input().split()\r\n a.append(int(ai))\r\n p.append(int(pi))\r\n\r\nfor i in range (0 , len(a)) :\r\n index = min(index , p[i])\r\n ans += index * a[i]\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "m=1000\r\nc=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if(b<m):\r\n m=b\r\n c+=m*a\r\nprint(c)\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n", "days = int(input())\r\nres , p = 0 , 100 \r\nfor i in range(days) : \r\n a , c_p = map(int , input().split()) \r\n mn = min(c_p , p ) \r\n p = mn\r\n res+= mn * a \r\nprint(res)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nm=l[0][1]\r\ns=m*l[0][0]\r\nfor i in range(1,n):\r\n if(l[i][1]<m):\r\n m=l[i][1]\r\n s+=m*l[i][0]\r\nprint(s)", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2018-09-29 20:30:50\r\n# @Author : raj lath ([email protected])\r\n# @Link : link\r\n# @Version : 1.0.0\r\n\r\nfrom sys import stdin\r\n\r\nmax_val=int(10e12)\r\nmin_val=int(-10e12)\r\n\r\ndef read_int() : return int(stdin.readline())\r\ndef read_ints() : return [int(x) for x in stdin.readline().split()]\r\ndef read_str() : return input()\r\ndef read_strs() : return [x for x in stdin.readline().split()]\r\n\r\nnb_days = read_int()\r\nmin_price = max_val\r\nspent = 0\r\nfor _ in range(nb_days):\r\n need, price = read_ints()\r\n min_price = min(min_price, price)\r\n spent += min_price * need\r\nprint(spent)\r\n\r\n\r\n\r\n", "ans=0\r\nm=6969\r\nfor run in range(int(input())):\r\n a,b=map(int,input().split())\r\n m=min(m,b)\r\n ans+=a*m\r\nprint(ans)", "\r\ndef main():\r\n buf = input()\r\n n = int(buf)\r\n a = []\r\n p = []\r\n for i in range(n):\r\n buf = input()\r\n buflist = buf.split()\r\n a.append(int(buflist[0]))\r\n p.append(int(buflist[1]))\r\n cost = 0\r\n min_price = float(\"inf\")\r\n for i in range(n):\r\n if p[i] < min_price:\r\n min_price = p[i]\r\n cost += a[i] * min_price\r\n print(cost) \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "test=[]\r\nt=int(input())\r\nfor i in range(t):\r\n\ta,p=map(int,input().split())\r\n\ttest.append([a,p])\r\n\t\r\nprice=100\r\ntotal=0\r\nfor i in range(t):\r\n\tprice=min(price,test[i][1])\r\n\ttotal+=price*test[i][0]\r\n\r\nprint(total)\t\r\n\r\n\r\n", "money = 0\r\nprice = 101\r\n\r\ndias = int(input())\r\nwhile dias>0:\r\n dias -=1\r\n line = input().split(\" \")\r\n x = int(line[0])\r\n y = int(line[1])\r\n if(price>y):\r\n price = y\r\n money+=price*x\r\nprint(money)", "def main():\r\n n = int(input())\r\n minPr, totalPrice = float(\"inf\"), 0\r\n\r\n for _ in range(n):\r\n a, p = list(map(int, input().split()))\r\n minPr = min(minPr, p) \r\n totalPrice += minPr*a\r\n\r\n \r\n print(totalPrice)\r\n\r\nmain() \r\n\r\n", "mn=10**9\r\nres=0\r\nfor n in range(int(input())):\r\n a,b=map(int,input().split())\r\n if b<=mn:\r\n mn=b\r\n res+=a*mn\r\nprint(res)", "s,c=0,101\r\nfor _ in range(int(input())):\r\n\ta,b=map(int, input().split())\r\n\tc=min(b,c)\r\n\ts+=a*c\r\nprint(s)", "n = int(input().strip())\r\nll = []\r\nt = list(map(int,input().split()))\r\nk = t[0]*t[1]\r\nl = t[1]\r\nfor i in range(n-1):\r\n t = list(map(int,input().split()))\r\n if l >= t[1]:\r\n k = k + t[1]*t[0]\r\n l = t[1]\r\n else:\r\n k = k + l * t[0]\r\nprint(k)", "n = int(input())\r\n\r\ncont = 0\r\nminP = 101\r\nfor i in range(n):\r\n a, p = input().split()\r\n a = int(a)\r\n p = int(p)\r\n if p < minP:\r\n minP = p\r\n cont += minP*a\r\n\r\nprint(cont)", "number=int(input())\r\nans=0\r\nmn=int(123)\r\nfor i in range(number):\r\n a,b=map(int,input().split())\r\n mn=min(mn,b)\r\n ans+=a*mn\r\nprint(ans)\r\n", "days = int(input())\r\ntotal, min_ = 0, 100\r\n\r\nfor day in range(days):\r\n a, b = [int(x) for x in input().split()]\r\n if b < min_:\r\n min_ = b\r\n total += a*min_\r\n\r\nprint(total)\r\n", "s,c=0,1000\r\nfor _ in range(int(input())):\r\n\tn,m=map(int,input().strip().split())\r\n\tif m<c:\r\n\t\tc=m\r\n\ts+=n*c\r\nprint(s)", "n = int(input())\r\n\r\ndef entier(str):\r\n return int(str)\r\n\r\nminimum = 101\r\narg = 0\r\n\r\nfor i in range(n):\r\n x = input().split()\r\n a = entier(x[0])\r\n p = entier(x[1])\r\n minimum = min(p,minimum)\r\n arg += minimum * a\r\n\r\nprint(arg)\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n \r\n", "n = int(input())\r\nl = []\r\np = []\r\nd = []\r\n\r\nfor i in range(n):\r\n\ta,b = map(int,input().split())\r\n\tl.append([a,b])\r\n\tp.append(b)\r\n\td.append(a)\r\n\r\nday = 0\r\ni = day\r\n\r\nprice = 1\r\ncost = 0\r\n\r\nwhile day<n:\r\n\twhile i <n:\r\n\t\tif l[day][price] <= l[i][price]:\r\n\t\t\tcost+=l[day][price]*l[i][0]\r\n\t\t\t\r\n\t\t\ti +=1\r\n\t\telse:\r\n\t\t\t\r\n\t\t\tday= i\r\n\t\t\t\r\n\r\n\t\r\n\t\r\n\tday+=1\r\n\t\t\t\r\n\r\nprint(cost)\r\n\r\n\r\n\r\n", "n = int(input())\r\nb = 100\r\nk = 0\r\nfor i in range(n):\r\n a,p = map(int,input().split())\r\n if b > p:\r\n b = p\r\n k += a * b\r\n\r\nprint(k)", "n=int(input())\nc=[]\nf=[]\nres=0\nfor i in range(n):\n\ta,b=[int(x) for x in input().split()]\n\tf.append(a)\n\tc.append(b)\nmini=101\nlista=[]\nfor i in range(n):\n if c[i]<mini:\n lista.append(i)\n mini=c[i]\nlista.append(n)\nwhile len(lista)>1:\n valor=c[lista[0]]\n comeco=lista.pop(0)\n for j in range(comeco,lista[0]):\n res+=valor*f[j]\nprint(res)\n\t\t \t \t\t \t \t \t \t\t \t\t \t", "n = int(input())\r\nans = 0\r\nprice = 1000\r\nfor u in range(n):\r\n a, p = (int(i) for i in input().split())\r\n price = min(price, p)\r\n ans += a * price\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nm=123\r\ns=0\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n m=min(m,b)\r\n s=s+a*m\r\nprint(s)\r\n", "inputs = [] \r\nn = int(input())\r\nfor i in range(0, n):\r\n arr = [int(x) for x in input().split()]\r\n inputs.append(arr)\r\nminimum=999\r\ncost=0\r\nfor i in range(n):\r\n if(inputs[i][1]<minimum):\r\n minimum=inputs[i][1]\r\n cost+=minimum*inputs[i][0]\r\nprint(cost) ", "ans = 0\nm = 100\nfor n in range(int(input())):\n a, p = map(int, input().split())\n m = min(m, p)\n ans += a*m\nprint(ans)\n", "n = int(input())\r\nA = []\r\nP = []\r\nfor i in range(n):\r\n a, p = map(int,input().split())\r\n A.append(a)\r\n P.append(p)\r\nmn = 142\r\nans = 0\r\nfor i in range(n):\r\n mn = min(mn, P[i])\r\n ans += A[i] * mn\r\nprint (ans)\r\n", "days = int(input())\r\na = []\r\np = []\r\nfor i in range(days):\r\n testInput = input()\r\n testArray = testInput.split(\" \")\r\n a.append(int(testArray[0]))\r\n p.append(int(testArray[1]))\r\ncheapestP = p[0]\r\ncheapestPIndex = 0\r\nrunningIndex = cheapestPIndex\r\ntotalCost = 0\r\nfor i in range(len(a)):\r\n if p[i] < cheapestP:\r\n cheapestP = p[i]\r\n cheapestPIndex = i\r\n totalCost += p[cheapestPIndex] * a[i]\r\nprint(totalCost)\r\n", "l=[]\t\r\nn=int(input())\r\nfor _ in range(n):\r\n\ta,b=map(int,input().split())\r\n\tl.append([a,b])\r\nc=0\t\r\nfor i in range(n-1):\r\n\tif l[i+1][1]>l[i][1]:\r\n\t\tl[i+1][1]=l[i][1]\r\nfor i in range(n):\r\n\tc+=l[i][0]*l[i][1]\r\nprint(c)\t\r\n", "n = int(input())\r\nm = 10**10; t = 0\r\nfor i in range(n):\r\n a,p = map(int,input().split())\r\n m = min(m,p)\r\n t += m*a\r\nprint(t)", "n=int(input())\r\nmoney=0\r\nminprice=200\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\tminprice=min(y,minprice)\r\n\tmoney+=x*minprice\r\nprint(money)\r\n", "meat = []\r\nprice = []\r\nfor i in range(int(input())):\r\n a , b = map(int , input().split())\r\n meat.append(a)\r\n price.append(b)\r\n\r\nmeat.append(0)\r\nprice.append(0)\r\n \r\n\r\nvalue = 0\r\nfor j in range(len(meat) - 1):\r\n value += meat[j] * price[j]\r\n if price[j] < price[j + 1]:\r\n price[j + 1] = price[j]\r\n \r\nprint(value)\r\n \r\n ", "days = int(input())\r\ni = 0\r\nmeat_needs = []\r\nmeat_prices = []\r\nwhile i < days:\r\n\tmeat, price = (int(x) for x in input().split())\r\n\tmeat_needs.append(meat)\r\n\tmeat_prices.append(price)\r\n\ti += 1\r\nprice_index = []\r\nstart = 0\r\nend = days\r\nwhile end > 0:\r\n\tmin_price = min(meat_prices[start:end])\r\n\tmin_pr_index = meat_prices.index(min_price)\r\n\tprice_index.append([min_price, min_pr_index])\r\n\tend = min_pr_index\r\nprice_index.reverse()\r\nlive_cost = 0\r\ni = 0\r\nwhile i < len(price_index):\r\n\tif i != len(price_index) - 1:\r\n\t\tstart = price_index[i][1]\r\n\t\tend = price_index[i+1][1]\r\n\t\tlive_cost += sum(meat_needs[start:end])*price_index[i][0]\r\n\telse:\r\n\t\tstart = price_index[i][1]\r\n\t\tlive_cost += sum(meat_needs[start:])*price_index[i][0]\r\n\ti += 1\r\nprint(live_cost)", "# LUOGU_RID: 100601887\nx, s = 100, 0\r\nn = int(input())\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n if x > p: x = p\r\n s += x * a\r\nprint(s)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Dec 12 19:37:05 2017\r\n\r\n@author: admin\r\n\"\"\"\r\n\r\nn = int(input())\r\namount =[]\r\nprice = []\r\nfor i in range(n):\r\n a,p = [int(x) for x in input().split()]\r\n amount.append(a)\r\n price.append(p)\r\n\r\nmoney = price[0]*amount[0]\r\nlow_price = price[0]\r\nfor i in range(1,n):\r\n if price[i]<low_price:\r\n low_price = price[i]\r\n \r\n money += low_price*amount[i]\r\nprint(money)\r\n", "n = int(input())\r\n\r\npCur = 100\r\ntotal = 0\r\nfor i in range(n):\r\n\ta,p = map(int,input().split())\r\n\t\r\n\tif p<=pCur: pCur = p\r\n\t\r\n\ttotal = total + a*pCur\r\n\t\r\nprint(total)", "n=int(input())\r\na=[]\r\nfor _ in range(n):\r\n b=[int(x) for x in input().split()]\r\n a.append(b)\r\nt=a[0][0]*a[0][1]\r\nl=a[0][1]\r\nfor i in range(1,n):\r\n l=min(l,a[i][1])\r\n t+=l*a[i][0]\r\nprint(t)\r\n", "n = int(input())\r\n\r\nminCost = None\r\nresult = 0\r\n\r\nfor i in range(0,n) :\r\n meat, cost = map(int, input().split())\r\n if minCost == None or cost < minCost :\r\n minCost = cost\r\n result += meat*minCost\r\n\r\nprint(result)", "n = int(input())\r\nm = []\r\np = []\r\nfor i in range(n):\r\n mi, pi = map(int, input().split())\r\n m.append(mi)\r\n p.append(pi)\r\nans = 0\r\nminp = p[0]\r\nfor i in range(n):\r\n minp = min(p[i], minp)\r\n ans += m[i]* minp\r\nprint(ans)\r\n", "c=0\r\nfor i in range(int(input())):\r\n\ta,b=map(int,input().split())\r\n\tif i==0:\r\n\t\tm=b\r\n\telse:\r\n\t\tif b<m:\r\n\t\t\tm=b\r\n\tc+=a*m\r\nprint(c)", "n = int(input())\r\ntotal_cost = 0\r\nmin_price = 101\r\n\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n min_price = min(min_price, p)\r\n total_cost += a * min_price\r\n\r\nprint(total_cost)\r\n", "def buy_meat(days):\r\n total = 0\r\n best_cost = 100\r\n\r\n for day in range(days):\r\n amount, cost = map(int, input().split())\r\n if(cost < best_cost):\r\n best_cost = cost\r\n total += best_cost * amount\r\n else:\r\n total += best_cost * amount\r\n return total\r\n\r\nprint(buy_meat(int(input())))", "n = int(input())\r\na = []\r\np = []\r\nfor i in range(n):\r\n day = [int(x) for x in input().split()]\r\n a.append(day[0])\r\n p.append(day[1])\r\ns = 0\r\ni = 0\r\nprice = p[0]\r\nwhile i <= n - 1:\r\n if p[i] >= price:\r\n s = s + a[i] * price\r\n i = i + 1\r\n else:\r\n price = p[i]\r\n s = s + a[i] * price\r\n i = i + 1\r\nprint(s)\r\n", "import sys\r\n\r\ndef mincost(req, price):\r\n minimum = sys.maxsize\r\n cost = 0\r\n for i in range(len(price)):\r\n minimum = min(minimum, price[i])\r\n cost += req[i]*minimum\r\n \r\n return cost\r\n\r\n\r\nn = int(input())\r\nprice = []\r\nreq = []\r\nfor i in range(n):\r\n sample = list(map(int, input().strip().split(' ')))\r\n req.append(sample[0])\r\n price.append(sample[1])\r\n\r\n\r\nprint(mincost(req, price))", "n=int(input())\r\n\r\na=list()\r\n\r\np=list()\r\n\r\n\r\n\r\nfor i in range(n):\r\n\r\n x,y = map(int,input().split())\r\n\r\n a.append(x)\r\n p.append(y)\r\n\r\n\r\nc=p[0]*a[0]\r\n\r\nlow=p[0]\r\n\r\nfor i in range(1,n):\r\n\r\n if p[i] < low:\r\n low=p[i]\r\n\r\n c+= low*a[i]\r\n\r\n else:\r\n c+=low*a[i]\r\n\r\nprint(c)\r\n", "aa = int(input())\r\n\r\na = 0\r\nb = 10000000\r\n\r\ntotal =0\r\nfor x in range(aa):\r\n\r\n t = input()\r\n t = t.split()\r\n if int(t[1]) <b:\r\n \r\n total+=int(t[0])*int(t[1])\r\n b= int(t[1])\r\n else:\r\n total+=int(t[0])*b\r\n \r\n\r\n \r\n\r\nprint(total)\r\n \r\n ", "n = int(input())\r\nmin_p = 100\r\nans = 0\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n min_p = min(min_p, p)\r\n ans += a * min_p\r\nprint(ans)", "n = int(input())\r\nprice = 101\r\ntotal = 0\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n price = min(p, price)\r\n total += price * a\r\nprint(total)\r\n", "n = int(input())\nm = 99999\nans = 0\n\nfor i in range(n):\n a,p = [int(x) for x in input().split()]\n m = min(m,p)\n ans += (a*m)\n\nprint(ans)", "n = int(input())\r\nlst = []\r\nfor i in range(0, n):\r\n data = input().split(' ')\r\n lst.append((int(data[0]), int(data[1])))\r\n\r\nindex = 1\r\nresult = lst[0][0] * lst[0][1]\r\nminPrice = lst[0][1]\r\nwhile index < len(lst):\r\n while index < len(lst) and minPrice < lst[index][1]:\r\n result = result + lst[index][0] * minPrice\r\n index = index + 1\r\n if index >= len(lst):\r\n break\r\n minPrice = lst[index][1]\r\n result = result + lst[index][0] * minPrice\r\n index = index + 1\r\nprint(result)\r\n", "d = int(input())\r\nm, c = list(map(int, input().split(\" \")))\r\ntc = 0\r\nfor _ in range(d-1):\r\n m2, c2 = list(map(int, input().split(\" \")))\r\n if c2 >= c:\r\n m += m2\r\n else:\r\n tc += (m * c)\r\n m, c = m2, c2\r\nprint(tc + (m*c))\r\n\r\n", "# 588A\r\n\r\nn = int(input())\r\nA = []\r\nP = []\r\n\r\nfor i in range(n):\r\n a, p = map(int, input().split(\" \"))\r\n A.append(a)\r\n P.append(p)\r\n\r\nminn = 100000\r\nans = 0\r\nfor i in range(n):\r\n minn = min(minn, P[i])\r\n ans += minn * A[i]\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = [0] * n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a[i] = (x, y)\r\nnow = a[0][0] * a[0][1]\r\nmin_now = a[0][1]\r\nfor i in range(1, n):\r\n if min_now > a[i][1]:\r\n min_now = a[i][1]\r\n now += min_now * a[i][0]\r\nprint(now)", "n = int(input())\r\nm,a= None,0\r\nfor i in range(n):\r\n e, c =map(int,input().split())\r\n if not m:\r\n m = c\r\n else:\r\n m = min(m, c)\r\n a += e * m\r\nprint(a) ", "n = int(input() )\na = [list(map(int, input().split() ) ) for _ in range(n) ]\n\nr, mn = a[0][0]*a[0][1], a[0][1]\nfor i in range(1, n):\n mn = min(mn, a[i][1] )\n r += mn*a[i][0]\n\nprint(r)\n\n", "n=int(input())\r\ny,s=101,0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if y>b:\r\n y=b\r\n s+=(a*y)\r\nprint(s)", "min_till=1000\r\nc=0\r\nfor _ in range(int(input())):\r\n\r\n a,b=map(int,input().split())\r\n\r\n if b<min_till:\r\n min_till=b\r\n\r\n c+=(a*min_till)\r\nprint(c)\r\n \r\n", "n = int(input())\r\ntemp = [int(x) for x in input().split()]\r\na = temp[0]\r\np = temp[1]\r\nsmallest = p\r\ncounter = a * smallest\r\nfor i in range(n-1):\r\n temp = [int(x) for x in input().split()]\r\n a = temp[0]\r\n p = temp[1]\r\n if p < smallest:\r\n smallest = p\r\n counter += a * smallest\r\nprint(counter)\r\n", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n lst.append([int(i) for i in input().split()])\r\ntotalMoneyNeeded = 0\r\nauxCost = 1000000000\r\nauxNum = 0\r\nfor i in lst:\r\n if i[1] < auxCost:\r\n totalMoneyNeeded += auxNum * auxCost\r\n auxCost = i[1]\r\n auxNum = i[0]\r\n else:\r\n auxNum += i[0]\r\ntotalMoneyNeeded += auxNum * auxCost\r\nprint(totalMoneyNeeded)", "n = int(input())\na = []\np = []\nfor i in range(n):\n aa, pp = input().split()\n a.append(int(aa))\n p.append(int(pp))\n\n\ntmp = a[0]\ntmp_price = p[0]\nres = 0\nfor i in range(1, n):\n if p[i] < tmp_price:\n res += tmp * tmp_price\n tmp_price = p[i]\n tmp = a[i]\n else:\n tmp += a[i]\nres += tmp * tmp_price\nprint(res)\n\n\t\t \t\t\t \t \t \t\t\t\t \t\t \t\t\t\t\t \t", "t=int(input())\r\nres=[]\r\na,p=list(map(int,input().split()))\r\nres.append([a,p])\r\nsum=a*p\r\nfor i in range(1,t):\r\n a,p=list(map(int,input().split()))\r\n if p>res[i-1][1]:\r\n p=res[i-1][1]\r\n res.append([a,p])\r\n sum=sum+a*p\r\nprint(sum) \r\n", "n = int(input())\r\n\r\nmaximo = 100000\r\n\r\ncusto = 0\r\n\r\nfor d in range(n):\r\n a, p = input().split() \r\n if int(p) < maximo: maximo = int(p)\r\n custo += maximo * int(a) \r\n\r\nprint(custo)", "\r\nn = int(input())\r\nmn = 999\r\nkq = 0\r\nfor _ in range(n):\r\n m, n = map(int, input().split())\r\n mn = min(mn, n)\r\n kq += mn*m\r\nprint(kq)\r\n\r\n\r\n", "def greddy(n):\r\n minimum_price = 101\r\n sum_ = 0\r\n for i in range(n):\r\n a_i, p_i = map(int, input().split())\r\n if (p_i < minimum_price):\r\n minimum_price = p_i\r\n\r\n sum_ += a_i * minimum_price\r\n\r\n return sum_\r\n\r\n\r\nn = int(input())\r\n\r\nprint(greddy(n))\r\n", "def main():\r\n price = 101\r\n minimum_money = 0 \r\n number_of_days = int(input())\r\n\r\n for i in range(number_of_days):\r\n values = input().split(\" \")\r\n amount = int(values[0])\r\n cost = int(values[1])\r\n if(price>cost):\r\n price = cost\r\n minimum_money += price * amount\r\n print(minimum_money)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m = 101\nc = 0\nfor _ in range(0, int(input())):\n k, p = map(int, input().split())\n m = min(p, m)\n c += m * k\nprint(c)\n", "d = int(input())\r\na = []\r\np = []\r\nfor _ in range(d):\r\n ea, ep = map(int, input().split()) \r\n a.append(ea)\r\n p.append(ep)\r\n\r\nkosten = 0\r\npreis = 0\r\n\r\nfor i in range(d):\r\n if i == 0:\r\n preis = p[i]\r\n anz = a[i]\r\n else:\r\n if p[i] < preis:\r\n kosten += anz * preis\r\n preis = p[i]\r\n anz = a[i]\r\n else:\r\n anz += a[i] \r\nkosten += anz * preis\r\nprint(kosten)", "n=int(input());m=[]\nfor i in range(n):\n j,k=map(int,input().split())\n m.append([j,k])\nt=m[0][0]*m[0][1];p=m[0][1]\nfor i in range(1,n):\n if m[i][1]>p:\n t+=m[i][0]*p\n else:\n t+=m[i][0]*m[i][1]\n p=m[i][1]\nprint(t)\n\n", "t = int(input())\r\nkg = []\r\ncost = []\r\nspent = 0\r\nfor x in range(t):\r\n a,b = input().split()\r\n kg.append(int(a))\r\n cost.append(int(b))\r\n\r\ncheap = cost[0]\r\nfor x,y in zip(kg,cost):\r\n if y >= cheap :\r\n spent += x*cheap\r\n else:\r\n cheap = y\r\n spent += x*cheap\r\n\r\nprint (spent)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\"\"\"\r\nday_remain = 0\r\nstor = 0\r\nwhile day_remain < day :\r\n if stor >= kg[day_remain] :\r\n stor -= kg[day_remain]\r\n else:\r\n spent += kg[day_remain]*cost[day_remain]\r\n cheaper = 0\r\n for y in cost[day_remain+1:day]:\r\n if y > cost[day_remain]:\r\n cheaper += 1\r\n else:\r\n break\r\n if (cheaper > 0):\r\n for x in kg[day_remain+1:day_remain+1+cheaper]:\r\n spent += x*cost[day_remain]\r\n stor += x\r\n day_remain += 1\r\n\"\"\"\r\n", "t = 123\r\nr = 0\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n t = min(t, b)\r\n r += a * t\r\nprint(r)", "n = int(input())\r\nprice = 10000\r\nsum = 0\r\nfor i in range(n):\r\n a, b = [int(a) for a in input().split()]\r\n if price > b:\r\n price = b\r\n sum += price*a\r\nprint(sum)", "n=int(input())\r\nm=0\r\nprize=1000000\r\nfor i in range(n):\r\n a,p=input().split()\r\n a,p=int(a),int(p)\r\n #print(prize)\r\n prize=min(prize,p)\r\n m+=prize*a\r\nprint(m)", "def to_list(s):\r\n return list(map(lambda x: int(x), s.split(' ')))\r\n\r\ndef solve(a,p):\r\n min_ = p[0]\r\n min_array = [0]*len(p)\r\n min_array[0] = min_\r\n sum_ = min_ * a[0]\r\n\r\n for i in range(1,len(p)):\r\n if p[i] < min_:\r\n min_ = p[i]\r\n min_array[i] = min_\r\n sum_ += min_ * a[i]\r\n\r\n print(str(sum_))\r\n \r\nt = int(input())\r\na = [0]*t\r\np = [0]*t\r\n\r\nfor i in range(t):\r\n a[i], p[i] = to_list(input())\r\n\r\nsolve(a,p) ", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\n\r\n\r\nmin_price = math.inf\r\n\r\nans = 0\r\n\r\nfor day in range(readint()):\r\n\r\n a, p = readarray(int)\r\n\r\n min_price = min(min_price, p)\r\n \r\n ans += (min_price * a)\r\n\r\n\r\nprint(ans)\r\n\r\n", "import sys\r\nimport os.path\r\nimport functools\r\nimport itertools\r\nimport re\r\n\r\ndef solve():\r\n # code goes here!! \r\n n = int(input())\r\n a = [0] * n\r\n p = [0] * n\r\n for i in range(n):\r\n a[i],p[i] = map(int,input().split())\r\n ans = 0\r\n i = 0\r\n cur = 0\r\n while i < n :\r\n cur = i\r\n while cur < n and p[i] <= p[cur] :\r\n ans += a[cur] * p[i]\r\n cur += 1\r\n i = cur\r\n print(ans)\r\n \r\n\r\ndef main():\r\n if os.path.exists('test.inp') :\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", "try:\r\n n = int(input())\r\n a = []\r\n p = []\r\n for i in range(n):\r\n x,y = map(int, input().split())\r\n a.append(x)\r\n p.append(y)\r\n sum1 = a[0]*p[0]\r\n b = p[0]\r\n for i in range(1,n):\r\n if b < p[i]:\r\n sum1 = sum1 + b*a[i]\r\n else:\r\n sum1 = sum1 + p[i]*a[i]\r\n b = p[i]\r\n print(sum1)\r\nexcept:\r\n pass", "n, a, p = int(input()), [], []\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n a.append(x) ; p.append(y)\r\nMIN, ans = max(p), 0\r\nfor i in range(n):\r\n if p[i] < MIN:\r\n MIN = p[i]\r\n ans += a[i]*MIN\r\nprint(ans)", "n = int(input())\nl = []\ncost = 0\nfor f in range(n):\n\ta, p = map(int, input().split())\n\tl.append((a, p))\nmin = 101\n\nfor a, p in l:\n\tif min > p:\n\t\tmin = p\n\tcost = cost + a*min\n\nprint(cost)", "n = int(input())\r\nif n!=1:\r\n a = []; p = []\r\n for i in range(n):\r\n ai, pi = map(int,input().split())\r\n a.append(ai); p.append(pi)\r\n _=0; pri = p[0]; quan = a[0]\r\n for q in range(1,n):\r\n if p[q]>pri:\r\n quan+=a[q]\r\n if q==n-1:\r\n _+=pri*quan\r\n else:\r\n _+=pri*quan\r\n pri=p[q]; quan=a[q]\r\n if q==n-1:\r\n _+=pri*quan\r\n else:\r\n print(_)\r\nelse:\r\n a,b = map(int,input().split())\r\n print(a*b)", "n=int(input())\r\nx = 0\r\nmin = 1000\r\nfor i in range(n):\r\n a,p=list(map(int,input().split(\" \")))\r\n if(p <= min):\r\n min = p\r\n x += a * min\r\nprint(x)", "# Mateus Brito de Sousa Rangel - 117110914\r\n\r\nn = int(input())\r\nminMoney = 0\r\naux = 200\r\n\r\nfor number in range(n):\r\n a, p = map(int, input().split())\r\n aux = min(aux, p)\r\n minMoney += a * aux\r\n \r\nprint(minMoney)", "p=105\r\nz=0\r\nfor i in range(int(input())):\r\n n=str(input())\r\n n=n.split()\r\n x=int(n[0])\r\n y=int(n[1])\r\n p=min(p, y)\r\n z+=p*x\r\nprint(z)\r\n", "a=[]\r\nb=[]\r\n\r\nt= int(input())\r\nfor i in range(t): \r\n meat, price= map(int, input().split())\r\n a.append(meat)\r\n if (i != 0) and b[i-1]<price:\r\n b.append(b[i-1])\r\n else:\r\n b.append(price)\r\nprice=0\r\nfor j in range(t):\r\n price+= a[j] * b[j]\r\nprint(price)", "n=int(input())\r\n\r\nsumy=0\r\na,b=map(int,input().split())\r\nsmall=b\r\nsumy+=a*small\r\nfor i in range(n-1):\r\n a,b=map(int,input().split())\r\n if(b<small):\r\n small=b\r\n sumy+=a*small\r\n \r\n\r\nprint(sumy)\r\n", "n = int(input())\r\ntotal = 0\r\nbestp = 9999999999999999\r\nfor _ in range(n):\r\n newa, newp = map(int,input().split())\r\n bestp = min(newp,bestp)\r\n total += newa*bestp\r\nprint(total)", "entrada = input()\r\ndias = int(entrada)\r\n\r\ntotal = 0\r\nk = 101\r\n\r\nfor i in range(dias):\r\n carne, custo = map(int, input().split())\r\n if custo < k:\r\n k = custo\r\n total += (k * carne)\r\n \r\nprint(total)", "days = int(input())\nrecords = []\n\nfor i in range(days):\n (meat_needs, cost_of_meat_per_kg) = map(int, input().split(' '))\n records.append([meat_needs, cost_of_meat_per_kg])\n\n\nspending = records[0][0] * records[0][1]\ninitial_cost_per_kg = records[0][1]\n\nfor i in range(1, days):\n if records[i][1] < initial_cost_per_kg:\n initial_cost_per_kg = records[i][1]\n spending += (initial_cost_per_kg * records[i][0])\n\nprint(spending)\n\n", "t=int(input())\r\nb=[]\r\ns=0\r\nfor i in range(0,t):\r\n a=list(map(int,input().split()))\r\n b.append(a)\r\nk=b[0][1]\r\nfor i in range(0,t):\r\n if(k<=b[i][1]):\r\n s=s+b[i][0]*k\r\n else:\r\n k=b[i][1]\r\n s=s+b[i][0]*k\r\nprint(s)\r\n \r\n \r\n \r\n", "n = int(input())\r\na = [0 for i in range(n)]\r\np = [0 for i in range(n)]\r\nfor i in range(n):\r\n a[i], p[i] = map(int, input().split(' '))\r\n\r\nmoney = 0\r\nminp = p[0]\r\nfor i in range(n):\r\n if minp <= p[i]:\r\n money += a[i]*minp\r\n else:\r\n minp = p[i]\r\n money += a[i]*minp\r\n \r\nprint(money)\r\n", "t = int(input())\r\nprice = -1\r\nzapac = 0\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n if b < price or price == -1:\r\n price= b\r\n zapac += price * a\r\nprint(zapac)", "a=int(input())\r\nans=[]\r\nfor i in range(a):\r\n x,y=map(int,input().split())\r\n ans.append([x,y])\r\n \r\n\r\ntotal=0\r\ntotal+=ans[0][0]*ans[0][1]\r\nmini=ans[0][1]\r\n\r\nfor i in range(1,len(ans)):\r\n mini=min(mini,ans[i][1])\r\n \r\n total+=mini*ans[i][0]\r\nprint(total)\r\n\r\n \r\n \r\n\r\n \r\n", "#!python3\n\nfrom collections import deque, Counter\nimport array\nfrom itertools import combinations, permutations\nfrom math import sqrt\nimport unittest\n\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_int_array():\n return [int(i) for i in input().strip().split(' ')]\n\n######################################################\n\n\"\"\"\na p\nN days\n\nI 1, naive\nM - kg in sum to buy.\nC(N+M-1, M) = (N+M-1)! / (N-1)! / M!\nTime: ~(N+M)!\nSpace: ~(N)\n\nI 2\nDP\nm, c = f(i-1, a_i - k) for k=0..a_i, meat and cost after i-1 day, if we need a_i-k meet\nx = max(0, a_i - m) meat to buy on i-th day\nm = max(0, m - a_i) meat left on i-th day\nc = x * b_i + c - money spent till i-th day\nmin(c) ?\n\nc(i, a) - money spent till i-th day on a amount of meat.\n\nc(i, a) = min ( c(i-1, a - (a_i - k)) + (a_i - k) * p_i ) for k in 0..a_i\n\nTime: ~(N+M)!\n\n\nI3\nGreedy ?\n\n\nEx 1\n1 5 -- 5\n2 1 -- 14*1\n3 3\n4 2\n5 4\nMin - 19\n\n\n\"\"\"\n\nn = read_int()\nA = []\nP = []\nfor _ in range(n):\n a, p = read_int_array()\n A += [a]\n P += [p]\nspent = P[0] * A[0]\nmin_p = P[0]\nfor i in range(1, n):\n if P[i] < min_p:\n min_p = P[i]\n spent += A[i] * min_p\nprint(spent)\n\n\n\n", "\r\n\r\nn = int(input())\r\namt, price = map(int, input().split())\r\ntotal = amt * price\r\nprevPrice = price\r\nfor _ in range(n - 1):\r\n\tamt, price = map(int, input().split())\r\n\tif price < prevPrice:\r\n\t\ttotal += amt * price\r\n\t\tprevPrice = price\r\n\r\n\telse:\r\n\t\ttotal += prevPrice * amt\r\n\r\n\r\nprint(total)\r\n\r\n", "n=int(input())\r\na=[]\r\np=[]\r\nminp=101\r\nc=0\r\nfor i in range(n):\r\n a0,p0=map(int,input().split())\r\n if p0<minp:\r\n minp=p0\r\n c+=a0*p0\r\n else:\r\n c+=a0*minp\r\nprint(c)\r\n \r\n", "n=int(input())\r\nm=100\r\nsum=0\r\nwhile(n):\r\n a,p=map(int,input().split())\r\n if(m>p):\r\n m=p\r\n sum=sum+(a*m)\r\n n=n-1\r\nprint(sum)", "n = int(input())\ncnt, min_price = 0, 101\nfor i in range(n):\n a, b = map(int, input().split())\n min_price = min(min_price, b)\n cnt += a * min_price\nprint(cnt)\n", "n = int(input())\ncost = 0\ncheap = 100\nfor i in range(n):\n\ta,p = list(map(int, input().split()))\n\tif p < cheap:\n\t\tcheap = p\n\tcost += a*cheap\n\n\nprint(cost)", "n=int(input())\r\nmin,sum=101,0\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n if b<min:\r\n sum+=b*a\r\n min=b\r\n else:\r\n sum+=min*a\r\nprint(sum)", "# ░░░░░░░░░░░░░░░░░░░░░░░░░░░░╔═══╗╔╗╔═══╦═══╗\r\n# ░░░░░░░░░░░░░░░░░░░░░░░░░░░░║╔═╗╠╝║║╔═╗║╔═╗║\r\n# ╔══╦═╗╔══╦═╗╔╗░╔╦╗╔╦══╦╗╔╦══╬╝╔╝╠╗║║║║║╠╝╔╝║\r\n# ║╔╗║╔╗╣╔╗║╔╗╣║░║║╚╝║╔╗║║║║══╬╗╚╗║║║║║║║║░║╔╝\r\n# ║╔╗║║║║╚╝║║║║╚═╝║║║║╚╝║╚╝╠══║╚═╝╠╝╚╣╚═╝║░║║░\r\n# ╚╝╚╩╝╚╩══╩╝╚╩═╗╔╩╩╩╩══╩══╩══╩═══╩══╩═══╝░╚╝░\r\n# ░░░░░░░░░░░░╔═╝║░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n# ░░░░░░░░░░░░╚══╝░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n\r\na=int(input())\r\nb=101\r\nc=0\r\nfor i in range(1,a+1):\r\n d,e=map(int,input().split())\r\n if(b>e):\r\n b=e\r\n c+=(b*d)\r\nprint(c)\r\n", "n = int(input())\r\na = [list(map(int,input().split())) for i in range(n)]\r\nans = a[0][0]*a[0][1]\r\nmi = a[0][1]\r\nfor i in range(1,n):\r\n if mi>a[i][1]:\r\n ans+=a[i][0]*a[i][1]\r\n mi=a[i][1]\r\n else:\r\n ans+=a[i][0]*mi\r\nprint(ans)", "n=int(input())\r\nmeat=[]\r\nmoney=[]\r\nfor i in range(n):\r\n x=[int(x) for x in input().split()]\r\n a=x[0]\r\n b=x[1]\r\n meat.append(a)\r\n money.append(b)\r\nans=0\r\nm=money[0]\r\nfor i in range(len(meat)):\r\n if money[i]<m:\r\n m=money[i]\r\n ans=ans+m*meat[i]\r\nprint(ans)\r\n#print(meat)\r\n#print(money)\r\n", "d = []\r\nfor _ in range(int(input())):\r\n a, p = map(int, input().split())\r\n d.append([a, p])\r\n\r\nres = d[0][0]*d[0][1]\r\ncur = d[0][1]\r\n\r\nfor i in range(1, len(d)):\r\n cur = min(cur, d[i][1])\r\n res += ((d[i][0])*cur)\r\nprint(res)\r\n", "cases = int(input())\r\nmn = float(\"inf\")\r\nans = 0\r\nwhile cases:\r\n cases -= 1\r\n a, p = map(int, input().split())\r\n\r\n if p < mn:\r\n mn = p\r\n\r\n ans += mn*a\r\n\r\nprint(ans)\r\n", "n = int(input())\nfrom math import inf\nmn = inf\nres = 0\nfor _ in range(n):\n a, p = list(map(int, input().split()))\n mn = min(mn, p)\n res += a * mn\n\nprint(res)", "n = int(input())\r\nm=100000\r\nans=0\r\n\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n m=min(m, p)\r\n ans+=a*m\r\n\r\nprint (ans)", "n = int(input())\nP = 101\nres = 0\nfor _ in range(n):\n a, p = [int(s) for s in input().split(' ')]\n if p < P:\n P = p\n res += a*P\nprint(res)", "n = int(input())\naa, pp = [], []\nfor i in range(n):\n a, p = (int(x) for x in input().split())\n aa.append(a)\n pp.append(p)\nm = pp[0]\nx = aa[0]\ns = 0\nfor i in range(1, n):\n if pp[i] < m:\n s += m * x\n m = pp[i]\n x = aa[i]\n else:\n x += aa[i]\ns += m * x\nprint(s)", "n = int(input())\nsumm = 0\nprice = 101\nfor _ in range(n):\n\ta, p = map(int, input().split())\n\tif price > p:\n\t\tprice = p\n\tsumm += a * price\nprint(summ)", "import re\r\nfrom sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = [[0, 0] for _ in range(n)]\r\n for i in range(n):\r\n a[i][0], a[i][1] = multi_input()\r\n mcost = 2**60\r\n ans = 0\r\n for req, cost in a:\r\n mcost = min(mcost, cost)\r\n ans += mcost*req\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# URL: http://codeforces.com/problemset/problem/588/A\r\n\r\nfrom typing import List, Tuple\r\n\r\n\r\ndef parse_input() -> Tuple[int, List[List[int]]]:\r\n n = int(input())\r\n arr = [[int(x) for x in input().split()] for _ in range(n)]\r\n return n, arr\r\n\r\n\r\ndef solve(n: int, arr: List[List[int]]) -> int:\r\n total_cost = arr[0][0] * arr[0][1]\r\n min_price = arr[0][1]\r\n for elem in arr[1:]:\r\n min_price = min(min_price, elem[1])\r\n total_cost += elem[0] * min_price\r\n return total_cost\r\n\r\n\r\nif __name__ == '__main__':\r\n n, arr = parse_input()\r\n print(solve(n, arr))\r\n", "# https://codeforces.com/contest/588/problem/A\r\n\r\n\r\ndef single_integer():\r\n return int(input())\r\n\r\n\r\ndef multi_integer():\r\n return map(int, input().split())\r\n\r\n\r\ndef string():\r\n return input()\r\n\r\n\r\ndef multi_string():\r\n return input().split()\r\n\r\n\r\nn = single_integer()\r\nans = 0\r\nprevious = float('inf')\r\nfor i in range(1, n + 1):\r\n a, p = multi_integer()\r\n if p > previous:\r\n ans += a * previous\r\n else:\r\n ans += a * p\r\n previous = p\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = list()\r\np = list()\r\nk = list()\r\nfor j in range(n) :\r\n k.clear()\r\n k = input().split()\r\n a.append(int(k[0]))\r\n p.append(int(k[1]))\r\n\r\nminm = p[0]\r\ncost = 0\r\nfor i in range(n) :\r\n if (p[i]>=minm) :\r\n cost = cost + minm*a[i]\r\n else :\r\n minm = p[i]\r\n cost = cost + minm*a[i]\r\n \r\nprint (cost)", "n=int(input())\nneeds=[]\nprices=[]\nfor i in range(n):\n w=[int(x) for x in input().split()]\n needs+=[w[0]]\n prices+=[w[1]]\ndate=0\npayment=0\nwhile date<=n-1:\n for j in range(date,n):\n if prices[j]>=prices[date]:\n payment+=prices[date]*needs[j]\n if j==n-1:\n date=n\n else:\n date=j\n break\nprint(payment)", "n=int(input())\r\nm,d=map(int,input().split())\r\ndmin=d\r\ns=m*d\r\nwhile n-1:\r\n m,d=map(int,input().split())\r\n if dmin>d:\r\n dmin=d\r\n s+=(m*dmin)\r\n n-=1\r\nprint(s)\r\n", "n=int(input())\r\na=n*[0]\r\np=n*[0]\r\n\r\nfor i in range(n):\r\n l = input()\r\n num=list(map(int,l.split(' ')))\r\n a[i]=num[0]\r\n p[i]=num[1]\r\n\r\npref=n*[0]\r\nmn=p[0]\r\n\r\nfor i in range(n):\r\n mn=min(mn,p[i])\r\n pref[i]=mn\r\n\r\nans=0\r\nfor i in range(n):\r\n ans=ans+a[i]*pref[i]\r\n\r\nprint(ans)\r\n ", "minn = 101\r\ntotal = 0\r\nfor i in range(0,int(input())):\r\n n,k = [int(i) for i in input().split()]\r\n minn = min(minn,k)\r\n total+= n*minn\r\nprint(total)", "min_cost = 10**4\r\nans = 0\r\nfor i in range(int(input())):\r\n m, p = [int(el) for el in input().split()]\r\n min_cost = min(min_cost, p)\r\n ans += min_cost * m\r\nprint(ans)", "n = int(input())\r\n\r\ncost = 0\r\na = []\r\np = []\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(x), p.append(y)\r\n\r\npmin = p[0]\r\n\r\nfor i in range(n):\r\n if (p[i] <= pmin):\r\n pmin = p[i]\r\n cost += a[i]*pmin\r\n\r\nprint(cost)", "from math import inf\r\n\r\nmin_price, total = inf, 0\r\n\r\nfor _ in range(int(input())):\r\n a, p = map(int, input().split())\r\n min_price = min(p, min_price)\r\n total += a * min_price\r\n\r\nprint(total)", "t=int(input())\r\na=[]\r\np=[]\r\nsum=0\r\nmin=101 \r\nfor i in range (t):\r\n arr= list(map(int,input().split()))\r\n a.append(arr[0])\r\n p.append(arr[1])\r\nfor i in range (0,t):\r\n if p[i]<min:\r\n min=p[i]\r\n sum+=a[i]*min\r\nprint(sum)", "n=int(input())\r\nw=[]\r\nfor i in range(n):\r\n w.append([int(k) for k in input().split()])\r\nres=0\r\nc=0\r\nmn=10**100\r\nfor j in range(n):\r\n mn=min(mn, w[j][1])\r\n res+=mn*w[j][0]\r\nprint(res)", "mine, ans = float('inf'), 0\nfor i in range(int(input())):\n a, b = map(int, input().split())\n mine = min(b, mine)\n ans += a * mine\nprint(ans)", "def solve():\r\n n = int(input())\r\n amount = []\r\n pricex = []\r\n for _ in range(n):\r\n a, p = map(int, input().split())\r\n amount.append(a)\r\n pricex.append(p)\r\n \r\n min_price = float('inf')\r\n price = 0\r\n for i in range(n):\r\n if pricex[i] < min_price:\r\n min_price = pricex[i]\r\n price += amount[i] * min_price\r\n \r\n print(price)\r\n\r\nsolve()\r\n", "quantity = int(input())\r\namounts = []\r\ncosts = []\r\n\r\nfor i in range(quantity):\r\n entry = input().split()\r\n amounts.append(int(entry[0]))\r\n costs.append(int(entry[1]))\r\n\r\ntotal = 0\r\ncurrent_min = costs[0]\r\n\r\nfor j in range(quantity):\r\n if (current_min > costs[j]):\r\n current_min = costs[j]\r\n total += amounts[j] * current_min\r\n\r\nprint(total) ", "t=int(input())\r\nlst=[]\r\nlst1=[]\r\nfor i in range(t):\r\n a,p=map(int,input().split())\r\n lst.append(a)\r\n lst1.append(p)\r\nd=lst[0]*lst1[0]\r\nr=0\r\nfor i in range(1,len(lst)):\r\n if lst1[i-1]<lst1[i]:\r\n d+=lst[i]*lst1[i-1]\r\n lst1[i]=lst1[i-1]\r\n else:\r\n d+=lst[i]*lst1[i]\r\nprint(d)\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n count = 0\r\n summa = 0\r\n last = 0\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n if i > 0:\r\n if last > b:\r\n summa += a * b\r\n last = b\r\n else:\r\n summa += a * last\r\n else:\r\n summa += a * b\r\n last = b\r\n print(summa)", "n = int(input())\r\nprice = []\r\namount = []\r\n\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n price.append(p)\r\n amount.append(a)\r\n\r\ni = 0\r\ntotal = price[0] * amount[0]\r\nwhile i < (n-1):\r\n j = i + 1\r\n while j < n:\r\n if(price[i] <= price[j]): total += price[i] * amount[j]\r\n else:\r\n total += price[j] * amount[j]\r\n break\r\n j+=1\r\n i = j\r\n# print('i, j', i, j)\r\n'''for i in range(j, n):\r\n try: total += price[i] * amount[i]\r\n except: break'''\r\nprint(total)", "l = []\r\nfor _ in range(int(input())):\r\n t = list(map(int, input().split()))\r\n l.append(t)\r\np,q,sum = 0,1,0\r\ninif = False\r\ninelseif = False\r\nif len(l) == 1:\r\n print(l[0][0]*l[0][1])\r\nelse:\r\n while q <= len(l):\r\n if (q == len(l)) and (inif == True):\r\n sum += l[p][0] * l[p][1]\r\n q += 1\r\n elif (q == len(l)) and (inelseif == True):\r\n sum += l[p][1]*l[p][0]\r\n q += 1\r\n else:\r\n if l[p][1] > l[q][1]:\r\n sum += l[p][0]*l[p][1]\r\n p = q\r\n q += 1\r\n inif = True\r\n inelseif = False\r\n else:\r\n sum += (l[q][0]*l[p][1])\r\n q += 1\r\n inif = False\r\n inelseif = True\r\n print(sum)", "n=int(input())\r\na=[]\r\np=[]\r\np1=101\r\ntotal_sum=0\r\nfor i in range(n):\r\n b,c=input().split()\r\n a.append(int(b))\r\n p.append(int(c))\r\nfor i in range(n):\r\n if p[i]<p1:\r\n p1=p[i]\r\n total_sum+=a[i]*p1\r\nprint(total_sum)", "\nn = int(input())\na, kilo =map(int,input().split())\ns = kilo*a\nwhile n-1>0:\n a,b = map(int,input().split())\n if b<kilo:\n kilo = b\n s += kilo*a\n n -= 1\nprint(s)\n", "# http://codeforces.com/problemset/problem/588/A\r\nn=int(input())\r\nans=k=0\r\nm=10000000000\r\nfor i in range(n):\r\n a,b=input().split()\r\n a,b=int(a),int(b)\r\n if b<m:\r\n ans+=m*k\r\n k=0\r\n m=b \r\n k+=a\r\nans+=m*k\r\nprint(ans) \r\n\r\n \r\n", "N=int(input())\r\na=[]\r\np=[]\r\nfor i in range(N):\r\n c,d= list(map(int, input().split()))\r\n a.append(c)\r\n p.append(d)\r\n \r\nmin=p[0]\r\nmoney=a[0]*p[0]\r\n\r\nfor i in range(1,N):\r\n if min <p[i]:\r\n money+=a[i]*min\r\n else:\r\n money+=a[i]*p[i]\r\n min=p[i]\r\n\r\nprint(money)\r\n \r\n ", "if __name__ == '__main__':\r\n n = int(input())\r\n ans = 0\r\n min = 101\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n if y < min:\r\n min = y\r\n ans += x * min\r\n print(ans)\r\n", "#codeforces_588A\r\nn = int(input())\r\na = []\r\np = []\r\nfor k in range(n):\r\n\tL = input().split(\" \")\r\n\ta.append(int(L[0]))\r\n\tp.append(int(L[1]))\r\nmoney = a[0]*p[0]\r\nprice = p[0]\r\nk = 1\r\nwhile k<n:\r\n\twhile k<n:\r\n\t\tif p[k]>=price :\r\n\t\t\tmoney += a[k]*price\r\n\t\t\tk+=1\r\n\t\telse: break\r\n\tif k<n:price = p[k]\r\nprint(money)\r\n", "mini = float('inf')\r\ntotal = 0\r\nfor _ in range(int(input())):\r\n a, p = map(int, input().split())\r\n mini = min(mini, p)\r\n total += mini * a\r\nprint(total)", "\na,n=list(),int(input())\nfor _ in range(n):\n x,y=map(int,input().split())\n a.append([x,y])\ni,ans,j=0,0,1\nwhile i<n:\n ans+=a[i][0]*a[i][1]\n while j<n and a[j][1]>a[i][1]:\n ans+=(a[j][0]*a[i][1])\n j+=1\n i=j\n j+=1\nprint(ans)\n\n", "n = int(input())\r\ns = [[int(x)for x in input().split()]for i in range(n)]\r\namount, price = s[0][0], s[0][1]\r\ncost = amount * price\r\nfor i in range(1,n):\r\n amount = s[i][0]\r\n if s[i][1] < price:\r\n price = s[i][1]\r\n cost += amount * price\r\nprint(cost)\r\n", "n = int(input())\r\nkilos = []\r\nprecios = []\r\ncosto_total = 0\r\nfor i in range(n):\r\n k, p = list(map(int, input().split(\" \")))\r\n kilos.append(k)\r\n precios.append(p)\r\n\r\nmenor = 101\r\nfor i in range(n):\r\n if menor >= precios[i]:\r\n menor = precios[i]\r\n costo_total += kilos[i] * menor\r\nprint(costo_total)\r\n \r\n", "# coding: utf-8\nn = int(input())\n\ncost = 0\nmin_price = 100\nfor i in range(n):\n amount, price = input().split(\" \")\n amount, price = int(amount), int(price)\n\n if price < min_price:\n min_price = price\n\n cost += amount * min_price\n \nprint(cost)", "n = int(input())\r\nans = 0\r\nmin_price = 101\r\nfor i in range(n):\r\n meat, price = map(int, input().split())\r\n if price < min_price:\r\n ans += meat*price\r\n min_price = price\r\n else:\r\n ans += meat*min_price\r\nprint(ans)", "f=lambda:map(int,input().split())\r\nn=int(input())\r\na,p=zip(*(f() for i in range(n)))\r\ni=1\r\nw,c=a[0],p[0]\r\ntc=0\r\nwhile i<n:\r\n if c<=p[i]:\r\n w+=a[i]\r\n else:\r\n tc+=c*w\r\n w=a[i]\r\n c=p[i]\r\n i+=1\r\nprint(tc+c*w)", "n = int(input())\r\ncounter = 0\r\nmin = 101\r\nfor _ in range(n):\r\n a,p = list(map(int,input().split()))\r\n if p <= min:\r\n counter+=(a*p)\r\n min = p \r\n else:\r\n counter+=(min*a)\r\nprint(counter) ", "n = int(input())\r\namount = []\r\ncost = []\r\nfor i in range(n):\r\n a, c = [int(x) for x in input().split(' ')]\r\n amount.append(a)\r\n cost.append(c)\r\nmn = 142\r\nans = 0\r\nfor z in range(n):\r\n mn = min(mn, cost[z])\r\n ans += amount[z]*mn\r\n\r\nprint(ans)", "dinheiro = 0\r\npreco = 150\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n quantidade, preco_i = input().split()\r\n quantidade = int(quantidade)\r\n preco_i = int(preco_i)\r\n\r\n if (preco > preco_i):\r\n preco = preco_i\r\n dinheiro += preco * quantidade\r\n\r\nprint(dinheiro)", "n=int(input())\r\nb=110\r\ns=0\r\nfor i in range(n):\r\n\ta,p=map(int,input().split())\r\n\tb=min(b,p)\r\n\ts=s+a*b\r\n\t\r\nprint(s)\t", "n = int(input())\r\nMIN, result = 101, 0\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n if p < MIN:\r\n MIN = p\r\n result += MIN*a\r\nprint(result)", "n = int(input())\r\nmeat = [0]*100002\r\ncost = [0]*100002\r\nfor i in range(n):\r\n meat[i], cost[i] = [int(i) for i in input().split()]\r\ni = 0\r\nj = 0\r\nres = 0\r\nwhile i < n:\r\n if i == j:\r\n res+=meat[i] * cost[j]\r\n i+=1\r\n while cost[j] < cost[i] and i < n:\r\n res+=meat[i] * cost[j]\r\n i+=1\r\n j=i\r\nprint(str(res))\r\n", "N = int(input())\r\nans = 0 \r\nmin_price = float(\"inf\")\r\nfor n in range(N):\r\n a,p = map(int,input().split())\r\n if p < min_price : \r\n min_price = p \r\n ans += a * min_price \r\nprint(ans)", "n = int(input())\r\nresult = 0\r\np = 100\r\n\r\nfor i in range(n):\r\n\ta, b = map(int, input().split())\r\n\tp = min(p, b)\r\n\tresult = result + p * a\r\n\t\r\n\t\r\n\t\r\nprint(result)", "import sys\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef min_cost(n, ap):\n m = ap[0][1]\n t = 0\n for a, p in ap:\n m = min(m, p)\n t += a*m\n return t\n\n\ndef pap():\n a, p = map(int, input().split())\n return a, p\n\n\ndef main():\n n = int(input())\n ap = [pap() for _ in range(n)]\n print(min_cost(n, ap))\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 main()\n b = float(o)\n try:\n a, = map(float, r.getvalue().splitlines())\n except Exception:\n ok = False\n else:\n ok = abs(a-b)/max(1,b) <= 0.0001\n if ok:\n log(\"OK\\n\")\n else:\n log(f\"Expected:\\n{o}Got:\\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 = [(\"\"\"\\\n3\n1 3\n2 2\n3 1\n\"\"\", \"\"\"\\\n10\n\"\"\"), (\"\"\"\\\n3\n1 3\n2 1\n3 2\n\"\"\", \"\"\"\\\n8\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\n", "n = int(input())\nres, prc = 0, 100\nfor _ in range(n):\n a, p = (int(i) for i in input().split())\n prc = min(prc, p)\n res += a * prc\nprint(res)\n", "n = int(input())\ncnt, min_price = 0, 0\nfor i in range(n):\n x = list(map(int, input().split()))\n if i == 0:\n min_price = x[1]\n cnt = x[0] * x[1]\n else:\n if x[1] < min_price:\n min_price = x[1]\n cnt += x[0] * min_price\nprint(cnt)\n", "'''s=[];n=int(input());i=1\r\nfor _ in [0]*n:\r\n s.append([int(i) for i in input().split()])\r\nb=s[0][1];t=s[0][0]*b\r\nwhile i<n:\r\n while i<n and s[i][1]>b:\r\n t+=s[i][0]*b;i+=1\r\n if i>=n:break\r\n b=s[i][1];t+=s[i][0]*b;i+=1\r\nprint(t)'''\r\n\r\n\r\n\r\nn=int(input())\r\na=[int(i) for i in input().split()];b=a[1];t=a[0]*b\r\nfor _ in [0]*(n-1):\r\n a=[int(i) for i in input().split()]\r\n if a[1]<b:b=a[1]\r\n t+=a[0]*b\r\nprint(t)", "n=int(input())\r\ncost=0\r\na=[]\r\nmini=0\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\ta.append([x,y])\r\nfor i in range(n):\r\n\tif(i==0):\r\n\t\tcost+=a[i][1]*a[i][0]\r\n\t\tmini=a[i][1]\r\n\telse:\r\n\t\tif(a[i][1]>=mini):\r\n\t\t\tcost+=a[i][0]*mini\r\n\t\telse:\r\n\t\t\tmini=a[i][1]\r\n\t\t\tcost+=a[i][0]*mini\r\nprint(cost)\r\n\r\n", "n=int(input())\r\na=[]\r\np=[]\r\nfor i in range(n) :\r\n b=[int(j) for j in input().split(' ')]\r\n a.append(b[0])\r\n p.append(b[1])\r\n#print(a,p)\r\nminp=101\r\ncost=0\r\nfor i in range(n) :\r\n if p[i]<minp :\r\n minp=p[i]\r\n cost+=minp*a[i]\r\nprint(cost) ", "res = 0\r\nfor _ in range(int(input())):\r\n a, p = list(map(int, input().split()))\r\n if res == 0:\r\n pMin = p\r\n else:\r\n pMin = min(pMin, p)\r\n res += a * pMin\r\nprint(res)", "n=int(input())\r\na, p = [0 for i in range(n)], [0 for i in range(n)]\r\nk = 0\r\nfor i in range(n):\r\n a[i], p[i] = map(int,input().split())\r\n \r\n\r\nr = p.index(min(p))\r\nwhile r >= 0:\r\n k += p[r]*(sum(a[r:]))\r\n a = a[:r]\r\n if r == 0:\r\n break\r\n r = p[:r].index(min(p[:r]))\r\n \r\n \r\nprint(k)", "def sol():\r\n n=int(input())\r\n ans=0\r\n minn=0\r\n for i in range(n):\r\n a,p=map(int,input().split())\r\n if(i==0):\r\n minn=p\r\n ans+=(p*a)\r\n else:\r\n if(p<minn):\r\n minn=p\r\n ans+=(minn*a)\r\n print(ans)\r\nif(__name__=='__main__'):\r\n sol()\r\n", "n=int(input())\r\na=[0]*n\r\nb=[0]*n\r\nfor i in range(n):\r\n a[i],b[i]=map(int,input().split())\r\nk=b[0]\r\nh=0\r\nfor i in range(n):\r\n if(b[i]>k):\r\n h+=k*a[i]\r\n else:\r\n k=b[i]\r\n h+=k*a[i]\r\nprint(h)", "N = int(input())\r\nans = 0\r\ncur = 1e18\r\nfor i in range(N):\r\n\ta, b = map(int, input().split())\r\n\tcur = min(cur, b)\r\n\tans += a * cur\r\nprint(ans)", "n = int(input())\r\nans = 0\r\nok = 10 ** 9\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n ok = min(ok,b)\r\n ans += ok * a\r\nprint(ans)", "n=int(input())\r\nl=[]\r\ns=0\r\nfor i in range(n):\r\n\tr=list(map(int,input().split()))\r\n\tl.append(r)\r\n\tif len(l)==1:\r\n\t\ts+=l[-1][0]*l[-1][1]\r\n\telif l[-2][1]<l[-1][1]:\r\n\t\tl[-1][1]=l[-2][1]\r\n\t\ts+=l[-1][0]*l[-1][1]\r\n\telse:\r\n\t\ts+=l[-1][0]*l[-1][1]\r\nprint(s)", "n=int(input())\r\nprice=101\r\nmoney=0\r\nfor i in range(n):\r\n a,p=map(int,input().split( ))\r\n if p>price:\r\n money+=a*price\r\n else:\r\n price=p\r\n money+=a*p\r\nprint(money)", "n = int(input())\nm = 99999\nans = 0\nfor i in range(n):\n a, p = [int(x) for x in input().split()]\n m = min(m, p)\n ans += (a * m)\nprint(ans)\n \t \t\t \t\t \t \t\t \t\t\t\t\t", "a=int(input())\r\nb=[]\r\nc=101\r\ns=0\r\nfor i in range(a):\r\n d,e=map(int,input().split())\r\n c=min(c,e)\r\n s+=d*c\r\nprint(s)", "n=int(input())\r\nm=100\r\nt=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n m=min(m,b)\r\n t=t+a*m\r\nprint(t)", "n = int(input())\r\nmoney, price = 0, 100\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n if price > p:\r\n price = p\r\n money += price * a\r\nprint(money)", "n=int(input())\r\ne=[]\r\nc=[]\r\nfor i in range(n):\r\n s=[int(a) for a in input().split()]\r\n e.append(s[0])\r\n c.append(s[1])\r\nex=c[0]\r\nm=0\r\ncnt=0\r\nwhile m<n:\r\n cnt=cnt+e[m]*ex\r\n m=m+1\r\n if m==n:\r\n break\r\n if c[m]<ex:\r\n ex=c[m]\r\nprint(cnt)\r\n", "inp=input()\nn=int(inp)\na=[]\np=[]\nmoney=0\nmin_pi=1000\nfor i in range(n):\n chars=input().split()\n ai=int(chars[0])\n pi=int(chars[1])\n if pi < min_pi:\n min_pi=pi\n money=money+ai*min_pi\nprint(money)\n\n \n", "n=int(input())\nsoma = 0\nminimo = 101\nfor i in range(n):\n a,b=list(map(int,input().split(\" \")))\n if(minimo > b):\n minimo = b\n \n soma += a * minimo\n \nprint(soma)", "n=int(input())\r\nl,d=[],[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n l.append(x)\r\n d.append(y)\r\nm=10**10\r\ns=0\r\n\r\nfor i in range(n):\r\n if(d[i]<m):\r\n m=d[i]\r\n s=s+l[i]*m\r\nprint(s)\r\n", "n=int(input())\r\nminn=101 \r\nans=0 \r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n minn=min(minn,b) \r\n ans+=a*minn \r\nprint(ans)", "from functools import reduce\r\nn = [int(i) for i in input().split()][0]\r\na = []\r\np = []\r\nmins = []\r\nfor i in range(n):\r\n cura, curp = [int(i) for i in input().split()]\r\n a.append(cura)\r\n p.append(curp)\r\ncurmin = p[0]\r\nmins = [p[0]]\r\nfor i in range(1,n):\r\n if p[i]<curmin:\r\n curmin = p[i]\r\n mins.append(curmin)\r\nlist_c = [ i*b for (i,b) in zip(mins,a)]\r\n\r\nproduct = reduce((lambda x, y: x + y), list_c)\r\n\r\nprint (product)", "n = int(input())\r\na, p = [0]*n, [0]*n\r\nfor i in range(n):\r\n\ta[i], p[i] = [int(x) for x in input().split()]\r\n\r\ncurr_min = p[0]\r\ncost = a[0] * p[0]\r\nfor i in range(1, n):\r\n\tif p[i] < curr_min:\r\n\t\tcurr_min = p[i]\r\n\tcost += a[i] * curr_min\r\n\r\nprint(cost)", "a=int(input())\r\nmin=1000000\r\nans=0\r\nfor i in range(a):\r\n z=input().split(\" \")\r\n if(min>int(z[1])):\r\n min=int(z[1])\r\n ans+=int(z[0])*min\r\nprint(ans)\r\n ", "s=0\nm=10000\nfor t in range(int(input())):\n\ta,b=map(int,input().split())\n\tm=min(m,b)\n\ts+=(a*m)\nprint(s)\n\t\n\t\n\t\t \t \t \t\t\t \t\t\t\t\t \t \t\t \t", "days=int(input())\r\nlist1=[]\r\nfor t in range(days):\r\n list1.append(list(map(int,input().split())))\r\nfor p in range(len(list1)):\r\n if p==len(list1)-1:\r\n pass\r\n else:\r\n if list1[p][1]<list1[p+1][1]:\r\n list1[p+1][1]=list1[p][1]\r\n else:continue\r\nresults=0\r\nfor i in range(len(list1)):\r\n results+=list1[i][0]*list1[i][1]\r\nprint(results)\r\n", "n = int(input())\n\ns = 0\nmn = 101\n\nfor _ in range(n):\n a, p = map(int, input().split())\n if p < mn:\n mn = p\n s += a * mn\n\nprint(s)\n", "n = int(input())\r\n\r\nbutuh = []\r\nharga = []\r\n\r\nfor i in range(n):\r\n x, y = map(int,input().split())\r\n butuh.append(x)\r\n harga.append(y)\r\n\r\ntotal = 0\r\n\r\nwhile len(butuh) > 0:\r\n h = min(harga)\r\n ind = harga.index(h)\r\n total += h * sum(butuh[ind:])\r\n butuh = butuh[:ind]\r\n harga = harga[:ind]\r\n\r\nprint(total)\r\n", "total_cost = 0\nday_cost = 101\nfor i in range(int(input())):\n ai, pi = [int(i) for i in input().split()]\n day_cost = min(day_cost, pi)\n total_cost += day_cost * ai\nprint(total_cost)", "n = int(input())\r\n\r\nprice = 10000000\r\nans = 0\r\nfor _ in range(n):\r\n a, p = list(map(int, input().split()))\r\n price = min(price, p)\r\n ans += a * price\r\n\r\nprint(ans)", "x = int(input())\r\na = 101\r\ntot = 0\r\nfor i in range(x):\r\n y, z = map(int,input().split())\r\n a = min(a,z)\r\n tot += a * y\r\n\r\nprint(tot)\r\n", "x=input()\r\nm=123\r\nt=0\r\nfor i in range(int(x)):\r\n a,b=map(int,input().split())\r\n m=min(m,b)\r\n t=t+a*m\r\nprint(t)", "l = []\r\nfor i in range(int(input())):\r\n x,y = map(int , input().split())\r\n k = [x,y]\r\n l.append(k)\r\nd = l[0][1]\r\nans = 0\r\nfor i in range(len(l)):\r\n d = min(d,l[i][1])\r\n ans+=d*l[i][0]\r\n \r\nprint(ans)\r\n \r\n ", "# from sys import stdin, stdout\r\n\r\n# import re\r\n\r\n# import math\r\n# import statistics\r\n# import itertools\r\n# import collections\r\n# import cmath\r\n\r\n# import calendar\r\n# import datetime\r\n\r\n# import operator\r\n\r\n#----------Profiling----------\r\n# import cProfile\r\n# import pstats\r\n\r\nn = int(input())\r\nai = []\r\npi = []\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n ai.append(a) \r\n pi.append(p)\r\n\r\n\r\ncheapest = pi[0]\r\nspent = 0\r\nfor i in range(n):\r\n if pi[i] < cheapest:\r\n cheapest = pi[i]\r\n spent += ai[i] * cheapest\r\nprint(spent)", "days = int(input())\r\n\r\nweights = []\r\nprices = []\r\n\r\n\r\ndef solve():\r\n total_price = 0\r\n\r\n for day in range(days):\r\n temp_day = day\r\n while (temp_day < days and weights[temp_day] > 0 and prices[day] <= prices[temp_day]):\r\n total_price += weights[temp_day] * prices[day]\r\n weights[temp_day] = 0\r\n temp_day += 1\r\n\r\n return total_price\r\n\r\n\r\nfor _ in range(days):\r\n\r\n weight, price = map(int, input().split())\r\n\r\n weights.append(weight)\r\n prices.append(price)\r\n\r\n\r\nprint(solve())\r\n", "# Bismillah\r\n# In the name of GOD\r\n\r\nn = int(input())\r\na = [0] * n\r\np = [0] * n\r\nfor i in range(n):\r\n\ta[i], p[i] = map(int, input().split())\r\nprice = 0\r\nfor i in range(n):\r\n\tj = i + 1\r\n\tprice += a[i] * p[i]\r\n\twhile j < n:\r\n\t\tif p[i] < p[j]:\r\n\t\t\tprice += a[j] * p[i]\r\n\t\t\ta[j] = 0\r\n\t\t\tj += 1\r\n\t\telse:\r\n\t\t\tbreak\r\nprint(price)\r\n", "n=int(input())\r\nc=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n c.append(a)\r\nl=[]\r\nr=[]\r\nfor i in range(len(c)):\r\n l.append(c[i][0])\r\n r.append(c[i][1])\r\nfor i in range(n-1):\r\n if(r[i]<r[i+1]):\r\n r[i+1]=r[i]\r\nz=0\r\nfor i in range(n):\r\n z+=r[i]*l[i]\r\nprint(z)\r\n", "n=int(input())\r\nk=[]\r\nl=[]\r\nans=0\r\nm=10**9+7\r\nfor i in range(n):\r\n k1,l1=map(int,input().split())\r\n m=min(m,l1)\r\n ans+=k1*m\r\nprint(ans)\r\n", "n=int(input())\r\np=100\r\nans=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n p=min(p,b)\r\n ans=ans+p*a\r\nprint(ans)\r\n", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n\ta,p=map(int,input().split())\r\n\tif i==0:\r\n\t\tm=p\r\n\telse:\r\n\t\tm=min(m,p)\r\n\tc+=a*m\r\nprint(c)", "dias = []\r\nn = int(input())\r\nwhile n:\r\n quantia, custo = list(map(int, input().split()))\r\n \r\n dias.append([quantia, custo])\r\n n -= 1\r\n\r\n# seta o minimo atual pelo maior valor possivel mais 1\r\nactual_min = 101\r\nfor i in range(len(dias)):\r\n \r\n # substitui o minimo atual pelo melhor minimo que ja passou\r\n actual_min = min(actual_min, dias[i][1])\r\n # custo\r\n dias[i][1] = actual_min\r\n\r\n# multiplica todos custo por sua quantia modifica e soma tudo\r\nprint(sum(list(map(lambda x: x[0]*x[1], dias))))\r\n", "import sys\r\nn = int(input())\r\nrate = sys.maxsize\r\ntotal = 0\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n if(p < rate):\r\n total += p*a\r\n rate = p\r\n else:\r\n total += rate*a\r\nprint(total)", "a = []\r\narray_1 = []\r\narray_2 = []\r\nm=1000000000000000000000000000000000\r\nresult=0\r\nlimit = int(input())\r\nfor i in range(limit):\r\n x,y=map(int,input().split())\r\n array_1.append(x)\r\n array_2.append(y)\r\n\r\n \r\nfor i in range(limit):\r\n if(array_2[i]<m):\r\n m=array_2[i]\r\n result=result+array_1[i]*m\r\nprint(result)", "n = int(input())\r\n\r\nmoney_spent = 0\r\ncurrent_price = 1000\r\nfor _ in range(n):\r\n meat, price = [int(i) for i in input().split()]\r\n current_price = min(current_price, price)\r\n money_spent += current_price * meat\r\nprint(money_spent)\r\n", "n = int(input())\r\nans = 0\r\nminimum = 10000\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n minimum = min(minimum, p)\r\n ans += a * minimum\r\nprint(ans)", "sum=0\r\nz=int(input())\r\nfor i in range(z):\r\n c=list(map(int,input().split()))\r\n a=c[1]\r\n if i!=0:\r\n if b<=a:\r\n a=b \r\n sum=sum+(c[0]*a) \r\n b=a\r\nprint(sum) ", "d=int(input())\r\nm=1000\r\ncost=0\r\nfor _ in range(d):\r\n a,p= map(int, input().split())\r\n m=min(m,p)\r\n cost=cost+(a*m)\r\nprint(cost)", "def Main():\n n = int(input())\n\n minsf = 101\n ans = 0\n for i in range(n):\n a, p = map(int, input().split())\n if minsf > p:\n minsf = p\n ans+=(minsf*a)\n \n print(ans)\n\nif __name__ == \"__main__\":\n Main()\n", "n=int(input())\r\na,p=map(int,input().split())\r\ns=(a*p)\r\nfor i in range(1,n):\r\n\ta,b=map(int,input().split())\r\n\tif b>p:\r\n\t\ts+=(a*p)\r\n\telse:\r\n\t\ts+=(a*b)\r\n\t\tp=b\r\nprint(s)", "N = int(input())\n\nret = 0\nmin_p = 1e10\nfor _ in range(N):\n a, p = map(int, input().split())\n if p < min_p:\n min_p = p\n ret += a * min_p\n\nprint(ret)\n \t\t \t\t \t \t\t \t \t \t\t", "enter = int(input())\r\n\r\nmin = 100\r\n\r\ntotal = 0\r\n\r\nfor i in range(enter):\r\n enter_2 = input().split()\r\n needed = int(enter_2[0])\r\n price = int(enter_2[1])\r\n if(price < min):\r\n min = price\r\n total += needed*min\r\n\r\nprint(total)", "n=int(input())\r\nr=0\r\nm=2**20\r\nfor _ in range(n):\r\n a,p=map(int,input().split())\r\n m=min(m,p)\r\n r+=a*m\r\nprint (r)\r\n", "n = int(input())\r\nres,cost = 0,2e9\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split(' '))\r\n if(b < cost):\r\n cost = b\r\n res+=a*cost\r\n\r\nprint(res)\r\n", "n = int(input())\r\n\r\nl = 100\r\nt = 0\r\n\r\nfor i in range(n):\r\n a, p = [int(x) for x in input().split()]\r\n l = min(l, p)\r\n t += l * a\r\n\r\nprint(t)", "#!/usr/bin/env python3\nn = int(input())\n\np_min = 101\ntotal = 0\nfor i in range(n):\n a, p = [int(s) for s in input().split(' ')]\n if p < p_min:\n p_min = p\n total += (p_min * a)\n\nprint(total)\n\n", "n = int(input())\r\nprice = []\r\ntotal = 0\r\nfor i in range(n):\r\n a, p = input().split()\r\n a, p = int(a), int(p)\r\n\r\n if price == [] or p <= price[-1]:\r\n x = p\r\n elif p > price[-1]:\r\n x = price[-1]\r\n \r\n total = total + a *x \r\n price.append(x)\r\n \r\nprint(total)", "n=int(input())\r\ns=0\r\nm=123\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n m=min(m,b)\r\n s=s+m*a\r\nprint(s)", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range (n):\r\n x,y = map(int,input().split())\r\n a.append(x)\r\n b.append(y)\r\n\r\nprice = 2000000000\r\nans = 0\r\nfor i in range (n):\r\n price = min(price,b[i])\r\n ans += price*a[i]\r\n\r\nprint(ans)", "n = int(input())\nA = []\nP = []\nfor i in range(n):\n a,p = [int(x) for x in input().split()]\n A.append(a)\n P.append(p)\ncost = A[0]*P[0]\nmin_p = P[0]\nfor i in range(1,n):\n if P[i]<=min_p:\n min_p = P[i]\n cost+=min_p*A[i]\nprint(cost)\n\t\t\t \t\t\t \t\t\t \t\t\t \t\t\t \t \t \t", "n = int(input())\r\nx = float(\"inf\")\r\ny = 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n x = min(x, b)\r\n y = y + a*x\r\n\r\nprint(y)", "n = int(input())\r\n\r\nmini = 110\r\nsum = 0\r\n\r\nfor i in range(n):\r\n a, p = [int(x) for x in input().split()]\r\n mini = min(mini, p) \r\n sum += mini * a\r\n\r\nprint(sum)\r\n", "n=int(input())\r\n\r\na,m=map(int,input().split())\r\nans=a*m\r\n\r\nfor i in range(n-1):\r\n \r\n b,c=map(int,input().split())\r\n m=min(m,c)\r\n ans+=(b*m)\r\n \r\nprint(ans)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n#import datetime\r\n# import webbrowser\r\n\r\nn = int(input())\r\nmin_price = 1000000\r\namount = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n min_price = min(y, min_price)\r\n amount += min_price * x\r\nprint(amount)\r\n", "t=int(input())\r\nsum1=0\r\nprice=10100101010101\r\nfor i in range(t):\r\n a,p=map(int,input().split(\" \"))\r\n price=min(price,p)\r\n sum1+=a*price\r\nprint(sum1)", "n=int(input())\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x.append(a)\r\n y.append(b)\r\nm=0\r\ns=y[0]\r\nfor j in range(0,n):\r\n if(s<=y[j]):\r\n m=m+x[j]*s\r\n else:\r\n s=y[j]\r\n m=m+x[j]*s\r\nprint(m) \r\n \r\n \r\n \r\n\r\n \r\n", "money = 0\r\ncost = 101\r\ndays = int(input())\r\n\r\nwhile(days>0):\r\n days = days - 1\r\n line = input().split(\" \")\r\n x = int(line[0])\r\n y = int(line[1])\r\n \r\n if(cost>y):\r\n cost = y\r\n money += cost*x\r\n\r\nprint(money)\r\n", "# https://codeforces.com/problemset/problem/588/A\r\n\r\ndef minimise_expense(n, meat_kg_list, meat_price_list):\r\n\r\n min_price = 101\r\n expense = 0\r\n\r\n for idx, price in enumerate(meat_price_list):\r\n\r\n if price < min_price:\r\n min_price = price\r\n\r\n expense += meat_kg_list[idx] * min_price\r\n\r\n return expense\r\n\r\nif __name__ == '__main__':\r\n\r\n n = int(input())\r\n meat_kg_list = []\r\n meat_price_list = []\r\n\r\n for __ in range(n):\r\n\r\n kg, price = list(map(int, input().split()))\r\n meat_kg_list.append(kg)\r\n meat_price_list.append(price)\r\n\r\n expense = minimise_expense(n, meat_kg_list, meat_price_list)\r\n print(expense)\r\n", "n = int(input())\r\na = []\r\nmn = 111\r\nfor i in range(n):\r\n ch = input()\r\n ch = ch.split()\r\n ch = [int(x) for x in ch]\r\n if ch[1] < mn:\r\n mn = ch[1]\r\n else:\r\n ch[1] = mn\r\n a.append(ch)\r\n\r\nsm = 0\r\nfor i in a:\r\n sm += i[0] * i[1]\r\n\r\n\r\nprint( sm)", "n=int(input())\na,p=input().split()\na,p=int(a),int(p)\np1=p\nm=a*p1\nfor i in range(n-1):\n\ta,p=input().split()\n\ta,p=int(a),int(p)\n\tif p<p1:\n\t\tp1=p\n\tm+=a*p1\nprint(m)\n\n\t\n\n\n\n\n\n\n\t\n\n\n\n\n\t\n\n\n\n\n\n", "import math\r\nn=int(input())\r\na=[]\r\np=[]\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\ta.append(x)\r\n\tp.append(y)\r\nans=0;\r\nprice=1000\r\nfor i in range(n):\r\n\tprice=min(p[i],price)\r\n\tans=ans+a[i]*price\r\nprint(ans)\r\n", "sm = 1000\r\ncheck = 0\r\nfor i in range(int(input())):\r\n k, p = map(int, input().split())\r\n if p < sm:\r\n sm = p\r\n check += sm * k\r\nprint(check)", "cost,prev = 0,0\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n if prev!=0 and prev<b:\r\n cost+=prev*a\r\n else:\r\n cost+=a*b\r\n prev = b\r\nprint(cost)", "n = int(input())\r\ndemand = []\r\nprice = []\r\nfor i in range(0,n):\r\n a = list(map(int,input().split()))\r\n demand.append(a[0])\r\n price.append(a[1])\r\nt = price[0]\r\ns = 0\r\nfor i in range(0,n):\r\n if price[i] < t:\r\n t = price[i]\r\n s += t * demand[i]\r\nprint (s)\r\n", "lst1=[]\r\nlst2=[]\r\nfor a in range(int(input())):\r\n lst=[int(x) for x in input().split()]\r\n lst1.append(lst[0])\r\n lst2.append(lst[1])\r\ncost=lst1[0]*lst2[0]\r\nq=lst2[0]\r\nfor i in range(1, len(lst2)):\r\n if q < lst2[i]:\r\n cost+= q*lst1[i]\r\n else:\r\n q=lst2[i]\r\n cost+=q*lst1[i]\r\nprint(cost)\r\n\r\n", "n = int(input())\r\n[a,p] = list(map(int,input().split()))\r\ncost = a*p\r\n\r\nfor i in range(n-1):\r\n [a1,p1] = list(map(int,input().split()))\r\n if p1<p:\r\n p = p1\r\n cost+=a1*p\r\nprint(cost)", "z=int(input())\r\n\r\nmin=99999\r\ncount=0\r\nfor i in range(z) :\r\n y=list(map(int,input().split()))\r\n if min>y[1] :\r\n min=y[1]\r\n count+=(min*y[0])\r\n\r\nprint(count)\r\n\r\n", "a = []\r\np = []\r\nfor _ in range(int(input())) :\r\n x,y = map(int,input().split())\r\n a.append(x)\r\n p.append(y)\r\ncost = a[0] * p[0]\r\nfor i in range(1,len(a)) :\r\n if p[i] > p[i-1] :\r\n p[i] = p[i-1]\r\n cost += a[i] * p[i]\r\n else :\r\n cost += a[i] * p[i]\r\nprint(cost)", "n = int(input())\nm = 1000\nres = 0\nfor i in range(n):\n s = input().split()\n a, b = int(s[0]), int(s[1])\n if m > b: m = b\n res += a*m\nprint(res)\n", "n=int(input())\r\nsum1=0\r\nmini=200\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n mini=min(b,mini)\r\n sum1+=a*mini\r\nprint(sum1) \r\n", "n = int(input())\r\ncosts = []\r\namounts = []\r\ntotal_money = 0\r\n\r\na, p = map(int, input().split())\r\ncur_min = p\r\ntotal_money += (a * p)\r\nfor _ in range(1, n):\r\n a, p = map(int, input().split())\r\n if p < cur_min:\r\n cur_min = p\r\n total_money += (a * cur_min)\r\n\r\nprint(total_money)\r\n", "\ndef main():\n days = int(input())\n\n need_per_day = []\n price_per_day = []\n for _ in range(days):\n i = input()\n i_splitted = i.split(' ')\n need_per_day.append(int(i_splitted[0]))\n price_per_day.append(int(i_splitted[1]))\n\n print(get_minimal_money(need_per_day, price_per_day))\n\ndef get_minimal_money(need_per_day, price_per_day):\n total = 0\n curr_min = 999999\n for i in range(len(need_per_day)):\n if price_per_day[i] < curr_min:\n curr_min = price_per_day[i]\n total += need_per_day[i] * curr_min\n return total\n\nif __name__ == \"__main__\":\n main()", "a=int(input())\nb=input().strip().split()\nb[0]=int(b[0])\nb[1]=int(b[1])\ncurM=b[1]\nout=curM*b[0]\nfor i in range(a-1):\n b=input().strip().split()\n b[0]=int(b[0])\n b[1]=int(b[1])\n if b[1]<curM:\n curM=b[1]\n out+=curM*b[0]\nprint(out)", "n = int(input())\r\na = []\r\np = []\r\ncost = 0\r\nfor i in range(n):\r\n b,c = map(int,input().split())\r\n a.insert(i,b)\r\n p.insert(i,c)\r\nfor j in range(n):\r\n if j != n-1 and p[j] < p[j+1]:\r\n p[j+1] = p[j]\r\n cost += a[j]*p[j]\r\nprint(cost)\r\n", "n = int(input())\r\nc = 10 ** 10\r\nres = 0\r\nfor i in range(n):\r\n a,p = map(int, input().split())\r\n c = min(c,p)\r\n res += c * a\r\nprint(res)", "n=int(input())\r\nx,y=map(int,input().split())\r\ns=x*y\r\nz=y\r\nfor i in range(n-1):\r\n x,y=map(int,input().split())\r\n if(z>y):\r\n z=y\r\n s=s+(x*z)\r\nprint(s)\r\n", "n = int(input())\r\nout = 0\r\nmeat = []\r\ncost = []\r\nfor i in range(n): \r\n vals = [int(i) for i in input().split()]\r\n meat.append(vals[0])\r\n cost.append(vals[1])\r\ncomp = 100\r\nfor i in range(n):\r\n if cost[i] < comp:\r\n out += cost[i]*meat[i]\r\n comp = cost[i]\r\n else:\r\n out += comp*meat[i]\r\nprint(out)", "n = int(input())\r\namount = 0\r\n\r\nprices = []\r\ndays = []\r\nfor i in range(n):\r\n a, b = input().split()\r\n prices.append(int(b))\r\n days.append(int(a))\r\n\r\nwhile True:\r\n if len(prices) == 0:\r\n break\r\n start = prices.index(min(prices))\r\n amount += prices[start] * sum(days[start:])\r\n prices = prices[: start]\r\n days = days[: start]\r\n\r\nprint(amount)", "# coding: utf-8\r\n\r\ntam = int(input())\r\n\r\nsoma = 0\r\n\r\nmeat = []\r\ncost = []\r\n\r\nfor i in range(0, tam):\r\n\tentrada = input().split(\" \")\r\n\tmeat.append(int(entrada[0]))\r\n\tcost.append(int(entrada[1]))\r\n\t\r\nsoma += meat[0] * cost[0]\r\nmenor = cost[0]\r\n\r\nfor j in range(1, tam):\r\n\tif(menor > cost[j]):\r\n\t\tmenor = cost[j]\r\n\tsoma += menor * meat[j]\r\n\t\r\nprint(soma)\r\n", "n = int(input())\n\ndados = []\n\nfor _ in range(n):\n a, b = [ int(x) for x in input().split() ]\n dados.append((a, b))\n\nresult = 0\ni = 0\nwhile i < n:\n compra = dados[i][0]\n j = i + 1\n while j < n and dados[j][1] > dados[i][1]:\n compra += dados[j][0]\n j += 1\n result += compra * dados[i][1]\n i = j\n\nprint(result)", "n=int(input())\r\na=[0]*n\r\np=[0]*n\r\nfor i in range(n):\r\n l=[int(x) for x in input().split(' ')]\r\n a[i]=l[0]\r\n p[i]=l[1]\r\ns=p[0]*a[0]\r\nmin_p=p[0]\r\nfor i in range(1, n):\r\n min_p=min(min_p, p[i])\r\n s+=min_p*a[i]\r\nprint(s)", "n = int(input())\r\ncount = 10000\r\ncount1 = 0\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n if (count > p):\r\n count = p\r\n count1 += count * a\r\n \r\nprint(count1)", "n=int(input())\r\nl2=[]\r\nfor i in range(n):\r\n l2.append([int(x) for x in input().split()])\r\na = l2[0][1]\r\nsump = 0\r\nfor i in range(n):\r\n a=min(a,l2[i][1])\r\n sump=sump+a*l2[i][0]\r\nprint(sump)", "n = int(input())\r\na = []\r\np = []\r\nfor i in range(n):\r\n x, y =map(int,input().split())\r\n a.append(x)\r\n p.append(y)\r\nmoney=0\r\nwhile len(p)>=1:\r\n pmin=p.index(min(p))\r\n money+=(sum(a[pmin:]))*(p[pmin])\r\n \"\"\"\r\n print(sum(a[pmin:]))\r\n print(p[pmin])\r\n \"\"\"\r\n p=p[:pmin]\r\n a=a[:pmin]\r\n \"\"\"print(p)\"\"\"\r\nprint(money)", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\ncost = 0\r\nprice = 100\r\n\r\nfor i in range(n):\r\n\tHomura = [int(i) for i in input().split()]\r\n\tprice = min(price, Homura[1])\r\n\tcost += Homura[0] * price\r\n\r\nprint(cost)\r\n", "# Duff and Meat\ndef meat(a, p):\n ans = 0\n price = float('inf')\n for i in range(len(a)):\n price = min(price, p[i])\n ans += price * a[i]\n return ans\n \n\n\nn = int(input())\na = []\np = []\nfor i in range(n):\n x = list(map(int, input().rstrip().split()))\n a.append(x[0])\n p.append(x[1])\nprint(meat(a, p))\n# 5643", "n = int(input())\r\nmoney = 0\r\nprice = 101\r\nwhile(n):\r\n a,p = map(int,input().split())\r\n if(price>p):\r\n price = p\r\n money+=price*a\r\n n-=1\r\nprint(money)", "n=int(input())\r\na=[]\r\np=[]\r\nfor i in range(n):\r\n m,pm=map(int,input().split())\r\n a.append(m)\r\n p.append(pm)\r\nmin_=p[0]\r\ncost=0\r\nsa=0\r\nfor i in range(n):\r\n if p[i]>=min_:\r\n sa+=a[i]\r\n else:\r\n cost=cost+(sa*min_)\r\n min_=p[i]\r\n sa=a[i]\r\n #print('sa:',sa)\r\ncost+=(sa*min_)\r\nprint(cost)", "c,f=0,float('inf')\r\nfor i in range(int(input())):\r\n\tn,m = map(int,input().split())\r\n\tf = min(f,m)\r\n\tc+=f*n\r\nprint(c)", "n=int(input())\r\nmin_p=101\r\nprice=0\r\nwhile(n):\r\n n-=1\r\n a,p=map(int,input().split())\r\n min_p=min(min_p,p)\r\n price+=min_p*a\r\nprint(price)\r\n \r\n", "def totalCost(meat, price):\r\n minCost = None\r\n total = 0\r\n for i in range(len(meat)):\r\n if minCost is None or price[i] <= minCost:\r\n total += meat[i] * price[i]\r\n minCost = price[i]\r\n elif price[i] > minCost:\r\n total += meat[i] * minCost\r\n return total\r\n\r\nmeat = list()\r\nprice = list()\r\nt = int(input())\r\nwhile t:\r\n m, p = [int(meat) for meat in input().split()]\r\n meat.append(m)\r\n price.append(p)\r\n t -= 1\r\nval = totalCost(meat, price)\r\nprint(val)\r\n \r\n \r\n", "n=int(input())\r\nkgs=[]\r\nprice=[]\r\nfor i in range(n):\r\n mn=list(map(int,input().split(\" \")))\r\n kgs.append(mn[0])\r\n price.append(mn[1])\r\n\r\nfor i in range(0,len(kgs)):\r\n temp=[]\r\n if(i==0):\r\n low=price[0]\r\n ans=kgs[0]*price[0]\r\n else:\r\n if(price[i]>low):\r\n ans+=low*kgs[i]\r\n else:\r\n ans+=kgs[i]*price[i]\r\n low=price[i]\r\n \r\nprint(ans)\r\n", "import math\r\ndef main():\r\n\t# t = int(input())\r\n\t# for _ in range(t):\r\n\tprint(case())\r\n\r\ndef case():\r\n\tn = int(input())\r\n\ts = 0\r\n\tminP = 101\r\n\tfor _ in range(n):\r\n\t\ta, p = map(int, input().split())\r\n\t\tif p < minP:\r\n\t\t\tminP = p\r\n\t\t\ts += a * minP\r\n\t\telse:\r\n\t\t\ts += a * minP\r\n\r\n\treturn s\r\n\r\n\r\nmain()", "n = int(input())\r\nneeded = []\r\nprice = []\r\nfor i in range(n):\r\n need,price_ = map(int,input().split())\r\n needed.append(need)\r\n price.append(price_)\r\n\r\ntotal = 0\r\nmin_price = 100\r\nfor i in range(n):\r\n if (price[i] < min_price):\r\n min_price = price[i]\r\n total+= needed[i]*min_price\r\nprint(total)\r\n", "N = int(input())\nminv = 1e20\nans = 0\nfor i in range(N):\n a, p = map(int, input().split())\n minv = min(minv, p)\n ans += a * minv\nprint(ans)\n", "n = int(input())\r\n\r\nc, d = 0, 101\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n if b < d:\r\n d = b\r\n c += a*d\r\nprint(c)", "n= int(input())\nminc = 101\ns=0\nfor i in range(n):\n a, p=map(int,input().split())\n if minc>p: minc=p \n s += a*minc\nprint(s)", "n=int(input())\r\ntm=0\r\nfor i in range(n):\r\n\ta,p=map(int,input().split())\r\n\tif i==0:\r\n\t\tmi=p\r\n\telse:\r\n\t\tmi=min(mi,p)\r\n\ttm=tm+a*mi\r\nprint(tm)", "from math import inf\r\n\r\nt = int(input())\r\n\r\na, p = [], []\r\nfor _ in range(t):\r\n \r\n an, pn = list(map(int, input().split()))\r\n a.append(an)\r\n p.append(pn)\r\n \r\ncur_min = inf\r\ntotal = 0\r\nfor i in range(len(a)):\r\n cur_min = min(cur_min, p[i])\r\n total += cur_min * a[i]\r\n \r\nprint(total)", "n = int(input())\r\nQ=[]\r\nP=[]\r\nfor i in range(n):\r\n ll=list(map(int,input().split()))\r\n Q.append(ll[0])\r\n P.append(ll[1])\r\n\r\n\r\ndef function(Q,P):\r\n if P==[] and Q==[] :\r\n return 0\r\n else :\r\n min = P[0]\r\n sum = 0\r\n for i in range(len(P)):\r\n if P[i]<min :\r\n min=P[i]\r\n for i in range(P.index(min),len(P)):\r\n sum += Q[i]\r\n return min*sum + function(Q[:P.index(min)],P[:P.index(min)])\r\n\r\nprint(function(Q,P))", "n = int(input())\r\nminimo = 101\r\nsoma = 0\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n if minimo > p:\r\n minimo =p\r\n soma += minimo*a\r\nprint(soma)", "n=int(input())\nl=[]\nfor x in range(n):\n l.append(input().split())\nm=int(l[0][1])\nsum=int(l[0][0])*int(l[0][1])\nfor x in range(1,n):\n if int(l[x][1])<m:\n m=int(l[x][1])\n sum+=m*int(l[x][0])\nprint(sum)\n ", "def get_user_input_days():\r\n\treturn int(input())\r\n\r\ndef get_user_input_price():\r\n\tline_split = input().split()\r\n\tkg = int(line_split[0])\r\n\tprice = int(line_split[1])\r\n\treturn kg, price\r\n\r\ndef get_minimum_price():\r\n\tdays = get_user_input_days()\r\n\tlowest_price = 100\r\n\ttotal = 0\r\n\r\n\tfor i in range(days):\r\n\t\tkg, price = get_user_input_price()\r\n\r\n\t\tif price < lowest_price:\r\n\t\t\tlowest_price = price\r\n\t\t\r\n\t\ttotal += lowest_price * kg\r\n\t\r\n\treturn total\r\n\r\n\r\nprint(get_minimum_price())", "n= int(input())\r\nmeat= 0\r\nduff= 100\r\n\r\nfor _ in range(n):\r\n a, p= map(int, input().split())\r\n duff= min(duff, p)\r\n meat += duff*a\r\n\r\nprint(meat)", "n = int(input())\ntemp = 100000\nmoney=0\nfor i in range(n):\n day,coast = input().split(\" \")\n if int(coast)<int(temp):\n temp=int(coast)\n money = int(money) + (int(day)*int(temp))\n else:\n money+=int(day)*int(temp)\nprint(money)\n ", "from collections import *\nimport sys\nimport math\nfrom functools import reduce\n\ndef factors(n): \n return set(reduce(list.__add__,([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\n\n\ndef li():return [int(i) for i in input().rstrip('\\n').split(' ')]\ndef st():return input().rstrip('\\n')\ndef val():return int(input())\ndef stli():return [int(i) for i in input().rstrip('\\n')]\n\n\ntot = 0\nl = []\nfor _ in range(val()):\n l.append(li())\nmi = min(i[1] for i in l)\ni = 0\nwhile i<len(l):\n j = i\n while j<len(l) and l[j][1]>=l[i][1]:\n tot += l[i][1]*l[j][0]\n j+=1\n i = j - 1\n i+=1\nprint(tot)", "min_=1000\r\nc=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if b<min_:\r\n min_=b\r\n c+=(a*min_)\r\nprint(c)", "z = 101\r\ns = 0\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if y<z:\r\n s += x*y\r\n z = y\r\n else:\r\n s += x*z\r\nprint(s)\r\n", "c=0\r\np=0\r\nfor i in range(int(input())):\r\n n,m=map(int,input().split())\r\n if c==0:\r\n c=m\r\n if m<c:\r\n c=m\r\n p+=n*c\r\nprint(p)\r\n\r\n\r\n", "n = int(input())\r\ncounter = 100\r\nspendings = 0\r\nfor i in range(n):\r\n a, p = list(map(int, input().split()))\r\n if counter > p:\r\n counter = p\r\n spendings += counter * a\r\nprint(spendings)\r\n", "n=int(input())\r\nl=[]\r\na2,b2=(int(x) for x in input().split())\r\nsum=a2*b2\r\nc=b2\r\nfor i in range(1,n):\r\n a,b=(int(x) for x in input().split())\r\n if(b<c):\r\n c=b\r\n sum+=a*c\r\n else:\r\n sum+=a*c\r\nprint(sum)\r\n \r\n \r\n \r\n \r\n", "from sys import stdin, stdout\r\n \r\ndef main():\r\n \r\n # input via readline method\r\n n = int(stdin.readline())\r\n \r\n\r\n a = []\r\n p = []\r\n arr = []\r\n for i in range(n):\r\n arr.append([int(x) for x in stdin.readline().split(\" \")])\r\n a.append(arr[0][0])\r\n p.append(arr[0][1])\r\n arr = []\r\n\r\n cost = 0\r\n min_day = p.index(min(p))\r\n a_new = a[0:min_day]\r\n p_new = p[0:min_day]\r\n cost = cost + sum(a[min_day:])*p[min_day]\r\n while min_day != 0:\r\n #print(\"#\",min_day)\r\n min_day = p_new.index(min(p_new))\r\n cost = cost + sum(a_new[min_day:])*p_new[min_day]\r\n a_new = a_new[0:min_day]\r\n p_new = p_new[0:min_day]\r\n \r\n print(cost)\r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n# call the main method\r\nif __name__ == \"__main__\":\r\n main() ", "entrada = int(input())\r\n\r\nsaida = 0\r\naux = 101\r\n\r\nfor i in range(1, entrada + 1):\r\n\r\n a, p = map(int, input().split())\r\n\r\n if (p > aux):\r\n saida += a * aux\r\n\r\n else:\r\n saida += a * p\r\n aux = p\r\n\r\nprint(saida)\r\n", "n = int(input())\r\nmoney = 0\r\nprice = 1000000\r\nwhile n:\r\n a,p = map(int,input().split())\r\n if price > p:\r\n price = p\r\n money += price * a\r\n n -= 1\r\nprint(money)\r\n", "n = int(input())\r\nmin_meat_cost = float(\"inf\")\r\nans = 0\r\nfor i in range(n):\r\n duff_meat, meat_cost = list(map(int, input().split()))\r\n min_meat_cost = min(min_meat_cost, meat_cost)\r\n ans += duff_meat * min_meat_cost\r\nprint(ans)", "n = int(input())\r\n\r\nres = 0\r\nlocalMin = float(\"inf\")\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n localMin = min(localMin, p)\r\n res += localMin * a\r\n\r\nprint(res)", "import sys\nimport math\ninput = sys.stdin.readline\n\ndef int_array():\n\treturn list(map(int, input().strip().split()))\ndef str_array():\n\treturn input().strip().split()\nprice = []\nday = []\nmini = 10e56\ncount = 0\nn = int(input());\nfor _ in range(n):\n\tdays, cost = int_array()\n\tprice.append(cost)\n\tday.append(days)\nfor i in range(n):\n\tif price[i] < mini:\n\t\tmini = price[i]\n\tcount += day[i]*mini\nprint(count)", "arr = []\r\narrN = []\r\nrs = 0\r\nn = int(input())\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n arr.append(b)\r\n arrN.append(a)\r\nrs = arr[0] * arrN[0]\r\nminA = arr[0]\r\nfor i in range(1, n):\r\n if arr[i] < minA:\r\n minA = arr[i]\r\n rs += minA * arrN[i]\r\nprint(rs)", "n=int(input())\r\na,b=[],[]\r\nfor i in range(n):\r\n p,q = map(int,input().split())\r\n a.append(p), b.append(q)\r\nsum = a[0]*b[0]\r\n\r\nfor i in range(n-1):\r\n b[i+1] = min(b[i],b[i+1])\r\n sum += a[i+1]*b[i+1]\r\nprint(sum)", "n=int(input())\r\na,p=[],[]\r\nfor i in range(n):\r\n A,P=map(int,input().split())\r\n a.append(A)\r\n p.append(P)\r\ncost,final=p[0],0\r\nfor i in range(len(p)):\r\n cost=min(p[i],cost)\r\n final+=cost*a[i]\r\nprint(final) ", "s=0\r\nc=100\r\nfor i in range(int(input())):\r\n a,b=list(map(int,input().split()))\r\n b=b if c>b else c\r\n s+=a*b\r\n c=b\r\n # print(s)\r\nprint(s)", "nb = int(input())\ntab = []\nfor i in range(nb):\n tab.append(input())\n\n\nc = 0\nprice = 101\nfor a in tab:\n a = a.split(' ')\n if int(a[1]) < price:\n price = int(a[1])\n c = c + int(a[0]) * price\nprint (c)", "n=int(input())\r\n\r\nmeat=[];price=[]\r\nfor i in range(n):\r\n\ta, b=map(int, input().split())\r\n\tmeat+=[a]\r\n\tprice+=[b]\r\ncost=0; k=0\r\nfor j in range(n):\r\n\tif j<n-1:\r\n\t\tif price[k]<=price[j]:\r\n\t\t\t#If price is greater the next day,he can buy the meet this day for next days as long is price is lower or equal\r\n\t\t\tcost+=price[k]*meat[j]\r\n\t\telse:\r\n\t\t\tk=j\r\n\t\t\t#Lowest price changes when lower price then before are found\r\n\t\t\tcost+=price[k]*meat[j]\r\n\telse:\t\r\n\t\t#For when in the last of the loop\r\n\t\tif price[j]>=price[k]:\r\n\t\t\t#If last price is greater or equal, there is no need to buy that day, buy it the previous days\r\n\t\t\tcost+=price[k]*meat[j]\r\n\t\telse:\r\n\t\t\t#Buy it the last day if price is lower\r\n\t\t\tcost+=price[j]*meat[j]\r\nprint(cost)", "n = int(input())\nbest = 200\nres = 0\nfor i in range(n):\n a, p = map(int, input().split())\n best = min(p, best)\n res += a*best\nprint(res)", "n = int(input())\r\nresult=0\r\nmin_price=0\r\nfor _ in range(n):\r\n a,p=[int(i) for i in input().split()]\r\n if _ == 0:\r\n min_price=p\r\n if p<min_price:\r\n min_price=p\r\n result+=a*min_price\r\nprint(result)", "n=int(input())\r\nminn=99999\r\nans=0\r\nfor i in range(n):\r\n a1,p=map(int,input().split())\r\n if p<minn:\r\n minn=p\r\n ans+=(a1*minn)\r\nprint(ans)", "n = int(input())\r\nl = []\r\nlesspi =float(\"inf\")\r\nprice = 0\r\nfor i in range(n):\r\n\tai,pi = map(int,input().split())\r\n\tif lesspi > pi:\r\n\t\tlesspi = pi\r\n\tprice = price + ai*lesspi\r\nprint(price)", "n=int(input())\r\narr=[]\r\nprice=10000000000000000\r\nans=0\r\nfor i in range(n):\r\n\ta,p=map(int,input().split())\r\n\tprice=min(price,p)\r\n\tans+=price*a\r\nprint(ans)", "n=int(input())\r\nmin_cost=0\r\nc=[int(ele) for ele in input().split(' ')]\r\nmn=c[1]\r\nmin_cost=mn*c[0]\r\nfor i in range(0,n-1):\r\n c=[int(ele) for ele in input().split(' ')]\r\n if c[1]<mn:\r\n mn=c[1]\r\n min_cost+=mn*c[0]\r\nprint(min_cost)", "x=1000\r\ns=int(input())\r\nqian=0\r\nfor i in range(s):\r\n m,n=[int(x) for x in input().split()] \r\n x=min(x,n)\r\n qian+=x*m\r\nprint(qian)\r\n", "n = int(input())\n\nmenor_preco, total = 101, 0\nfor i in range(n):\n a, p = map(int, input().split())\n if p < menor_preco:\n menor_preco = p\n total += a * menor_preco\n\nprint(total)\n", "n=int(input())\nminn=101\nans=0\nfor i in range(n):\n a,b=map(int,input().split())\n minn=min(minn,b)\n ans+=a*minn\nprint(ans)", "t = int(input())\r\nx, pre = 0, float(\"inf\")\r\nfor _ in range(t):\r\n n, m = map(int, input().split())\r\n pre = min(pre, m)\r\n x += n*pre\r\nprint(x)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a,p = map(int,input().split())\r\n if i == 0:\r\n pMin = p\r\n if p >= pMin:\r\n p = pMin\r\n else:\r\n pMin = p\r\n count += a * pMin\r\nprint(count)\r\n", "n = int(input())\r\n\r\nmeat,cost = [],[]\r\n\r\nfor _ in range(n):\r\n\ta,b = map(int,input().split(\" \"))\r\n\r\n\tmeat.append(a)\r\n\tcost.append(b)\r\n\r\n\r\ntotal = 0\r\n\r\nmini = 999\r\n\r\nfor i in range(n):\r\n\r\n\tif(cost[i]<mini):\r\n\t\tmini = cost[i]\r\n\r\n\t\ttotal += mini*meat[i]\r\n\r\n\telse:\r\n\r\n\t\ttotal += mini*meat[i]\r\n\r\n\r\n\r\n\r\nprint(total)", "money = 0\r\ncheapest = None\r\nfor _ in range(int(input())):\r\n a, p = map(int, input().split())\r\n if cheapest is None or p < cheapest:\r\n cheapest = p\r\n money += a*cheapest\r\nprint(money)", "t = int(input())\r\nkg = []\r\nprice = []\r\nfor i in range(t):\r\n a,b = [int(x) for x in input().split()]\r\n kg.append(a)\r\n price.append(b)\r\n\r\ntotal = price[0]*kg[0]\r\ncprice = price[0]\r\nfor j in range(1,t):\r\n if price[j]<cprice:\r\n cprice = price[j]\r\n total += cprice * kg[j]\r\nprint(total)\r\n", "sum=0 \r\nn=int(input())\r\na,b=map(int,input().split())\r\nsum=a*b \r\nmini=b\r\nfor i in range(n-1):\r\n a,b=map(int,input().split())\r\n mini=min(mini,b)\r\n sum+=a*mini \r\n mini=min(mini,b)\r\nprint(sum)", "n=int(input())\r\nwt=[]\r\nprice=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n wt+=[a]\r\n price+=[b]\r\ncost=100000000\r\nans=0\r\nfor i in range(n):\r\n cost=min(cost,price[i])\r\n ans+=(cost*wt[i])\r\nprint(ans)", "n = int(input())\n\ncost = 0\nlowest_price = 101\n\nfor i in range(n):\n\ta, p = input().split()\n\ta = int(a)\n\tp = int(p)\n\n\n\tif p < lowest_price:\n\t\tlowest_price = p\n\telse:\n\t\tp = lowest_price\n\n\tcost += a * p\n\t\n\nprint(cost)\n\n\t\n\n\n\n", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n line = [int(i) for i in input().split()]\r\n a.append(line[0])\r\n b.append(line[1])\r\nmoney = 0\r\nfor i in range(n):\r\n price = min(b)\r\n x = b.index(price)\r\n money += sum(a[x:])*price\r\n b = b[0:x]\r\n a = a[0:x]\r\n if b == []:\r\n break\r\nprint(money)", "sheet = list()\r\nfor day in range(int(input())):\r\n sheet.append(list(map(int, input().split())))\r\nprice = sheet[0][1]\r\nsum = 0\r\nfor day in sheet:\r\n price = min(price, day[1])\r\n sum += day[0] * price\r\nprint(sum) \r\n", "n=int(input())\nm=100\nr=0\nwhile n:a,b=map(int,input().split());m=min(b,m);r+=a*m;n-=1\nprint(r)\n\t\t\t \t \t \t \t\t\t\t\t\t\t\t \t\t\t \t \t\t", "def main():\r\n n = int(input())\r\n prices, kilos = [], []\r\n minPr, totalPrice = float(\"inf\"), 0\r\n\r\n for _ in range(n):\r\n a, p = list(map(int, input().split()))\r\n kilos.append(a)\r\n minPr = min(minPr, p)\r\n prices.append(minPr)\r\n\r\n for i in range(n):\r\n totalPrice += kilos[i]*prices[i]\r\n \r\n print(totalPrice)\r\n\r\nmain() \r\n\r\n", "n = int(input())\r\namount = []\r\nprice = []\r\ndays = [n]\r\nborder = n\r\nmoney = 0\r\nfor i in range(n):\r\n l = tuple(map(int, input().split()))\r\n amount.append(l[0])\r\n price.append(l[1])\r\n\r\nwhile border != 0:\r\n border = price.index(min(price[:border]))\r\n days.append(border)\r\n\r\nfor beg in range(1, len(days)):\r\n money += price[days[beg]] * sum(amount[days[beg]:days[beg - 1]])\r\nprint(money)", "n = int(input())\r\ncost = 0\r\nm = float('inf')\r\nfor day in range(n):\r\n a, p = [int(x) for x in input().split(' ')]\r\n m = min(m, p)\r\n cost += a * m\r\nprint(cost)\r\n", "n = int(input())\r\n \r\ndados = []\r\n \r\nfor i in range(n):\r\n a, b = list(map(int, input().split()))\r\n dados.append((a, b))\r\n \r\nans = 0\r\ni = 0\r\nwhile i < n:\r\n compra = dados[i][0]\r\n j = i + 1\r\n while j < n and dados[j][1] > dados[i][1]:\r\n compra += dados[j][0]\r\n j += 1\r\n ans += compra * dados[i][1]\r\n i = j\r\n \r\nprint(ans)", "def duff(ls):\r\n s = 0\r\n s = s + (ls[0][0] * ls[0][1])\r\n k = ls[0][1]\r\n for i in range(1, len(ls)):\r\n if(k > ls[i][1]):\r\n k = ls[i][1]\r\n s = s + (ls[i][0] * k)\r\n return s \r\n\r\n\r\nn = int(input())\r\nls = []\r\nwhile(n > 0):\r\n ls1 = [int(i) for i in input().split()]\r\n ls.append(ls1)\r\n n = n - 1\r\nprint(duff(ls)) ", "n1= int(input())\r\ns, t= map(int, input().split(\" \"))\r\nr = s* t\r\nl= t\r\nfor k in range(n1 - 1):\r\n s, t= map(int, input().split(\" \"))\r\n if t < l:\r\n l = t\r\n r = r+l* s\r\nprint(r)", "n = int(input())\r\n \r\nmin_price = 101\r\ntotal = 0\r\n\r\nfor _ in range(n):\r\n day_amount, price = map(int, input().split())\r\n if price < min_price:\r\n min_price = price\r\n\r\n total += day_amount * min_price\r\n \r\nprint(total)\r\n", "n = int(input())\r\ntr = [0]*n \r\nst = [0]*n\r\nfor i in range(n):\r\n tr[i], st[i] = map(int, input().split())\r\nkg = 0\r\np = 0\r\ni = 0\r\nwhile i < n:\r\n y = i + 1\r\n kg = tr[i]\r\n while y < n and st[y] > st[i]:\r\n kg += tr[y]\r\n y += 1\r\n else:\r\n p += kg * st[i]\r\n i = y\r\nprint(p)\r\n ", "n = int(input())\r\npMin = 101\r\ntot = 0\r\nfor i in range(n):\r\n a,p = map(int,input().split()) \r\n if pMin > p:\r\n pMin = p\r\n tot += pMin * a\r\n \r\nprint(tot)", "#https://codeforces.com/problemset/problem/588/A\n\n\n\n\nn = int(input())\n\na, p = map(int, input().split(\" \"))\nmm = a * p # minimum money\nmp = p # minimum price\nfor i in range(n - 1):\n a, p = map(int, input().split(\" \"))\n if p < mp:\n mp = p\n mm += a * mp\n\nprint(mm)\n", "import math\r\nn = int(input())\r\nx = math.inf\r\nans = 0\r\nfor i in range(0, n):\r\n a, p = map(int, input().split())\r\n x = min(x, p)\r\n ans += x * a\r\nprint(ans)", "n=int(input())\nm=100\nt=0\nfor i in range(n):\n a,b=map(int,input().split())\n m=min(m,b)\n t=t+a*m\nprint(t)\n\t \t \t \t \t \t \t\t \t \t", "n = int(input())\r\n\r\na = [0]*n\r\np = [0]*n\r\nfor i in range(n):\r\n a[i], p[i] = map(int, input().split())\r\n\r\nprice = 999\r\nmeat = 0\r\nfor i in range(n):\r\n price = min(price, p[i])\r\n meat += price*a[i]\r\nprint(meat)\r\n", "n = int(input())\r\na1,m=[int(x) for x in input().split()]\r\ncost=a1*m\r\nfor _ in range(n-1):\r\n a,p=[int(x) for x in input().split()]\r\n m=min(m,p)\r\n cost+=a*m\r\nprint(cost)", "n=int(input())\r\na=[]\r\np=[]\r\nsum=0\r\nfor i in range(0,n):\r\n x=input()\r\n ele1,ele2=(x.split())\r\n a.append(int(ele1))\r\n p.append(int(ele2))\r\n\r\n\r\nfor i in range(0,len(p)-1):\r\n sum=sum+p[i]*a[i]\r\n if p[i+1]>p[i]:\r\n p[i+1]=p[i]\r\nsum=sum+a[len(p)-1]*p[len(p)-1]\r\n \r\nprint(sum)", "n = int(input())\r\nmin = 101\r\nres = 0\r\nfor i in range(n):\r\n a, p = map(int, input().split(' '))\r\n if p<min:\r\n min = p\r\n res += a*min\r\n\r\nprint(res)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n t=list(map(int,input().split()))\r\n l.append(t)\r\nmin=l[0][1]\r\ncnt=0\r\nfor i in range(n):\r\n if(min>l[i][1]):\r\n min=l[i][1]\r\n cnt=cnt+l[i][0]*min\r\n else:\r\n cnt=cnt+l[i][0]*min\r\nprint(cnt)", "n=int(input())\r\namts=[0]*n\r\npri=[0]*n\r\nfor i in range(n):\r\n amt, p=map(int, input().split())\r\n amts[i]=amt\r\n pri[i]=p\r\n\r\n#walk amts, buying the cheapest seen so far\r\ncheapest=pri[0]\r\nexp=0\r\nfor i in range(n):\r\n cheapest=min(cheapest, pri[i])\r\n exp+=amts[i]*cheapest\r\n #print(cheapest)\r\n\r\nprint(exp)", "\r\nmin_p = 100\r\nt = 0\r\nfor _ in range(int(input())):\r\n a, p = map(int, input().split())\r\n min_p = min(min_p, p)\r\n t += a*min_p\r\nprint(t)", "n=int(input())\r\na,p=map(int,input().split())\r\nmoney=a*p\r\nfor i in range(n-1):\r\n a,q=map(int,input().split())\r\n if q<p:\r\n p=q\r\n money += a*p\r\nprint(money)\r\n", "n = int(input())\r\na = [[int(j) for j in input().split()[:2]] for i in range(n)]\r\nsum = 0\r\nx=a[0][1]\r\np2=0\r\nsum+=a[0][0]*x\r\nfor i in range(1,n):\r\n if(a[i][1]>=x):\r\n sum += (a[i][0] * a[p2][1])\r\n else:\r\n x = a[i][1]\r\n p2=i\r\n sum += (a[i][0] * a[p2][1])\r\n\r\n\r\nprint(sum)", "n = int(input())\r\nm = [input().split() for i in range(n)]\r\nr = int(m[0][1])\r\nresult = 0\r\nfor i in m:\r\n if int(i[1]) < r:\r\n r = int(i[1])\r\n result += int(i[0]) * r\r\nprint(result)", "n = int(input())\r\nres = 0\r\nm = float(\"inf\")\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n m = min(m, p)\r\n res += m*a\r\nprint(res)\r\n", "n=int(input())\r\na=n*[0]\r\nfor i in range(n):\r\n a[i]=list(map(int,input().split()))+[1]\r\nf=0\r\nfor i in range(n):\r\n if a[i][2]:\r\n j=i+1\r\n while j<n and a[j][1]>a[i][1]:\r\n j+=1\r\n s=0\r\n for k in range(i,j):\r\n s+=a[k][0]\r\n a[k][2]=0\r\n f+=s*a[i][1]\r\nprint(f)\r\n", "t=int(input())\r\nmc=999998988\r\nprice=0\r\nfor i in range(t):\r\n n,m=map(int,input().strip().split())\r\n mc=min(mc,m)\r\n price+=mc*n\r\nprint(price)", "n = int(input())\r\nlowest = 100\r\ntotal = 0\r\nfor i in range(n):\r\n a, p = [int(x) for x in input().split()]\r\n lowest = min(lowest, p)\r\n total += lowest * a\r\nprint(total)", "n = int(input())\r\nans = 0\r\nm = 10**9\r\nfor _ in range(n):\r\n\td, c = list(map(int, input().split()))\r\n\tm = min(m, c)\r\n\tans += (d * m)\r\nprint(ans)", "MAX_DAYS = 100000\r\nMAX_PRICE = 100\r\n\r\nn_days = int(input())\r\nbest_price = MAX_DAYS * MAX_PRICE\r\nmin_cost = 0\r\n\r\nfor i in range(n_days):\r\n a, p = list(map(lambda x: int(x), input().split()))\r\n best_price = min(best_price, p)\r\n min_cost += best_price * a\r\n\r\nprint(min_cost)", "n = int(input())\r\namount = []\r\nmoney = []\r\nans = 0\r\nfor i in range(n):\r\n line = [int(x) for x in input().split()]\r\n amount.append(line[0])\r\n money.append(line[1])\r\nfor i in range(n-1):\r\n if money[i] <= money[i+1]:\r\n money[i+1] = money[i]\r\nfor i in range(n):\r\n ans += amount[i] * money[i]\r\nprint(ans)\r\n", "import sys\n\nqtyDays = int(input())\ntotal = 0\nminimumPrice = sys.maxsize\nfor i in range(qtyDays):\n\n dayStats = input().split()\n dayStats = list(map(lambda values: int(values), dayStats)) # Integer\n atualPrice = dayStats[1]\n if (atualPrice < minimumPrice):\n minimumPrice = atualPrice\n amount = dayStats[0]\n total += amount * minimumPrice\n\nprint(total)", "n = int(input())\r\nlp = 100000\r\ncost = 0\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n lp = min(lp, b)\r\n cost += a * lp\r\nprint(cost)", "count = 0\r\n\r\nfor i in range(int(input())):\r\n\r\n a, b = map(int, input().split())\r\n\r\n if (i == 0):\r\n min_cost = b\r\n\r\n if (b < min_cost):\r\n min_cost = b\r\n count += a*min_cost\r\n\r\nprint(count)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input().split())\r\n l[i][0]=int(l[i][0])\r\n l[i][1]=int(l[i][1])\r\ns=l[0][0]*l[0][1]\r\npricemin=l[0][1]\r\nfor i in range(1,n):\r\n pricemin=min(pricemin,l[i][1])\r\n s+=pricemin*l[i][0]\r\n #print(s)\r\nprint(s)", "def main():\r\n n = int(input())\r\n money = 0\r\n price = 101\r\n\r\n for _ in range(n):\r\n a, p = map(int, input().split())\r\n if price > p:\r\n price = p\r\n money += price * a\r\n\r\n print(money)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\nfrom os import path\nif (path.exists('input.txt') and path.exists('output.txt')):\n sys.stdout = open('output.txt', 'w')\n sys.stdin = open('input.txt', 'r')\n\n\ndef main():\n N = int(input())\n needs = []\n costs = []\n for ii in range(N):\n a, p = map(int, input().split())\n needs.append(a)\n costs.append(p)\n \n ans = 0\n i = 0\n while i < N:\n curr_cost = costs[i]\n ans += needs[i] * curr_cost\n # print(i)\n for j in range(i + 1, N):\n if curr_cost < costs[j]:\n ans += needs[j] * curr_cost\n i += 1\n else:\n break\n i += 1\n \n print(ans)\n\nmain()", "n = int(input())\r\nmoney = 100\r\nsum = 0\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n money = min(money, p)\r\n sum += a*money\r\nprint(sum)", "n=int(input())\r\nm=100\r\nr=0\r\nwhile n:a,b=map(int,input().split());m=min(b,m);r+=a*m;n-=1\r\nprint(r)", "import sys\ninput = sys.stdin.readline\n\nD = int(input())\nM = [list(map(int, input().split())) for _ in range(D)]\n\nr = 0\ndi = 0\nwhile di < D :\n\tr += M[di][0] * M[di][1]\n\tbd = 0\n\twhile di+bd+1 < D and M[di][1] <= M[di+bd+1][1] :\n\t\tbd += 1\n\t\tr += M[di][1] * M[di+bd][0]\n\tdi += bd\n\tdi += 1\nprint(r)", "n=int(input())\nai=[]\npi=[]\nfor i in range (n):\n\ta=list(map(int,input().split()))\n\tai.append(a[0])\n\tpi.append(a[1])\n#print(ai,pi)\n\nprice=0\nj=0\n#for j in range(n):\nwhile j < n:\n\t# price+=p[j]*a[j]\n\t# if p[j+1]>p[j]:\n\t# \tprice+=a[j+1]*p[j]\n\tfor k in range(j,n):\n\t\tif pi[k]>=pi[j]:\n\t\t\tprice+=pi[j]*ai[k]\n\t\t\tif k==n-1:\n\t\t\t\tj=n-1\n\t\t\t\tbreak\n\t\telse:\n\t\t\tbreak\n\tif j ==n-1 :\n\t\tbreak\t\t\n\tj=k\t\t\n\nprint(price)\n\n", "z=101;s=0\r\nfor _ in range(int(input())):a,b=map(int,input().split());z=min(z,b);s+=(a*z)\r\nprint(s)\r\n\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split()))[:2])\r\nmin = a[0][1]\r\ncnt = a[0][0]*min\r\nentered = False\r\ni = 1\r\nwhile i < n:\r\n if(a[i][1] > min):\r\n cnt = cnt + a[i][0]*min\r\n i += 1\r\n else:\r\n min = a[i][1]\r\n cnt = cnt + a[i][0]*a[i][1]\r\n i += 1\r\n\r\nprint(cnt)", "n=int(input())\r\na,p=map(int, input().split())\r\nc=p\r\nm=a\r\ntc=0\r\nfor i in range(n-1):\r\n a,p=map(int, input().split())\r\n if c>=p:\r\n tc+=m*c\r\n m=a\r\n c=p\r\n else:\r\n m+=a\r\ntc+=m*c\r\nprint(tc)\r\n \r\n ", "number = int(input())\r\n \r\nanswer = 0\r\nlim = 100\r\n \r\nfor i in range(0, number):\r\n amount, price = map(int, input().split())\r\n \r\n if (price > lim):\r\n answer += amount * lim\r\n else:\r\n answer += amount * price\r\n lim = price\r\n \r\nprint(answer)", "n = int(input() )\na = [list(map(int, input().split() ) ) for _ in range(n) ]\n\nr, mn, c = 0, float('inf'), 0\nfor i in range(n):\n if a[i][1] >= mn:\n c += a[i][0]\n else:\n if c:\n r += mn * c\n c = a[i][0]\n mn = a[i][1]\n\nprint(r + mn * c)\n\n", "n = int(input())\r\ndemand = []\r\nprice = []\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n demand.append(a)\r\n price.append(b)\r\nmoney = 0\r\nwhile len(price) > 1:\r\n s = min(price)\r\n d = price.index(s)\r\n if d != 0:\r\n l = demand[d:len(price)]\r\n su = sum(l)\r\n money += s * su\r\n price = price[0:d]\r\n else:\r\n l = demand[1:len(price)]\r\n su = sum(l)\r\n money += s * su\r\n break\r\nmoney += demand[0] * price[0]\r\nprint(money)", "n = int(input())\r\na = []\r\np = []\r\nfor i in range (0, n):\r\n a1, p1 = [int(x) for x in input().split()]\r\n a.append(a1)\r\n p.append(p1)\r\nminCurrent = 1000\r\ncost = 0\r\nfor i in range (0, n):\r\n if p[i] < minCurrent:\r\n minCurrent = p[i]\r\n cost += minCurrent * a[i]\r\nprint(cost)", "n = int(input())\r\n\r\nquantity = []\r\nprice = []\r\nfor i in range(n):\r\n q, p = map(int, input().split())\r\n quantity.append(q)\r\n price.append(p)\r\n\r\ns = price[0] * quantity[0]\r\nm = price[0]\r\nfor i in range(1, n):\r\n if price[i] < m:\r\n m = price[i]\r\n s += m * quantity[i]\r\n\r\nprint(s)\r\n", "t=int(input())\r\nsum=0\r\nres=[]\r\nfor i in range(t):\r\n a,p=list(map(int,input().split()))\r\n res.append([p,i,a])\r\nres1=list(res)\r\nres1.sort()\r\nresc=list(res)\r\nc=t\r\nwhile c>0:\r\n v=res1[0][1]\r\n x=resc[v::]\r\n c=c-len(x)\r\n m=res1[0][0]\r\n s=0\r\n for j in x:\r\n s=s+j[2]\r\n sum=sum+s*m\r\n resc=list(res[0:v])\r\n res1=list(resc)\r\n res1.sort()\r\nprint(sum) \r\n", "#creating three empty list\r\nprice=[]\r\namount=[]\r\nproducts=[]\r\n#declaring variables\r\noptimal_price=0\r\nminimum=120\r\n#number of elements as input\r\nn=int(input())\r\n#iterating till the range\r\nfor j in range(n):\r\n sle,ele=input().split()\r\n sle=int(sle)\r\n ele=int(ele)\r\n amount.append(sle)\r\n price.append(ele)\r\n#do a loop over price\r\nfor idx,item in enumerate(price):\r\n if(item>minimum): #making a condition\r\n price[idx]=minimum\r\n else:\r\n minimum=price[idx]\r\n#multiplication between two lists\r\nfor num1,num2 in zip(price,amount):\r\n products.append(num1*num2)\r\nfor gle in range(0,len(products)):\r\n optimal_price=optimal_price+products[gle]\r\nprint(optimal_price)", "n = int(input())\r\nbest = 101\r\nres = 0\r\nfor i in range(n):\r\n nums = list(map(int, input().split()))\r\n best = min(best, nums[1])\r\n res += nums[0] * best\r\nprint (res)\r\n", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\nn = int(input())\r\ntotal, min = 0, 0\r\nfor i in range(n):\r\n a, p = inp()\r\n if (i == 0 or p < min):\r\n min = p\r\n total+=min*a\r\nprint(total)\r\n", "import sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\n\r\ndef solve(arr):\r\n\ttemp = float(\"inf\")\r\n\ttot = 0\r\n\tfor i in arr:\r\n\t\ta,p = i[0],i[1]\r\n\t\ttemp = min(temp,p)\r\n\t\ttot += a*temp\r\n\tprint(tot)\r\n\r\n\r\narr = []\r\nfor _ in range(int(input())):\r\n\ta,p = map(int,input().split())\r\n\tarr.append([a,p])\r\nsolve(arr)\r\n", "n = int(input())\r\n\r\nminimum = 999\r\nanswer = 0\r\n\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n minimum = min(minimum, p)\r\n answer += a * minimum\r\n\r\nprint(answer)\r\n", "n_input=int(input())\nn_min=101\nresult=0\n\nfor i in range(n_input):\n a, p= map(int, input().split(\" \"))\n if (p < n_min):\n n_min = p\n result += a * n_min\n\nprint(result)\n", "n = int(input())\r\nx = 0\r\ny = 100\r\nwhile n:\r\n a,b = map(int, input().split())\r\n y = min(y,b)\r\n x += a*y\r\n n -= 1\r\nprint(x)\r\n", "k = int(input())\r\nans = 0\r\ncost = 100000\r\nfor _ in range(k):\r\n\ta,b = map(int,input().split())\r\n\tif b<cost:\r\n\t\tans+=a*b\r\n\t\tcost =b\r\n\telse:\r\n\t\tans+=a*cost\r\n\r\nprint(ans)", "num = int(input())\r\na = []\r\nb = []\r\nfor x in range(num):\r\n temp = input().split(\" \")\r\n b.append(int(temp[0]))\r\n a.append(int(temp[1]))\r\n pass\r\n\r\ncost = 0\r\nlowestday = num\r\nday = num\r\n\r\nwhile len(a[:lowestday]) > 0:\r\n c = a[:lowestday]\r\n lowestprice = min(c)\r\n lowestday = a.index(min(c))\r\n #print(\"lowestprice\", lowestprice)\r\n #print(\"lowestday\", lowestday)\r\n if a[lowestday:]:\r\n cost += sum([lowestprice * x for x in b[lowestday:day]])\r\n # print(a[lowestday:])\r\n # print(cost)\r\n pass\r\n day = lowestday\r\n # print(a[:lowestday])\r\n pass\r\n\r\nprint(cost)\r\n", "n = int(input())\r\n \r\nmoney = 0\r\naux = 100\r\n \r\nfor i in range(n):\r\n num1, num2 = map(int, input().split())\r\n \r\n if (num2 <= aux):\r\n money += num1 * num2\r\n aux = num2\r\n else:\r\n money += num1 * aux\r\n \r\nprint(money)", "n = int(input())\r\nminp = 999\r\nresult = 0\r\nfor _ in range(n):\r\n\ta, p = map(int, input().split())\r\n\tif p<minp:\r\n\t\tminp = p\r\n\tresult+=a*minp\r\nprint(result)", "c = int(input())\r\nmenor = 999\r\np = 0;\r\nfor i in range(c):\r\n a,b = map(int,input().split())\r\n if(menor>b):\r\n menor = b\r\n p += a*menor\r\nprint(p)\r\n", "t=int(input())\r\n \r\n \r\nprice=101\r\nmoney=0\r\nwhile t:\r\n arr = [int(x) for x in input().split()]\r\n if price>arr[1]:\r\n price=arr[1]\r\n money+=price*arr[0]\r\n t-=1\r\nprint(money)\r\n\r\n\r\n#a,p", "c=1000000\r\nn=int(input())\r\nv=0\r\nfor i in range (n):\r\n a,b=map(int,input().split())\r\n c=min(c,b)\r\n v=v+a*c\r\nprint(v)\r\n", "n = int(input())\r\nls=[]\r\nfor i in range(n):\r\n a,b = input().split()\r\n ls.append(int(a))\r\n ls.append(int(b))\r\ni = 1\r\nans = 0\r\nm=1000\r\nwhile i < len(ls):\r\n m = min(m,ls[i])\r\n ans = ans + (m*ls[i-1])\r\n i=i+2\r\nprint(ans)", "n = int(input())\r\nmini = 1000000000000\r\nsum = 0\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n mini = min(mini,p)\r\n sum += a*mini \r\nprint(sum)", "num_days = int(input())\r\n\r\ntotal_cost = 0\r\nlowest_so_far = float(\"inf\")\r\nfor _ in range(num_days):\r\n # buy the meat with the lowest cost so far\r\n amount, cost = [int(a) for a in input().strip().split()]\r\n if cost < lowest_so_far:\r\n lowest_so_far = cost\r\n total_cost += amount * lowest_so_far\r\n\r\nprint(total_cost)\r\n", "n = int(input())\r\nweight=[]\r\nprice=[]\r\nresult=0\r\n\r\nfor _ in range(1,n+1):\r\n [a,p]=[int(i) for i in input().split()]\r\n weight.append(a)\r\n price.append(p)\r\nmin_price=price[0]\r\nfor _ in range(n):\r\n if price[_]<min_price:\r\n min_price=price[_]\r\n result+=weight[_]*min_price\r\nprint(result)", "n=input()\r\nt=999\r\nsum=0\r\nfor i in range(int(n)):\r\n a,b=map(int,input().split())\r\n t=min(t,b)\r\n sum=sum+a*t\r\n #print(sum,t)\r\nprint(sum) ", "n = int(input())\r\nans = 0\r\nmn = 101\r\nfor i in range(n):\r\n\ta, b = map(int,input().split())\r\n\tmn = min(mn, b)\r\n\tans += a * mn\r\nprint (ans)\r\n", "n=int(input())\r\nprice=101\r\nans=0\r\nwhile(n>0):\r\n n-=1\r\n a,p=map(int,input().split())\r\n if(price>p):\r\n price=p\r\n ans+=price*a\r\nprint(ans)\r\n \r\n", "n = int(input())\r\nans = 0\r\nmn = 101\r\n\r\nfor _ in range(n):\r\n d, m = map(int, input().split())\r\n mn = min(m, mn)\r\n ans += d*mn\r\n\r\nprint(ans)", "n = int(input())\r\nres = 0\r\nprice = 200\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n price = min(price, p)\r\n res += a * price\r\n\r\nprint(res)\r\n", "# Duff and Meat\r\nn_dias = int(input())\r\n\r\nkilo_por_dia = []\r\npreco_por_dia = []\r\nfor i in range(n_dias):\r\n\tkilos_preco = input()\r\n\ttemp_array = kilos_preco.split(\" \")\r\n\tkilo_por_dia.append(int(temp_array[0]))\r\n\tpreco_por_dia.append(int(temp_array[1]))\r\n\r\npreco_total = 0\r\nmenor_valor = preco_por_dia[0]\r\n\r\nfor i in range(len(preco_por_dia)):\r\n\tif(menor_valor > preco_por_dia[i]):\r\n\t\tmenor_valor = preco_por_dia[i]\r\n\r\n\tpreco_total += (kilo_por_dia[i] * menor_valor)\r\n\r\n\r\nprint(preco_total)", "x=999\r\ns=0\r\nfor i in range (int(input())):\r\n a,p = map(int,input().split())\r\n x = min(x,p)\r\n s += a*x\r\nprint(s)", "N = int(input())\r\nA=[]\r\nP=[]\r\nfor i in range(N):\r\n a,p=map(int,input().split())\r\n A.append(a)\r\n P.append(p)\r\np=101\r\na=0\r\nfor i in range(N):\r\n if(p>P[i]): p=P[i]\r\n a+=p*A[i]\r\nprint(a)", "n=int(input())\r\n\r\nsmallest=99999999999999\r\ntotal=0\r\nfor _ in range(n):\r\n amount,price=(int(i) for i in input().split())\r\n if(smallest>price):\r\n smallest=price\r\n \r\n total+=smallest*amount\r\n\r\nprint(total)\r\n", "cost = 0\ncurrMin = 10000000\nfor _ in range(int(input().strip())):\n\ta, p = map(int, input().strip().split())\n\tcurrMin = min(p, currMin)\n\tcost += a*currMin\nprint(cost)", "n = int(input())\r\n\r\nminCost = -1\r\nresult = 0\r\nfor i in range(n):\r\n (eat, cost) = map(int, input().split(' '))\r\n if minCost > cost or minCost == -1:\r\n minCost = cost\r\n result += minCost * eat\r\n \r\nprint(result)", "n=int(input())\r\nans = 0\r\nfor i in range(n):\r\n\ta, p = map(int,input().split())\r\n\tif i == 0:\r\n\t min = p\r\n\telif p<min:\r\n\t min = p\r\n\tans+=a*min\r\nprint(ans)", "n = int(input())\r\namount = []\r\nmoney = []\r\nfor i in range(n):\r\n a, b = map(int,input().split())\r\n amount.append(a)\r\n money.append(b)\r\ncost = amount[0]*money[0]\r\nsmall = money[0]\r\nfor i in range(1,n):\r\n if money[i] >= small:\r\n cost += small*amount[i]\r\n else:\r\n small = money[i]\r\n cost += small*amount[i]\r\nprint(cost)", "p = 100\r\nt = 0\r\nfor _ in range(int(input())):\r\n ai,pi = map(int, input().split())\r\n p = min(p,pi)\r\n t += ai*p\r\nprint(t)", "t=int(input())\r\np=101\r\nsum=0\r\nfor i in range(1,t+1,1):\r\n a,b=map(int,input().split())\r\n if(p>b):\r\n p=b\r\n sum+=(p*a)\r\nprint(sum)\r\n\r\n", "n=int(input())\r\nprice=101\r\nsum=0\r\nfor i in range(n):\r\n a,p=map(int,input().split())\r\n if p<price:\r\n price=p\r\n sum+=a*price\r\nprint(sum)\r\n", "n = int(input())\r\np = 100\r\nans = 0\r\nwhile n:\r\n a, b = map(int, input().split())\r\n p = min(p, b)\r\n ans += a * p\r\n n -= 1\r\nprint(ans)\r\n", "def main():\n n = int(input())\n a = [0 for _ in range(n)]\n p = [0 for _ in range(n)]\n\n for i in range(n):\n [ai, pi] = [int(_) for _ in input().split()]\n a[i] = ai\n p[i] = pi\n\n sum_money = 0\n bought = [False for _ in range(n)]\n\n for i in range(n):\n if not bought[i]:\n try:\n j = next(index for index in range(i + 1, n) if p[index] < p[i])\n except StopIteration:\n j = n\n\n for k in range(i, j):\n sum_money += p[i] * a[k]\n bought[k] = True\n\n print(sum_money)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nmin_price = float('inf')\nres = 0\n\nfor i in range(n):\n a, p = [int(x) for x in input().split()]\n min_price = min(min_price, p)\n res += a * min_price\nprint(res)\n", "n = int(input())\r\np = []\r\na = []\r\nans = 0\r\nfor j in range(n):\r\n c, b = map(int, input().split())\r\n p.append(b)\r\n a.append(c)\r\nprice = 1000000000\r\nfor i in range(n):\r\n price = min(price, p[i])\r\n ans += a[i] * price\r\nprint(ans)\r\n", "n=int(input())\r\na = list(map(int,input().split()))\r\nl,m=a[1]*a[0],a[1]\r\nfor _ in range(n-1):\r\n a = list(map(int,input().split()))\r\n if a[1]<m:\r\n m=a[1]\r\n l+=a[0]*m\r\n else:\r\n l+=a[0]*m\r\nprint(l)", "t=int(input())\r\nmeat=[]\r\nmoney=[]\r\nwhile t>0:\r\n num=[int(i) for i in input().split()]\r\n a=num[0]\r\n b=num[1]\r\n meat.append(a)\r\n money.append(b)\r\n t=t-1\r\ntot=0\r\nmin=money[0]\r\nfor i in range(len(meat)):\r\n if money[i]<min:\r\n min=money[i]\r\n tot=tot+min*meat[i]\r\nprint(tot)\r\n", "n = int(input())\r\nmin = 1000\r\nres = 0\r\n\r\nfor i in range(n):\r\n\ta, p = map(int, input().split())\r\n\tif p < min: min = p\r\n\tres += a * min\r\n\r\nprint(res)\r\n\r\n", "'''\r\n-------------------------------------------------------\r\n\t\tCompetitive programing\r\n\t\t Đào Xuân Hoàng Tuấn\r\nNothing is impossible, as you as you believe you can do it\r\n\t\t You can do it!!!\r\n-------------------------------------------------------\r\n'''\r\n# import random\r\n# for i in range(6):\r\n# \tprint(random.randint(1, 10))\r\nn = int(input())\r\na = []\r\np = []\r\nfor i in range(n):\r\n\tx, y = map(int, input().split())\r\n\ta.append(x)\r\n\tp.append(y)\r\np_min = 1000\r\nans = 0\r\nfor i in range(n):\r\n\tif p[i] < p_min:\r\n\t\tp_min = p[i]\r\n\tans += a[i] * p_min\r\nprint(ans)\r\n", "n = int(input())\r\ns = 0\r\nmc = float(\"inf\")\r\nfor _ in range(n):\r\n a, p = [int(x) for x in input().split()]\r\n mc = min(p, mc)\r\n s += mc*a\r\nprint(s)\r\n \r\n", "t = int(input())\r\nA = []\r\nP = []\r\nfor i in range(t):\r\n a, p = map(int, input().split())\r\n A.append(a)\r\n P.append(p)\r\n m = P[0]\r\nc = A[0] * P[0]\r\nA.pop(0)\r\nfor i in range(1, len(P)):\r\n if m < P[i]:\r\n c += +A[0] * m\r\n A.pop(0)\r\n else:\r\n c += (A[0]) * P[i]\r\n A.pop(0)\r\n m = P[i]\r\nprint(c)\r\n", "n = int(input())\r\nres = 0\r\nmin_price,i = 100,0\r\nfor i in range(n):\r\n\tw,p = map(int, input().split())\r\n\tif min_price > p:\r\n\t\tmin_price = p\r\n\tres += min_price*w\r\n\r\nprint(res)", "n = int(input())\r\nk = [0] * 2 * n\r\nj = 0\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n k[j], k[j + 1] = a, p\r\n j += 2\r\nz = 0\r\ns = k[1]\r\nfor i in range(0, len(k), 2):\r\n s = min(k[i + 1], s)\r\n if s < k[i + 1]:\r\n z += k[i] * s\r\n else:\r\n z += k[i] * k[i + 1]\r\nprint(z)", "n,b,c=int(input()),0,1e30\r\nfor i in range(n):\r\n\ta,p=(int(x) for x in input().split())\r\n\tc=min(c,p)\r\n\tb+=a*c\r\nprint(b)", "ans = 0\r\nprice = float('inf')\r\nfor i in range(int(input())):\r\n a,b = list(map(int,input().split()))\r\n price = min(price,b)\r\n ans += price * a\r\nprint(ans)", "class pairs:\r\n\tdef __init__(self,fir,sec):\r\n\t\tself.first=fir\r\n\t\tself.second=sec\r\nl=[]\r\nfor i in range(int(input())):\r\n\tfir,sec=map(int,input().split())\r\n\titem=pairs(fir,sec)\r\n\tl.append(item)\r\nmi=l[0].second\r\ntot=0\r\nfor e in l:\r\n\tif e.second<=mi:\r\n\t\tmi=e.second\r\n\ttot+=mi*e.first\r\nprint(tot)", "n, res, mi = int(input()), 0, 1000000000\r\nfor x in range(n): \r\n a, p = map(int, input().split())\r\n res, mi = res + min(p, mi) * a, min(p, mi)\r\nprint(res)", "n=int(input())\r\nmenor=101\r\ns=0\r\nfor k in range(n):\r\n a,b=map(int,input().split(\" \"))\r\n if(b<menor):\r\n menor=b\r\n s+=a*menor\r\nprint(s)", "n = int(input())\r\nneed = []\r\nprice = []\r\nsum = 0\r\nfor i in range(n):\r\n p,q = map(int,input().split())\r\n need.append(p)\r\n price.append(q)\r\na = price[0]\r\nfor i in range(len(price)):\r\n if price[i] < a:\r\n a = price[i]\r\n sum += a * need[i]\r\n\r\nprint(sum)", "n = int(input())\r\nmi=100000000000000\r\nans=0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if b<mi:\r\n ans+=(a*b)\r\n mi=b\r\n else:\r\n ans+=(a*mi)\r\nprint(ans) \r\n\r\n", "\r\nn = int(input())\r\n\r\nspent = 0\r\nbest_price = 101\r\n\r\nfor i in range(n):\r\n needed, price = map(int, input().split())\r\n best_price = min(best_price, price)\r\n spent += needed * best_price\r\n\r\nprint(spent)\r\n", "def water(l, a):\r\n ans=0\r\n mn=10**9\r\n ln=len(l)\r\n for i in range(ln):\r\n c,d=l[i],a[i]\r\n if min(c,d)<0:\r\n return -1\r\n mn=min(mn,d)\r\n ans+=c*mn\r\n return ans\r\n\r\nn=int(input())\r\nl,a=[],[]\r\nfor i in range(n):\r\n c,d=map(int,input().split())\r\n l.append(c)\r\n a.append(d)\r\nprint(water(l,a))\r\n", "# my name is Abduaziz\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nans = 0\r\nm = 10000000000000000000000000000000000000000000000000000000000\r\nfor i in range(n):\r\n a, p = map(int, input().split())\r\n m = min(m, p)\r\n ans += m * a\r\nprint(ans)\r\n", "def mincost(T,A,B):\r\n min = 101\r\n count = 0\r\n for i in range(T):\r\n if B[i]<min:\r\n min = B[i]\r\n count+=A[i]*min\r\n return count\r\n\r\nN = int(input())\r\nP = []\r\nQ = []\r\nfor i in range(N):\r\n A,B = map(int,input().split())\r\n P.append(A)\r\n Q.append(B)\r\nprint(mincost(N,P,Q))\r\n", "N = int(input())\r\nLowest = 100000\r\nSUM = 0\r\nfor i in range(N):\r\n X = list(map(int, input().split()))\r\n Lowest = min(Lowest, X[1])\r\n SUM += X[0] * Lowest\r\nprint(SUM)\r\n", "n = int(input())\nA = []\nfor i in range(n):\n x, y = map(int, input().split())\n A.append((y, x))\n\nans = i = j = 0\nwhile i < n:\n s = 0\n j = i\n while j < n and A[i][0] <= A[j][0]:\n s+=A[j][1]\n j+=1\n\n ans += s*A[i][0]\n i = j\n\nprint(ans)\n\n", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n m = None\r\n c = 0\r\n for s in inp[1:]:\r\n a, p = map(int, s.split())\r\n if m == None or m > p: m = p\r\n c += a*m\r\n return c\r\n \r\nprint(main())", "import math\r\n\r\n\r\ndef main_function():\r\n input_data = [[int(i) for i in input().split(\" \")] for j in range(int(input()))]\r\n total = 0\r\n current_lowest_price = 1000000000000000000000000000000000000000000\r\n for i in input_data:\r\n needed_meat, price = i\r\n if price < current_lowest_price:\r\n current_lowest_price = price\r\n total += current_lowest_price * needed_meat\r\n return total\r\n\r\nprint(main_function())", "noOfDays=int(input())\nmeat=[]\ncost=[]\ntcost=0\na=101\nfor i in range(noOfDays):\n var=input().split()\n meat.append(int(var[0]))\n cost.append(int(var[1]))\n if cost[i]<a:\n a=cost[i]\n tcost+=meat[i]*a\nprint(tcost)\n \n", "n = int(input())\r\nlow = 101\r\nans = 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n a, b = int(a), int(b)\r\n if b < low:\r\n low = b\r\n ans += a * low\r\nprint(ans)", "d=int(input())\r\nc=[[int(i) for i in input().split()]for i in range(d)]\r\nm=[y[1] for y in c ]\r\ndd=1\r\nmmin=100\r\nx=0\r\nwhile dd<=d:\r\n mmin=min(mmin,m[dd-1])\r\n x+=mmin*c[dd-1][0]\r\n dd+=1\r\nprint(x)\r\n \r\n\r\n \r\n", "min=101\r\nans=0\r\nn=int(input())\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if y<min:\r\n min=y\r\n ans+=x*min\r\nprint(ans)", "n = int(input())\r\na = [] ; arr = []\r\nfor i in range(n):\r\n\tt1, t2 = map(int, input().split())\r\n\ta.append(t1)\r\n\ta.append(t2)\r\n\tarr.append(a)\r\n\ta = []\r\nminAmount = arr[0][1]\r\nAmount = 0\r\nfor i in range(len(arr)):\r\n\tif arr[i][1] <= minAmount:\r\n\t\tminAmount = arr[i][1]\r\n\t\tAmount += arr[i][0] * arr[i][1]\r\n\telse:\r\n\t\tAmount += arr[i][0] * minAmount\r\nprint(Amount)", "n = int(input())\r\nmoney = 0\r\ncheapest = None\r\nfor i in range(n):\r\n a, p = map(int,input().split())\r\n if cheapest is None or p < cheapest:\r\n cheapest = p\r\n money += a*cheapest\r\nprint(money)\r\n", "days = int(input())\r\nl1 = []\r\nl2 = []\r\nsum_cost = 0\r\nfor i in range(days):\r\n a, p = list(map(int, input().split(\" \")))\r\n l1.append(a)\r\n l2.append(p)\r\nl1.append(0)\r\nl2.append(0)\r\nfor i in range(days):\r\n if l2[i] >= l2[i+1]:\r\n sum_cost += l1[i] * l2[i]\r\n else:\r\n l2[i+1] = l2[i]\r\n sum_cost += l1[i] * l2[i]\r\nprint(sum_cost)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[1]:\n\n\nn=int(input())\na=[]\np=[]\nfor i in range(n):\n num=list(map(int, input().split()))\n a.append(num[0])\n p.append(num[1])\nsum=a[0]*p[0]\nmin=p[0]\nfor i in range(1,n):\n if p[i]<min:\n min=p[i]\n sum=sum+a[i]*p[i]\n else:\n sum=sum+a[i]*min\n \nprint(sum) \n\n", "n=int(input())\r\nc=0\r\na,b=map(int,input().split())\r\nc+=a*b\r\nminn=b\r\nfor i in range(0,n-1):\r\n a,b=map(int,input().split())\r\n if b<minn:\r\n minn=b\r\n c+=a*minn\r\nprint(c)", "n=int(input())\r\na=[0]\r\np=[0]\r\nfor i in range(n):\r\n f=[int(n) for n in input().split(\" \")]\r\n a.append(f[0])\r\n p.append(f[1])\r\nans = 0\r\nprice = 99999999\r\ni=1\r\na=a[1:]\r\np=p[1:]\r\nfor i in range(n):\r\n\r\n\r\n price = min(price, p[i])\r\n ans=ans+(price*a[i])\r\nprint(ans)\r\n", "n=int(input())\r\nc=[]\r\nd=[]\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tc.append(a)\r\n\td.append(b)\r\n\r\nt=sum(c)\r\nm=d[0]\r\np=d[0]*t\r\nfor i in range(1,n):\r\n\tt=t-c[i-1]\r\n\tif d[i]<m:\r\n\t\tp=p-(t*m)+(d[i]*t)\r\n\t\tm=d[i]\r\nprint(p)", "import sys\r\nn = int(input())\r\nap = list(int(s) for i in range(n) for s in sys.stdin.readline().split())\r\na = ap[::2]\r\np = ap[1::2]\r\nr = len(a)\r\ns = 0\r\nwhile r > 0:\r\n i = p.index(min(p[:r]))\r\n price = p[i]\r\n s += sum(a[i:r]) * price\r\n r = i\r\nprint(s)\r\n", "def min_money_spent(n, days):\r\n min_cost = days[0][1] # Initialize minimum cost with the first day's cost\r\n total_cost = 0\r\n\r\n for i in range(n):\r\n amount_needed, cost = days[i]\r\n\r\n if cost < min_cost:\r\n min_cost = cost\r\n\r\n total_cost += amount_needed * min_cost\r\n\r\n return total_cost\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n days = []\r\n for _ in range(n):\r\n a, p = map(int, input().split())\r\n days.append((a, p))\r\n\r\n result = min_money_spent(n, days)\r\n print(result)\r\n", "a=int(input())\nb=[input() for i in range(a)]\ncosts=[]\nreq=[]\nfor i in b:\n\tcosts.append(int(i.split()[1]))\n\treq.append(int(i.split()[0]))\nmin_cost=costs[0]\ntotal=0\ni=0\nwhile i<a:\n\tif min_cost<=costs[i]:\n\t\ttotal+=min_cost*req[i]\n\t\ti+=1\n\telse:\n\t\tmin_cost=costs[i]\nelse:\n\tprint(total)\n", "n = int(input())\r\nc = 0\r\np = 100\r\n\r\nfor i in range (n):\r\n m,t = map(int,input().split())\r\n p = min(t,p)\r\n c += m*p\r\n\r\nprint(c)", "n = int(input())\r\ncost = float('inf')\r\not = 0\r\nfor _ in range(n):\r\n a, p = map(int,input().split())\r\n cost = p if p < cost else cost\r\n ot += a * cost\r\nprint(ot)\r\n\r\n", "from functools import reduce\r\nimport sys, os\r\nimport math\r\nfrom collections import Counter\r\n\r\nTC = False\r\n\r\nclass Meat():\r\n def __init__(self) -> None:\r\n self.day = 0\r\n self.price = 0\r\n\r\n\r\ndef solve():\r\n N = int(input())\r\n meats = [Meat() for _ in range(N)]\r\n for i in range(N):\r\n meats[i].day, meats[i].price = map(int, input().split())\r\n \r\n price = meats[0].day*meats[0].price\r\n x = meats[0].price\r\n\r\n for i in range(1, N):\r\n if meats[i].price < x:\r\n price += meats[i].day*meats[i].price\r\n x = meats[i].price\r\n else:\r\n price += meats[i].day*x\r\n \r\n print(price)\r\n \r\n\r\nif os.path.exists('input.txt'):\r\n debug = True\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n #sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nif TC:\r\n for _ in range(int(input())):\r\n solve()\r\nelse:\r\n solve()", "a=[];ans=0\r\nfor i in range(int(input())):\r\n\tx,y=map(int,input().split())\r\n\tif i==0 or y<p:p=y\r\n\tans=ans+p*x\r\nprint(ans)", "\"\"\"Solution & helper classes\"\"\"\r\nclass Solution:\r\n \"\"\"__init__ & solve_and_print methods\"\"\"\r\n def __init__(self):\r\n self.__n = int(input())\r\n self.__a, self.__p = [], []\r\n for _ in range(self.__n):\r\n _a, _p = [int(x) for x in input().split()]\r\n self.__a.append(_a)\r\n self.__p.append(_p)\r\n\r\n def solve_and_print(self):\r\n \"\"\"Solves the problem & prints the output\"\"\"\r\n min_price = float('inf')\r\n min_money = 0\r\n for _a, _p in zip(self.__a, self.__p):\r\n min_price = min(min_price, _p)\r\n min_money += (min_price* _a)\r\n print(min_money)\r\n\r\nif __name__ == \"__main__\":\r\n Solution().solve_and_print()\r\n", "c = 0\r\npr = 100\r\nfor i in range(int(input())):\r\n a,p = map(int,input().split())\r\n if pr >= p:\r\n pr = p\r\n c += pr*a\r\nprint(c)", "\r\nn = int(input())\r\na = []\r\nb = []\r\nfor _ in range(n):\r\n m, n = map(int, input().split())\r\n a.append(m)\r\n b.append(n)\r\n kq = 0\r\n mn = 99999\r\nfor i in range(len(a)):\r\n mn = min(mn, b[i])\r\n kq += mn*a[i]\r\nprint(kq)\r\n\r\n\r\n", "n=int(input())\r\na=[];b=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append(x)\r\n b.append(y)\r\ni=0;s=0\r\nwhile i<n:\r\n p=b[i]\r\n s+=p*a[i]\r\n while i<n-1 and b[i+1]>p:\r\n s+=p*(a[i+1])\r\n i+=1\r\n if i<n-1 and b[i+1]<=b[i]:\r\n i+=1\r\n else:\r\n i+=1\r\nprint(s)", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input().rstrip())\r\na,p = [],[]\r\nfor _ in range(n):\r\n A,P = map(int, input().rstrip().split())\r\n a.append(A)\r\n p.append(P)\r\n\r\nresult = 0\r\nmini = p[0]\r\nfor i in range(n):\r\n if p[i]<mini:\r\n mini = p[i]\r\n result += mini*a[i]\r\nprint(result)", "n = int(input())\r\na, p = map(int, input().split())\r\nx = p\r\npas = x*a\r\nfor i in range(1, n):\r\n a, p = map(int, input().split())\r\n if p < x:\r\n x = p\r\n pas += x*a\r\nprint(pas)\r\n", "n = int(input()); p = 10000; c = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n p = min(p, b)\r\n c += a * p\r\nprint(c)", "days = int(input())\n\nneeded, prices = [], []\n\nfor _ in range(days):\n need, prix = [int(x) for x in input().split()]\n needed.append(need)\n prices.append(prix)\n\ntotal = needed[0] * prices[0]\n\nindice_old = 0\nindice = 1\n\nwhile indice < len(needed):\n if prices[indice] <= prices[indice_old]:\n total += prices[indice] * needed[indice]\n indice_old = indice\n indice += 1\n else:\n total += prices[indice_old] * needed[indice]\n indice += 1\n\nprint(total)\n", "n= int(input())\nlt=[]\nfor i in range(n):\n lt.append(list(map(int,input().split())))\ns=0\ni=0\nwhile i<n:\n\n for j in range(i,n):\n if lt[j][1]>=lt[i][1]:\n s+=lt[j][0]*lt[i][1]\n \n else:\n i=j\n break\n else:\n i=j+1\nprint(s)\n \n", "n=int(input())\r\na=[]\r\np=[]\r\nfor i in range(n):\r\n\ta1,p1=map(int,input().split())\r\n\ta.append(a1)\r\n\tp.append(p1)\r\nk=p[0]\r\nr=0\r\nfor i in range(len(p)):\r\n\tk=min(k,p[i])\r\n\tr=r+k*a[i]\r\nprint(r)", "n=int(input())\r\nm=123\r\nx=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n m=min(m,b)\r\n x=x+a*m\r\n \r\nprint(x)", "'''input\n3\n1 3\n2 1\n3 2\n'''\nm, t = 1e10, 0\nfor _ in range(int(input())):\n\ta, p = map(int, input().split())\n\tm = min(m, p)\n\tt += a * m\nprint(t)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/22 22:34\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\n\r\nA = []\r\nP = []\r\n\r\nfor i in range(N):\r\n a, p = map(int, input().split())\r\n A.append(a)\r\n P.append(p)\r\n\r\n\r\nans = 0\r\nminCost = float('inf')\r\n\r\nfor i in range(N):\r\n minCost = min(minCost, P[i])\r\n ans += minCost * A[i]\r\n\r\nprint(ans)", "n = int(input())\r\na = []\r\np = []\r\nfor i in range(n):\r\n temp = list(map(int, input().strip().split(' ')))\r\n a.append(temp[0])\r\n p.append(temp[1])\r\nminp = p[0]\r\nres = 0\r\nfor i in range(n):\r\n minp = min(minp, p[i])\r\n res += a[i] * minp\r\nprint(res)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/588/A\r\n\r\nn = int(input())\r\nm = None\r\nt = 0\r\nfor _ in range(n):\r\n w, c = map(int, input().split())\r\n if m == None or m > c:\r\n m = c\r\n t += m*w\r\nprint(t)", "n = int(input())\n\nmenorPreco = -1\n\nreais = 0\nfor i in range(n):\n entrada = input().split(\" \")\n k = int(entrada[0])\n preco = int(entrada[1])\n\n if preco < menorPreco or menorPreco == -1:\n menorPreco = preco\n\n reais += k * menorPreco\nprint(reais)\n\n\n\n", "n = int(input())\r\nmini = 100\r\ntotal = 0\r\nfor i in range(n):\r\n\ta_p = list(map(int, input().split(\" \")))\r\n\ta, p = a_p\r\n\tmini = min(mini, p)\r\n\ttotal += (a*mini)\r\nprint(total)\r\n\r\n\r\n", "n = int(input())\r\n\r\na, p = map(int, input().split(\" \"))\r\nmm = a * p # minimum money\r\nmp = p # minimum price\r\nfor i in range(n - 1):\r\n a, p = map(int, input().split(\" \"))\r\n if p < mp:\r\n mp = p\r\n mm += a * mp\r\n\r\nprint(mm)", "n=int(input())\r\nMin=101\r\nans=0\r\nfor i in range(n):\r\n a,p=map(int,input().split())\r\n Min=min(Min,p)\r\n ans+=Min*a\r\nprint(ans)\r\n\r\n", "n = int(input())\r\nlistOfamount = [None]*n\r\nlistofprice = [None]*n\r\nres = 0\r\nfor i in range(n):\r\n amount,price = map(int,input().split())\r\n listOfamount[i] = amount\r\n listofprice[i] = price\r\nminn = 0\r\nfor i in range (n):\r\n if i == 0:\r\n res = res + (listOfamount[i]*listofprice[i])\r\n minn = listofprice[i]\r\n else:\r\n if listofprice[i] < minn:\r\n minn = listofprice[i]\r\n res = res + (listOfamount[i]*minn)\r\n\r\nprint(res)", "temp = 0\nans = 0\na = [list(map(int, input().split())) for i in range(int(input()))]\ni = 0\nwhile i < len(a):\n temp = a[i][1]\n while i < len(a):\n if (temp > a[i][1]):\n temp = a[i][1]\n ans += a[i][0]*temp\n i += 1\nprint(ans)\n", "ans = 0\r\nmx_price = 101\r\nfor i in range(int(input())):\r\n wt, price = map(int,input().split())\r\n if price < mx_price:\r\n mx_price = price\r\n ans += wt * mx_price\r\n\r\nprint(ans)\r\n", "costs = []\namounts = []\n\nn = int(input())\n\nfor i in range(n):\n amount, cost = list(map(int, input().split()))\n amounts.append(amount)\n costs.append(cost)\n\nquantities = [0]*n\n\nminCost = 101\nminIndex = 0\ntotalAmount = sum(amounts)\ncurrentAmount = 0\n\nfor i in range(n):\n if costs[i] < minCost:\n if i > 0:\n quantities[minIndex] = currentAmount\n \n totalAmount -= currentAmount\n currentAmount = 0\n\n minIndex = i\n minCost = costs[i]\n quantities[i] = totalAmount\n currentAmount += amounts[i]\n\nfinal = 0\n\nfor i in range(n):\n final += quantities[i] * costs[i]\n\nprint(final)\n \n", "n=int(input())\r\nx=111\r\nb=0\r\nfor i in range(n):\r\n a,p=map(int,input().split())\r\n x=min(x,p)\r\n b+=a*x\r\nprint(b)", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\nmeat_array = list()\r\ncost_array = list()\r\nfor i in range(n):\r\n ai, pi = map(int, stdin.readline().strip().split())\r\n meat_array.append(ai)\r\n cost_array.append(pi)\r\ncost = 0\r\n# increasing_array = list()\r\nmin_cost = cost_array[0]\r\nfor j in range(len(cost_array)):\r\n if cost_array[j]<min_cost:\r\n min_cost = cost_array[j] \r\n cost+=meat_array[j]*min_cost \r\nstdout.write(f\"{cost}\\n\")\r\n \r\n\r\n ", "meat=[]\r\nprice=[]\r\nfor _ in range(int(input())):\r\n a,p=map(int,input().split())\r\n meat.append(a)\r\n price.append(p)\r\nt=99999999999999999999999999999\r\ntotal=0\r\nfor i in range(len(price)):\r\n if price[i]<t:\r\n t=price[i]\r\n \r\n total+=meat[i]*t\r\n\r\nprint(total)\r\n \r\n ", "n = int(input())\r\nx, c = 101, 0\r\nfor _ in range(n):\r\n\ta, p = map(int, input().split())\r\n\tx = min(x, p)\r\n\tc += x * a\r\nprint(int(c))", "cash = 0\r\nprice = 101\r\n \r\nday = int(input())\r\nfor i in range(day):\r\n day -=1\r\n a = input().split(\" \")\r\n x1 = int(a[0])\r\n y1 = int(a[1])\r\n if(price>y1):\r\n price = y1\r\n cash +=price*x1\r\nprint(cash)", "#!/bin/env python3\n\ndef sol():\n n = int(input().strip())\n [a, b] = input().split(\" \")\n min_price=int(b)\n cumu_cost=int(a)*min_price\n for i in range(n-1):\n (kg, p) = tuple(map(lambda e: int(e), input().split(\" \")))\n if p<min_price:\n min_price = p\n cumu_cost += kg*min_price\n return cumu_cost\n\nif __name__ == \"__main__\":\n print(\"{0}\".format(sol()))\n", "n = int(input())\r\ndata = [] \r\nfor _ in range(n):\r\n data.append(input().split())\r\ntotal_cost = int(data[0][0]) * int(data[0][1])\r\nmin_cost = int(data[0][1])\r\nfor i in range(1, n):\r\n if min_cost > int(data[i][1]):\r\n min_cost = int(data[i][1])\r\n total_cost += min_cost * int(data[i][0])\r\n \r\nprint(total_cost)# 1689401942.4971132", "n=int(input())\r\nL=[]\r\nL1=[]\r\nfor k in range (n):\r\n a,b=map(int,input().split(\" \"))\r\n L.append(a)\r\n L1.append(b)\r\nmini=101\r\nsuma=0\r\nfor k in range(n):\r\n if(L1[k]<mini):\r\n mini=L1[k]\r\n suma+=L[k]*mini\r\nprint(suma)", "n = int(input())\r\nla = []\r\nlp = []\r\nk = 0\r\nprice = 100\r\nfor i in range(n):\r\n a,p = map(int,input().split())\r\n la.append(a)\r\n lp.append(p)\r\n price = min(price,lp[i])\r\n #print(price)\r\n k = k+price*la[i]\r\n #print(k)\r\nprint(k)\r\n\r\n", "N = int(input())\nmin_cost = float('inf')\nres = 0\n\nfor n in range(N):\n a, p = map(int, input().split())\n min_cost = min(min_cost, p)\n res += min_cost * a\n\nprint(res)\n", "n=int(input())\r\na=[]\r\np=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append(x)\r\n p.append(y)\r\ni=0\r\nans=0\r\nwhile(i<n):\r\n start=i\r\n while(i<n and p[start]<=p[i]):\r\n i+=1\r\n ans+=sum(a[start:i])*p[start]\r\nprint(ans)", "n=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n s=input().split()\r\n a.append(int(s[0]))\r\n b.append(int(s[1]))\r\nans=0\r\ncur=1000000000\r\nfor i in range(n):\r\n cur=min(cur,b[i])\r\n ans=ans+cur*a[i]\r\nprint(ans)\r\n \r\n ", "def solve(n, d):\n x = [d[0][1] for _ in range(n)]\n for i in range(1, n):\n x[i] = min(d[i][1], x[i-1])\n\n s = 0\n for i in range(n):\n s += d[i][0]*x[i]\n return s\n\n\ndef main():\n n = int(input())\n d = [tuple(map(int, input().split())) for _ in range(n)]\n print(solve(n, d))\n\n\nmain()\n", "n = int(input())\r\nans = 0\r\nminp = 100\r\nfor i in range(n):\r\n line =list(map(int,input().split()))\r\n minp = min(minp,line[1])\r\n ans += int(line[0]) * minp\r\nprint(ans)\r\n", "n = int(input())\r\nmn = 101\r\nret = 0\r\n\r\nfor _ in range(n):\r\n ai, pi = [int(x) for x in input().split()]\r\n if pi < mn:\r\n mn = pi\r\n ret += mn * ai\r\n\r\nprint(ret)", "a=int(input())\r\nz=a\r\nx=0\r\ny=[]\r\nk=3\r\nj=0\r\nh=0\r\nl=1\r\n\r\nwhile 1<=z<=100000:\r\n b=input().split()\r\n y.extend(b)\r\n z=z-1\r\n\r\nh=int(y[j])\r\nif a==1:\r\n x=int(y[0])*int(y[1])\r\nwhile k<=((a*2)-1):\r\n if int(y[l])<=int(y[k]):\r\n j=j+2\r\n h=h+int(y[j])\r\n\r\n \r\n if k==(a*2-1):\r\n x=x+(int(y[l])*h)\r\n break\r\n k=k+2\r\n \r\n elif int(y[l])>int(y[k]):\r\n \r\n x=x+(int(y[l])*h)\r\n l=k\r\n \r\n j=j+2\r\n h=int(y[j])\r\n if k==(a*2-1):\r\n \r\n x=x+(int(y[l])*h)\r\n break\r\n k=k+2\r\n\r\n \r\n\r\n \r\nprint(x)\r\n", "s=0\r\nminrate=1000\r\nfor _ in range(int(input())):\r\n\ta,b=map(int,input().split())\r\n\tminrate=min(minrate,b)\r\n\ts+=(a*minrate)\r\nprint(s)\r\n\t\r\n\t", "n = int(input())\r\nans = 0\r\nminprice = 100\r\n\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n if p <= minprice:\r\n minprice = p\r\n ans += a * minprice\r\n\r\nprint(ans)\r\n\r\n", "class pairs:\n\tdef __init__(self,fir,sec):\n\t\tself.first=fir\n\t\tself.second=sec\nl=[]\nfor i in range(int(input())):\n\tfir,sec=map(int,input().split())\n\titem=pairs(fir,sec)\n\tl.append(item)\nmi=l[0].second\ntot=0\nfor e in l:\n\tif e.second<=mi:\n\t\tmi=e.second\n\ttot+=mi*e.first\nprint(tot)\n \t\t\t \t\t \t \t\t \t \t\t\t \t \t\t\t \t \t", "n = int(input())\r\nprice_optimal_today = 101 # problem statement has 1 <= a, p <= 100\r\n\r\ntotal_spent = 0\r\n\r\nfor _ in range(n):\r\n a, p = map(int, input().split())\r\n price_optimal_today = min(p, price_optimal_today)\r\n total_spent += price_optimal_today * a\r\n\r\nprint(total_spent)", "n = int(input())\nmin_price = 101\nsum = 0\nfor i in range(n):\n a, p = map(int, input().split())\n min_price = min(min_price, p)\n sum += min_price*a\n\nprint(sum)", "n=int(input())\r\nt=[]\r\ns=[]\r\nfor j in range(n):\r\n a,b=list(map(int,input().split()))\r\n t.append(a)\r\n s.append(b)\r\n\r\np=0\r\nu=s[0]\r\nfor i in range(len(s)):\r\n if s[i]<u:\r\n u=s[i]\r\n p+=t[i]*u\r\n else:\r\n p+=t[i]*u\r\nprint(p)\r\n \r\n" ]

[ "i = input().split()\nn = int(i[0])\nt = int(i[1])\nprint(n * 1.0 *(1.000000011 ** t))\n", "n, t = [int(x) for x in input().split()]\r\n\r\ntasa = 1.000000011\r\n\r\nincremento = tasa**t\r\n\r\nprint(n*incremento)", "n,t1=map(int,input().split())\r\nprint(((1.000000011**t1))*n)\r\n", "n, t = map(int, input().split())\r\nprint(n * 1.000000011 ** t)", "n,t=map(int,input().split())\r\nprint(n*(1.000000011**t))", "n, t = map(int, input().split())\r\n\r\ntransistors = n * (1.000000011 ** t)\r\nprint(\"{:.15f}\".format(transistors))\r\n", "def estimate_transistors(n, t):\n growth_rate = 1.000000011\n estimated_transistors = n * (growth_rate ** t)\n return estimated_transistors\nn, t = map(int, input().split())\nresult = estimate_transistors(n, t)\nprint(\"{:.6f}\".format(result))\n \t \t \t\t \t \t \t \t\t\t \t\t\t\t", "n, t = map(int, input().split())\r\n\r\ntransistors = n * (1.000000011 ** t)\r\nprint(f'{transistors:.15f}')\r\n", "n, t = map(int, input().split())\r\n\r\nprint(n * 1.000000011 ** t)\n# Sat Aug 05 2023 12:36:29 GMT+0300 (Moscow Standard Time)\n", "n,t=map(int,input().split())\r\nprint(n*( 1.000000011)**t)", "s = input()\r\nn = s.split()[0]\r\nt = s.split()[1]\r\n\r\nprint(float(n) * pow(float(1.000000011), int(t)))", "t, s = input().split()\nprint(int(t)*(1.000000011**int(s)))\n \t\t\t\t\t \t \t\t\t\t \t \t\t \t\t \t\t\t \t\t", "n,t=map(int,input().split())\r\nprint(n*((1.000000011**t)))", "n, s = map(int, input().split())\r\n\r\nprint(n * 1.000000011**s)", "raw_input = input()\nsplited = raw_input.split(' ')\nn = int(splited[0])\nt = int(splited[1])\nexp=1.000000011\nprint(n*exp**t)\n \t \t \t \t \t\t\t\t\t \t \t\t \t\t", "n, k = map(int, input().split())\r\nans = n*(1.000000011)**k\r\nprint(\"%.30f\"%ans)", "n,x=map(int,input().split())\r\nprint(n*( 1.000000011**x))", "n,t=[int(e) for e in input().split()]\r\nprint(n*1.000000011**t)" ]

[ "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\nk, n = map(int, input().split())\r\nd1 = defaultdict(lambda : [])\r\nd2 = defaultdict(lambda : [])\r\nfor _ in range(k):\r\n s, a = input().rstrip().decode().split()\r\n f = 1\r\n for i in range(n):\r\n if not s[i] == s[n - i - 1]:\r\n f = 0\r\n break\r\n if not f:\r\n d1[s].append(int(a))\r\n else:\r\n d2[s].append(int(a))\r\nfor i in d1.keys():\r\n d1[i].sort()\r\nans = 0\r\nfor i in d1.keys():\r\n j = i[::-1]\r\n if not j in d1:\r\n continue\r\n u, v = d1[i], d1[j]\r\n while u and v and u[-1] + v[-1] >= 0:\r\n ans += u.pop() + v.pop()\r\ndp = [0] * 2\r\nfor i in d2.keys():\r\n d2[i].sort()\r\n u = d2[i]\r\n while len(u) >= 2 and u[-2] >= 0:\r\n ans += u.pop()\r\n ans += u.pop()\r\n dp0 = list(dp)\r\n if len(u) >= 2:\r\n x = u[-1] + u[-2]\r\n for j in range(2):\r\n dp0[j] = max(dp[j] + x, dp0[j])\r\n if len(u) >= 1:\r\n x = u[-1]\r\n dp0[1] = max(dp[0] + x, dp0[1])\r\n dp = dp0\r\nans += max(dp)\r\nprint(ans)", "n, k = map(int, input().split())\r\np = {}\r\nnp = {}\r\npair = []\r\nused = {}\r\nrev_d = {}\r\n\r\ndef push(d, s, v):\r\n if s not in d:\r\n d[s] = []\r\n d[s].append(v)\r\n\r\ndef is_pal(s):\r\n n = len(s)\r\n flg=True\r\n for i in range(n//2):\r\n if s[i] != s[n-1-i]:\r\n flg = False\r\n break\r\n return flg \r\n\r\ndef rev(s):\r\n return s[::-1]\r\n\r\nfor _ in range(n):\r\n s, val = input().split()\r\n val = int(val)\r\n \r\n if is_pal(s):\r\n push(p, s, val)\r\n else:\r\n push(np, s, val)\r\n \r\n if s not in rev_d:\r\n rev_d[s] = rev(s)\r\n\r\nfor k, v in p.items():\r\n p[k] = sorted(v, reverse=True)\r\n \r\nfor k, v in np.items():\r\n np[k] = sorted(v, reverse=True)\r\n \r\nfor s in np:\r\n if s not in used and rev_d[s] in np:\r\n pair.append([s, rev_d[s]])\r\n used[s] = True\r\n used[rev_d[s]] = True\r\n \r\nmax_remain = 0\r\nminus = 0\r\nmax_S = 0\r\n\r\nfor v_arr in p.values():\r\n n = len(v_arr)\r\n for i in range(0, n, 2):\r\n if i+1==n:\r\n if v_arr[i] > 0:\r\n max_remain = max(max_remain, v_arr[i]) \r\n \r\n else:\r\n if v_arr[i] + v_arr[i+1] >= 0:\r\n max_S += v_arr[i] + v_arr[i+1]\r\n \r\n if v_arr[i+1] < 0:\r\n minus = min(minus, v_arr[i+1])\r\n else:\r\n if v_arr[i] > 0:\r\n max_remain = max(max_remain, v_arr[i]) \r\n\r\nfor [u, v] in pair:\r\n n = min(len(np[u]), len(np[v]))\r\n \r\n for x, y in zip(np[u][:n], np[v][:n]):\r\n if x+y > 0:\r\n max_S += x+y\r\n \r\nprint(max(max_S+max_remain, max_S-minus)) \r\n\r\n#7 3\r\n#abb 2\r\n#aaa -3\r\n#bba -1\r\n#zyz -4\r\n#abb 5\r\n#aaa 7\r\n#xyx 4", "# teamwork with rainboy\nk, n = map(int, input().split())\nht = {}\nfor _ in range(k):\n s, a = input().split()\n ht.setdefault(s, []).append(int(a))\na0, a1 = [], []\nfor s in ht:\n ht[s].sort()\nfor s in ht:\n ls = ht[s]\n t = s[::-1]\n if s == t:\n l = len(ls)\n tot = 0\n for i in range(l - 1, 0, -2):\n a = ls[i] + ls[i - 1]\n if a <= 0:\n break\n tot += a\n a0.append(tot)\n tot = max(ls[l - 1], 0)\n for i in range(l - 2, 0, -2):\n a = ls[i] + ls[i - 1]\n if a <= 0:\n break\n tot += a\n a1.append(tot)\n elif s < t and t in ht:\n lt = ht[t]\n tot = 0\n i, j = len(ls) - 1, len(lt) - 1\n while i >= 0 and j >= 0:\n a = ls[i] + lt[j]\n if a <= 0:\n break\n tot += a\n i, j = i - 1, j - 1\n a0.append(tot)\n a1.append(0)\nans = tot = sum(a0)\nfor i in range(len(a0)):\n ans = max(ans, tot - a0[i] + a1[i])\nprint(ans)\n", "# teamwork with rainboy\nk, n = map(int, input().split())\nht = {}\nfor _ in range(k):\n s, a = input().split()\n ht.setdefault(s, []).append(int(a))\nfor s in ht:\n ht[s].sort(reverse = True)\nsum_, diff = 0, 0\nfor s in ht:\n ls = ht[s]\n t = s[::-1]\n if s == t:\n l = len(ls)\n sum0 = 0\n for i in range(0, l - 1, 2):\n a = ls[i] + ls[i + 1]\n if a <= 0:\n break\n sum0 += a\n sum1 = max(ls[0], 0)\n for i in range(1, l - 1, 2):\n a = ls[i] + ls[i + 1]\n if a <= 0:\n break\n sum1 += a\n sum_ += sum0\n diff = max(diff, sum1 - sum0)\n elif s < t and t in ht:\n lt = ht[t]\n l = min(len(ls), len(lt))\n sum0 = 0\n for i in range(l):\n a = ls[i] + lt[i]\n if a <= 0:\n break\n sum0 += a\n sum_ += sum0\nprint(sum_ + diff)\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\n\ndef main():\n n,l = list(map(int, input().split()))\n d = collections.defaultdict(list)\n e = collections.defaultdict(list)\n k = collections.defaultdict(list)\n for _ in range(n):\n sa = input().split()\n s = sa[0]\n c = int(sa[1])\n sr = s[::-1]\n if s == sr:\n k[s].append(c)\n else:\n d[s].append(c)\n e[s].append(c)\n r = 0\n rm = 0\n for cs in k.values():\n cs.sort()\n cs.reverse()\n cl = len(cs)\n i = 0\n crm = 0\n while cl > i+1:\n if cs[i+1] >= 0:\n r += cs[i] + cs[i+1]\n i += 2\n continue\n if cs[i] > 0:\n if cs[i]+cs[i+1] > 0:\n r += cs[i] + cs[i+1]\n crm = -cs[i+1]\n else:\n crm = cs[i]\n i += 2\n else:\n break\n if cl > i and cs[i] > 0:\n crm = cs[i]\n if crm > rm:\n rm = crm\n r += rm\n for s,cs in d.items():\n sr = s[::-1]\n ecs = e[sr]\n cs.sort()\n cs.reverse()\n ecs.sort()\n ecs.reverse()\n e[s] = []\n l = min(len(cs), len(ecs))\n for i in range(l):\n if cs[i] + ecs[i] > 0:\n r += cs[i] + ecs[i]\n return r\n\n\n\n\nprint(main())\n" ]

[ "def canonise(t):\r\n\tif t < 0:\r\n\t\treturn \"(0-\" + canonise(-t) + \")\"\r\n\tans = \"\"\r\n\twhile t > 50:\r\n\t\tans += \"(50+\"\r\n\t\tt -= 50\r\n\treturn ans + str(t) + \")\" * (len(ans)//4)\r\n\r\nn = int(input())\r\n\r\ncxes = []\r\ncyes = []\r\nfor i in range(n):\r\n\tx, y, r = map(int, input().split())\r\n\tfor dx in range(2):\r\n\t\tfor dy in range(2):\r\n\t\t\tif (x+dx)%2 == 0 and (y+dy)%2 == 0:\r\n\t\t\t\tcxes.append((x+dx)//2)\r\n\t\t\t\tcyes.append((y+dy)//2)\r\n\r\ncoeffx = [0]*(n+2)\r\ncoeffy = [0]*(n+2)\r\ncfx = 0\r\ncfy = 0\r\n\r\nfor i in range(n):\r\n\tif i == 0:\r\n\t\tcfx += cxes[i]\r\n\t\tcoeffx[i+1] -= cxes[i]\r\n\t\tcoeffx[i+2] += cxes[i]\r\n\t\t\r\n\t\tcfy += cyes[i]\r\n\t\tcoeffy[i+1] -= cyes[i]\r\n\t\tcoeffy[i+2] += cyes[i]\r\n\telif i == n-1:\r\n\t\tcfx += cxes[i]\r\n\t\tcoeffx[i] += cxes[i]\r\n\t\tcoeffx[i+1] -= cxes[i]\r\n\r\n\t\tcfy += cyes[i]\r\n\t\tcoeffy[i] += cyes[i]\r\n\t\tcoeffy[i+1] -= cyes[i]\r\n\telse:\r\n\t\tcoeffx[i] += cxes[i]\r\n\t\tcoeffx[i+1] -= 2*cxes[i]\r\n\t\tcoeffx[i+2] += cxes[i]\r\n\r\n\t\tcoeffy[i] += cyes[i]\r\n\t\tcoeffy[i+1] -= 2*cyes[i]\r\n\t\tcoeffy[i+2] += cyes[i]\r\n\r\nrx = \"\"\r\nry = \"\"\r\nfor i in range(1, n+1):\r\n\ts = f\"abs((t-{i}))\"\r\n\tif i != n:\r\n\t\trx += f\"(({s}*{canonise(coeffx[i])})+\"\r\n\t\try += f\"(({s}*{canonise(coeffy[i])})+\"\r\n\telse:\r\n\t\trx += f\"({s}*{canonise(coeffx[i])})\" + \")\"*(n-1)\r\n\t\try += f\"({s}*{canonise(coeffy[i])})\" + \")\"*(n-1)\r\n\r\nprint(f\"({rx}+{canonise(cfx)})\")\r\nprint(f\"({ry}+{canonise(cfy)})\")" ]

[ "import sys\r\nfrom itertools import combinations\r\n\r\nin_file = open(\"input.txt\", \"r\") #\r\nout_file = open(\"output.txt\", \"w\")\r\n\r\nn = int(in_file.readline().strip())\r\n\r\nU = []\r\nfor i in range(n):\r\n U.append(in_file.readline().strip())\r\n \r\nA = [set() for u in U]\r\nl = len(U)\r\nV_inv = {}\r\nfor i in range(1, 5):\r\n for j in range(len(U)):\r\n u = U[j]\r\n for v in combinations(u, i):\r\n v = \"\".join(v)\r\n if v not in V_inv:\r\n V_inv[v] = l\r\n l += 1\r\n A.append(set())\r\n A[j].add(V_inv[v])\r\n A[V_inv[v]].add(j)\r\n\r\nV = [-1 for i in range(len(V_inv))]\r\nfor v in V_inv:\r\n V[V_inv[v]-len(U)] = v\r\n\r\ninf = len(V)+len(U)\r\nmatch = [inf for i in range(len(V)+len(U))]\r\ndist = [-1 for i in range(inf+1)]\r\ndef bfs():\r\n Q = []\r\n i = 0\r\n for u in range(len(U)):\r\n if match[u] == inf:\r\n dist[u] = 0\r\n Q.append(u)\r\n else:\r\n dist[u] = inf\r\n dist[inf] = inf\r\n while i < len(Q):\r\n u = Q[i]\r\n if dist[u] < dist[inf]:\r\n for v in A[u]:\r\n if dist[match[v]] == inf:\r\n dist[match[v]] = dist[u]+1\r\n Q.append(match[v])\r\n i += 1\r\n return dist[inf] != inf\r\n\r\ndef dfs(u):\r\n if u != inf:\r\n for v in A[u]:\r\n if dist[match[v]] == dist[u]+1:\r\n if dfs(match[v]):\r\n match[v] = u\r\n match[u] = v\r\n return True\r\n dist[u] = inf\r\n return False\r\n return True\r\n\r\nmatches = 0\r\nwhile bfs():\r\n for u in range(len(U)):\r\n if match[u] == inf:\r\n if dfs(u):\r\n matches += 1\r\n\r\nif matches == len(U):\r\n for i in range(len(U)):\r\n out_file.write(V[match[i]-len(U)]+\"\\n\")\r\nelse:\r\n out_file.write(\"-1\\n\")\r\n\r\nout_file.flush()\r\n\r\nin_file.close()\r\nout_file.close()" ]

[ "def bin_search(n,a):\r\n l = 0\r\n r = len(a)-1\r\n while l<=r:\r\n m = (l+r)//2\r\n if n>a[m][0]:\r\n l = m+1\r\n if n<a[m][0]:\r\n r = m-1\r\n if n == a[m][0]:\r\n return m\r\n return -1\r\nn = int(input())\r\na = input().split()\r\ndef ke(n):\r\n return n[1]\r\ndef f(n):\r\n return abs(n[2]-n[3])\r\ncnt = {}\r\nmx = 0\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n if a[i] in cnt:\r\n cnt[a[i]][1] += 1\r\n cnt[a[i]][3] = i\r\n else:\r\n cnt[a[i]] = [a[i],1,i,0]\r\nfor m in cnt.values():\r\n if m[1]>mx:\r\n mx = m[1]\r\nv = []\r\nfor m in cnt.values():\r\n if m[1]==mx:\r\n v.append(m)\r\nv.sort(key=f)\r\nprint(v[0][2]+1,v[0][3]+1)\r\n", "from sys import stdin\r\n\r\n\r\ndef main():\r\n n = int(stdin.readline())\r\n ar = list(map(int, stdin.readline().split()))\r\n c = [0] * (10 ** 6 + 1)\r\n mf = 0\r\n for elm in ar:\r\n c[elm] += 1\r\n if c[elm] > mf:\r\n mf = c[elm]\r\n start = 0\r\n end = 0\r\n lk = [0] * (10 ** 6 + 1)\r\n f = [0] * (n + 1)\r\n f[0] = n\r\n cf = 0\r\n ml = n + 1\r\n il = -1\r\n ir = -1\r\n while end < n:\r\n while end < n and cf < mf:\r\n f[lk[ar[end]]] -= 1\r\n lk[ar[end]] += 1\r\n f[lk[ar[end]]] += 1\r\n if lk[ar[end]] > cf:\r\n cf = lk[ar[end]]\r\n end += 1\r\n if cf == mf:\r\n if end - start < ml:\r\n ml = end - start\r\n il = start + 1\r\n ir = end\r\n while start < end and cf == mf:\r\n f[lk[ar[start]]] -= 1\r\n lk[ar[start]] -= 1\r\n f[lk[ar[start]]] += 1\r\n start += 1\r\n if f[cf] == 0:\r\n cf = cf - 1\r\n else:\r\n if end - start < ml:\r\n ml = end - start\r\n il = start + 1\r\n ir = end\r\n print(il, ir)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import collections\n\ndef findsubsegment(l, nums):\n freq_map = collections.Counter(nums)\n beauty = max(freq_map.items(), key = lambda x: x[1])[1]\n keys = {}\n if beauty == 1:\n print(\"1 1\")\n return\n for key, val in freq_map.items():\n if val == beauty:\n keys[key] = [l, -1]\n for i, num in enumerate(nums):\n if num in keys:\n if i < keys[num][0]:\n keys[num][0] = i\n keys[num][1] = i\n min_val = l\n min_range = [1, l]\n for key, ranges in keys.items():\n if ranges[1] - ranges[0] < min_val:\n min_val = ranges[1] - ranges[0]\n min_range = [ranges[0] + 1, ranges[1] + 1]\n\n print(str(min_range[0]) + ' ' + str(min_range[1]))\n\nl = int(input())\nnums = [int(x) for x in input().split(' ')]\nfindsubsegment(l, nums)\n \t \t \t\t \t\t\t \t\t \t \t \t\t", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\nfrom collections import Counter, defaultdict\r\nfrom operator import itemgetter\r\n\r\ndef main():\r\n n = I()\r\n a = IA()\r\n c = Counter(a)\r\n m = max(c.values())\r\n s = set(k for k, v in c.items() if v==m)\r\n d = defaultdict(list)\r\n for i in range(n):\r\n if a[i] in s:\r\n d[a[i]].append(i)\r\n mi = 999999\r\n l,r = 0, 0\r\n for k, v in d.items():\r\n diff = abs(v[-1]-v[0])\r\n if diff < mi:\r\n mi = diff \r\n l, r = v[0]+1, v[-1]+1\r\n print(*[l,r])\r\n \r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nb=[[] for x in range(1, 10**6+10)]\r\nfor i, j in enumerate(arr):\r\n\tb[j].append(i)\r\nmaxi=0\r\nfor i in b:\r\n\tmaxi=max(maxi, len(i))\r\nbest=10**10\r\nl, r=1, 1\r\nfor i in b:\r\n\tif len(i)==maxi:\r\n\t\tif i[-1]-i[0]<best:\r\n\t\t\tbest=i[-1]-i[0]\r\n\t\t\tl, r=i[0], i[-1]\r\nprint(l+1, r+1)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = max(a) + 5\r\ncnt = [0] * m\r\ninf = pow(10, 9) + 1\r\nl0, r0 = [inf] * m, [-inf] * m\r\nfor i in range(n):\r\n ai = a[i]\r\n cnt[ai] += 1\r\n l0[ai], r0[ai] = min(l0[ai], i + 1), max(r0[ai], i + 1)\r\nl, r = -inf, inf\r\nma = max(cnt)\r\nfor i in range(m):\r\n if cnt[i] == ma and r0[i] - l0[i] < r - l:\r\n l, r = l0[i], r0[i]\r\nprint(l, r)", "N = int(input())\nA = [int(x) for x in input().split()]\n\nbucket = dict()\nfor i, num in enumerate(A):\n if num in bucket:\n bucket[num].append(i)\n else:\n bucket[num] = [i]\n\nsorted_buckets = sorted(bucket.values(), key=lambda val: (-len(val), val[-1]-val[0]))\nprint(sorted_buckets[0][0]+1, sorted_buckets[0][-1]+1)\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = defaultdict(list)\r\nfor i, v in enumerate(a):\r\n d[v].append(i)\r\nbestSize = -float('inf')\r\nbestLen = float('inf')\r\nl = r = None\r\nfor cnt in d.values():\r\n i, j = cnt[0], cnt[-1]\r\n if (len(cnt) > bestSize) or (len(cnt) == bestSize and j - i + 1 < bestLen):\r\n bestSize = len(cnt)\r\n bestLen = j - i + 1\r\n l, r = i, j\r\nprint('%d %d' % (l + 1, r + 1))", "n=input()\r\nnum=list(map(int,input().split()))\r\narr={}\r\nfor i in range(len(num)):\r\n if num[i] in arr:\r\n arr[num[i]][2]=i\r\n arr[num[i]][0]+=1\r\n else:\r\n arr[num[i]]=[1,i,i]\r\nmxk=num[0]\r\nfor key in arr:\r\n if arr[mxk][0]<arr[key][0]:\r\n mxk=key\r\n elif arr[mxk][0]==arr[key][0] and arr[mxk][2]-arr[mxk][1]>arr[key][2]-arr[key][1]:\r\n mxk=key\r\nprint(arr[mxk][1]+1,arr[mxk][2]+1)", "\nN=1000001\n\nl=[0]*N\nr=[0]*N\nnum=[0]*N\n\nn=int(input())\n\ni=1\nfor x in input().split():\n x=int(x)\n if num[x]==0:\n l[x]=i\n r[x]=i\n num[x]=num[x]+1\n i=i+1\n\nansn=0\nfor i in range(N):\n ansn=max(ansn,num[i])\n\nansl=0\nansr=n\nfor i in range(N):\n if num[i]==ansn:\n if ansr-ansl>r[i]-l[i]:\n ansr=r[i]\n ansl=l[i]\n\nprint(ansl,ansr)\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter, defaultdict\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nd = Counter(w).most_common()\r\nx = d[0][1]\r\nif x == 1:\r\n print(1, 1)\r\nelse:\r\n q = defaultdict(list)\r\n q1 = set()\r\n for i, j in d:\r\n if j == x:\r\n q1.add(i)\r\n else:\r\n break\r\n for i in range(n):\r\n if w[i] in q1:\r\n q[w[i]].append(i)\r\n c = 1000000\r\n c1 = -1\r\n for i in q:\r\n if q[i][-1] - q[i][0] < c:\r\n c = q[i][-1] - q[i][0]\r\n c1 = i\r\n print(q[c1][0]+1, q[c1][-1]+1)\r\n", "n=int(input())\r\nm={}\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i] not in m:\r\n m[a[i]]=1,i,i\r\n else:\r\n m[a[i]]=m[a[i]]=m[a[i]][0]+1,m[a[i]][1],i\r\nkey=list(m.keys())\r\nmax=0\r\nmin=1000000\r\nfor i in range(len(key)):\r\n if m[key[i]][0]>max:\r\n max=m[key[i]][0]\r\n maxl=key[i]\r\n min=m[key[i]][2]-m[key[i]][1]\r\n elif m[key[i]][0]==max and min> m[key[i]][2]-m[key[i]][1]:\r\n maxl = key[i]\r\n min = m[key[i]][2] - m[key[i]][1]\r\nprint(m[maxl][1]+1,m[maxl][2]+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nf={}\r\nfor i in l:\r\n try:\r\n f[i]+=1\r\n \r\n except:\r\n f[i]=1\r\n \r\nt=max(f.values()) \r\nff={}\r\nfor i in range(n):\r\n if f[l[i]]==t:\r\n try:\r\n ff[l[i]][1]=i\r\n \r\n except:\r\n ff[l[i]]=[i,0]\r\nans=10**9+8\r\n\r\nfor i in ff.values():\r\n if abs(i[0]-i[1])+1<ans:\r\n ans=abs(i[0]-i[1])+1\r\n s=i\r\nprint(s[0]+1,s[1]+1)\r\n \r\n ", "n = int(input())\na = [int(c) for c in input().split()]\n\ndt = {}\nfor i in range(n):\n if not a[i] in dt:\n dt[a[i]] = 0\n dt[a[i]] += 1\n\nm = max(dt.values())\n\nmkeys = set()\nfor k in dt.keys():\n if dt[k] == m:\n mkeys.add(k)\n\nmkeys2 = set(mkeys)\n\ndt2 = {}\nfor i in range(n):\n if a[i] in mkeys:\n mkeys.remove(a[i])\n dt2[a[i]] = i\n if not mkeys:\n break\ndt3 = {}\ndt4 = {}\nfor i in reversed(range(n)):\n if a[i] in mkeys2:\n mkeys2.remove(a[i])\n dt3[a[i]] = i\n dt4[a[i]] = i - dt2[a[i]]\n if not mkeys2:\n break\n\nmi = min(dt4.values())\n\nfor k in dt4.keys():\n if dt4[k] == mi:\n print(' '.join([str(dt2[k]+1), str(dt3[k]+1)]))\n break\n\n", "from collections import Counter\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nstart=dict([])\r\nend=dict([])\r\nall=[]\r\ncount=Counter(a)\r\nmaxx=max(list(count.values()))\r\nfor j in count:\r\n if count[j]==maxx:\r\n all.append(j)\r\nfor i in range(n):\r\n if a[i] not in start:\r\n start[a[i]]=i+1\r\n end[a[i]]=i+1\r\n else:\r\n end[a[i]]=i+1\r\nminn=100000000\r\nele=0\r\nfor k in all:\r\n if (end[k]-start[k])<minn:\r\n minn=end[k]-start[k]\r\n ele=k\r\nprint(start[ele],end[ele])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1={}\r\nfor i in range(n) :\r\n if l[i] not in l1 :\r\n l1[l[i]]=[1,i,i]\r\n else :\r\n l1[l[i]][0]=l1[l[i]][0]+1\r\n l1[l[i]][2]=i\r\nma=0\r\nma1=100000\r\nma2=-1\r\nfor j in l1.values() :\r\n if ma<j[0] :\r\n ma=j[0]\r\n ma1=abs(j[1]-j[2])\r\n ma2=str(j[1]+1)+' '+str(j[2]+1)\r\n if ma==j[0] and abs(j[1]-j[2])<ma1 :\r\n ma=j[0]\r\n ma1=abs(j[1]-j[2])\r\n ma2=str(j[1]+1)+' '+str(j[2]+1)\r\nprint(ma2)\r\n \r\n \r\n \r\n \r\n", "import collections\r\nfrom collections import defaultdict\r\n\r\nd=defaultdict(lambda:0)\r\ns=defaultdict(lambda:0)\r\ne=defaultdict(lambda:0)\r\n\r\n\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n d[x[i]]+=1\r\n if d[x[i]]==1:\r\n s[x[i]]=i\r\n e[x[i]]=i\r\n else:\r\n e[x[i]]=i\r\n\r\nmval=-1\r\nmdis=0\r\none=0\r\ntwo=0\r\nfor i,j in d.items():\r\n # print(i,j)\r\n if j>mval:\r\n mval=j\r\n mdis=e[i]-s[i]+1\r\n one=s[i]\r\n two=e[i]\r\n elif mval==j and e[i]-s[i]+1<mdis:\r\n # mval = j\r\n mdis = e[i] - s[i] + 1\r\n one = s[i]\r\n two = e[i]\r\nprint(one+1, two+1)", "n=int(input())\na=list(map(int,input().split()))\nd={}\n\nfor i in range(n):\n if str(a[i]) not in d:\n d[str(a[i])]=[1,i,i]\n else:\n d[str(a[i])][0]+=1\n d[str(a[i])][2]=max(d[str(a[i])][2],i)\n\nres = sorted(d, key = lambda x: d[x][0],reverse=True)\nmaxx=d[res[0]][0]\nans=float('inf')\nfor i in range(len(res)):\n if d[res[i]][0]<maxx:\n break\n if ans>d[res[i]][2]-d[res[i]][1]:\n ans=d[res[i]][2]-d[res[i]][1]\n ind=[d[res[i]][1]+1,d[res[i]][2]+1]\n \nprint(*ind)", "from collections import defaultdict\n\nn = int(input())\na = list(map(int, input().split()))\n\nm, counter = 0, defaultdict(int)\nfor x in a:\n counter[x] += 1\n m = max(m, counter[x])\n\ni, j = 0, 0\ncounter = defaultdict(int)\n\nl, r = -1, -1\nwhile j < n:\n counter[a[j]] += 1\n while counter[a[j]] >= m:\n if l == -1 or r - l > j - i:\n l, r = i, j\n counter[a[i]] -= 1\n i += 1\n j += 1\n\nprint(l + 1, r + 1)\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef solve():\r\n n, = map(int, input().split())\r\n\r\n a = list(map(int, input().split()))\r\n\r\n d = {}\r\n\r\n for i in range(n):\r\n rr = d.setdefault(a[i], [i + 1, 0, i])\r\n rr[1] += 1\r\n rr[2] = i + 1\r\n\r\n mx = a[0]\r\n\r\n for k, v in d.items():\r\n if v[1] > d[mx][1]:\r\n mx = k\r\n elif v[1] == d[mx][1]:\r\n if v[2] - v[0] < d[mx][2] - d[mx][0]:\r\n mx = k\r\n\r\n print(d[mx][0], d[mx][2])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "n = int(input())\r\narr = tuple(map(int, input().split()))\r\nd = {}\r\nfor i in arr:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nbig = 0\r\nfor i in d:\r\n if d[i] > big:\r\n big = d[i]\r\n s = {i}\r\n elif d[i] == big:\r\n s.add(i)\r\nsmall = {}\r\nlarge = {}\r\nfor i in range(n):\r\n if arr[i] not in small:\r\n small[arr[i]] = i\r\nfor i in range(n - 1, -1, -1):\r\n if arr[i] not in large:\r\n large[arr[i]] = i\r\nbest = n + 1\r\nfor i in s:\r\n j = small[i]\r\n k = large[i]\r\n if k - j + 1 < best:\r\n best = k - j + 1\r\n ans = (j + 1, k + 1)\r\nprint(*ans)", "# HEY STALKER\r\nfrom collections import Counter\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nd = Counter(l)\r\nma = 0\r\nfor t in d:\r\n ma = max(ma, d[t])\r\nq = {}\r\nfor t in l:\r\n if d[t] == ma:\r\n q[t] = 1\r\nocc = {}\r\nvis = [0 for t in range(max(l)+1)]\r\nfor i in range(n):\r\n if l[i] in q:\r\n if vis[l[i]] == 0:\r\n occ[l[i]] = [i, i]\r\n vis[l[i]] = 1\r\n else:\r\n occ[l[i]][1] = i\r\na, b = 0, 0\r\ncur = 2e18\r\nfor t in occ:\r\n dis = occ[t][1] - occ[t][0]\r\n if dis < cur:\r\n cur = dis\r\n a = occ[t][0]\r\n b = occ[t][1]\r\nprint(a+1, b+1)", "from sys import *\nn = int(input())\n\ntab = list(map(int, stdin.readline().split()))\na = 1000001*[0]\nmax = -1\nmin = 10000001\nxstar = 0\nb = 1000001*[0]\nc = 1000001*[0]\nfor i in range(n):\n\tx = tab[i]\n\ta[x]+=1\n\tif b[x] == 0:\n\t\tb[x] = i+1\n\tc[x] = i+1\n\tif a[x] > max:\n\t\txstar = x\n\t\tmax = a[x]\n\t\tmin = c[x]-b[x]\n\telif a[x] == max and c[x]-b[x] < min:\n\t\txstar = x\n\t\tmax = a[x]\n\t\tmin = c[x]-b[x]\nprint(b[xstar], c[xstar])\n\t\n\n", "N = int(input())\na = [int(i) for i in input().split()]\nd = {}\nb = {}\nfor i, f in enumerate(a):\n if f not in d:\n d[f] = 0\n b[f] = [i, i]\n d[f] += 1\n b[f][1] = i\n\nmn = max(d.values())\n\nm = [0, N]\n\nfor k in d.keys():\n if d[k] != mn:\n continue\n\n if b[k][1] - b[k][0] < m[1] - m[0]:\n m = b[k]\n\nprint(m[0]+1, m[1]+1)\n", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\nai = list(map(int, stdin.readline().split()))\r\n\r\nd = {}\r\nvmax = 0\r\nfor i in range(0, n):\r\n if ai[i] not in d:\r\n d[ai[i]] = list([i])\r\n else:\r\n d[ai[i]].append(i)\r\n\r\nvmax = 0\r\nl = 0\r\nr = 0\r\nk = []\r\nfor i in d.keys():\r\n c = len(d[i])\r\n if c > vmax:\r\n vmax = c\r\n k = d[i]\r\n elif c == vmax:\r\n if d[i][c - 1] - d[i][0] < k[len(k) - 1] - k[0]:\r\n k = d[i]\r\n \r\n l = k[0]\r\n r= k[len(k) - 1]\r\n \r\nprint(str(l + 1) + \" \" + str(r + 1))", "from collections import defaultdict\nN = int(input())\nA = [int(x) for x in input().split()]\n\nbucket = defaultdict(list)\nfor i, num in enumerate(A):\n bucket[num].append(i)\n\nsorted_buckets = sorted(bucket.values(), key=lambda val: (-len(val), val[-1]-val[0]))\nprint(sorted_buckets[0][0]+1, sorted_buckets[0][-1]+1)\n", "from operator import itemgetter\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nc=[0]*1000001\r\nar=[]\r\nfor i in range (n):\r\n c[a[i]]+=1\r\n ar.append([a[i],i])\r\n\r\nar=sorted(ar,key=itemgetter(0,1))\r\n#print(ar)\r\nmaxc=max(c)\r\ni=0\r\nmd=n\r\nst=0\r\nen=n-1\r\nel=-1\r\nwhile (i<n):\r\n pvsi=i\r\n while(i<n-1 and ar[i][0]==ar[i+1][0]):\r\n i+=1\r\n\r\n co=(i-pvsi+1)\r\n le=ar[i][1]-ar[pvsi][1]+1\r\n if(maxc==co and md>le):\r\n md=le\r\n st=ar[pvsi][1]\r\n en=ar[i][1]\r\n i+=1\r\n\r\nprint(st+1,en+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", "\n\nn=int(input())\nnums,d,mx=[],dict(),0\nfor i,e in enumerate(input().split()):\n cur=d.setdefault(int(e),[0,i,i])\n cur[0]+=1;cur[2]=i\n d[int(e)]=cur\n mx=max(mx,d[int(e)][0])\nl,r=0,100000\nfor i in d.keys():\n if d[i][0]==mx:\n if d[i][2]-d[i][1]<r-l:\n r,l=d[i][2],d[i][1]\nprint(l+1,r+1)\n\n\n", "n=int(input())\nli=list(map(int,input().split()))\ndic={}\nfor i in range(n):\n\tif li[i] in dic:\n\t\tdic[li[i]][0]+=1\n\t\tdic[li[i]][2]=i\n\telse:\n\t\tdic[li[i]]=[1,i,i]\nl=list(dic.values())\nl.sort(reverse=True)\nm=0\nd=n+1\nfor i in l:\n\tif(i[0]>=m):\n\t\tm=i[0]\n\t\tif(i[2]-i[1]<d):\n\t\t\tp1=i[1]\n\t\t\tp2=i[2]\n\t\t\td=(i[2]-i[1])\n\telse:\n\t\tbreak\nprint(p1+1,p2+1)\n\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nfrom collections import defaultdict \r\nd=defaultdict(list)\r\nfor i in range(n):\r\n d[l[i]].append(i)\r\nfrom collections import Counter \r\nc=Counter(l)\r\nmaxf=0 \r\nmini=10**9 \r\nfor i in c:\r\n maxf=max(maxf,c[i])\r\nfor i in d:\r\n if len(d[i])==maxf:\r\n if d[i][-1]-d[i][0]+1<mini:\r\n mini=d[i][-1]-d[i][0]\r\n a=d[i][0]+1 \r\n b=d[i][-1]+1 \r\nprint(a,b)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * 1000001\r\nvisited = [False] * 1000001\r\nl = [0] * 1000001\r\nr = [0] * 1000001\r\nmax_b = 0\r\nfor i in a:\r\n b[i] += 1\r\n if b[i] > max_b:\r\n max_b = b[i]\r\nfor i in range(n):\r\n if b[a[i]] == max_b and not visited[a[i]]:\r\n l[a[i]] = i\r\n visited[a[i]] = True\r\nvisited = [False] * 1000001\r\nmin_d = n + 1\r\nmin_l = 0\r\nmin_r = n\r\nfor i in range(n - 1, -1, -1):\r\n if b[a[i]] == max_b and not visited[a[i]]:\r\n r[a[i]] = i\r\n if r[a[i]] - l[a[i]] + 1 < min_d:\r\n min_l = l[a[i]]\r\n min_r = r[a[i]]\r\n min_d = r[a[i]] - l[a[i]] + 1\r\n visited[a[i]] = True\r\nprint(min_l + 1, min_r + 1)\r\n", "#! /usr/bin/python3\r\n\r\nn = int(input())\r\ns = input().split()\r\ncount = [0] * 1000005\r\na = [0] * 1000005\r\n\r\nfor i in range (0, n):\r\n a[i] = int(s[i])\r\n count[a[i]] = count[a[i]] + 1\r\n\r\nmax = 0\r\nfor i in range(1, 1000001):\r\n if count[i] > max:\r\n max = count[i]\r\n\r\nfirst = [-1] * 1000001;\r\nlast = [-1] * 1000001;\r\n\r\nfor i in range(0, 1000001):\r\n if count[a[i]] == max and first[a[i]] == -1:\r\n first[a[i]] = i\r\n\r\ni = 1000000 \r\nwhile i > 0:\r\n if count[a[i]] == max and last[a[i]] == -1:\r\n last[a[i]] = i\r\n i = i - 1\r\n \r\nb = 0\r\ne = n - 1;\r\n\r\nfor i in range(1, 1000001):\r\n if first[a[i]] != -1 and last[a[i]] - first[a[i]] < (e - b):\r\n e = last[a[i]]\r\n b = first[a[i]]\r\n\r\nb = b + 1;\r\ne = e + 1;\r\nprint(b,end=' ')\r\nprint(e)\r\n ", "n = int(input())\nlist = list(map(lambda num: int(num), input().split(\" \")))\ndictionary = {}\n\nfor i in range(n):\n num = list[i]\n if num not in dictionary.keys():\n dictionary[num] = [i, i, 1]\n else:\n start, end, cnt = dictionary[num]\n dictionary[num] = [start, i, cnt + 1]\n\nmaxKey = None\nmax = -1\nfor key in dictionary.keys():\n start, end, cnt = dictionary[key]\n if cnt > max:\n maxKey = key\n max = cnt\n elif cnt == max:\n distOld = dictionary[maxKey][1] - dictionary[maxKey][0]\n distNew = end - start\n maxKey = key if distOld > distNew else maxKey\n\nprint(str(dictionary[maxKey][0] + 1) + \" \" + str(dictionary[maxKey][1] + 1))\n\n\t\t \t\t \t \t\t\t \t\t\t \t \t\t \t \t\t", "I=lambda: map(int,input().split())\r\nn=int(input())\r\nl=list(I())\r\n\r\nd=dict()\r\nfor i in range(n):\r\n if l[i] not in d:\r\n d[l[i]]=[1,i,i]\r\n else:\r\n d[l[i]][0]+=1\r\n d[l[i]][2]=i\r\n\r\na=list(d.values())\r\na.sort(reverse=True)\r\nz=a[0][0]\r\ntotal=10**9\r\nfor i in range(len(a)):\r\n if a[i][0]==z:\r\n xs=a[i][1]\r\n ys=a[i][2]\r\n if ys-xs<total:\r\n x=xs\r\n y=ys\r\n total=ys-xs\r\n\r\nprint(x+1,end=\" \")\r\nprint(y+1) \r\n \r\n \r\n ", "from collections import defaultdict\r\n_ = input()\r\n\r\nnums = list(map(int, input().split()))\r\n\r\nfreqs = defaultdict(list)\r\n\r\n_max = -1\r\nfor i, k in enumerate(nums):\r\n freqs[k].append(i + 1)\r\n _max = max(_max, len(freqs[k]))\r\n\r\n\r\nstart = 1\r\nend = len(nums)\r\nlength = end - start\r\nfor k, v in freqs.items():\r\n if len(v) == _max:\r\n if v[-1] - v[0] < length:\r\n start = v[0]\r\n end = v[-1]\r\n length = end - start\r\n\r\nprint(start, end)\r\n\r\n", "# Question C, AmrLargeArray\n# TUE, 10-03-2020\n\n# count the words and their locations\n_ = input()\ncounter = dict()\nnum_list = list(map(int, input().split()))\nfor i, num in enumerate(num_list):\n if num not in counter:\n counter[num] = {\"fr\": i, \"dst\": 0, \"frq\": 1}\n else:\n counter[num][\"frq\"] += 1\n counter[num][\"dst\"] = i - counter[num][\"fr\"]\n\n# find the best\nsorted_list = sorted(counter.keys(), reverse=True,\n key=lambda a: counter.get(a)[\"frq\"])\nmax_freq = counter[sorted_list[0]][\"frq\"]\n\ntop_freq_list = list(filter(lambda a: counter.get(a)[\n \"frq\"] == max_freq, sorted_list))\nminimum_dst_list = sorted(top_freq_list,\n key=lambda a: counter.get(a)[\"dst\"])\nmin_dist = counter[minimum_dst_list[0]][\"dst\"]\nmin_dist_list = list(filter(lambda a: counter.get(\n a)[\"dst\"] == min_dist, sorted_list))\n\nbest = min_dist_list[0]\nprint(counter[best][\"fr\"]+1, counter[best]\n [\"fr\"]+counter[best][\"dst\"]+1)\n\n \t \t \t\t \t \t \t \t\t\t \t \t\t\t", "import math,sys\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\ndef Pr(x): sys.stdout.write(str(x)+'\\n')\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\n\r\n# Find leftmost value >= x #\r\ndef find_gte(a, 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 l=list(In())\r\n d=defaultdict(list)\r\n ma=0\r\n for i in range(n):\r\n d[l[i]].append(i+1)\r\n ma=max(len(d[l[i]]),ma)\r\n if ma==1:\r\n print(1,1)\r\n return\r\n dist=P\r\n ele=-1\r\n for x in d:\r\n if len(d[x])==ma:\r\n if d[x][-1]-d[x][0]+1<dist:\r\n dist=d[x][-1]-d[x][0]+1\r\n ele=x\r\n print(d[ele][0],d[ele][-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#End#\r\n\r\n# ******************* All The Best ******************* #", "input();d={}\r\nfor i,a in enumerate(map(int,input().split())):\r\n c,_,l=d.get(a,(0,0,i))\r\n d[a]=(c+1,l-i,l)\r\n_,h,l=max(d.values())\r\nprint(l+1,l-h+1)", "n = int(input())\na = [int(x) for x in input().split()]\nl = [-1] * (10**6 + 1)\nr = [-1] * (10**6 + 1)\nc = [0] * (10**6 + 1)\nfor i in range(len(a)):\n\tx = a[i]\n\tif l[x] == -1:\n\t\tl[x] = i\n\tr[x] = i\n\tc[x] += 1\nm = 0\nx = -1\nfor i in range(len(c)):\n\tif c[i] > m:\n\t\tm = c[i]\n\t\tx = i\n\telif c[i] == m and r[i] - l[i] < r[x] - l[x]:\n\t\tx = i\nprint(l[x] + 1, r[x] + 1)\n", "n = int(input())\na = list(map(int, input().split()))\n\ndata = {}\nfor i, ai in enumerate(a, 1):\n if ai not in data:\n data[ai] = [1, i, i]\n else:\n data[ai][0] += 1\n data[ai][2] = i\n\nfor results in sorted(data.values(), key=lambda data: (-data[0], data[2] - data[1])):\n print(results[1], results[2])\n break", "def main():\r\n M = 1000005\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n interval = [(-1, -1) for _ in range(M)]\r\n count = [0 for _ in range(M)]\r\n for i in range(len(a)):\r\n x = a[i]\r\n count[x] += 1\r\n if interval[x][0] == -1:\r\n interval[x] = (i, i)\r\n else:\r\n interval[x] = (interval[x][0], i)\r\n\r\n beauty = max(count)\r\n left, right = -1, M\r\n for x in range(M):\r\n if count[x] == beauty and interval[x][1] - interval[x][0] < right - left:\r\n left, right = interval[x][0], interval[x][1]\r\n print('{0} {1}'.format(left + 1, right + 1))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import collections\r\n\r\nn = int(input())\r\nAs = list(map(int, input().split()))\r\n\r\ndef solve(n, As):\r\n counter = collections.Counter(As)\r\n candidates = []\r\n prev_freq = 0\r\n for num, freq in counter.most_common():\r\n if prev_freq and prev_freq!= freq:\r\n break\r\n candidates.append(num)\r\n prev_freq = freq\r\n lr = {cand:[] for cand in candidates}\r\n for i, a in enumerate(As, 1):\r\n if a in lr:\r\n lr[a].append(i)\r\n minspan = float('inf')\r\n for pos in lr.values():\r\n if pos[-1] - pos[0] < minspan:\r\n minspan = pos[-1] - pos[0]\r\n LR = (pos[0], pos[-1])\r\n return LR\r\n\r\nprint(*solve(n, As))\r\n", "A=dict()\r\nn = int(input())\r\na=input().split()\r\nfor i in range(len(a)):\r\n if a[i] in A:\r\n A[a[i]][0] +=1\r\n A[a[i]][2] = i\r\n else:\r\n A[a[i]] = [1,i,i]\r\nper = 0\r\nanswer = [0] * len(A)\r\nfor j in A:\r\n answer[per] = A[j]\r\n per+=1\r\nanswer.sort(key = lambda x: (int(x[0]), -(int(x[2])-int(x[1]))))\r\nprint(answer[-1][1]+1,answer[-1][2]+1)\r\n", "size = int(input())\r\narr = input()\r\n\r\narr = [int(a) for a in arr.split(\" \")]\r\n\r\n\r\nhold = {}\r\n\r\n\r\nfor j, i in enumerate(arr):\r\n if i not in hold:\r\n hold[i] = [1, j, j]\r\n else:\r\n hold[i][0] += 1\r\n hold[i][2] = j\r\n \r\n\r\n# find max\r\nmaxele, maxval = -1, -1\r\nfor k in hold.keys():\r\n if hold[k][0] > maxval:\r\n maxele = k\r\n maxval = hold[k][0]\r\n elif hold[k][0] == maxval:\r\n if (hold[k][2] - hold[k][1]) < (hold[maxele][2] - hold[maxele][1]):\r\n maxele = k\r\n\r\nl, r = 0, size -1\r\n\r\n\r\nwhile arr[l] != maxele or arr[r] != maxele:\r\n if arr[l] != maxele:\r\n l += 1\r\n if arr[r] != maxele:\r\n r -= 1\r\nprint(l+1, r+1)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nal = input().split(' ')\r\nd = {}\r\nfor i in range(n):\r\n j = al[i]\r\n if j not in d:\r\n d[j] = [1, i, i]\r\n else:\r\n d[j][0] += 1\r\n d[j][2] = i\r\nm = max([i[0] for i in d.values()])\r\nl = float('inf')\r\nfor i in d:\r\n if d[i][0] == m:\r\n if d[i][2]-d[i][1] < l:\r\n ans = d[i]\r\n l = d[i][2]-d[i][1]\r\nprint(ans[1]+1,ans[2]+1)\r\n", "import sys\r\ninput= lambda:sys.stdin.readline()\r\nMOD = 1000000007\r\nii = lambda: int(input())\r\nsi = lambda: input()\r\ndgl = lambda: list(map(int, input()))\r\nf = lambda: list(map(int, input().split()))\r\nil = lambda: list(map(int, input().split()))\r\nls = lambda: list(input())\r\nn=ii()\r\nl=il()\r\nd=dict()\r\ns1=set()\r\ns2=set()\r\nfor i in l:\r\n d[i]=d.get(i,0)+1\r\nmx=max(d[i] for i in d)\r\nfor i in d:\r\n if d[i] == mx:\r\n s1.add(i)\r\n s2.add(i)\r\nd=dict()\r\nfor i in range(n):\r\n if len(s1)==0:\r\n break\r\n if l[i] in s1:\r\n d[l[i]]=[i]\r\n s1.discard(l[i])\r\nmn=10**12\r\nfor i in range(n-1,-1,-1):\r\n if len(s2)==0:\r\n break\r\n if l[i] in s2:\r\n mn=min(i-d[l[i]][0],mn)\r\n d[l[i]].append(i)\r\n s2.discard(l[i])\r\nfor i in d:\r\n if (d[i][1]-d[i][0])==mn:\r\n print(d[i][0]+1,d[i][1]+1)\r\n break", "n = int(input())\r\na = list(map(int, input().split()))\r\ncounter = {}\r\nindex = {}\r\nbeauty = 0\r\nbeauty_start = 0\r\nbeauty_end = 0\r\nfor i in range(n):\r\n\tai = a[i]\r\n\tif ai not in counter:\r\n\t\tcounter[ai] = 1\r\n\t\tindex[ai] = (i, i)\r\n\telse:\r\n\t\tcounter[ai] += 1\r\n\t\tindex[ai] = (index[ai][0], i)\r\n\tif counter[ai] > beauty:\r\n\t\tbeauty = counter[ai]\r\n\t\tbeauty_start = index[ai][0]\r\n\t\tbeauty_end = index[ai][1]\r\n\telif counter[ai] == beauty:\r\n\t\tk = index[ai]\r\n\t\tif k[1] - k[0] < beauty_end - beauty_start:\r\n\t\t\tbeauty_start = k[0]\r\n\t\t\tbeauty_end = k[1]\r\nprint(beauty_start+1, beauty_end+1)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = dict()\r\nfor i, e in enumerate(a):\r\n if e in d:\r\n c, l, r = d[e]\r\n d[e] = (c + 1, l, i)\r\n else:\r\n d[e] = (1, i, i)\r\nans_c, ans_l, ans_r = 0, 0, n - 1\r\nfor c, l, r in d.values():\r\n if (c > ans_c) or (c == ans_c and r - l < ans_r - ans_l):\r\n ans_c, ans_l, ans_r = c, l, r\r\nprint(ans_l + 1, ans_r + 1)", "input(); d = {}\nfor i, a in enumerate(map(int, input().split())):\n c, _, l = d.get(a, (0, 0, i))\n d[a] = (c + 1, l - i, l)\n_, h, l = max(d.values())\nprint(l + 1, l - h + 1)", "n = int(input())\na = [int(i) for i in input().split()]\n\nx = 1000000 + 1\nm = 0\nc = [0] * x\nl = [-1] * x\nr = [-1] * x\noo = -1\nrr = -1\nll = -1\n\nfor i in range(len(a)):\n c[a[i]] += 1\n if c[a[i]] > m:\n m = c[a[i]]\n if l[a[i]] == -1:\n l[a[i]] = i\n r[a[i]] = i\n\n#print(m)\n#print(c)\n#print(l)\n#print(r)\n\nfor i in range(x):\n if m == c[i]:\n o = r[i] - l[i]\n if (oo == -1) or (o < oo):\n oo = o\n rr = r[i]\n ll = l[i]\n\nprint(ll + 1, rr + 1)\n\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncnt = {}\r\nfor i in range(n):\r\n if arr[i] not in cnt:\r\n cnt[arr[i]] = [0, i, i]\r\n cnt[arr[i]][0] += 1\r\n cnt[arr[i]][2] = i\r\nres = [0, 0, 0]\r\nfor c, i, j in cnt.values():\r\n if c > res[0] or (c == res[0] and j - i < res[2] - res[1]):\r\n res = [c, i, j]\r\nprint(res[1] + 1, res[2] + 1)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\ncount = {}\r\nfirst = {}\r\nlast = {}\r\n\r\nfor i in range(n):\r\n if a[i] not in count.keys():\r\n count[a[i]] = 0\r\n first[a[i]] = i\r\n count[a[i]] += 1\r\n last[a[i]] = i\r\n\r\nmaxCount = 0\r\ntarget = []\r\n\r\nfor key in count.keys():\r\n if count[key] > maxCount:\r\n maxCount = count[key]\r\n target = [key]\r\n elif count[key] == maxCount:\r\n target.append(key)\r\n\r\nans = 999999999\r\noutput = ''\r\nfor t in target:\r\n if last[t] - first[t] < ans:\r\n ans = last[t] - first[t]\r\n output = str(first[t] + 1) + ' ' + str(last[t] + 1)\r\n\r\nprint(output)\r\n", "#!/usr/bin/env python\n# 558B_larray.py - Codeforces.com 558B Larray quiz\n#\n# Copyright (C) 2015 Sergey\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\n\"\"\"\nHelp Amr by choosing the smallest subsegment possible.\nInput\n\nThe first line contains one number n , the size of the array.\n\nThe second line contains n integers ai , representing elements of the\narray.\nOutput\n\nOutput two integers l,r, the beginning and the end of the subsegment\nchosen respectively.\n\nIf there are several possible answers you may output any of them.\n\"\"\"\n\n# Standard modules\nimport unittest\nimport sys\nimport re\nimport random\nimport bisect\nimport array\n\n# Additional modules\n\n\n###############################################################################\n# Larray Class\n###############################################################################\n\n\nclass Larray:\n \"\"\" Larray representation \"\"\"\n\n def __init__(self, args):\n \"\"\" Default constructor \"\"\"\n\n self.n = args[0]\n self.list = args[1]\n\n self.freq = {}\n for i in range(self.n):\n\n key = self.list[i]\n if key in self.freq:\n (it, len, min, max) = self.freq[key]\n it += 1\n if i < min:\n min = i\n len = min - max\n if i > max:\n max = i\n len = min - max\n self.freq[key] = (it, len, min, max)\n else:\n self.freq[key] = (1, 0, i, i)\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n values = sorted(self.freq.values())\n result = [values[-1][2]+1, values[-1][3]+1]\n\n return str(\" \".join(map(str, result)))\n\n\n###############################################################################\n# Helping classes\n###############################################################################\n\n\n###############################################################################\n# Executable code\n###############################################################################\n\n\ndef get_inputs(test_inputs=None):\n\n it = iter(test_inputs.split(\"\\n\")) if test_inputs else None\n\n def uinput():\n \"\"\" Unit-testable input function wrapper \"\"\"\n if it:\n return next(it)\n else:\n return sys.stdin.readline()\n\n # Getting string inputs. Place all uinput() calls here\n num = int(uinput())\n nums = list(map(int, uinput().split()))\n\n # Decoding inputs into a list\n return [num, nums]\n\n\ndef calculate(test_inputs=None):\n \"\"\" Base class calculate method wrapper \"\"\"\n return Larray(get_inputs(test_inputs)).calculate()\n\n\n###############################################################################\n# Unit Tests\n###############################################################################\n\n\nclass unitTests(unittest.TestCase):\n\n def test_sample_tests(self):\n \"\"\" Quiz sample tests. Add \\n to separate lines \"\"\"\n\n # Sample test 1\n test = \"5\\n1 1 2 2 1\"\n self.assertEqual(calculate(test), \"1 5\")\n self.assertEqual(get_inputs(test)[0], 5)\n self.assertEqual(list(get_inputs(test)[1]), [1, 1, 2, 2, 1])\n\n # Sample test 2\n test = \"5\\n1 2 2 3 1\"\n self.assertEqual(calculate(test), \"2 3\")\n\n # Sample test 3\n test = \"6\\n1 2 2 1 1 2\"\n self.assertEqual(calculate(test), \"2 6\")\n\n # Time limit test\n imax = 10000\n test = str(imax)\n test += \"\\n\" + \" \".join(map(str, range(imax)))\n self.assertEqual(calculate(test), \"10000 10000\")\n\n def test_Larray_class__basic_functions(self):\n \"\"\" Larray class basic functions testing \"\"\"\n\n # Constructor test\n d = Larray([5, [1, 1, 2, 2, 1]])\n self.assertEqual(d.list[0], 1)\n self.assertEqual(d.freq[1], (3, -4, 0, 4))\n\nif __name__ == \"__main__\":\n\n # Avoiding recursion limitaions\n sys.setrecursionlimit(100000)\n\n if sys.argv[-1] == \"-ut\":\n unittest.main(argv=[\" \"])\n\n # Print the result string\n sys.stdout.write(calculate())\n", "\nN=1000001\n\nnum={}\n\nn=int(input())\n\ni=1\nfor x in input().split():\n x=int(x)\n if num.get(x)==None:\n num.setdefault(x,(i,i,1))\n else:\n num[x]=(num[x][0],i,num[x][2]+1)\n i=i+1\n\nansn=0\nansl=0\nansr=n\nfor x,(l,r,n) in num.items():\n ansn=max(ansn,n)\n\nfor x,(l,r,n) in num.items():\n if n==ansn and ansr-ansl>r-l:\n ansr=r\n ansl=l\n\nprint(ansl,ansr)\n", "def cmp_to_key(mycmp):\r\n 'Convert a cmp= function into a key= function'\r\n\r\n class K:\r\n def __init__(self, obj, *args):\r\n self.obj = obj\r\n\r\n def __lt__(self, other):\r\n return mycmp(self.obj, other.obj) < 0\r\n\r\n def __gt__(self, other):\r\n return mycmp(self.obj, other.obj) > 0\r\n\r\n def __eq__(self, other):\r\n return mycmp(self.obj, other.obj) == 0\r\n\r\n def __le__(self, other):\r\n return mycmp(self.obj, other.obj) <= 0\r\n\r\n def __ge__(self, other):\r\n return mycmp(self.obj, other.obj) >= 0\r\n\r\n def __ne__(self, other):\r\n return mycmp(self.obj, other.obj) != 0\r\n\r\n return K\r\n\r\n\r\ndef compare(x, y):\r\n if x[2] != y[2]:\r\n return y[2] - x[2]\r\n return (x[1] - x[0]) - (y[1] - y[0])\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n d = list(map(int, input().split()))\r\n r = {}\r\n for i in range(n):\r\n if d[i] in r:\r\n r[d[i]] = [r[d[i]][0], i + 1, r[d[i]][2]+1]\r\n else:\r\n r[d[i]] = [i + 1, i + 1, 1]\r\n\r\n sr = sorted(r.values(), key=cmp_to_key(compare))\r\n print(sr[0][0], sr[0][1])\r\n\r\n\r\nmain()\r\n", "def solve():\r\n d1 = {}\r\n d2 = {}\r\n input()\r\n l = list(map(int,input().split()))\r\n for idx, i in enumerate(l):\r\n #print(idx, i)\r\n if i not in d1:\r\n d1[i] = [1,idx,idx]\r\n else:\r\n d1[i][0]+=1\r\n d1[i][2]=idx\r\n\r\n for k,v in d1.items():\r\n if v[0] in d2:\r\n d2[v[0]].append(k)\r\n else:\r\n d2[v[0]] = [k]\r\n\r\n sd2 = sorted(d2.items(), reverse=True)\r\n # print(d1)\r\n # print(d2)\r\n # print(sd2)\r\n\r\n\r\n v = sd2[0][1]\r\n\r\n if len(v) == 1:\r\n print(d1[v[0]][1] + 1, d1[v[0]][2] + 1)\r\n else:\r\n shortestDistance = 10**5\r\n leftIndex = -1\r\n rightIndex = -1\r\n for elem in v:\r\n if d1[elem][2] - d1[elem][1] < shortestDistance:\r\n shortestDistance = d1[elem][2] - d1[elem][1]\r\n leftIndex = d1[elem][1]\r\n rightIndex = d1[elem][2]\r\n print(leftIndex + 1, rightIndex + 1)\r\n\r\n\r\n\r\n\r\nsolve()", "# 558B\r\n# O(log(10^6)*10^6) time\r\n# θ(10^6) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n seq = [0] * 1000001\r\n for i in range(1, 1000001):\r\n seq[i] = i\r\n cnt = [0] * 1000001\r\n fst = [-1] * 1000001\r\n lst = [-1] * 1000001\r\n n = read()\r\n a = read(3)\r\n for i in range(n):\r\n cnt[a[i]] += 1\r\n lst[a[i]] = i\r\n if fst[a[i]] == -1:\r\n fst[a[i]] = i\r\n seq.sort(key=lambda i: (cnt[i], fst[i] - lst[i]), reverse=True)\r\n return fst[seq[0]] + 1, lst[seq[0]] + 1\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s='\\n'):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s)\r\n\r\n\r\nwrite(main())", "# Description of the problem can be found at http://codeforces.com/problemset/problem/558/B\r\n\r\nn = int(input())\r\nl_i = list(map(int, input().split()))\r\n\r\nd = {}\r\nm_b = 0\r\nm_b_i = 0\r\nm_l = 0\r\n\r\nfor i in range(n):\r\n if l_i[i] not in d:\r\n d[l_i[i]] = [0, i]\r\n d[l_i[i]][0] += 1\r\n \r\n if d[l_i[i]][0] > m_b:\r\n m_b = d[l_i[i]][0]\r\n m_b_i = i\r\n m_l = i - d[l_i[i]][1]\r\n elif d[l_i[i]][0] == m_b and i - d[l_i[i]][1] < m_l:\r\n m_b = d[l_i[i]][0]\r\n m_b_i = i\r\n m_l = i - d[l_i[i]][1]\r\n\r\nprint(d[l_i[m_b_i]][1] + 1, m_b_i + 1)", "N=int(input())\r\n\r\nA=list(map(int,input().split()))\r\nR=[0]*1000000\r\nL=[0]*1000000\r\nCnt=[0]*1000000\r\nMx=0\r\nfor I in range(N):\r\n Cnt[A[I]-1]+=1\r\n R[A[I]-1]=I\r\n if Cnt[A[I]-1]==1:\r\n L[A[I]-1]=I\r\n Mx=max(Mx,Cnt[A[I]-1])\r\nAns=N+1\r\nLL=RR=0\r\nfor I in range(1000000):\r\n if Cnt[I]==Mx and R[I]-L[I]<Ans:\r\n Ans=R[I]-L[I]\r\n LL=L[I]\r\n RR=R[I]\r\nprint(LL+1,RR+1)\r\n", "n=int(input())\na=[int(x)for x in input().split()]\nd,mx=dict(),0\nfor i in range(n):\n cur=d.setdefault(a[i],[0,0,i])\n cur[1]=-(i-cur[2]);cur[0]+=1\n d[a[i]]=cur\n mx=max(mx,cur[0])\nc=max(d.values())\nprint(c[2]+1,c[2]-c[1]+1)\n", "#!/usr/bin/env python3\n\nimport sys\n\nN = int(input())\nA = list(map(int, input().split(' ')))\n\nleft_idx = {}\nright_idx = {}\ncount = {}\n\nfor i, e in enumerate(A):\n if e not in count:\n count[e] = 0\n count[e] += 1\n if e not in left_idx:\n left_idx[e] = i\n if i < left_idx[e]:\n left_idx[e] = i\n if e not in right_idx:\n right_idx[e] = i\n if right_idx[e] < i:\n right_idx[e] = i\n\nmax_count = max(count[c] for c in count)\nitems_with_mc = [i for i in count if count[i] == max_count]\n\nspan_i = [(right_idx[i] - left_idx[i], i) for i in items_with_mc]\n\niwms = min(span_i)[1]\n\nprint(left_idx[iwms] + 1, right_idx[iwms] + 1)", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nfrom collections import Counter\n\n\ndef solve(n, xs):\n rxs = list(reversed(xs))\n length = len(xs)\n counter = {}\n # counter = Counter(xs)\n # m = counter.most_common(1)[0][1]\n for i, x in enumerate(xs):\n if x in counter:\n counter[x]['cnt'] += 1\n counter[x]['last'] = i\n else:\n counter[x] = {'cnt': 0, 'first': i, 'last': i}\n ts = sorted(counter.items(), key=lambda t: t[1]['cnt'], reverse=True)\n maxs = []\n mv = 0 # max value\n mr = float('inf') # max range\n rkey = 0 # result key\n for t in ts:\n k, d = t\n r = d['last'] - d['first']\n if mv <= d['cnt'] and mr > r:\n mv = d['cnt']\n mr = r\n rkey = k\n return counter[rkey]['first'] + 1, counter[rkey]['last'] + 1\n # maxs = map(lambda x: x[0], filter(lambda x: x[1] == m, counter.most_common()))\n # r = float('inf')\n # rf = 0\n # rl = 0\n # for x in maxs:\n # first = xs.index(x)\n # last = length - rxs.index(x) - 1\n # l = last - first + 1\n # if r > l:\n # r = l\n # rf = first\n # rl = last\n # return rf + 1, rl + 1\n\n\ndef getinput():\n def getints_line():\n return list(map(int, input().split(' ')))\n n = int(input())\n xs = getints_line()\n return n, xs\n\n\ndef test():\n # print(solve(5, [1, 1, 2, 2, 1]))\n # print(solve(5, [1, 2, 2, 3, 1]))\n # print(solve(6, [1, 2, 2, 1, 1, 2]))\n assert solve(5, [1, 1, 2, 2, 1]) == (1, 5)\n assert solve(5, [1, 2, 2, 3, 1]) == (2, 3)\n assert solve(6, [1, 2, 2, 1, 1, 2]) == (1, 5)\n\n\ndef main():\n # test()\n # print(*getinput())\n print(' '.join(map(str, solve(*getinput()))))\n # print('\\n'.join(map(str, solve(*getinput()))))\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n if(a[i] in d):\r\n d[a[i]]=[d[a[i]][0],i+1]\r\n else:\r\n d[a[i]]=[i+1,i+1]\r\nd1={}\r\nfor i in a:\r\n if(i in d1):\r\n d1[i]+=1\r\n else:\r\n d1[i]=1\r\nb=list(d1.items())\r\nb.sort(reverse=True,key=lambda x:x[1])\r\nym=b[0][1]\r\nm=9999999\r\ns=e=-1\r\nfor i in b:\r\n x,y=i[0],i[1]\r\n if(y!=ym):\r\n break\r\n if(d[x][1]-d[x][0]<m):\r\n m=d[x][1]-d[x][0]\r\n s=d[x][0]\r\n e=d[x][1]\r\nprint(s,e)", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = dict()\r\nd = set()\r\ne = dict()\r\nkolv = dict()\r\nmaxi = 0\r\nans = [0]\r\nfor i in range(n):\r\n if a[i] not in d:\r\n c[a[i]] = i\r\n kolv[a[i]] = 1\r\n else:\r\n kolv[a[i]] += 1\r\n d.add(a[i])\r\nd = set()\r\nfor i in range(n - 1, -1, -1):\r\n if a[i] not in d:\r\n e[a[i]] = i\r\n d.add(a[i])\r\nd = set()\r\nmass = []\r\nfor i in a:\r\n if i not in d:\r\n d.add(i)\r\n mass.append((kolv[i], c[i] - e[i], c[i], e[i]))\r\nprint(max(mass)[2] + 1, max(mass)[3] + 1)\r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\nhash_map = dict()\r\nfor i in range(len(array)):\r\n if array[i] not in hash_map:\r\n hash_map[array[i]] = [i + 1]\r\n else:\r\n hash_map[array[i]].append(i + 1)\r\nseg = 10e7\r\nl, r = 0, 0\r\nmax_len = 0\r\nfor v in hash_map.values():\r\n max_len = max(max_len, len(v))\r\n\r\nfor v in hash_map.values():\r\n if v[-1] - v[0] + 1 < seg and len(v) == max_len:\r\n seg = v[-1] - v[0] + 1\r\n l, r = v[0], v[-1]\r\nprint(l, r)\r\n", "\nn=int(input())\na=[int(x)for x in input().split()]\nd=dict()\nmx=0\nfor i in range(n):\n cur=d.setdefault(a[i],[0,i,i])\n cur[0]+=1;cur[2]=i\n d[a[i]]=cur\n mx=max(mx,cur[0])\nans=[0,9999999]\nfor i in d.keys():\n if d[i][0]==mx:\n ans=ans if d[i][2]-d[i][1]>ans[1]-ans[0] else [d[i][1],d[i][2]]\nprint(ans[0]+1,ans[1]+1)\n\n", "def main():\n n, d = int(input()), {}\n for i, a in enumerate(map(int, input().split())):\n c, _, l = d.get(a, (0, 0, i))\n d[a] = (c + 1, l - i, l)\n _, h, l = max(d.values())\n print(l + 1, l - h + 1)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nmas=list(map(int,input().split(\" \")))\r\ndic={i:[0,-1,-1] for i in set(mas)}\r\nma=0\r\nfor i in range(n):\r\n if dic[mas[i]][1]==-1:\r\n dic[mas[i]][1]=i\r\n dic[mas[i]][0]+=1\r\n dic[mas[i]][2]=i\r\n if dic[mas[i]][0]>ma:ma=dic[mas[i]][0]\r\nmi=9999999999\r\na=0\r\nb=0\r\nfor i in range(n):\r\n if(dic[mas[i]][0]==ma and dic[mas[i]][2]-dic[mas[i]][1]<mi):\r\n a=dic[mas[i]][1]\r\n b=dic[mas[i]][2]\r\n mi=b-a\r\nprint(a+1,b+1)\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd={}\r\nfor i in range(len(l)):\r\n if l[i] in d:\r\n d[l[i]][0]+=1\r\n d[l[i]][2] =i+1\r\n else:\r\n d[l[i]] = [1,i+1,i+1]\r\nmaxi = 0\r\ndiff = 99999999999999\r\nl=-1\r\nr=-1\r\nfor i in d:\r\n maxi = max(maxi,d[i][0])\r\nfor i in d:\r\n if d[i][0]==maxi:\r\n if diff>d[i][2]-d[i][1]:\r\n diff = d[i][2]-d[i][1]\r\n l = d[i][1]\r\n r = d[i][2]\r\nprint(l,r)\r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ncur = 0\r\nd = [[0, -1, -1]] * (max(a) + 1)\r\nfor i in range(n):\r\n if d[a[i]][1] == -1:\r\n d[a[i]] = [1, i, i]\r\n else:\r\n d[a[i]][0] += 1\r\n d[a[i]][2] = i\r\nmaxcnt = max(d, key=lambda x: x[0])[0]\r\ncur = 10000000001\r\nfor i in d:\r\n if (i[0] == maxcnt) and (i[2] - i[1] < cur):\r\n cur = i[2] - i[1]\r\n fin = [i[1] + 1, i[2] + 1]\r\nprint(fin[0], fin[1])\r\n", "from operator import itemgetter\n\n\nclass CodeforcesTask558BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.array = []\n\n def read_input(self):\n self.n = int(input())\n self.array = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n beauty_count = [0] * (10 ** 6)\n for a in self.array:\n beauty_count[a - 1] += 1\n mx_b = max(beauty_count)\n maxes = [x + 1 for x in range(10 ** 6) if mx_b == beauty_count[x]]\n mx_set = set(maxes)\n starts = {}\n stops = {}\n results = []\n #print(maxes)\n for x in range(self.n):\n if len(starts) == len(mx_set):\n break\n if self.array[x] in mx_set:\n if self.array[x] not in starts:\n starts[self.array[x]] = x\n for x in range(1, self.n + 1):\n #print(x, self.array[-x])\n if len(stops) == len(mx_set):\n break\n if self.array[-x] in mx_set:\n if self.array[-x] not in stops:\n stops[self.array[-x]] = self.n - x\n #print(starts, stops)\n for r in mx_set:\n #print(r)\n results.append((starts[r], stops[r], stops[r] - starts[r]))\n results.sort(key=itemgetter(2))\n #print(results)\n self.result = \"{0} {1}\".format(results[0][0] + 1, results[0][1] + 1)\n\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask558BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\ndef process(A):\r\n n = len(A)\r\n d = {}\r\n for i in range(n):\r\n ai = A[i]\r\n if ai not in d:\r\n d[ai] = [1, i, i]\r\n else:\r\n d[ai][0]+=1\r\n d[ai][2] = i\r\n my_max = [0, None]\r\n for ai in d:\r\n c, l, r = d[ai]\r\n if c > my_max[0]:\r\n my_max = [c, [l, r]]\r\n elif c==my_max[0]:\r\n l2, r2 = my_max[1]\r\n if r-l < r2-l2:\r\n my_max[1] = [l, r]\r\n l, r = my_max[1]\r\n sys.stdout.write(f'{l+1} {r+1}\\n')\r\n \r\n \r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprocess(A)", "n = int(input())\na = [int(x) for x in input().split()]\ncount = [0] * (1000000 + 1)\nleft = [0] * 1000001\nright = [0] * 1000001\n\nfor i in range(n):\n count[a[i]] += 1\n if left[a[i]] == 0:\n left[a[i]] = i + 1\nfor i in range(n-1, -1, -1):\n if right[a[i]] == 0:\n right[a[i]] = i + 1\nm = 0\nmi = 0\nfor i in range(1, 1000001):\n if count[i] > m:\n m = count[i]\n mi = i\n elif count[i] == m:\n if right[i] - left[i] < right[mi] - left[mi]:\n m = count[i]\n mi = i\nprint(left[mi], right[mi])\n\n\n", "n = int(input())\na = list(map(int, input().split()))\nl = r = None\nc = 0\nd = {}\nfor i, e in enumerate(a):\n if e not in d:\n d[e] = [i]\n else:\n d[e] += [i]\n\nfor v in d.values():\n lv = len(v)\n if l is None or lv > c:\n l, r, c = v[0], v[-1], lv\n elif lv == c and r-l > v[-1]-v[0]:\n l, r = v[0], v[-1]\n\n\nprint(l+1, r+1)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nlr = {}\r\nfor i in range(n):\r\n c, l, r = lr.setdefault(a[i], (1, i, i))\r\n if r != i:\r\n lr[a[i]] = (c + 1, l, i)\r\nmc = max(c for c, l, r in lr.values())\r\nx, l, r = min((r - l + 1, l, r) for c, l, r in lr.values() if c == mc)\r\nprint(l + 1, r + 1)", "# Link - https://codeforces.com/contest/558/problem/B\n# Time: O(n)\n\nfrom collections import defaultdict\n\nn = int(input())\na = list(map(int, input().split()))\n\nM, counter = 0, defaultdict(int)\nfirst, last = {}, {}\n\nfor i, x in enumerate(a):\n counter[x] += 1\n M = max(M, counter[x])\n if x not in first:\n first[x] = i\n last[x] = i\n\nl, r = -1, -1\nfor x in a:\n if counter[x] == M:\n if l == -1 or last[x] - first[x] < r - l:\n l, r = first[x], last[x]\n\nprint(l + 1, r + 1)\n\n\"\"\"\n\n# find the max freq\nm, counter = 0, defaultdict(int)\nfor x in a:\n counter[x] += 1\n m = max(m, counter[x])\n\ncounter.clear()\n\ni, j = 0, 0\nl, r = -1, -1\n\n# sliding window\nwhile j < n:\n counter[a[j]] += 1\n while counter[a[j]] >= m:\n if l == -1 or r - l > j - i:\n l, r = i, j\n counter[a[i]] -= 1\n i += 1\n j += 1\n\nprint(l + 1, r + 1)\n\n\n\"\"\"\n", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n temp_dict = {}\r\n min_distance, max_occurance, min_distance_l, min_distance_r = (\r\n float(\"inf\"),\r\n float(\"-inf\"),\r\n 0,\r\n 0,\r\n )\r\n for index, element in enumerate(arr):\r\n if element in temp_dict:\r\n temp_dict[element].append(index + 1)\r\n else:\r\n temp_dict[element] = [index + 1]\r\n\r\n if len(temp_dict[element]) > max_occurance:\r\n max_occurance = len(temp_dict[element])\r\n\r\n l = temp_dict[element][0]\r\n r = temp_dict[element][-1]\r\n distance = r - l + 1\r\n\r\n min_distance = distance\r\n min_distance_l = l\r\n min_distance_r = r\r\n elif len(temp_dict[element]) == max_occurance:\r\n l = temp_dict[element][0]\r\n r = temp_dict[element][-1]\r\n distance = r - l + 1\r\n\r\n if distance < min_distance:\r\n min_distance = distance\r\n min_distance_l = l\r\n min_distance_r = r\r\n\r\n print(min_distance_l, min_distance_r)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "n, k = list(map(int,input().strip().split(' ')))\r\nholidays = list(map(int,input().strip().split(' ')))[1:]\r\nprev = 0\r\ni = 0\r\ninc = 0\r\npres = 0\r\nwhile i < n:\r\n i += 1\r\n inc += 1\r\n if inc == k or i in holidays:\r\n prev = i\r\n inc = 0\r\n pres += 1\r\nprint(pres)", "def findNext(cursor: int, k: int, holidays: list) -> int:\r\n i = cursor + 1\r\n\r\n while i < cursor + k:\r\n if i in holidays:\r\n return i\r\n\r\n i += 1\r\n\r\n return i\r\n\r\n\r\nn, k = [int(item) for item in input().split(' ')]\r\nholidays = [int(item) for item in input().split(' ')]\r\ndel holidays[0]\r\n\r\nans, cursor = 0, 0\r\n\r\nwhile cursor <= n:\r\n cursor = findNext(cursor, k, holidays)\r\n if cursor <= n:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n'''\r\n\r\nn = 20 k = 5\r\n3 6 14 15\r\n1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20\r\n ^ ^ ^ ^ ^ ^\r\n\r\n'''", "n, k = map(int, input().split())\nh, d, hi, v = list(map(int, input().split())) + [n + 1], 0, 1, -1\nwhile d <= n:\n v += 1\n if h[hi] <= d + k:\n d = h[hi]\n hi += 1\n else:\n d += k\nprint(v)\n", "def cpd(fd,sd,k):\r\n\td=sd-fd-1\r\n\treturn d//k\r\n\r\nn,k=[int(x) for x in input().split(' ')]\r\nvp=[int(x) for x in input().split(' ')]\r\nnp=vp[0]\r\nvp[0]=0\r\nvp.append(n+1)\r\nsm=len(vp)-2\r\nfor c in range(len(vp)-1):\r\n\tsm+=cpd(vp[c],vp[c+1],k)\r\nprint(sm)", "n, k = list(map(int, input().split()))\r\n\r\na = list(map(int, input().split()))\r\nc, *a = a\r\nif c == 0:\r\n print(n // k)\r\nelse:\r\n res = len(a)\r\n for i in range(1, len(a)):\r\n if a[i] - a[i - 1] > k:\r\n res += (a[i] - a[i - 1]) // k\r\n if (a[i] - a[i - 1]) % k == 0:\r\n res -= 1\r\n if a[0] - 1 >= k:\r\n res += (a[0] - 1) // k\r\n if n - a[-1] >= k:\r\n res += (n - a[-1]) // k\r\n print(res)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=1\r\nans=0\r\nfor i in range(1,n+1):\r\n if i in a[1:]:\r\n ans+=1\r\n t=1\r\n elif t==k:\r\n ans+=1\r\n t=1\r\n else:\r\n t+=1\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\nz=list(map(int,input().split()[1:]))\r\nans,t=0,1\r\nfor i in range(1,a+1):\r\n if i in z:ans+=1;t=1\r\n elif t==b:ans+=1;t=1\r\n else:t+=1\r\nprint(ans)", "n, k = map(int, input().split())\nholidays = list(map(int, input().split()))[1:]\n\ncount = 0\nprevious = 0\nfor holiday in holidays:\n count += (holiday - previous - 1) // k\n count += 1\n previous = holiday\nif len(holidays) == 0 or holidays[-1] < n:\n count += (n - previous) // k\n\nprint(count)\n", "def nextMove(pos, holliday, k):\r\n for day in range(pos + 1, pos + k):\r\n if day in holliday:\r\n return day\r\n\r\n return pos + k\r\n\r\n\r\ndays, k = [int(item) for item in input().split(' ')]\r\nholliday = [int(item) for item in input().split(' ')]\r\nn, ans, pos = holliday[0], 0, 0\r\ndel holliday[:1]\r\nwhile True:\r\n pos = nextMove(pos, holliday, k)\r\n if pos > days:\r\n break\r\n ans += 1\r\n\r\nprint(ans)", "N,K = map(int, input().split());\r\ndl, d, index, ans = list(map(int, input().split()))+[N+1], 0, 1, -1;\r\n\r\nwhile(d<=N):\r\n ans+=1;\r\n if dl[index]<=d+K:\r\n d=dl[index];\r\n index+=1;\r\n else:\r\n d+=K;\r\nprint(ans)\r\n", "def nextPresent(start: int, k: int, holidays: list) -> int:\r\n i = start + 1\r\n while i < start + k:\r\n if i in holidays:\r\n return i\r\n i += 1\r\n return i\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\nholidays = list(map(int, input().split()))\r\n\r\ndel holidays[0]\r\nans, cursor = 0, 0\r\n\r\nwhile True:\r\n cursor = nextPresent(cursor, k, holidays)\r\n if cursor <= n:\r\n ans += 1\r\n else:\r\n break\r\n\r\nprint(ans)\r\n\r\n'''\r\n\r\n20 5\r\n3 7 14 16\r\n\r\n1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20\r\n ^ ^ ^ ^ ^\r\n'''\r\n", "I = lambda: map(int, input().split())\n\nn, k = I()\nC, *X = I()\nX = [0] + X + [n+1]\n\nprint(C + sum((X[i+1]-X[i]-1)//k for i in range(C+1)))\n\t\t \t\t \t\t \t \t\t\t\t \t\t\t \t", "n, k = map(int, input().split(\" \"))\r\ndays = list(map(int, input().split(\" \")))\r\n\r\nanswer = [0] + days[1:] + [n+1]\r\nans = sum([(answer[i]-answer[i-1]-1)//k for i in range(1, days[0]+2)]) + days[0]\r\n\r\nprint(ans)", "n,k=input().split()\r\nlis=input().split()\r\nlis1=lis[1:]\r\ncount=dict()\r\nfor i in lis1 :\r\n count[int(i)]=count.get(int(i),0)+1\r\nans=0\r\nprev=0\r\nfor i in range(int(n)+1) :\r\n if count.get(i,0)>0 :\r\n ans+=1\r\n prev=i\r\n elif (i-prev) >= int(k) :\r\n prev=i\r\n ans+=1\r\n \r\n \r\nprint(ans)", "N, K = map(int, input().split()) # получаем н и к \r\nholidays = [int(i) for i in input().split()] # получаем список выходных \r\nholidays.pop(0) # удаляем первый эл из списка выходных, тк это просто к-во выходных\r\n\r\nif K == 1: # на случай если между получением подарков 1 день \r\n print(N)\r\n exit()\r\n \r\ncnt = 0 # счетчик для вывода\r\nprev = 0 \r\n\r\nfor i in range(1, N + 1):\r\n if i in holidays: # если число есть в списке выходных, увеличиваем счетчик и добаляем +1 к результату\r\n cnt += 1\r\n prev = i \r\n elif i - prev >= K: # иначе проверяем чтоб разница между предидущим и текущим значением была не меньше K\r\n cnt += 1 \r\n prev = i \r\n \r\nprint(cnt)\r\n", "def searchInRange(arr: list, start: int, end: int) -> int:\r\n for i in range(start, end + 1):\r\n if i in arr:\r\n return i\r\n return -1\r\n\r\n\r\nn, k = [int(item) for item in input().split(' ')]\r\nholidays = [int(item) for item in input().split(' ')]\r\ndel holidays[:1]\r\nans, start, end = 0, 1, k\r\n\r\nwhile start <= n:\r\n day = searchInRange(holidays, start, end)\r\n if day == -1 and start + k - 1 > n:\r\n break\r\n if day == -1:\r\n start = end + 1\r\n else:\r\n start = day + 1\r\n\r\n end = start + k - 1 if start + k - 1 <= n else n\r\n ans += 1\r\n\r\nprint(ans)", "\r\nentrada1 = input().split()\r\nn, k = int(entrada1[0]), int(entrada1[1])\r\n\r\nentrada2 = input().split()\r\nc = int(entrada2[0])\r\nfestivos = []\r\nfor i in range(c):\r\n festivos.append(int(entrada2[i+1]))\r\n\r\nregalos = 0\r\nk_esimo = 0\r\nf = 0\r\n\r\ni = 1\r\nwhile i<=n:\r\n if f<c and i == festivos[f]:\r\n regalos = regalos + 1\r\n f = f+1\r\n k_esimo = 0\r\n else:\r\n k_esimo = k_esimo + 1\r\n \r\n if k_esimo == k:\r\n regalos = regalos + 1\r\n k_esimo = 0\r\n i =i+1\r\nprint(regalos)", "n, k = map(int, input().split())\r\nt = list(map(int, input().split())) + [n + 1]\r\nc, t[0] = t[0], 0\r\nprint(sum((t[i + 1] - t[i] - 1) // k for i in range(c + 1)) + c)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nc = w[0]\r\nif c == 0:\r\n print(n//k)\r\nelse:\r\n s = set()\r\n d = sum([(j-i-1)//k for (i, j) in zip(w[1:], w[2:])])\r\n d1 = (w[1]-1)//k\r\n d2 = (n-w[-1])//k\r\n print(d+d1+d2+c)\r\n", "n, k = map(int, input().split())\r\nc = list(map(int, input().split()))\r\np, cur, ans = 1, 0, 0\r\nwhile cur <= n:\r\n if p <= c[0] and c[p] <= cur + k:\r\n cur = c[p]\r\n p += 1\r\n ans += 1\r\n else:\r\n cur += k\r\n if cur <= n:\r\n ans += 1\r\nprint(ans)", "w=list(map(int,input().split()))\r\nholl=list(map(int,input().split()))[1:]\r\ntr=0\r\nq=w[1]\r\nfor e in range(1,w[0]+1):\r\n if e==q :\r\n tr+=1\r\n q+=w[1]\r\n elif e in holl :\r\n tr+=1\r\n q=e+w[1]\r\n else:\r\n pass\r\nprint(tr)\r\n", "# n, k = list(map(int, input().split(' ')))\r\n# holidays = [int(item) for item in input().split(' ')]\r\n# ans = set()\r\n# i = 0\r\n#\r\n# for i in range(i + k, n + 1, k):\r\n# ans.add(i)\r\n#\r\n# for j in range(1, len(holidays)):\r\n# if holidays[j] <= n:\r\n# ans.add(holidays[j])\r\n#\r\n# print(len(ans))\r\n#\r\n# n, k = list(map(int, input().split(' ')))\r\n# holidays = [int(item) for item in input().split(' ')]\r\n# ans = []\r\n# j = 1\r\n#\r\n# for i in range(1, n + 1):\r\n# if i == holidays[j]:\r\n# ans.append(i)\r\n# k = i + k\r\n# if len(holidays) != 2:\r\n# j += 1\r\n# elif i == k:\r\n# ans.append(i)\r\n# k = k * 2\r\n#\r\n# print(len(ans))\r\n\r\ndef nextStep(cursor, holidays, k):\r\n # helper = cursor + k\r\n # j = 0\r\n # if holidays[j] < helper:\r\n # j += 1\r\n # return holidays[j]\r\n # return helper\r\n\r\n for i in range(cursor + 1, cursor + k):\r\n if i in holidays:\r\n return i\r\n return cursor + k\r\n\r\n\r\nn, k = list(map(int, input().split(' ')))\r\nholidays = [int(item) for item in input().split(' ')]\r\ndel holidays[0]\r\nans, cursor = 0, 0\r\n\r\nwhile True:\r\n cursor = nextStep(cursor, holidays, k)\r\n if cursor <= n:\r\n ans += 1\r\n else:\r\n break\r\n\r\nprint(ans)\r\n\r\n'''\r\n5 2\r\n1 3\r\n\r\n1 2 3 4 5\r\n ^ ^ ^\r\n\r\n\r\n20 5\r\n3 8 12 18\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20\r\n ^ ^ ^ ^ ^\r\n\r\n'''\r\n" ]

[ "# import sys\r\n# sys.stdin = open('cf602a.in')\r\n\r\nn, bx = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nm, by = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\nxx = sum(v * bx**(len(x) - i - 1) for i, v in enumerate(x))\r\nyy = sum(v * by**(len(y) - i - 1) for i, v in enumerate(y))\r\n\r\nif xx < yy:\r\n\tprint('<')\r\nelif xx == yy:\r\n\tprint('=')\r\nelse:\r\n\tprint('>')", "# coding=utf8\r\n\r\nif __name__ == '__main__':\r\n n_x, b_x = str(input()).split()\r\n n_x = int(n_x)\r\n b_x = int(b_x)\r\n line_x = str(input()).split()\r\n sum_x = 0\r\n for i in range(n_x):\r\n sum_x += pow(b_x, i) * int(line_x[n_x - 1 - i])\r\n n_y, b_y = str(input()).split()\r\n n_y = int(n_y)\r\n b_y = int(b_y)\r\n line_y = str(input()).split()\r\n sum_y = 0\r\n for i in range(n_y):\r\n sum_y += pow(b_y, i) * int(line_y[n_y - 1 - i])\r\n if sum_x == sum_y:\r\n print('=')\r\n elif sum_x > sum_y:\r\n print('>')\r\n elif sum_x < sum_y:\r\n print('<')\r\n", "nx, bx = map(int, input().split(' ')[:2])\r\nxs = list(map(int, input().split(' ')[:nx]))\r\nny, by = map(int, input().split(' ')[:2])\r\nys = list(map(int, input().split(' ')[:ny]))\r\n\r\np = 1\r\nx = 0\r\nfor d in reversed(xs):\r\n x += d * p\r\n p *= bx\r\n\r\np = 1\r\ny = 0\r\nfor d in reversed(ys):\r\n y += d * p\r\n p *= by\r\n\r\nif x == y:\r\n print('=')\r\nelif x < y:\r\n print('<')\r\nelse:\r\n print('>')", "from functools import reduce\r\n \r\nBX = int( input().split()[1] )\r\nX = [ int(x) for x in input().split() ]\r\nX = reduce( lambda a,b: a*BX+b, X )\r\n \r\nBY = int( input().split()[1] )\r\nY = [ int(x) for x in input().split() ]\r\nY = reduce( lambda a,b: a*BY+b, Y )\r\n \r\nprint( '=<>'[(X<Y)+2*(X>Y)] )", "import math\r\ndef from_vase_to_decimal(b, l):\r\n counter = 0\r\n for i in range(len(l)):\r\n j = len(l) - 1 - i\r\n counter += l[j] * (b ** i)\r\n return counter\r\n\r\n\r\ndef main_function():\r\n n, b_x = [int(i) for i in input().split(\" \")]\r\n x = [int(i) for i in input().split(\" \")]\r\n m, b_y = [int(i) for i in input().split(\" \")]\r\n y = [int(i) for i in input().split(\" \")]\r\n x_10 = from_vase_to_decimal(b_x, x)\r\n y_10 = from_vase_to_decimal(b_y, y)\r\n if x_10 > y_10:\r\n print(\">\")\r\n elif x_10 == y_10:\r\n print(\"=\")\r\n else:\r\n print(\"<\")\r\n\r\nmain_function()\r\n", "n, bx = map(int, input().split(\" \"))\r\nvx = list(map(int, input().split(\" \")))\r\nres = 0\r\nfor i in range(n):\r\n res = res * bx + vx[i]\r\nn, bx = map(int, input().split(\" \"))\r\nvx = list(map(int, input().split(\" \")))\r\nret = 0\r\nfor i in range(n):\r\n ret = ret * bx + vx[i]\r\nif res == ret:\r\n print(\"=\")\r\nelse:\r\n print(\">\" if res > ret else \"<\")\r\n", "n, bx = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nm, by = map(int, input().split())\r\ny = list(map(int, input().split()))\r\ntmp = 1\r\nans = 0\r\nfor i in range(1, n + 1):\r\n ans += x[-i] * tmp\r\n tmp *= bx\r\nans1 = 0\r\ntmp = 1\r\nfor i in range(1, m + 1):\r\n ans1 += y[-i] * tmp\r\n tmp *= by\r\nif ans < ans1:\r\n print(\"<\")\r\nelif ans > ans1:\r\n print(\">\")\r\nelse:\r\n print(\"=\")\r\n\r\n", "\r\ndef f(a, b, c) :\r\n\tret = 0\r\n\tmult = 1\r\n\tfor i in range (a - 1, -1, -1) :\r\n\t\tret += int(c[i]) * mult\r\n\t\tmult = mult * b\r\n\treturn ret\r\n\r\n\r\na1 = input().split()\r\nc1 = input().split()\r\na2 = input().split()\r\nc2 = input().split()\r\n#print (a1, c1)\r\n#print (a2, c2)\r\n\r\nx = f(int(a1[0]), int(a1[1]), c1)\r\ny = f(int(a2[0]), int(a2[1]), c2)\r\nif (y == x) :\r\n\tprint(\"=\")\r\nelif (x < y) :\r\n\tprint (\"<\")\r\nelse :\r\n\tprint (\">\")\r\n", "n,b1=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nm,b2=map(int,input().split())\r\ny=list(map(int,input().split()))\r\nx=x[::-1]\r\ny=y[::-1]\r\nans1 = 0\r\nfor i in range(n):\r\n\tans1+=(b1**i)*x[i]\r\nans2 = 0 \r\nfor i in range(m):\r\n\tans2+=(b2**i)*y[i]\r\nif ans1==ans2:\r\n\tprint(\"=\")\r\nelif ans1<ans2:\r\n\tprint(\"<\")\r\nelse:\r\n\tprint(\">\")", "f=[int(i) for i in input().split()]\r\nx=[int(i) for i in input().split()]\r\ns=[int(i) for i in input().split()]\r\ny=[int(i) for i in input().split()]\r\nbx=f.pop()\r\nnx=f.pop()\r\nby=s.pop()\r\nny=s.pop()\r\nxreal=0\r\nyreal=0\r\nif bx==10:\r\n xreal=''\r\n for num in x:\r\n xreal+=str(num)\r\n xreal=int(xreal)\r\nelse:\r\n k=len(x)\r\n count=1\r\n for num in x:\r\n xreal+=num*(bx**(k-count))\r\n count+=1\r\n\r\nif by==10:\r\n yreal=''\r\n for num in y:\r\n yreal+=str(num)\r\n yreal=int(yreal)\r\nelse:\r\n k=len(y)\r\n count=1\r\n for num in y:\r\n yreal+=num*(by**(k-count))\r\n count+=1\r\nif xreal==yreal:\r\n print('=')\r\nelif xreal>yreal:\r\n print('>')\r\nelse:\r\n print('<')", "n, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nv = 0\r\nu = 0\r\nfor d in a:\r\n v = v * x + d\r\n \r\nn, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nfor d in a:\r\n u = u * x + d\r\n\r\nif (v == u):\r\n print(\"=\")\r\nif (v < u):\r\n print(\"<\")\r\nif (v > u):\r\n print(\">\")", "a = list(map(int, input().split()))\nn = a[0]\nm = a[1]\na = list(map(int, input().split()))\nfor i in range(n):\n a[n-i-1] *= m**i\nx = 0\nfor i in range(n):\n x += a[i]\nx = int(x)\n\na = list(map(int, input().split()))\nn = a[0]\nm = a[1]\na = list(map(int, input().split()))\nfor i in range(n):\n a[n-i-1] *= m**i \ny = 0\nfor i in range(n):\n y += a[i]\n\nif x<y:\n print(\"<\")\nelif x>y:\n print(\">\")\nelse:\n print(\"=\")", "n, nb = map(int, input().split())\nnl = list(map(int, input().split()))\nm, mb = map(int, input().split())\nml = list(map(int, input().split()))\nx = 0\ny = 0\nfor i in nl:\n x = x*nb+i\nfor i in ml:\n y = y*mb+i\nif x == y :\n print('=')\nelif x > y:\n print('>')\nelse:\n print('<')\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(map(int,input().split()))\r\nm,k1 = map(int,input().split())\r\nb = list(map(int,input().split()))\r\na = a[::-1]\r\nb = b[::-1]\r\ns1 = 0\r\nfor i in range(n):\r\n s1 += pow(k,i)*a[i]\r\ns2 = 0\r\nfor i in range(m):\r\n s2 += pow(k1,i)*b[i]\r\nif s1 > s2:\r\n print(\">\")\r\nelif s1 < s2:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")\r\n\r\n", "def make_num(lst, osn):\r\n result = 0\r\n for elem in lst:\r\n result *= osn\r\n result += elem\r\n return result\r\n\r\n\r\nn, bx = [int(i) for i in input().split()]\r\nnum1 = make_num(map(int, input().split()), bx)\r\nm, by = [int(i) for i in input().split()]\r\nnum2 = make_num(map(int, input().split()), by)\r\nif num1 < num2:\r\n print('<')\r\nelif num1 == num2:\r\n print('=')\r\nelse:\r\n print('>')\r\n", "read = lambda: map(int, input().split())\r\nf = lambda p, a, n: sum(a[i] * p ** (n - i - 1) for i in range(n))\r\nn, x = read()\r\nX = f(x, list(read()), n)\r\nm, y = read()\r\nY = f(y, list(read()), m)\r\nprint('<' if X < Y else '>' if X > Y else '=')\r\n", "def fun(n,m,arr):\r\n ans = 0\r\n for c in arr:\r\n ans = ans*m+c\r\n return ans\r\n\r\nres = []\r\nfor i in range(2):\r\n n,m = map(int,input().split())\r\n arr = list(map(int,input().split()))\r\n res.append(fun(n,m,arr))\r\nif res[0]==res[1]:\r\n print(\"=\")\r\nelif res[0]<res[1]:\r\n print(\"<\")\r\nelse:\r\n print(\">\")\r\n\r\n", "n, bx = tuple(map(int, input().split()))\r\nx = tuple(map(int, input().split()))\r\nm, by = tuple(map(int, input().split()))\r\ny = tuple(map(int, input().split()))\r\nX = 0\r\nfor i in range(n):\r\n X += x[n - 1 - i] * (bx ** i)\r\nY = 0\r\nfor j in range(m):\r\n Y += y[m - 1 - j] * (by ** j)\r\n \r\nif X == Y: print('=')\r\nif X > Y: print('>')\r\nif X < Y: print('<')", "a,b = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nd,e = [int(i) for i in input().split()]\r\nf = [int(i) for i in input().split()]\r\nx = 0\r\ny = 0\r\nfor i in range(a):\r\n\tx+=c[i]*b**(a-i-1)\r\nfor i in range(d):\r\n\ty+=f[i]*e**(d-i-1)\r\nif x > y: print('>')\r\nelif x < y : print('<')\r\nelse: print('=')\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl, k = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nc1 = 0\r\nc2 = 0\r\nfor i in range(n - 1, -1, -1):\r\n c1 += m ** (n - 1 - i) * a[i]\r\nfor t in range(l - 1, -1, -1):\r\n c2 += k ** (l - 1 - t) * b[t]\r\nif c1 == c2:\r\n print('=')\r\nelif c1 < c2:\r\n print('<')\r\nelse:\r\n print('>')\r\n", "n,b1=map(int, input().split())\r\nl1=list(map(int, input().split()))\r\nm,b2=map(int, input().split())\r\nl2=list(map(int, input().split()))\r\nx=y=0\r\nif l1[-1]!=0:\r\n x=l1[-1]\r\nif l2[-1]!=0:\r\n y=l2[-1]\r\np=b1\r\nfor i in range(n-2,-1,-1):\r\n x+=l1[i]*p\r\n p=p*b1\r\np=b2\r\nfor i in range(m-2,-1,-1):\r\n y+=l2[i]*p\r\n p=p*b2\r\nif x==y:\r\n print(\"=\")\r\nelif x<y:\r\n print(\"<\")\r\nelse:\r\n print(\">\")\r\n", "nx, bx = [int(i) for i in input().split()]\r\nx = [int(i) for i in input().split()]\r\nny, by = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\nresx = 0\r\nresy = 0\r\nfor i in range(nx):\r\n resx += x[i] * (bx ** (nx - i - 1))\r\nfor i in range(ny):\r\n resy += y[i] * (by ** (ny - i - 1))\r\nif resx > resy:\r\n print(\">\")\r\nelif resx == resy:\r\n print(\"=\")\r\nelse:\r\n print(\"<\")\r\n", "def solve():\r\n q,base = [int(i) for i in input().split()]\r\n s = [int(i) for i in input().split()]\r\n s = s[::-1]\r\n ans = 0\r\n\r\n for j in range(q):\r\n ans += s[j] * (base ** j)\r\n\r\n return ans\r\n\r\nx = solve()\r\ny = solve()\r\n\r\nif x > y: print(\">\")\r\nelif x < y: print(\"<\")\r\nelse: print(\"=\")", "#!/usr/bin/env python3\n# 602A_mem.py - Codeforces.com/problemset/problem/602/A by Sergey 2015\n\nimport unittest\nimport sys\n\n###############################################################################\n# Mem Class (Main Program)\n###############################################################################\n\n\nclass Mem:\n \"\"\" Mem representation \"\"\"\n\n def __init__(self, test_inputs=None):\n \"\"\" Default constructor \"\"\"\n\n it = iter(test_inputs.split(\"\\n\")) if test_inputs else None\n\n def uinput():\n return next(it) if it else sys.stdin.readline().rstrip()\n\n # Reading single elements\n [self.n, self.bx] = map(int, uinput().split())\n\n # Reading a single line of multiple elements\n self.numsx = list(map(int, uinput().split()))\n\n # Reading single elements\n [self.m, self.by] = map(int, uinput().split())\n\n # Reading a single line of multiple elements\n self.numsy = list(map(int, uinput().split()))\n\n self.x = 0\n for n in self.numsx:\n self.x = self.x * self.bx + n\n self.y = 0\n for n in self.numsy:\n self.y = self.y * self.by + n\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n if self.x == self.y:\n return \"=\"\n if self.x > self.y:\n return \">\"\n return \"<\"\n\n###############################################################################\n# Unit Tests\n###############################################################################\n\n\nclass unitTests(unittest.TestCase):\n\n def test_single_test(self):\n \"\"\" Mem class testing \"\"\"\n\n # Constructor test\n test = \"6 2\\n1 0 1 1 1 1\\n2 10\\n4 7\"\n d = Mem(test)\n self.assertEqual(d.n, 6)\n self.assertEqual(d.m, 2)\n\n # Sample test\n self.assertEqual(Mem(test).calculate(), \"=\")\n\n # Sample test\n test = \"3 3\\n1 0 2\\n2 5\\n2 4\"\n self.assertEqual(Mem(test).calculate(), \"<\")\n\n # Sample test\n test = \"7 16\\n15 15 4 0 0 7 10\\n7 9\\n4 8 0 3 1 5 0\"\n self.assertEqual(Mem(test).calculate(), \">\")\n\n # My tests\n test = \"\"\n # self.assertEqual(Mem(test).calculate(), \"0\")\n\n # Time limit test\n # self.time_limit_test(5000)\n\n def time_limit_test(self, nmax):\n \"\"\" Timelimit testing \"\"\"\n import random\n import timeit\n\n # Random inputs\n test = str(nmax) + \" \" + str(nmax) + \"\\n\"\n numnums = [str(i) + \" \" + str(i+1) for i in range(nmax)]\n test += \"\\n\".join(numnums) + \"\\n\"\n nums = [random.randint(1, 10000) for i in range(nmax)]\n test += \" \".join(map(str, nums)) + \"\\n\"\n\n # Run the test\n start = timeit.default_timer()\n d = Mem(test)\n calc = timeit.default_timer()\n d.calculate()\n stop = timeit.default_timer()\n print(\"\\nTimelimit Test: \" +\n \"{0:.3f}s (init {1:.3f}s calc {2:.3f}s)\".\n format(stop-start, calc-start, stop-calc))\n\nif __name__ == \"__main__\":\n\n # Avoiding recursion limitaions\n sys.setrecursionlimit(100000)\n\n if sys.argv[-1] == \"-ut\":\n unittest.main(argv=[\" \"])\n\n # Print the result string\n sys.stdout.write(Mem().calculate())\n", "def get():\n a = [int(x) for x in input().split()]\n d = 0\n for x in input().split():\n d = d*a[1] + int(x)\n return d\ndg = get()\ndg2 = get()\nif (dg == dg2):\n print('=')\nelif (dg > dg2):\n print('>')\nelse:\n print('<')\n", "xcount, xschis = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nx = x[::-1]\r\nsumx = 0\r\nycount, yschis = map(int, input().split())\r\ny = list(map(int, input().split()))\r\ny = y[::-1]\r\nsumy = 0\r\ns = \"\"\r\nfor i in range(len(x)):\r\n sumx += pow(xschis, i) * x[i]\r\n\r\nfor j in range(len(y)):\r\n sumy += pow(yschis, j) * y[j]\r\n\r\nif sumx > sumy:\r\n s = \">\"\r\nelif sumx == sumy:\r\n s = \"=\"\r\nelse:\r\n s = \"<\"\r\n\r\nprint(s)", "a1,b1=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx1=0\r\na2,b2=map(int,input().split())\r\ny=list(map(int,input().split()))\r\ny1=0\r\nfor i in range(a1):\r\n x1+=(b1**(a1-i-1))*x[i]\r\nfor i in range(a2):\r\n y1+=(b2**(a2-i-1))*y[i]\r\nif x1<y1:\r\n print('<')\r\nif x1==y1:\r\n print('=')\r\nif x1>y1:\r\n print('>')\r\n", "I=lambda:[*map(int,input().split())]\r\nn,a=I()\r\nx=0\r\nfor c in I():x=x*a+c\r\nm,b=I()\r\ny=0\r\nfor c in I():y=y*b+c\r\nprint('<=>'[(x>=y)+(x>y)])\r\n", "cin = lambda:map(int,input().split())\r\ndef solve():\r\n n,a = cin()\r\n sum=0\r\n for i in cin():\r\n sum=(sum*a+i)\r\n return sum \r\nans1,ans2=solve(),solve()\r\nprint ('>' if ans1>ans2 else '<' if ans1<ans2 else '=')", "import logging\r\nimport copy\r\nimport sys\r\nimport math\r\nlogging.basicConfig(stream=sys.stderr, level=logging.DEBUG)\r\n\r\n#def solve(firstLine):\r\ndef solve(b, nums):\r\n nums.reverse()\r\n sum = 0\r\n for i, num in enumerate(nums):\r\n sum += (math.pow(b, i) * num)\r\n \r\n return sum\r\n\r\ndef main():\r\n base10 = [0,0]\r\n for i in range(2):\r\n line = list(map(int, input().split()))\r\n n, b = line[0], line[1]\r\n nums = list(map(int, input().split()))\r\n base10[i] = solve(b, nums)\r\n \r\n if base10[0] == base10[1]:\r\n print(\"=\")\r\n elif base10[0] < base10[1]:\r\n print(\"<\")\r\n elif base10[0] > base10[1]:\r\n print(\">\")\r\n \r\n\r\ndef log(*message):\r\n logging.debug(message)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "_, bx = map(int, input().split())\r\ndigx = list(map(int, input().split()))\r\n\r\n_, by = map(int, input().split())\r\ndigy = list(map(int, input().split()))\r\n\r\nx = 0\r\ny = 0\r\nfor i, d in enumerate(digx[::-1]):\r\n x += d * bx**i\r\n\r\nfor i, d in enumerate(digy[::-1]):\r\n y += d * by**i\r\n\r\nif x == y:\r\n print('=')\r\nelif x > y:\r\n print('>')\r\nelse:\r\n print('<')", "x, bx = map(int, input().split())\r\na = list(map(int, input().split()))\r\ny, by = map(int, input().split())\r\nb = list(map(int, input().split()))\r\none = two = 0\r\npower = 0\r\nfor i, x in enumerate(reversed(a)):\r\n\tone += x * bx**i\r\nfor i, x in enumerate(reversed(b)):\r\n\ttwo += x * by**i\r\nif one < two:\r\n\tprint(\"<\")\r\nelif one == two:\r\n\tprint(\"=\")\r\nelse:\r\n\tprint(\">\")", "n,bx = map(int,input().split())\r\ns = input().split()\r\ns = [int(x) for x in s]\r\n\r\nadd1 = 0\r\nfor i in range(n):\r\n add1 += pow(bx, i)*s[-i-1]\r\n\r\n\r\nm,by = map(int,input().split())\r\nt = input().split()\r\nt = [int(x) for x in t]\r\n\r\nadd2 = 0\r\nfor i in range(m):\r\n add2 += pow(by, i)*t[-i-1]\r\n\r\nif add1==add2:\r\n print(\"=\")\r\nelif add1>add2:\r\n print(\">\")\r\nelse:\r\n print(\"<\")\r\n\r\n", "firstline = [int(x) for x in input().split()]\nfirstnum = 0\nfor digit in input().split():\n firstnum *= firstline[1]\n firstnum += int(digit)\n\nsecondline = [int(x) for x in input().split()]\nsecondnum = 0\n\nfor digit in input().split():\n secondnum *= secondline[1]\n secondnum += int(digit)\n\nif (firstnum > secondnum):\n print('>')\nif (firstnum == secondnum):\n print('=')\nif (firstnum < secondnum):\n print('<')\n", "basamak1, taban1 = list(map(int, input().split()))\nilksayi = list(map(int, input().split()))\nbasamak2, taban2 = list(map(int, input().split()))\nikisayi = list(map(int, input().split()))\n\ntot1 = 0\ntot2 = 0\nfor i in range(1,basamak1+1):\n\ttot1 += ilksayi[-i]*(taban1**(i-1))\nfor i in range(1,basamak2+1):\n\ttot2 += ikisayi[-i]*(taban2**(i-1))\n\nif tot1 == tot2:\n\tprint('=')\nelif tot1 > tot2:\n\tprint('>')\nelse:\n\tprint('<')", "def intConvert(l):\n\tfor i in range(0, len(l)):\n\t\tl[i] = int(l[i])\n\ndef base10(l, base):\n\tresult = 0\n\tfor i in range(0, len(l)):\n\t\tresult += l[len(l)-i-1]*(base**i)\n\treturn result\n\nd1 = input().split()\ndigits1 = input().split()\n\nintConvert(d1)\nintConvert(digits1)\n\nresult1 = base10(digits1, d1[1])\n\nd2 = input().split()\ndigits2 = input().split()\n\nintConvert(d2)\nintConvert(digits2)\n\nresult2 = base10(digits2, d2[1])\n\nif(result1 == result2):\n\tprint(\"=\")\nelif(result1 < result2):\n\tprint(\"<\")\nelif(result1 > result2):\n\tprint(\">\")\n", "nx, bx = map(int, input().split(' ')[:2])\nxs = list(map(int, input().split(' ')[:nx]))\nny, by = map(int, input().split(' ')[:2])\nys = list(map(int, input().split(' ')[:ny]))\n\np = 1\nx = 0\nfor d in reversed(xs):\n x += d * p\n p *= bx\n\np = 1\ny = 0\nfor d in reversed(ys):\n y += d * p\n p *= by\n\nif x == y:\n print('=')\nelif x < y:\n print('<')\nelse:\n print('>')\n", "\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfirst=int(0)\r\nsecond=int(0)\r\nnow=int(1)\r\nfor i in range(len(l)-1,-1,-1):\r\n first=first+now*l[i]\r\n now=now*m\r\n\r\nn1,m1=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\n\r\nnow=1\r\nfor i in range(len(l1)-1,-1,-1):\r\n second=second+now*l1[i]\r\n now=now*m1\r\n\r\nif second==first:\r\n print('=')\r\nelif second>first:\r\n print('<')\r\nelse:\r\n print('>')\r\n", "r = lambda: list(map(int,input().split()))\r\nn,b = r()\r\n\r\nx = sum(x*b**(n-1-i) for i,x in enumerate(r()))\r\nn,b = r()\r\n\r\ny = sum(x*b**(n-1-i) for i,x in enumerate(r()))\r\n\r\nif x == y:\r\n print ('=')\r\nelif x < y:\r\n print ('<')\r\nelse:\r\n print ('>')\r\n", "n, b1 = map(int, input().split())\r\na = list(map(int, input().split()))\r\nm, b2 = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nnum1 = 0\r\nnum2 = 0\r\nfor i in range(n):\r\n num1 += a[i] * (b1 ** (n - i - 1))\r\nfor i in range(m):\r\n num2 += b[i] * (b2 ** (m - i - 1))\r\nif (num1 == num2):\r\n print('=')\r\nelif (num1 > num2):\r\n print('>')\r\nelse:\r\n print('<')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\r\n\"\"\"\r\nn = list(map(int,input().split()))\r\nnum1 = list(map(int,input().split()))\r\nt1=0\r\nx=n[0]\r\nfor i in range(0,n[0]):\r\n x-=1\r\n t1 += num1[i]*pow(n[1],x)\r\n\r\nm = list(map(int,input().split()))\r\nnum2 = list(map(int,input().split()))\r\nt2=0\r\ny=m[0]\r\nfor i in range(0,m[0]):\r\n y-=1\r\n t2 += num2[i]*pow(m[1],y)\r\n \r\nif t1==t2:\r\n print(\"=\")\r\n\r\nelif t1>t2:\r\n print(\">\")\r\nelse:\r\n print(\"<\")", "def digits_to_int(b, ds):\n i = 0\n for d in ds:\n i = i*b + d\n return i\n\ndef compare(bx, xd, by, yd):\n x = digits_to_int(bx, xd)\n y = digits_to_int(by, yd)\n return '<' if x < y else '>' if x > y else '='\n\n\nif __name__ == '__main__':\n n, bx = map(int, input().split())\n xd = tuple(map(int, input().split()))\n m, by = map(int, input().split())\n yd = tuple(map(int, input().split()))\n print(compare(bx, xd, by, yd))\n", "a, b = 0, 0\r\n\r\nn, m = [int(x) for x in input().split()]\r\nfor item in input().split():\r\n\ta = a * m + int(item)\r\n\r\nn, m = [int(x) for x in input().split()]\r\nfor item in input().split():\r\n\tb = b * m + int(item)\r\n\r\nif a < b:\r\n\tprint(\"<\")\r\nelif a > b:\r\n\tprint(\">\")\r\nelse:\r\n\tprint(\"=\")", "def Two_Bases():\n x=list(map(int,input().split()))\n dx=list(map(int,input().split()))\n s=0\n for i in dx:\n s=x[1]*s+i\n \n return s\n\n\n\nX=Two_Bases()\nY=Two_Bases()\nif X==Y:print('=')\nelif X<Y:print('<')\nelif X>Y:print('>')\n \t\t\t\t \t\t\t\t \t\t \t", "def readnum():\r\n n, b = (int(w) for w in input().split())\r\n x = 0\r\n nums = list(int(w) for w in input().split())\r\n return sum(nums[i] * b**(n-1-i) for i in range(n))\r\n\r\nx = readnum()\r\ny = readnum()\r\n\r\nif x==y: print('=')\r\nif x<y: print('<')\r\nif x>y: print('>')\r\n", "read = lambda: map(int, input().split())\nt, bx = read()\nX = list(read())\nx = sum(X[_] * bx ** (t - 1 - _) for _ in range(t))\nt, by = read()\nY = list(read())\ny = sum(Y[_] * by ** (t - 1 - _) for _ in range(t))\nprint('<' if x < y else '>' if x > y else '=')\n", "n, b = map(int, input().split())\r\ncurr = 1\r\nc1 = 0\r\na = [int(i) for i in input().split()]\r\na = a[::-1]\r\nfor i in range(n):\r\n c1 += a[i] * curr\r\n curr *= b\r\nn, b = map(int, input().split())\r\ncurr = 1\r\nc2 = 0\r\na = [int(i) for i in input().split()]\r\na = a[::-1]\r\nfor i in range(n):\r\n c2 += a[i] * curr\r\n curr *= b\r\nif (c1 < c2):\r\n print('<')\r\nelif (c1 == c2):\r\n print('=')\r\nelse:\r\n print('>')", "__author__ = 'cmashinho'\n\nn, b = map(int, input().split())\nlB = list(map(int, input().split()))\nm, y = map(int, input().split())\nlY = list(map(int, input().split()))\n\nnB = 0\nnY = 0\n\nfor i in range(n):\n nB += lB[i] * int(pow(b, (n - i - 1)))\n\nfor i in range(m):\n nY += lY[i] * int(pow(y, (m - i - 1)))\n\nif nB == nY:\n print(\"=\")\nelif nB > nY:\n print(\">\")\nelse:\n print(\"<\")\n", "I = lambda: map(int, input().split())\r\n\r\nn, b = I()\r\nX = sum(x*b**(n-i) for i,x in enumerate(I(),1))\r\nn, b = I()\r\nY = sum(y*b**(n-i) for i,y in enumerate(I(),1))\r\n\r\nprint('<' if X<Y else '>' if X>Y else '=')", "n, x = map(int,input().split())\r\n\r\nnX = [int(s) for s in input().split()]\r\n\r\nm, y = map(int,input().split())\r\n\r\nmY = [int(s) for s in input().split()]\r\n\r\n\r\nsum = 0\r\nfor i in range(max(n,m)):\r\n if i < n:\r\n sum += nX[i] * (x**(n-1-i))\r\n if i < m:\r\n sum -= mY[i] * (y**(m-1-i))\r\n\r\nif sum > 0:\r\n print('>')\r\nelif sum < 0:\r\n print('<')\r\nelse:\r\n print('=')\r\n", "n,b1 = (int(x) for x in input().split())\r\ns = input().split()\r\nx1,x2 = (0,0)\r\nfor i in range(n):\r\n x1 += int(s[i])*(b1**(n-i-1))\r\nn,b2 = (int(x) for x in input().split())\r\ns = input().split()\r\nfor i in range(n):\r\n x2 += int(s[i])*(b2**(n-i-1))\r\nif(x1 == x2):\r\n print('=')\r\nelif(x1 < x2):\r\n print('<')\r\nelse:\r\n print('>')", "def to_dec(s, b):\n i = len(s) - 1\n n = 0\n for d in s:\n n += d * (b ** i)\n i -= 1\n return n\n\nxlen, xb = map(int, input().split())\nx = list(map(int, input().split()))\nylen, yb = map(int, input().split())\ny = list(map(int, input().split()))\nx = int(to_dec(x, xb))\ny = int(to_dec(y, yb))\n\nif x == y:\n print('=')\nelif x > y:\n print('>')\nelse:\n print('<')\n\t \t \t\t \t\t \t \t \t\t\t\t \t\t\t \t", "a1,b1=map(int,input().split())\r\nX=input().split()\r\na2,b2=map(int,input().split())\r\nY=input().split()\r\nk=0\r\ng=0\r\nfor i in range(a1):\r\n k+=int(X[i])*(b1**(a1-i-1))\r\nfor i in range(a2):\r\n g+=int(Y[i])*(b2**(a2-i-1))\r\nif k>g:\r\n print('>')\r\nelif k<g:\r\n print('<')\r\nelif k==g:\r\n print('=')\r\n \r\n", "n, b1 = map(int, input().split())\r\nnum = [int(x) for x in input().split()]\r\n \r\np = b1 ** (n - 1)\r\nx = 0\r\nfor i in range(n):\r\n numx = int(num[i])\r\n x += numx * p\r\n p //= b1\r\n \r\nm, b2 = map(int, input().split())\r\nnum = [int(x) for x in input().split()]\r\n \r\np = b2 ** (m - 1)\r\ny = 0\r\nfor i in range(m):\r\n numy = int(num[i])\r\n y += numy * p\r\n p //= b2\r\n \r\nif x < y:\r\n print('<')\r\nelif x > y:\r\n print('>')\r\nelse:\r\n print('=')", "x_n, x_osn = map(int, input().split())\r\nx_data = list(map(int, input().split()))\r\nx_10 = 0\r\nfor i in range(x_n):\r\n x_10 += x_data[i] * (x_osn ** (x_n - i - 1))\r\ny_n, y_osn = map(int, input().split())\r\ny_data = list(map(int, input().split()))\r\ny_10 = 0\r\nfor i in range(y_n):\r\n y_10 += y_data[i] * (y_osn ** (y_n - i - 1))\r\nif x_10 < y_10:\r\n print('<')\r\nelif x_10 > y_10:\r\n print('>')\r\nelse:\r\n print('=')", "digit1, base1 = input().split()\ndata = input().split()\ndata = [int(x) for x in data]\ndata = data[::-1]\nout = 0\npower = 0\nfor i in data:\n\tout += i * (int(base1) ** power)\n\tpower += 1\n\t\ndigit2, base2 = input().split()\ndata2 = input().split()\ndata2 = [int(x) for x in data2]\ndata2 = data2[::-1]\npower = 0\nout2 = 0\nfor i in data2:\n\tout2 += i * (int(base2) ** power)\n\tpower += 1\nif out == out2:\n\tprint('=')\nelif out < out2:\n\tprint('<')\nelif out > out2:\n\tprint('>')\n", "n, bx = list(map(int, input().split()))\r\nx = []\r\nx = list(map(int, input().split()))\r\nm, by = list(map(int, input().split()))\r\ny = []\r\ny = list(map(int, input().split()))\r\nxk = 1\r\nyk = 1\r\nX = 0\r\nY = 0\r\nfor i in range(n - 1, -1, -1):\r\n X += xk * x[i]\r\n xk *= bx\r\nfor i in range(m - 1, -1, -1):\r\n Y += yk * y[i]\r\n yk *= by\r\nif X < Y:\r\n print('<')\r\nif X > Y:\r\n print('>')\r\nif X == Y:\r\n print('=')\r\n", "a = []\r\nfor i in range(2):\r\n n, b = map(int, input().split())\r\n a.append(0)\r\n for x in map(int, input().split()):\r\n a[-1] = a[-1] * b + x\r\nprint('<>='[(a[0] == a[1]) + (a[0] >= a[1])])\r\n", "import math\r\nfrom decimal import *\r\nimport sys\r\nfrom fractions import Fraction\r\n\r\n\r\ninp=input().split()\r\nn=int(inp[0])\r\nbx=int(inp[1])\r\nX=list(map(int,input().split()))\r\n \r\ninp=input().split()\r\nm=int(inp[0])\r\nby=int(inp[1])\r\nY=list(map(int,input().split()))\r\n\r\nx=0\r\nt=1\r\nfor i in range(0,n):\r\n x += X[n-i-1]*t\r\n t *= bx\r\n\r\ny=0\r\nt=1\r\nfor i in range(0,m):\r\n y += Y[m-i-1]*t\r\n t *= by\r\n\r\nif x<y:\r\n print(\"<\")\r\nif x==y:\r\n print(\"=\")\r\nif x>y:\r\n print(\">\")\r\n", "\nnx,x=list(map(int,input().split()))\n\nxvals=list(map(int,input().split()))\n\nny,y=list(map(int,input().split()))\n\nyvals=list(map(int,input().split()))\n\nnum1=0\nfor i in range(nx):\n num1+=xvals[i]*pow(x,nx-i-1)\n\nnum2=0\nfor i in range(ny):\n num2+=yvals[i]*pow(y,ny-i-1)\n\nif num1>num2:\n print(\">\")\nelif num1<num2:\n print(\"<\")\nelse:\n print(\"=\")\n \t\t\t\t \t \t\t\t\t\t\t\t\t \t \t\t \t\t\t\t \t", "n, xbase = map(int, input().split())\r\nxs = list(map(int, input().split()))\r\n\r\nm, ybase = map(int, input().split())\r\nys = list(map(int, input().split()))\r\n\r\nx = 0\r\nxt = 1\r\nfor c in xs[::-1]:\r\n\tx += c * xt\r\n\txt *= xbase\r\n\r\ny = 0\r\nyt = 1\r\nfor c in ys[::-1]:\r\n\ty += c * yt\r\n\tyt *= ybase\r\n\r\nif x < y:\r\n\tprint('<')\r\nelif x > y:\r\n\tprint('>')\r\nelse:\r\n\tprint('=')\r\n", "n, bx = map(int, input().split())\r\n\r\nxnum = list(map(int, input().split()))\r\nxnum = xnum[::-1]\r\n\r\nm, by = map(int, input().split())\r\n\r\nynum = list(map(int, input().split()))\r\nynum = ynum[::-1]\r\n\r\nxdec = 0\r\nydec = 0\r\n\r\nfor place, num in enumerate(xnum):\r\n xdec += num * pow(bx, place)\r\nfor place, num in enumerate(ynum):\r\n ydec += num * pow(by, place)\r\n#print(xdec, ydec)\r\nif ydec > xdec:\r\n print(\"<\")\r\nelif ydec < xdec:\r\n print(\">\")\r\nelse:\r\n print(\"=\")\r\n", "n, b = map(int, input().split())\r\nnum1 = 0\r\nnum2 = 0\r\nn -= 1\r\nfor c in list(map(int, input().split())):\r\n num1 += (b ** n) * c\r\n n -= 1\r\nn, a = map(int, input().split())\r\nn -= 1\r\nfor c in list(map(int, input().split())):\r\n num2 += (a ** n) * c\r\n n -= 1\r\nif num1 > num2:\r\n print('>')\r\nelif num1 == num2:\r\n print('=')\r\nelse:\r\n print('<')", "vstup = input()\r\nseznam = [int(n) for n in vstup.split()]\r\ncislo = [int(n) for n in input().split()]\r\nzaklad = seznam[1]\r\n\r\nvstup2 = input()\r\nseznam2 = [int(n) for n in vstup2.split()]\r\ncislo2 = [int(n) for n in input().split()]\r\nzaklad2 = seznam2[1]\r\n\r\ndef preved (cislo,zaklad):\r\n prvni = 0\r\n for k in range(len(cislo)):\r\n rad = len(cislo) - k - 1\r\n prvni2 = (zaklad**rad) * cislo[k]\r\n prvni += prvni2\r\n return prvni\r\n\r\nx = preved(cislo,zaklad)\r\ny = preved(cislo2,zaklad2)\r\nif x > y:\r\n print(\">\")\r\nelif x < y:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "I=lambda:map(int,input().split()[::-1])\r\ndef f():\r\n b,_=I()\r\n r,x=0,1\r\n for i in I():\r\n r+=i*x\r\n x*=b\r\n return r\r\na=f()-f()\r\nprint(\"<\"if a<0 else \">=\"[a==0])", "def convertTo10(d, base, n):\n\tindex = d - 1\n\tresult = 0\n\twhile index >= 0:\n\t\tpow = d - index - 1\n\t\tresult += n[index]*(base**pow)\n\t\tindex -= 1\n\n\treturn result\n\n\nif __name__==\"__main__\":\n\td1, b1 = input().split()\n\td1, b1 = int(d1), int(b1)\n\tn1 = input().split()\n\tn1 = [ int(x) for x in n1 ]\n\tn110 = convertTo10(d1, b1, n1)\n\td2, b2 = input().split()\n\td2, b2 = int(d2), int(b2)\n\tn2 = input().split()\n\tn2 = [ int(x) for x in n2 ]\n\tn210 = convertTo10(d2, b2, n2)\n\tif n110 < n210:\n\t\tprint('<')\n\telif n110 > n210:\n\t\tprint('>')\n\telse:\n\t\tprint('=')", "n,b1=map(int, input().split())\r\nl1=list(map(int, input().split()))\r\nm,b2=map(int, input().split())\r\nl2=list(map(int, input().split()))\r\nx=y=0\r\np=1\r\nfor i in range(n-1,-1,-1):\r\n x+=l1[i]*p\r\n p=p*b1\r\np=1\r\nfor i in range(m-1,-1,-1):\r\n y+=l2[i]*p\r\n p=p*b2\r\nif x==y:\r\n print(\"=\")\r\nelif x<y:\r\n print(\"<\")\r\nelse:\r\n print(\">\")\r\n", "x=0\ny=0\nnx,bx=list(map(int,input().split(' ')))\nk=list(map(int,input().split(' ')))\nfor i in range(nx):\n x+=k[i]*pow(bx,nx-i-1)\nny,by=list(map(int,input().split(' ')))\nk=list(map(int,input().split(' ')))\nfor i in range(ny):\n y+=k[i]*pow(by,ny-i-1)\nif(x<y):\n print('<')\nelif(x==y):\n print('=')\nelif(x>y):\n print('>')\n \t \t\t\t\t \t\t\t \t \t\t \t\t\t\t \t\t", "n,b=map(int,input().split())\r\nX=0\r\nfor x in list(map(int,input().split())):\r\n n-=1\r\n X+=x*(b**n)\r\nm,a=map(int,input().split())\r\nY=0\r\nfor y in list(map(int,input().split())):\r\n m-=1\r\n Y+=y*(a**m)\r\nif X<Y: print(\"<\")\r\nelif X>Y: print(\">\")\r\nelse: print(\"=\")", "import sys\r\nn,bx = map(int,input().split())\r\nx = list(map(int,input().split()))\r\nm,by = map(int,input().split())\r\ny = list(map(int,input().split()))\r\nres1 = res2 = 0\r\na = b = 0\r\nfor i in range(n-1,-1,-1):\r\n res1 += x[i] * (bx ** a)\r\n a += 1\r\n\r\nfor j in range(m-1,-1,-1):\r\n res2 += y[j] * (by ** b)\r\n b += 1\r\nif(res1 < res2):\r\n print('<')\r\nelif(res1 > res2):\r\n print('>')\r\nelse:\r\n print('=')", "#!/usr/bin/python3\n\nfrom itertools import *\nfrom collections import Counter\n\nfrom operator import *\nfrom functools import reduce\n\nimport re, math\n\nfrom pprint import pprint\nfrom fractions import gcd\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\n\nx, bx = inputarray()\nA = reversed(list(inputarray()))\n\nX, k = 0, 1\nfor i, v in enumerate(A):\n X = X + v*k\n k = k*bx\n\ny, by = inputarray()\nB = reversed(list(inputarray()))\n\nY, k = 0, 1\nfor i, v in enumerate(B):\n Y = Y + v*k\n k = k*by\n\nif X < Y:\n print('<')\nelif X > Y:\n print('>')\nelse:\n print('=')\n", "def base(a, b, c):\r\n tot = 0\r\n for i in range(a):\r\n tot += c[-(i + 1)] * (b ** i)\r\n return tot\r\n\r\nx, bx = (int(i) for i in input().split())\r\nxnum = [int(i) for i in input().split()]\r\ny, by = (int(i) for i in input().split())\r\nynum = [int(i) for i in input().split()]\r\n\r\nrx = base(x, bx, xnum)\r\nry = base(y, by, ynum)\r\n\r\nif rx == ry:\r\n print(\"=\")\r\nelif rx > ry:\r\n print(\">\")\r\nelse:\r\n print(\"<\")", "n, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\nx = 0\r\nfor i in range(n):\r\n x += a[i] * b ** (n - i - 1)\r\nn, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\ny = 0\r\nfor i in range(n):\r\n y += a[i] * b ** (n - i - 1)\r\nif x == y:\r\n print('=')\r\nelif x < y:\r\n print('<')\r\nelse:\r\n print('>')", "def intlist():\n return [int(i) for i in input().split()]\n\nn, bx = intlist()\nx = intlist()\nx.reverse()\nX = 0\np = 1\nfor a in x:\n X += p * a\n p *= bx\n\nm, by = intlist()\ny = intlist()\ny.reverse()\nY = 0\np = 1\nfor a in y:\n Y += p * a\n p *= by\n\nif X == Y:\n print(\"=\")\nelse:\n print([\"<\", \">\"][X > Y])\n", "infox=input().split(' ')\nnx = int(infox[0])\nbx = int(infox[1])\nx = input().split(' ')\ninfoy=input().split(' ')\nny = int(infoy[0])\nby = int(infoy[1])\ny = input().split(' ')\n\nsumx = 0\nsumy = 0\nfor i in range(nx):\n\tsumx = sumx*bx + int(x[i])\nfor i in range(ny):\n\tsumy = sumy*by + int(y[i])\nif sumx>sumy:\n\tprint('>')\nelif sumx==sumy:\n\tprint('=')\nelse: \n\tprint('<')", "from itertools import count\nfrom operator import mul\ndef ints():\n\treturn [int(x) for x in input().split()]\ndef number():\n\t(n, base), digits = ints(), ints()\n\tpowers = (base ** i for i in range(n - 1, -1, -1))\n\treturn sum(d * p for d, p in zip(digits, powers))\nX, Y = number(), number()\nprint('>' if X > Y else '<' if X < Y else '=')\n", "n, bx = map(int,input().split())\r\n\r\nnum = list(map(int,input().split()))\r\n\r\nnum.reverse()\r\n\r\norig = 0\r\nfor i in range(0,len(num)):\r\n orig += num[i]*bx**i\r\n\r\n\r\nn, bx2 = map(int,input().split())\r\n\r\nnum = list(map(int,input().split()))\r\n\r\nnum.reverse()\r\n\r\norig2 = 0\r\nfor i in range(0,len(num)):\r\n orig2 += num[i]*bx2**i\r\n\r\n\r\nif orig == orig2:\r\n print('=')\r\nelif orig < orig2:\r\n print('<')\r\nelse:\r\n print('>')\r\n", "n, bx = map(int, input().split())\nx = list(map(int, input().split()))\nn, by = map(int, input().split())\ny = list(map(int, input().split()))\n\n\ndef to_dec(a, base):\n res = 0\n a = a[::-1]\n for i, aa in enumerate(a):\n res += aa * base**i\n return res\n\nx = to_dec(x, bx)\ny = to_dec(y, by)\n\nprint(\"=\" if x==y else (\"<\" if x<y else \">\"))\n\n", "n,a=input().split()\r\nn=int(n)\r\nx=0\r\np=1\r\na=int(a)\r\nl=input().split()\r\nfor i in range(n):\r\n x+=int(l[n-i-1])*p\r\n p*=a\r\nn,b=input().split()\r\nn=int(n)\r\ny=0\r\np=1\r\nb=int(b)\r\nl=input().split()\r\nfor i in range(n):\r\n y+=int(l[n-i-1])*p\r\n p*=b\r\nif(x==y):\r\n print(\"=\")\r\nelif(x<y):\r\n print(\"<\")\r\nelse:\r\n print(\">\")\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n, b1 = map(int, input().split())\r\n x = 0\r\n for a in list(map(int, input().split())):\r\n x = x * b1 + a\r\n n, b2 = map(int, input().split())\r\n y = 0\r\n for a in list(map(int, input().split())):\r\n y = y * b2 + a\r\n if x == y:\r\n print('=')\r\n elif x > y:\r\n print('>')\r\n elif x < y:\r\n print('<')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#Two Bases.py\r\nimport os\r\nn, bx = map(int, input().split())\r\nx = 0\r\nlx = []\r\nt = input()\r\nfor i in t.split():\r\n lx.append(int(i))\r\nfor i in range(0, n):\r\n x = x * bx + lx[i]\r\n # print(x)\r\nm, by = map(int, input().split())\r\ny = 0\r\nly = []\r\nt = input()\r\nfor i in t.split():\r\n ly.append(int(i))\r\nfor i in range(0, m):\r\n y = y * by + ly[i]\r\n# print(x)\r\n# print(y)\r\nif x > y:\r\n print(\">\")\r\nelse:\r\n if x < y:\r\n print(\"<\")\r\n else:\r\n print(\"=\")", "def main():\n res = []\n for _ in range(2):\n _, b = map(int, input().split())\n x = 0\n for s in input().split():\n x = x * b + int(s)\n res.append(x)\n print(\">\" if res[0] > res[1] else \"<\" if res[0] < res[1] else \"=\")\n\n\nif __name__ == '__main__':\n main()\n", "def fun(m, b, L):\n ret = 0\n L.reverse()\n for i in range(m):\n ret += L[i] * (b ** i)\n return ret\n\nn, bx = map(int, input().split())\nX = list(map(int, input().split()))\nxx = fun(n, bx, X)\n\nm, by = map(int, input().split())\nY = list(map(int, input().split()))\nyy = fun(m, by, Y)\n\nif xx > yy:\n print(\">\")\nelif xx < yy:\n print(\"<\")\nelse:\n print(\"=\")\n", "def parser():\r\n a = input().split();\r\n base = int(a[1]);\r\n exponent = 0;\r\n out = 0;\r\n vct = input().split();\r\n for i in reversed(vct):\r\n out += pow(base, exponent) * int(i);\r\n exponent += 1;\r\n return out;\r\n \r\n \r\na = parser();\r\nb = parser();\r\nif (a == b):\r\n print ('=')\r\nelse:\r\n if (a > b):\r\n print ('>')\r\n else:\r\n print ('<')\r\n \r\n# print (a)\r\n# print (b)", "x = input().split(' ')\r\nn = int(x[0])\r\nbx = int(x[1])\r\nx = input().split(' ')\r\ny = input().split(' ')\r\nm = int(y[0])\r\nby = int(y[1])\r\ny = input().split(' ')\r\nt = 1\r\nX = 0\r\nwhile (n > 0):\r\n n -= 1\r\n X += t * int(x[n])\r\n t *= bx\r\nt = 1\r\nY = 0\r\nwhile (m > 0):\r\n m -= 1\r\n Y += t * int(y[m])\r\n t *= by\r\n#print(X, Y)\r\nif (X == Y):\r\n print(\"=\\n\")\r\nelif (X < Y):\r\n print(\"<\\n\")\r\nelse:\r\n print(\">\\n\")\r\n", "n,b1=map(int,input().split())\r\narr1=list(map(int,input().split()))\r\nm,b2=map(int,input().split())\r\narr2=list(map(int,input().split()))\r\nsum1=0\r\nsum2=0\r\nfor i in arr1:\r\n sum1+= i* (b1**(n-1))\r\n n-=1\r\nfor i in arr2:\r\n sum2+= i* (b2**(m-1))\r\n m-=1\r\nif (sum1==sum2):\r\n print(\"=\")\r\nelif(sum1<sum2):\r\n print(\"<\")\r\nelse:\r\n print(\">\")\r\n", "_, b_x = tuple(map(int, input().split(\" \")))\nx = list(map(int, input().split(\" \")))\n_, b_y = tuple(map(int, input().split(\" \")))\ny = list(map(int, input().split(\" \")))\n\n\ndef convert_to_base(x, base):\n s = 0\n for i, n in enumerate(x[::-1]):\n s += n*(base**i)\n return s\n\ndef solve(b_x, x, b_y, y):\n x1 = convert_to_base(x, b_x)\n x2 = convert_to_base(y, b_y)\n if x1 == x2:\n return \"=\"\n elif x1 > x2:\n return \">\"\n else:\n return \"<\"\n\nprint(solve(b_x, x, b_y, y))\n", "n,bx = map(int, input().split())\ninp=list(map(int, input().split()))\nnum1=sum(inp[i]*bx**(n-i-1) for i in range(n))\nm,by = map(int, input().split())\ninp=list(map(int, input().split()))\nnum2=sum(inp[i]*by**(m-i-1) for i in range(m))\nif num1==num2:\n\tprint('=')\nelif num1<num2:\n\tprint('<')\nelse:\n\tprint('>')\n", "n, bx = list(map(int, input().split(\" \")))\r\nX = list(map(int, input().split(\" \")))\r\n\r\nm, by = list(map(int, input().split(\" \")))\r\nY = list(map(int, input().split(\" \")))\r\n\r\nvx = 0\r\nvy = 0\r\n\r\nfor i in range(n-1, -1, -1):\r\n vx+= X[n-i-1]*(bx**i)\r\n \r\nfor i in range(m-1, -1, -1):\r\n vy+= Y[m-i-1]*(by**i)\r\n \r\nif(vx == vy):\r\n print(\"=\")\r\nelif(vx> vy):\r\n print(\">\")\r\nelse:\r\n print(\"<\")\r\n ", "import sys\r\na, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nd, e = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nc.reverse()\r\nf.reverse()\r\ns1 = s2 = 0\r\nfor i in range(0, a):\r\n s1 += c[i] * (b ** i)\r\nfor i in range(0, d):\r\n s2 += f[i] * (e ** i)\r\nif s1 < s2:\r\n sys.stdout.write('<')\r\nelif s1 > s2:\r\n sys.stdout.write('>')\r\nelse:\r\n sys.stdout.write('=')\r\n", "n,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx.reverse()\r\na=0\r\nfor i in range(n):\r\n a+=x[i]*pow(b,i)\r\nn,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx.reverse()\r\nc=0\r\nfor i in range(n):\r\n c+=x[i]*pow(b,i)\r\nif a==c:\r\n print(\"=\")\r\nelif a<c:\r\n print(\"<\")\r\nelse:\r\n print(\">\")", "a=int(input().split()[1])\r\nb=input().split()\r\n\r\nc=int(input().split()[1])\r\nd=input().split()\r\n\r\npower = 0\r\ntotal = 0\r\nfor i in range(len(b)-1,-1,-1):\r\n total += int(b[i])*a**power\r\n power += 1\r\na=total\r\n\r\npower = 0\r\ntotal = 0\r\nfor i in range(len(d)-1,-1,-1):\r\n total += int(d[i])*c**power\r\n power += 1\r\nc=total\r\n\r\nif a==c:\r\n print('=')\r\nelif a>c:\r\n print('>')\r\nelse:\r\n print('<')\r\n", "l = [int(x) for x in input().split()]\r\nn, bx = l[0], l[1]\r\na = [int(x) for x in input().split()]\r\n \r\nxx = 0\r\n \r\nfor y in a:\r\n\txx *= bx\r\n\txx += y\r\n \r\nl = [int(x) for x in input().split()]\r\nm, by = l[0], l[1]\r\nb = [int(x) for x in input().split()]\r\nyy = 0\r\n \r\nfor y in b:\r\n\tyy *= by\r\n\tyy += y\r\n \r\nif(xx < yy):\r\n\tprint(\"<\")\r\n \r\nelif (xx == yy):\r\n\tprint(\"=\")\r\n \r\nelse:\r\n\tprint(\">\")", "def to_decimal(digits, base):\r\n decimal = 0\r\n power = 1\r\n for digit in reversed(digits):\r\n decimal += digit * power\r\n power *= base\r\n return decimal\r\n\r\nn, bx = map(int, input().split())\r\nx_digits = list(map(int, input().split()))\r\n\r\nm, by = map(int, input().split())\r\ny_digits = list(map(int, input().split()))\r\n\r\nx_decimal = to_decimal(x_digits, bx)\r\ny_decimal = to_decimal(y_digits, by)\r\n\r\nif x_decimal < y_decimal:\r\n print('<')\r\nelif x_decimal > y_decimal:\r\n print('>')\r\nelse:\r\n print('=')\r\n", "n, bx = input().split()\nn = int(n)\nbx = int(bx)\nx = 0\nfor i in input().split():\n x = x*bx + int(i)\n\nm, by = input().split()\nm = int(m)\nby = int(by)\ny = 0\nfor i in input().split():\n y = y*by + int(i)\n\nif x == y:\n print('=')\nelif x>y:\n print('>')\nelse:\n print('<')\n\n \n", "n, bx = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nansx = 0\r\nfor i in range(n - 1, -1, -1):\r\n ansx += b[i] * bx**(n - i - 1)\r\n\r\nm, by = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nansy = 0\r\nfor i in range(m - 1, -1, -1):\r\n ansy += b[i] * by**(m - i - 1)\r\nif (ansx == ansy):\r\n print('=')\r\nelif ansx > ansy:\r\n print('>')\r\nelse:\r\n print('<')\r\n", "def to_int(b, arr):\r\n d = 1\r\n r = 0\r\n for x in arr:\r\n r += d * x\r\n d *= b\r\n return r\r\n\r\n\r\nn, bx = map(int, input().split())\r\nxd = [int(i) for i in input().split()][::-1]\r\n\r\nn, by = map(int, input().split())\r\nyd = [int(i) for i in input().split()][::-1]\r\n\r\nx = to_int(bx, xd)\r\ny = to_int(by, yd)\r\nif x < y:\r\n print('<')\r\nelif x == y:\r\n print('=')\r\nelse:\r\n print('>')\r\n", "n, x = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nm, y = map(int, input().split())\r\nb = [int(i) for i in input().split()]\r\na.reverse()\r\nb.reverse()\r\nu = v = 0\r\nfor i in range(n):\r\n u += a[i] * pow(x, i)\r\nfor i in range(m):\r\n v += b[i] * pow(y, i)\r\nif u == v:\r\n print(\"=\")\r\nelif u > v:\r\n print(\">\")\r\nelse:\r\n print(\"<\")", "def calc():\r\n n,b=map(int,input().split())\r\n x=list(map(int,input().split()))\r\n ans=0\r\n for i in x:\r\n ans=ans*b+i\r\n return ans\r\nX=calc()\r\nY=calc()\r\nif X>Y:\r\n print('>')\r\nelif X==Y:\r\n print('=')\r\nelse:\r\n print('<')", "n, b1 = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.reverse()\r\nm, b2 = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nb.reverse()\r\nsumm1 = a[0]\r\nsumm2 = b[0]\r\nbase1 = b1\r\nbase2 = b2\r\nfor i in range(1, n):\r\n summ1 += a[i] * base1\r\n base1 *= b1\r\nfor i in range(1, m):\r\n summ2 += b[i] * base2\r\n base2 *= b2\r\nif summ1 > summ2:\r\n print('>')\r\nelif summ1 == summ2:\r\n print('=')\r\nelse:\r\n print('<')", "import sys\r\n\r\ninput_file = sys.stdin\r\n#input_file = open(\"in.txt\")\r\n\r\n_, base_x = map(int,input_file.readline().rstrip().split())\r\nnumber_x = list(reversed(list(map(int,input_file.readline().rstrip().split()))))\r\n\r\n_, base_y = map(int,input_file.readline().rstrip().split())\r\nnumber_y = list(reversed(list(map(int,input_file.readline().rstrip().split()))))\r\n\r\n\r\nval_x = 0\r\nfor i,val in enumerate(number_x):\r\n val_x += number_x[i] * (base_x ** i)\r\n\r\nval_y = 0\r\nfor i,val in enumerate(number_y):\r\n val_y += number_y[i] * (base_y ** i)\r\n\r\nif val_x < val_y:\r\n print(\"<\")\r\nelif val_y < val_x:\r\n print(\">\")\r\nelse:\r\n print(\"=\")\r\n", "#from dust i have come dust i will be\r\n\r\nn,bx=map(int,input().split())\r\nx=list(map(int,input().split()))\r\n\r\nm,by=map(int,input().split())\r\ny=list(map(int,input().split()))\r\n\r\npx=pow(bx,n-1)\r\npy=pow(by,m-1)\r\n\r\npx=int(px)\r\npy=int(py)\r\n\r\na=0\r\nfor i in range(n):\r\n a+=(x[i]*px)\r\n px//=bx\r\n\r\nb=0\r\nfor i in range(m):\r\n b+=(y[i]*py)\r\n py//=by\r\n\r\n#print(a,b)\r\nif a==b:\r\n print('=')\r\nelif a>b:\r\n print('>')\r\nelse:\r\n print('<')", "def solve(n,a):\r\n li = list(map(int,input().split()))[::-1]\r\n ans=0\r\n for i in range(0,len(li)):\r\n ans+=(li[i]*int(pow(a,i)))\r\n return ans\r\nn,a = map(int,input().split())\r\nans1 = solve(n,a)\r\nm,b = map(int,input().split())\r\nans2 = solve(m,b)\r\nif ans1>ans2:\r\n print('>')\r\nelif ans1<ans2:\r\n print('<')\r\nelse:\r\n print('=')", "import math\r\nn,b1=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nm,b2=map(int,input().split())\r\nl2=list(map(int,input().split()))\r\nfor i in range(0,n):\r\n x=x+l1[i]*math.pow(b1,n-i-1);\r\nfor i in range(0,m):\r\n y=y+l2[i]*math.pow(b2,m-i-1);\r\nif(x==y):\r\n print(\"=\")\r\nelif(x<y):\r\n print(\"<\")\r\nelse:\r\n print(\">\")\r\n", "n,bx=input().split()\r\nbx=int(bx)\r\nx=input()\r\na=[int(i) for i in x.split()]\r\nm,by=input().split()\r\nby=int(by)\r\ny=input()\r\nb=[int(i) for i in y.split()]\r\nvbx=0\r\nfor i in range(len(a)):\r\n vbx=vbx+(bx**(len(a)-i-1))*a[i]\r\nvby=0\r\nfor i in range(len(b)):\r\n vby=vby+(by**(len(b)-i-1))*b[i]\r\nif(vbx<vby):\r\n print('<')\r\nelif(vbx==vby):\r\n print('=')\r\nelse:\r\n print('>')", "n1, base1 = map(int, input().split())\r\nnumbers1 = list(map(int,input().split()))[::-1]\r\nn2, base2 = map(int, input().split())\r\nnumbers2 = list(map(int,input().split()))[::-1]\r\nvalue1 = sum([numbers1[i]*base1**i for i in range(len(numbers1))])\r\nvalue2 = sum([numbers2[i]*base2**i for i in range(len(numbers2))])\r\nif value1 > value2:\r\n print(\">\")\r\nelif value1 < value2:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "n, bx = map(int, input().split())\nx = list(map(int, input().split()))\n\nm, by = map(int, input().split())\ny = list(map(int, input().split()))\n\nr = 0\nfor i in x:\n r *= bx\n r += i\n\nR = 0\nfor i in y:\n R *= by\n R += i\n\n# print(r, R)\nif r == R:\n print('=')\nelse:\n print(['>', '<'][r < R])\n", "n, bx = map(int, input().split())\nx = list(map(int, input().split()))\nm, by = map(int, input().split())\ny = list(map(int, input().split()))\n\nax = 0\nfor i, d in enumerate(reversed(x)):\n ax += d * bx ** i\n\nay = 0\nfor i, d in enumerate(reversed(y)):\n ay += d * by ** i\n\nif ax > ay:\n print('>')\nelif ax < ay:\n print('<')\nelse:\n print('=')\n", "n, bx = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nm, by = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\nx = x[::-1]\r\ny = y[::-1]\r\nst = 1\r\nansx = 0\r\nfor i in range(n):\r\n ansx += x[i] * st\r\n st *= bx\r\n\r\nst = 1\r\nansy = 0\r\nfor i in range(m):\r\n ansy += y[i] * st\r\n st *= by\r\n\r\nprint(\"=\" if ansx == ansy else (\"<\" if ansx < ansy else \">\"))\r\n", "n, bx = map(int, input().split())\r\nX = list(map(int, input().split()))\r\nm, by = map(int, input().split())\r\nY = list(map(int, input().split()))\r\nresX, resY = 0, 0\r\nfor i in range(n):\r\n resX += X[-i - 1] * bx ** i\r\nfor i in range(m):\r\n resY += Y[-i - 1] * by ** i\r\nif(resX < resY):\r\n print(\"<\")\r\nelif(resX == resY):\r\n print(\"=\")\r\nelse:\r\n print(\">\")", "n, bx = input().split()\r\nn = int(n)\r\nbx = int(bx)\r\nx = [int(i) for i in input().split()]\r\nxx = 0;\r\nfor i in x:\r\n\txx = xx*bx+i\r\n\r\nm, by = input().split()\r\nm = int(m)\r\nby = int(by)\r\ny = [int(i) for i in input().split()]\r\nyy = 0;\r\nfor i in y:\r\n\tyy = yy*by+i\r\n\r\nif xx == yy:\r\n\tprint('=')\r\nelif(xx>yy):\r\n\tprint(\">\")\r\nelse:\r\n\tprint(\"<\")\r\n", "n, x = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\n\r\nm, y = map(int, input().split(' '))\r\nb = list(map(int, input().split(' ')))\r\n\r\nstart: int = 1\r\nX: int = 0\r\nY: int = 0\r\na.reverse()\r\nb.reverse()\r\nfor i in a:\r\n X += start * i\r\n start *= x\r\nstart = 1\r\nfor i in b:\r\n Y += start * i\r\n start *= y\r\nif(X < Y):\r\n print('<')\r\nif(X == Y):\r\n print('=')\r\nif(X > Y):\r\n print('>')\r\n", "n, bx = [int(x) for x in input().split()]\nxi = [int(x) for x in input().split()]\nm, by = [int(x) for x in input().split()]\nyi = [int(x) for x in input().split()]\n\nx = 0\ny = 0\n\nfor i in range(len(xi)):\n x += xi[i] * bx**(n - i - 1)\n\nfor i in range(len(yi)):\n y += yi[i] * by**(m - i - 1)\n\nif x == y: print('=')\nif x > y: print('>')\nif x < y: print('<')\n\n", "n1, b1 = map(int, input().split())\r\nans1 = 0\r\na1 = list(map(int, input().split()))\r\nn2, b2 = map(int, input().split())\r\nans2 = 0\r\na2 = list(map(int, input().split()))\r\nfor i in range(n1):\r\n ans1 += a1[i] * (b1 ** (n1 - i - 1))\r\nfor i in range(n2):\r\n ans2 += a2[i] * (b2 ** (n2 - i - 1))\r\nif (ans1 == ans2):\r\n print('=')\r\nelse:\r\n if ans1 > ans2:\r\n print('>')\r\n else:\r\n print('<')\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, bx = map(int, input().split())\r\nx0 = list(map(int, input().split()))\r\nx, u = 0, 1\r\nfor i in x0[::-1]:\r\n x += i * u\r\n u *= bx\r\nm, by = map(int, input().split())\r\ny0 = list(map(int, input().split()))\r\ny, u = 0, 1\r\nfor i in y0[::-1]:\r\n y += i * u\r\n u *= by\r\nif x < y:\r\n ans = \"<\"\r\nelif x == y:\r\n ans = \"=\"\r\nelse:\r\n ans = \">\"\r\nprint(ans)", "q = input().split()\r\nn1 = int(q[0])\r\nb1 = int(q[1])\r\na = input().split()\r\nn1 = 0\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\n n1 = n1 * b1 + a[i]\r\n \r\nq = input().split()\r\nn2 = int(q[0])\r\nb2 = int(q[1])\r\nb = input().split()\r\nn2 = 0\r\nfor i in range(len(b)):\r\n b[i] = int(b[i])\r\n n2 = n2 * b2 + b[i]\r\n \r\nif n1 < n2:\r\n print('<')\r\nelif n1 > n2:\r\n print('>')\r\nelse:\r\n print('=')", "def perevod(chislo, osnovanie, dlina):\r\n rez = 0\r\n\r\n for i in range(dlina):\r\n rez += chislo[i] * osnovanie**i\r\n\r\n return rez\r\n\r\nn, bx = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nm, by = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\nx = x[::-1]\r\ny = y[::-1]\r\n\r\nrez1 = 0\r\nrez2 = 0\r\n\r\nrez1 = perevod(x, bx, n)\r\nrez2 = perevod(y, by, m)\r\n\r\nif rez1 == rez2:\r\n print('=')\r\nelif rez1 < rez2:\r\n print('<')\r\nelse:\r\n print('>')\r\n", "contest = True\nif not contest:\n fin = open(\"in\", \"r\")\ninp = input if contest else lambda: fin.readline()[:-1]\nread = lambda: tuple(map(int, inp().split()))\n\nlx, bx = read()\nnumsx = tuple(reversed(read()))\nx = 0\nfor i in range(lx):\n x += numsx[i] * bx ** i\n\nly, by = read()\nnumsy = tuple(reversed(read()))\ny = 0\nfor i in range(ly):\n y += numsy[i] * by ** i\n\nif x == y:\n print(\"=\")\nif x > y:\n print(\">\")\nif x < y:\n print(\"<\")\n", "\r\n\r\n\r\na , A = map(int,input().split())\r\n\r\n\r\nt = list(map(int,input().split()))[::-1]\r\n\r\n\r\nb,B = map(int,input().split())\r\n\r\n\r\ny = list(map(int,input().split()))[::-1]\r\n\r\nh=0\r\nfor j in range(a):\r\n h+=t[j]*((A)**j)\r\n\r\ng=0\r\nfor i in range(b):\r\n g+=y[i]*(B**i)\r\n\r\nif h>g:\r\n print('>')\r\nelif g>h:\r\n print('<')\r\nelse:\r\n print('=')\r\n", "import sys\r\nn,bx = map(int,input().split())\r\na = list(map(int,input().split()))\r\nm,by = map(int,input().split())\r\nb = list(map(int,input().split()))\r\n\r\nx = p = 0\r\nfor i in range(n-1,-1,-1):\r\n x += a[i]*(bx**p)\r\n p += 1\r\n\r\ny = p = 0\r\nfor i in range(m-1,-1,-1):\r\n y += b[i]*(by**p)\r\n p += 1\r\n\r\nif x < y:\r\n print('<')\r\nelif x > y:\r\n print('>')\r\nelse:\r\n print('=')\r\n ", "#!/usr/local/bin/python3.4 -tt\n\nimport random\nimport sys\n\nif __name__ == '__main__':\n def _(f):\n for l in f:\n for i in l.split():\n yield int(i)\n\n g = _(sys.stdin)\n\n n, b = (next(g),\n next(g),\n )\n\n X = 0\n\n for i in range(n):\n X = X * b + next(g)\n\n Y = 0\n \n n, b = (next(g),\n next(g),\n )\n\n for i in range(n):\n Y = Y * b + next(g)\n\n if X < Y:\n print('<')\n elif X > Y:\n print('>')\n else:\n print('=')\n", "nx, bx = map(int, input().split())\r\ndigx = list(map(int, input().split()))\r\nny, by = map(int, input().split())\r\ndigy = list(map(int, input().split()))\r\nx,y = 0,0\r\nfor i in range(nx):\r\n x += digx[nx-1-i] * (bx**i)\r\nfor j in range(ny):\r\n y += digy[ny-1-j] * (by**j)\r\nif x == y: print(\"=\")\r\nelif x > y: print(\">\")\r\nelse: print(\"<\")", "n1, m1 = map(int, input().split())\r\ns1 = 0;\r\np = 1;\r\nfor i in list(reversed(list(map(int, input().split())))):\r\n s1 += i * p\r\n p *= m1\r\nn1, m1 = map(int, input().split())\r\ns2 = 0;\r\np = 1;\r\nfor i in list(reversed(list(map(int, input().split())))):\r\n s2 += i * p\r\n p *= m1\r\nif (s1 == s2):\r\n print(\"=\")\r\nelif(s1 > s2):\r\n print(\">\")\r\nelse:\r\n print(\"<\")\r\n", "import sys\r\na, b = [int(x) for x in input().split()]\r\nbase = b ** (a - 1)\r\nres1 = 0\r\narr = [int(x) for x in input().split()]\r\nfor digit in arr:\r\n res1 += digit * base\r\n base //= b\r\n\r\na, b = [int(x) for x in input().split()]\r\nbase = b ** (a - 1)\r\nres2 = 0\r\narr = [int(x) for x in input().split()]\r\nfor digit in arr:\r\n res2 += digit * base\r\n base //= b\r\n\r\nif res1 > res2:\r\n print('>')\r\nelif res1 < res2:\r\n print('<')\r\nelse:\r\n print('=')\r\n\r\n", "def get():\r\n n, b = map(int, input().split())\r\n v = 0\r\n for x in map(int, input().split()):\r\n v = b * v + x\r\n return v\r\nx, y = get(), get()\r\nprint('<' if x < y else ('>' if x > y else '='))", "def getNum(x, base):\r\n ans = 0\r\n for r in x:\r\n ans = (ans * base) + r\r\n return ans\r\nN, bx = map(int, input().strip().split())\r\nx = [int(x) for x in input().strip().split()]\r\n\r\nM, by = map(int, input().strip().split())\r\ny = [int(x) for x in input().strip().split()]\r\n\r\nxx = getNum(x, bx)\r\nyy = getNum(y, by)\r\nif(xx == yy):\r\n print(\"=\")\r\nelif(xx < yy):\r\n print(\"<\")\r\nelse:\r\n print(\">\")\r\n", "from re import I\r\n#import sys\r\n#sys.stdin=open(\"testinput.txt\")\r\nline1=[int(i) for i in input().split(' ')]\r\nd=[int(i) for i in input().split(' ')]\r\nd.reverse()\r\ne=0\r\nfor i in range(len(d)):\r\n val=line1[1]**i\r\n e+=val*d[i]\r\n\r\n#print(e) \r\ne1=0\r\nline=[int(i) for i in input().split(' ')]\r\nd=[int(i) for i in input().split(' ')]\r\nd.reverse()\r\nfor i in range(len(d)):\r\n val=line[1]**i\r\n e1+=val*d[i]\r\nif(e==e1):\r\n print('=')\r\nelif(e>e1):\r\n print('>')\r\nelse:\r\n print('<')", "X,x=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\na=a[::-1]\r\nh=0\r\nfor i in range(X):\r\n h+=a[i]*x**i\r\nY,y=map(int,input().split())\r\nb=[int(i) for i in input().split()]\r\nb=b[::-1]\r\nk=0\r\nfor i in range(Y):\r\n k+=b[i]*y**i\r\nif(h==k):\r\n print('=')\r\nelif(h<k):\r\n print('<')\r\nelse:\r\n print('>')", "first_number_base = [int(info) for info in input().split(' ')]\nfirst_number_digits = input().split(' ')\nsecond_number_base = [int(info) for info in input().split(' ')]\nsecond_number_digits = input().split(' ')\nif first_number_base[1] != 10:\n\tfirst_number = 0\n\tcounter = 0\n\tfor i in list(reversed(first_number_digits)):\n\t\tfirst_number += int(i) * first_number_base[1] ** counter\n\t\tcounter += 1\nelse:\n\tfirst_number = int(''.join(first_number_digits))\n\nif second_number_base[1] != 10:\n second_number = 0\n counter = 0\n for i in list(reversed(second_number_digits)):\n second_number += int(i) * second_number_base[1] ** counter\n counter += 1\nelse:\n\tsecond_number = int(''.join(second_number_digits))\nif first_number < second_number:\n\tprint('<')\nelif first_number > second_number:\n\tprint('>')\nelse:\n\tprint('=')\n", "#n = int(input())\r\n#m = int(input())\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nn, bx = a\r\n\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nx = a.copy()\r\n\r\nsx = 0\r\nfor i in range(n):\r\n sx += x[n-1-i]* bx ** i\r\n\r\n\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nm, by = a\r\n\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\ny = a.copy()\r\n\r\nsy = 0\r\nfor i in range(m):\r\n sy += y[m-1-i]* by ** i\r\n\r\nif sx == sy:\r\n print('=')\r\nelif sx > sy:\r\n print('>')\r\nelse:\r\n print('<')", "nx,x=[int(i) for i in input().split()]\r\nX=0\r\nfor i in input().split():\r\n X+=int(i)*x**(nx-1)\r\n nx-=1\r\n\r\nny,y=[int(i) for i in input().split()]\r\nY=0\r\nfor i in input().split():\r\n Y+=int(i)*y**(ny-1)\r\n ny-=1\r\n\r\nif X<Y:\r\n print('<')\r\nelif X>Y:\r\n print('>')\r\nelse:\r\n print('=')\r\n", "i=input()\nn,bx= tuple(map(int,i.split(' ')))\ni=input()\nval1=sum([int(a)*(bx**(n-ind-1)) for ind,a in enumerate(i.split(' '))])\n\ni=input()\nn,bx= tuple(map(int,i.split(' ')))\ni=input()\nval2=sum([int(a)*(bx**(n-ind-1)) for ind,a in enumerate(i.split(' '))])\n\n#print(val1)\n#print(val2)\n\nif val1==val2:\n print('=')\nelse:\n if(val1<val2):\n print('<')\n else:\n print('>')\n", "n,bx = input().split()\r\nn,bx = int(n),int(bx);\r\nd = input().split()\r\nx,pot = 0,1\r\nd.reverse()\r\nfor dd in d:\r\n\tx += int(dd)*pot\r\n\tpot *= bx;\r\n\r\n\r\nn,bx = input().split()\r\nn,bx = int(n),int(bx);\r\nd = input().split()\r\ny,pot = 0,1\r\nd.reverse()\r\nfor dd in d:\r\n\ty += int(dd)*pot\r\n\tpot *= bx;\r\n\r\nif x<y:\r\n\tprint('<')\r\nelif x>y:\r\n\tprint('>')\r\nelse:\r\n\tprint('=')", "inp = input().split()\nn = int(inp[0])\nbx = int(inp[1])\n\nX = input().split()\nfor i in range(n):\n X[i] = int(X[i])\nX = X[::-1]\n\ninp = input().split()\nm = int(inp[0])\nby = int(inp[1])\n\nY = input().split()\nfor i in range(m):\n Y[i] = int(Y[i])\nY = Y[::-1]\n\nsum_X = 0\nbase = 1\nfor n in X:\n sum_X += base*n\n base *= bx\n\nsum_Y = 0\nbase = 1\nfor n in Y:\n sum_Y += base*n\n base *= by\nif sum_X == sum_Y:\n print('=')\nelif sum_X < sum_Y:\n print('<')\nelse:\n print('>')\n", "n, base = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nchislo1 = 0\r\nfor i in range(n):\r\n chislo1 += a[i]*(base**(n-i-1))\r\nn, base = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nchislo2 = 0\r\nfor i in range(n):\r\n chislo2 += a[i]*(base**(n-i-1))\r\nif chislo2 > chislo1:\r\n print('<')\r\nelif chislo2 == chislo1:\r\n print('=')\r\nelse:\r\n print('>')\r\n\r\n", "def solve():\r\n n, b_x = map(int, input().split())\r\n\r\n x = [int(_) for _ in input().split()]\r\n\r\n m, b_y = map(int, input().split())\r\n\r\n y = [int(_) for _ in input().split()]\r\n\r\n x_result = 0\r\n\r\n for i in range(0, n):\r\n x_result += pow(b_x, i) * int(x[len(x) - 1 - i])\r\n\r\n y_result = 0\r\n\r\n for i in range(0, m):\r\n y_result += pow(b_y, i) * int(y[len(y) - 1 - i])\r\n\r\n if x_result > y_result:\r\n print(\">\")\r\n elif x_result < y_result:\r\n print(\"<\")\r\n else:\r\n print(\"=\")\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "from collections import *\nfrom math import *\nfrom itertools import *\ndef I():return map(int , input().strip().split())\nx, b1 = I()\narr1 = list(I())\ny, b2 = I()\narr2 = list(I())\narr1.reverse()\narr2.reverse()\np1, p2 = 0, 0\nfor i in range(x):\n p1 += (pow(b1, i)*arr1[i])\nfor i in range(y):\n p2 += (pow(b2, i)*arr2[i])\nif p1 == p2:\n print(\"=\")\nelif p1 > p2:\n print(\">\")\nelse:\n print(\"<\")\n", "a=int(input().split()[1])\r\n*b,=map(int,input().split())\r\nc=0\r\nfor i in b:c=c*a+i\r\nd=int(input().split()[1])\r\n*e,=map(int,input().split())\r\nf=0\r\nfor i in e:f=f*d+i\r\nif c==f:print('=')\r\nelif c<f:print('<')\r\nelse:print('>')\r\n", "bx=int(input().split()[1])\r\nx=list(map(int,input().split()))\r\nby=int(input().split()[1])\r\ny=list(map(int,input().split()))\r\nX=Y=0\r\nfor xi in x:\r\n X=X*bx+xi\r\nfor yi in y:\r\n Y=Y*by+yi\r\nif(X>Y):\r\n print(\">\")\r\nelif(X<Y):\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "def convert(digits, base):\n res = 0\n digits.reverse()\n power = 1\n for i in digits:\n res += i * power\n power *= base\n return res\n\nn, base_a = [int(x) for x in input().split()]\ndigits_a = [int(x) for x in input().split()]\na = convert(digits_a, base_a)\n\nn, base_a = [int(x) for x in input().split()]\ndigits_a = [int(x) for x in input().split()]\nb = convert(digits_a, base_a)\n\nif a < b:\n print(\"<\")\nelif a > b:\n print(\">\")\nelse:\n print(\"=\")\n", "import math\r\ns1=input()\r\ns2=input()\r\ns3=input()\r\ns4=input()\r\ndx=int(s1.split(\" \")[0])\r\nbx=int(s1.split(\" \")[1])\r\ndy=int(s3.split(\" \")[0])\r\nby=int(s3.split(\" \")[1])\r\nx=0\r\ny=0\r\nfor i in range(0,dx):\r\n x=x+int(s2.split(\" \")[i])*(bx**(dx-1-i))\r\nfor i in range(0,dy):\r\n y=y+int(s4.split(\" \")[i])*(by**(dy-1-i))\r\nif x<y:\r\n print(\"<\")\r\nelif x>y:\r\n print(\">\")\r\nelse:\r\n print(\"=\")\r\n\r\n \r\n", "def main():\n x = read()\n y = read()\n\n if x == y:\n print(\"=\")\n elif x < y:\n print(\"<\")\n else:\n print(\">\")\n\n\ndef read():\n n, bx = map(int, input().split())\n xb = list(map(int, input().split()))\n x = 0\n\n for i in range(n - 1, -1, -1):\n x += xb[i] * (bx ** (n - 1 - i))\n\n return x\n\n\nif __name__ == \"__main__\":\n main()\n", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n\r\nn, bx = map(int,input().split())\r\nX = list(map(int,input().split()))\r\nd_x = 0\r\nfor idx, x in enumerate(X[::-1]):\r\n d_x += x * (bx ** idx)\r\n\r\nm, by = map(int,input().split())\r\nY = list(map(int,input().split()))\r\nd_y = 0\r\nfor idx, y in enumerate(Y[::-1]):\r\n d_y += y * (by ** idx)\r\nif d_x < d_y:\r\n print('<')\r\nelif d_x > d_y:\r\n print('>')\r\nelse:\r\n print('=')\r\n", "def convert():\r\n n, b = map(int, input().split())\r\n v = 0\r\n for x in map(int, input().split()):\r\n v = b * v + x\r\n return v\r\n\r\nx, y = convert(), convert()\r\nif x > y:\r\n print('>')\r\nelif x < y:\r\n print('<')\r\nelse:\r\n print('=')\r\n", "n,bx = [int(i) for i in input().split()]\r\nx = [int(i) for i in input().split()]\r\nm,by = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\nxd,yd = 0,0\r\nfor i in range(n):xd+=x[i]*bx**(n-i-1)\r\nfor i in range(m):yd+=y[i]*by**(m-i-1)\r\nif xd<yd: print('<')\r\nelif xd>yd: print('>')\r\nelse: print('=')\r\n", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2015 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn, b = list(map(int, input().split()))\nl1 = list(reversed(list(map(int, input().split()))))\n\nm, a = list(map(int, input().split()))\nl2 = list(reversed(list(map(int, input().split()))))\n\nx = 0\ny = 0\n\nfor i in range(len(l1)):\n x += (l1[i]*pow(b, i))\nfor i in range(len(l2)):\n y += (l2[i]*pow(a, i))\n\nif x < y:\n print(\"<\")\nelif x == y:\n print(\"=\")\nelse:\n print(\">\")\n", "a = input()\r\na = a.split()\r\n\r\nnx = int(a[0])\r\nbx = int(a[1])\r\nx = 0\r\n\r\na = input()\r\na = a.split()\r\nfor i in range(nx):\r\n x *= bx\r\n x += int(a[i])\r\n\r\na = input()\r\na = a.split()\r\n\r\nny = int(a[0])\r\nby = int(a[1])\r\ny = 0\r\n\r\na = input()\r\na = a.split()\r\nfor i in range(ny):\r\n y *= by\r\n y += int(a[i])\r\n\r\nif x == y :\r\n print('=')\r\nelif x > y :\r\n print('>')\r\nelse :\r\n print('<')\r\n\r\n", "n,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=1\r\na1=b1=0\r\nfor x in range(n-1,-1,-1):\r\n a1+=l[x]*d\r\n d*=b\r\n\r\n\r\nm,a=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=1\r\nfor x in range(m-1,-1,-1):\r\n b1+=l[x]*d\r\n d*=a\r\n\r\nif a1==b1:print('=')\r\nelif a1>b1:print('>')\r\nelse:print('<')", "nx, bx = map(int, input().split())\r\ndigx = list(map(int, input().split()))\r\nny, by = map(int, input().split())\r\ndigy = list(map(int, input().split()))\r\n\r\nx = y = 0\r\nrx = ry = 1\r\n\r\nfor i in range(nx):\r\n x += digx[nx-1-i] * rx\r\n rx *= bx\r\n \r\nfor j in range(ny):\r\n y += digy[ny-1-j] * ry\r\n ry *= by\r\n \r\nif x == y: \r\n print(\"=\")\r\nelif x > y: \r\n print(\">\")\r\nelse: \r\n print(\"<\")", "def getIn10bySt(n, st):\r\n m = 0\r\n ans = 0\r\n i = len(n)-1\r\n while i >= 0:\r\n ans += int(n[i]) * (st**m)\r\n m+=1\r\n i-=1\r\n return ans\r\nn, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nX = getIn10bySt(a, x)\r\nn, x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nY = getIn10bySt(a, x)\r\nif X > Y:\r\n print(\">\")\r\nelif X < Y:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "def bases():\n n,b=map(int, input().split())\n v=0\n for x in map(int,input().split()):\n v=b*v + x\n return v\nx,y=bases(),bases()\nprint('<' if x<y else ('>' if x>y else '='))\n \t\t \t \t\t \t\t\t \t\t\t \t \t \t", "def anyToDecimal(num,n):\r\n baseStr = {\"0\":0,\"1\":1,\"2\":2,\"3\":3,\"4\":4,\"5\":5,\"6\":6,\"7\":7,\"8\":8,\"9\":9,\r\n \"10\":10,\"11\":11,\"12\":12,\"13\":13,\"14\":14,\"15\":15,\"16\":16,\"17\":17,\"18\":18,\"19\":19,\r\n \"20\":20,\"21\":21,\"22\":22,\"23\":23,\"24\":24,\"25\":25,\"26\":26,\"27\":27,\"28\":28,\"29\":29,\r\n \"30\":30,\"31\":31,\"32\":32,\"33\":33,\"34\":34,\"35\":35,\"36\":36,\"37\":37,\"38\":38,\"39\":39,\r\n \"40\":40}\r\n new_num = 0\r\n nNum = len(num) - 1\r\n for i in num: \r\n new_num = new_num + baseStr[i]*pow(n,nNum)\r\n nNum = nNum -1 \r\n return new_num\r\n\r\nn1=list(map(int,input().split()))\r\nx=list(map(str,input().split()))\r\nn2=list(map(int,input().split()))\r\ny=list(map(str,input().split()))\r\n# print(x,n1[1])\r\nans_x=anyToDecimal(x, n1[1])\r\nans_y=anyToDecimal(y, n2[1])\r\nif ans_x>ans_y:\r\n print(\">\")\r\nelif ans_x<ans_y:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "def calc(base,arr):\r\n n=len(arr)\r\n ans=0\r\n for i in range(0,n):\r\n ans=ans+(base**i)*arr[-1-i]\r\n return ans\r\n\r\n\r\ninfo=list(map(int,input().split()))\r\nsizex,basex=info[0],info[1]\r\nvalx=list(map(int,input().split()))\r\ninfo=list(map(int,input().split()))\r\nsizey,basey=info[0],info[1]\r\nvaly=list(map(int,input().split()))\r\none =calc(basex,valx)\r\ntwo=calc(basey,valy)\r\nif one==two:\r\n print(\"=\")\r\nelif one<two:\r\n print(\"<\")\r\nelif one>two:\r\n print(\">\")\r\n", "def read():\r\n\tn, b = map(int, input().split())\r\n\tt = 0\r\n\tl = list(map(int, input().split()))\r\n\tfor i in l:\r\n\t\tt = t * b + i\r\n\treturn t\r\n\r\na = read()\r\nb = read()\r\nif a == b:\r\n\tprint(\"=\")\r\nelif a < b:\r\n\tprint(\"<\")\r\nelse:\r\n\tprint(\">\")", "\r\nprint((lambda x:'>' if x>0 else '='if x==0 else '<')(sum((lambda n:map((lambda x: n[1]**x[0]*x[1]),(list(enumerate(reversed(list(map(int,input().split()))))))))(list(map(int,input().split()))))-sum((lambda bx:map((lambda x: bx[1]**x[0]*x[1]),(list(enumerate(reversed(list(map(int,input().split()))))))))(list(map(int,input().split()))))))\r\n", "n, bx = map(int, input().split())\r\ns1 = 0\r\np1 = 1\r\nfor i in list(map(int, input().split()))[::-1]:\r\n s1 += i * p1\r\n p1 *= bx\r\nm, by = map(int, input().split())\r\ns2 = 0\r\np2 = 1\r\nfor i in list(map(int, input().split()))[::-1]:\r\n s2 += i * p2\r\n p2 *= by\r\nif s1 == s2:\r\n print('=')\r\nelif s1 > s2:\r\n print('>')\r\nelse:\r\n print('<')", "#!/usr/bin/python3\n\ndef make_num(lst, bx):\n\tres = 0\n\tfor elem in lst:\n\t\tres *= bx\n\t\tres += elem\n\treturn res\n\n\nn, bx = map(int, input().split())\nnum1 = make_num(map(int, input().split()), bx)\n\nm, by = map(int, input().split())\nnum2 = make_num(map(int, input().split()), by)\n\nif num1 < num2:\n\tprint('<')\nelif num1 == num2:\n\tprint('=')\nelse:\n\tprint('>')", "n1,base1 = list(map(int, input().strip(\" \").split(\" \")))\r\nx = list(map(int, input().strip(\" \").split(\" \")))\r\nn2,base2 = list(map(int, input().strip(\" \").split(\" \")))\r\ny = list(map(int, input().strip(\" \").split(\" \")))\r\ndef basex_base10(x,n,base):\r\n ans = 0\r\n for i in range(n):\r\n ans = ans + x[i]*(base**(n-i-1))\r\n return ans\r\nif basex_base10(x,n1,base1)>basex_base10(y,n2,base2):\r\n print(\">\")\r\nelif basex_base10(x,n1,base1)<basex_base10(y,n2,base2):\r\n print(\"<\")\r\nelse:\r\n print(\"=\")", "def main():\r\n X=0\r\n Y=0\r\n n, bx = [int(i) for i in input().split()]\r\n num = [int(i) for i in input().split()]\r\n for i in range(n):\r\n X+=num[n-i-1]*(bx**(i))\r\n \r\n n2, by = [int(i) for i in input().split()]\r\n num2 = [int(i) for i in input().split()]\r\n for i in range(n2):\r\n Y+=num2[n2-i-1]*(by**(i))\r\n \r\n if X>Y:\r\n print('>')\r\n elif X<Y:\r\n print('<')\r\n else:\r\n print('=')\r\n \r\nif __name__ == \"__main__\":\r\n main()", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\n\r\n#CODE\r\n\r\n\r\n\r\n\r\nn , a = MAP()\r\nl1 = LIST()\r\nr1 = 0\r\nfor i in l1:\r\n r1 += (i )* a **(n - 1)\r\n n-=1\r\n\r\nm , b = MAP()\r\nl2 = LIST()\r\nr2 = 0\r\nfor i in l2:\r\n r2 += (i) * b ** (m - 1)\r\n m -= 1\r\n\r\n#print(r1)\r\n#print(r2)\r\nif r1 > r2 :\r\n print('>')\r\nelif r1 < r2 :\r\n print('<')\r\nelse:\r\n print('=')\r\n\r\n", "n, bx = map(int, input().split())\r\nxn = list(map(int, input().split()))\r\nm, by = map(int, input().split())\r\nyn = list(map(int, input().split()))\r\nx = 0\r\nfor i in range(n):\r\n x += xn[n-1-i] * bx ** i\r\ny = 0\r\nfor i in range(m):\r\n y += yn[m-1-i] * by ** i\r\nif x == y:\r\n print(\"=\")\r\nelif x > y:\r\n print(\">\")\r\nelse:\r\n print(\"<\")\r\n", "l = [int(x) for x in input().split()]\nn, bx = l[0], l[1]\na = [int(x) for x in input().split()]\n\nxx = 0\n\nfor y in a:\n\txx *= bx\n\txx += y\n\nl = [int(x) for x in input().split()]\nm, by = l[0], l[1]\nb = [int(x) for x in input().split()]\nyy = 0\n\nfor y in b:\n\tyy *= by\n\tyy += y\n\nif(xx < yy):\n\tprint(\"<\")\n\nelif (xx == yy):\n\tprint(\"=\")\n\nelse:\n\tprint(\">\")\n", "n, b = list(map(int, input().split(' ')))\r\nX = list(map(int, input().split(' ')))\r\nNico = 1\r\nx = 0\r\nfor i in range(n):\r\n x = x + X[n - 1 - i] * Nico\r\n Nico = Nico * b\r\nn, b = list(map(int, input().split(' ')))\r\nY = list(map(int, input().split(' ')))\r\nNico = 1\r\ny = 0\r\nfor i in range(n):\r\n y = y + Y[n - 1 - i] * Nico\r\n Nico = Nico * b\r\nif (x < y):\r\n print(\"<\")\r\nif (x == y):\r\n print(\"=\")\r\nif (x > y):\r\n print(\">\")\r\n", "x=0\nn,k=map(int,input().split())\nfor i in map(int,input().split()):\n n-=1\n x+=i*k**n\ny=0\nn,k=map(int,input().split())\nfor i in map(int,input().split()):\n n-=1\n y+=i*k**n\nprint('=' if x==y else '<' if x < y else '>')", "n,x = map(int,input().split())\r\narrx = list(map(int,input().split()))\r\nm,y = map(int,input().split())\r\narry = list(map(int,input().split()))\r\nsumx=sumy=0\r\nfor i in range(n):\r\n sumx += pow(x,n-1-i)*arrx[i]\r\nfor j in range(m):\r\n sumy += pow(y,m-1-j)*arry[j]\r\nif sumx>sumy:\r\n print('>')\r\nelif sumx<sumy:\r\n print('<')\r\nelse:\r\n print('=')", "n1,base=map(int,input().split())\r\na1=list(map(int,input().split()))\r\nn2,base1=map(int,input().split())\r\na2=list(map(int,input().split()));val1=0;val2=0;c=0\r\nfor i in range(n1-1,-1,-1):\r\n val1+=a1[i]*(base**c);c+=1\r\nc=0\r\nfor i in range(n2-1,-1,-1):\r\n val2+=a2[i]*(base1**c);c+=1\r\nif val1<val2:print(\"<\")\r\nelif val1>val2:print(\">\")\r\nelse:print(\"=\")", "bx = int(input().split()[1])\r\nX = tuple(map(int, input().split()))\r\nby = int(input().split()[1])\r\nY = tuple(map(int, input().split()))\r\nx = y = 0\r\nfor d in X:\r\n\tx = x * bx + d\r\nfor d in Y:\r\n\ty = y * by + d\r\nif x == y:\r\n\tprint('=')\r\nelif x > y:\r\n\tprint('>')\r\nelse:\r\n\tprint('<')", "def convert_base(s: str, base: int):\r\n digits = list(map(int, s.strip().split()))\r\n return sum(\r\n digit * base ** (len(digits) - position - 1)\r\n for position, digit in enumerate(digits)\r\n )\r\n\r\n\r\nn, bx = map(int, input().strip().split())\r\nx = convert_base(input(), bx)\r\n\r\nm, by = map(int, input().strip().split())\r\ny = convert_base(input(), by)\r\n\r\nif x == y:\r\n print(\"=\")\r\nelif x < y:\r\n print(\"<\")\r\nelse:\r\n print(\">\")\r\n", "def get_number(digits, base):\n number = 0\n multiplier = 1\n for digit in reversed(digits):\n number += digit * multiplier\n multiplier *= base\n\n return number\n\n\ndef main():\n n, b_x = [int(t) for t in input().split()]\n digits_x = [int(t) for t in input().split()]\n n, b_y = [int(t) for t in input().split()]\n digits_y = [int(t) for t in input().split()]\n\n x = get_number(digits_x, b_x)\n y = get_number(digits_y, b_y)\n\n if x == y:\n print('=')\n if x < y:\n print('<')\n if x > y:\n print('>')\n\n\nif __name__ == '__main__':\n main()\n", "n, bx =map(int,input().split())\r\nx = list(map(int, input().split()))\r\nx =reversed(x)\r\nq = 1\r\nx1 = 0\r\nfor i in x:\r\n x1 += q * i\r\n q *= bx\r\n\r\nn, bx =map(int,input().split())\r\nx = list(map(int, input().split()))\r\nx =reversed(x)\r\nq = 1\r\ny1 = 0\r\nfor i in x:\r\n y1 += q * i\r\n q *= bx\r\nif x1>y1:\r\n print('>')\r\nelif x1<y1:\r\n print('<')\r\nelse:\r\n print('=')\r\n ", "n,bx=[int(i) for i in input().split()]\r\nx=input().split()\r\ns=0\r\nfor i in range(n):\r\n s=s+int(x[i])*(bx**(n-i-1))\r\nm,by=[int(i) for i in input().split()]\r\ny=input().split()\r\nt=0\r\nfor i in range(m):\r\n t=t+int(y[i])*(by**(m-i-1))\r\n\r\nif s<t:\r\n print('<')\r\nif s==t:\r\n print('=')\r\nif s>t:\r\n print('>')\r\n", "x, n = map(int, input().split())\r\na = 0\r\nfor e in map(int, input().split()):\r\n a += e\r\n a *= n\r\na //= n\r\nx, n = map(int, input().split())\r\nb = 0\r\nfor e in map(int, input().split()):\r\n b += e\r\n b *= n\r\nb //= n\r\nif a < b:\r\n print('<')\r\nelif a > b:\r\n print('>')\r\nelse:\r\n print('=')\r\n", "n , bx = map(int, input().split())\r\nX , Y = 0 , 0\r\nfor x in list(map(int,input().split())):\r\n X = X * bx + x\r\nn , by = map(int, input().split())\r\nfor y in list(map(int,input().split())):\r\n Y = Y * by + y\r\nprint([['<','>'][X>Y], '='][X==Y])", "n1,b1=map(int,input().split())\r\na1=list(map(int,input().split()))\r\na1.reverse()\r\nn2,b2=map(int,input().split())\r\na2=list(map(int,input().split()))\r\na2.reverse()\r\nx=0\r\ny=0\r\nimport math\r\nfor i in range(n1):\r\n x+=(a1[i]*math.pow(b1,i))\r\nfor i in range(n2):\r\n y+=(a2[i]*math.pow(b2,i))\r\nif(x==y):\r\n print(\"=\")\r\nelif(x<y):\r\n print(\"<\")\r\nelif (x>y):\r\n print(\">\")\r\n", "def main():\r\n\t(n, bx) = (int(x) for x in input().split())\r\n\tdigitsX = [int(x) for x in input().split()]\r\n\t(m, by) = (int(x) for x in input().split())\r\n\tdigitsY = [int(x) for x in input().split()]\r\n\tprint(solver(digitsX, bx, digitsY, by))\r\n\r\ndef solver(digitsX, bx, digitsY, by):\r\n\tX = getValue(digitsX, bx)\r\n\tY = getValue(digitsY, by)\r\n\tif X < Y:\r\n\t\treturn '<'\r\n\telif X == Y:\r\n\t\treturn '='\r\n\telse:\r\n\t\treturn '>'\r\n\r\ndef getValue(digitsK, bk):\r\n\ttotal = 0\r\n\tfor i in range(len(digitsK)):\r\n\t\ttotal += digitsK[i] * pow(bk, len(digitsK) - i - 1)\r\n\treturn total\r\n\r\nmain()\r\n# digits1 = [1, 0, 1, 1]\r\n# b1 = 3\r\n# print(getValue(digits1, b1))", "n, bx = [int(var) for var in input().split()]\r\nx = [int(var) for var in input().split()]\r\nm, by = [int(var) for var in input().split()]\r\ny = [int(var) for var in input().split()]\r\n\r\ndef findnum(b, db):\r\n num = 0\r\n for dig in db:\r\n num *= b\r\n num += dig\r\n return num\r\n\r\nax = findnum(bx, x)\r\nay = findnum(by, y)\r\n\r\nif ax < ay:\r\n print('<')\r\nelif ax == ay:\r\n print('=')\r\nelse:\r\n print('>')\r\n\r\n", "n,m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf.reverse()\r\nx = 0\r\nx1 = 1\r\ny = 0\r\ny1 = 1\r\nfor i in range(n):\r\n\tx += x1 * f[i]\r\n\tx1 *= m\r\nn,m = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf.reverse()\r\nfor i in range(n):\r\n\ty += y1 * f[i]\r\n\ty1 *= m\r\n#print(x)\r\n#print(y)\r\nif ( x < y ):\r\n\tprint (\"<\")\r\nelif ( x == y):\r\n\tprint (\"=\")\r\nelse:\r\n\tprint (\">\") \r\n\r\n", "#See the constraints; check if Brute force is useful\r\n#Figure out a realtion or general formula if possible\r\n#Find the corner cases\r\n#dp,prefix sum, greedy solution or logical \r\n#Ek baar aur kr bro\r\n#Be organised \r\n#Think hard you can do it\r\n\r\ndef singleinput():R = int(input());return R\r\ndef strinput():R = str(input());return R\r\ndef intarray():As = list(map(int,input().split()));return As\r\ndef matrixinput(arr): As = list(map(int,input().split())); arr.append(As)\r\n\r\n\r\nan = intarray()\r\nna,bx = an[0],an[1]\r\narrx = intarray()\r\nbn = intarray()\r\nnb,by = bn[0],bn[1]\r\narry = intarray()\r\n\r\nX = sum(arrx[i]*(bx**(na-i-1)) for i in range(0,na) )\r\nY = sum(arry[i]*(by**(nb-i-1)) for i in range(0,nb) )\r\n\r\nif(X>Y):\r\n print('>')\r\nelif(X==Y):\r\n print('=')\r\nelse:\r\n print('<')", "n1, m1 = map(int, input().split())\r\na1 = list(map(int, input().split()))\r\nans1 = 0\r\nind1 = n1 - 1\r\nfor i in a1:\r\n ans1 += i * (m1 ** ind1)\r\n ind1 -= 1\r\nn2, m2 = map(int, input().split())\r\na2= list(map(int, input().split()))\r\nans2 = 0\r\nind2 = n2 - 1\r\nfor i in a2:\r\n ans2 += i * (m2 ** ind2)\r\n ind2 -= 1\r\nif (ans1 == ans2):\r\n print('=')\r\nelse:\r\n if (ans1 > ans2):\r\n print('>')\r\n else:\r\n print('<')\r\n", "n, n1 = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nm,m1 = map(int,input().split())\r\nb = [int(x) for x in input().split()]\r\ns1 = 0\r\ns2 = 0\r\nk = 0\r\nfor i in range(len(a)-1,-1,-1):\r\n s1 += a[i] * (n1**k)\r\n k += 1\r\nk = 0\r\nfor i in range(len(b)-1,-1,-1):\r\n s2 += b[i] * (m1**k)\r\n k += 1\r\n\r\nif s1 < s2 : print('<')\r\nelif s1 > s2: print('>')\r\nelse : print('=')\r\n", "\"\"\"\nCodeforces Round 333 (Div. 2)\n\nProblem 602 A.\n\n@author yamaton\n@date 2015-11-24\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef solve(xs, ys, bx, by):\n x = functools.reduce(lambda acc, x: acc * bx + x, xs)\n y = functools.reduce(lambda acc, y: acc * by + y, ys)\n if x < y:\n return '<'\n elif x > y:\n return '>'\n else:\n return '='\n\n\n\n# def p(*args, **kwargs):\n# return print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n [n, bx] = map(int, input().strip().split())\n xs = [int(c) for c in input().strip().split()]\n assert len(xs) == n\n [m, by] = map(int, input().strip().split())\n ys = [int(c) for c in input().strip().split()]\n assert len(ys) == m\n\n result = solve(xs, ys, bx, by)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "n1 = 0\r\nn, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.reverse()\r\nfor i in range(n):\r\n n1 += a[i] * (b ** i)\r\nn2 = 0\r\nn, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.reverse()\r\nfor i in range(n):\r\n n2 += a[i] * (b ** i)\r\nif n1 < n2:\r\n print(\"<\")\r\nif n1 == n2:\r\n print(\"=\")\r\nif n1 > n2:\r\n print(\">\")\r\n", "def calc():\r\n n, b = map(int, input().split())\r\n x =list(map(int, input().split()))\r\n a = 0\r\n for i in x:\r\n a = a * b + i\r\n return a\r\nlis = []\r\nfor i in range(2):\r\n lis.append(calc())\r\nif lis[0] == lis[1]:\r\n print('=')\r\nif lis[0] > lis[1]:\r\n print('>')\r\nif lis[0] < lis[1]:\r\n print('<')", "\r\nn, bx = map(int, input().split())\r\nx_bx = list(map(int, input().split())) # list of each digit of x in base bx\r\n\r\nm, by = map(int, input().split())\r\ny_by = list(map(int, input().split())) # list of each digit of y in base by\r\n\r\nx_bx.reverse() # reverse to put x_bx[0] = lsb, x_bx[len - 1] = msb\r\n\r\nx_10 = 0\r\nfor i, digit in enumerate(x_bx):\r\n x_10 += int(digit) * bx ** i\r\n\r\ny_by.reverse()\r\n\r\ny_10 = 0\r\nfor i, digit in enumerate(y_by):\r\n y_10 += int(digit) * by ** i\r\n\r\nif x_10 < y_10:\r\n print('<')\r\nelif x_10 > y_10:\r\n print('>')\r\nelse:\r\n print('=')\r\n\r\n\r\n\r\n", "nx, bx = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nny, by = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\ndef todec(x , b):\r\n res = 0\r\n exp = len(x) -1\r\n for i in x:\r\n res += i * b ** exp\r\n exp -= 1\r\n return res\r\n\r\nx = todec(x, bx)\r\ny = todec(y, by)\r\n\r\nif x > y: print(\">\")\r\nelif x < y: print(\"<\")\r\nelse: print(\"=\")", "n,bx = map(int,input().split())\r\nx = []\r\nx = list(map(int, input().split()))\r\nm,by = map(int,input().split())\r\ny = []\r\ny = list(map(int, input().split()))\r\nX = 0\r\nY = 0\r\nfor i in range(n):\r\n X = X + x[n-i-1]*(bx**i)\r\nfor i in range(m):\r\n Y = Y + y[m-i-1]*(by**i)\r\nif X==Y:\r\n print('=')\r\nelif X>Y:\r\n print('>')\r\nelse:\r\n print('<')", "if __name__ == '__main__':\n n, bx = map(int, input().split())\n xarr = list(map(int, input().split()))\n\n x = 0\n\n for i in range(n):\n x += xarr[n - i - 1] * (bx ** i)\n\n n, bx = map(int, input().split())\n yarr = list(map(int, input().split()))\n\n y = 0\n\n for i in range(n):\n y += yarr[n - i - 1] * (bx ** i)\n\n print('=' if x == y else '<' if x < y else '>')", "import sys\nl=0\nfor line in sys.stdin:\n if l == 0: xn,xb=map(int,line.split())\n if l == 1: xi=line.split()\n if l == 2: yn,yb=map(int,line.split())\n if l == 3: yi=line.split()\n l += 1\n\nx = 0\ni = xn-1\np = 0\nwhile (i >= 0):\n x+=int(xi[p])*(xb**i)\n i-=1\n p+=1\ni = yn-1\np = 0\nwhile (i >= 0):\n x-=int(yi[p])*(yb**i)\n i-=1\n p+=1\nif (x>0): print (\">\")\nelif (x==0): print (\"=\")\nelse: print (\"<\")\n", "n1, r1 = map(int, input().split())\r\nv1 = 0\r\nx1 = 1\r\nfor d in list(map(int, input().split()))[::-1]:\r\n v1 += d * x1\r\n x1 *= r1\r\n\r\nr2 = int(input().split()[1])\r\nv2 = 0\r\nx2 = 1\r\nfor d in list(map(int, input().split()))[::-1]:\r\n v2 += d * x2\r\n x2 *= r2\r\nprint('>' if v1 > v2 else ('<' if v1 < v2 else '='))\r\n", "n, bx = list(map(int, input().split(' ')))\nx = 0\nfor d in input().split(' '):\n\tx = x * bx + int(d)\n\nm, by = list(map(int, input().split(' ')))\ny = 0\nfor d in input().split(' '):\n\ty = y * by + int(d)\n\nprint('=' if x == y else '<' if x < y else '>')", "n, bx = map(int, input().split())\r\nx = 0\r\nfor i in input().split():\r\n x = x * bx + int(i)\r\nm, by = map(int, input().split())\r\ny = 0\r\nfor i in input().split():\r\n y = y * by + int(i)\r\nif x < y:\r\n print('<')\r\nelif x == y:\r\n print('=')\r\nelse:\r\n print('>')\r\n", "ans=[]\r\nfor i in range(2):\r\n (n,b),data=map(int,input().split()),list(map(int, input().split()))\r\n data.reverse();\r\n t=0\r\n j=0\r\n for i in range(n):\r\n t+=data[i]*(b**j)\r\n j+=1\r\n ans.append(t)\r\n# print(ans[0],\"...\",ans[1])\r\nif ans[0]>ans[1]:\r\n print(\">\")\r\nelif ans[0]<ans[1]:\r\n print(\"<\")\r\nelse:\r\n print(\"=\")\r\n \r\n", "n, bx = map(int, input().split())\r\nsumma1 = 0\r\ns = list(map(int, input().split()))\r\nfor i in range(n):\r\n a = s[i]\r\n summa1 += bx ** (n - i - 1) * a\r\nm, by = map(int, input().split())\r\nsumma2 = 0\r\ns = list(map(int, input().split()))\r\nfor i in range(m):\r\n a = s[i]\r\n summa2 += by ** (m - i - 1) * a\r\nif summa1 > summa2:\r\n print('>')\r\nelif summa2 == summa1:\r\n print('=')\r\nelse:\r\n print('<')", "n, bx = map(int, input().split())\r\nx = list(map(int, input().split()))[::-1]\r\nm, by = map(int, input().split())\r\ny = list(map(int, input().split()))[::-1]\r\nd1 = 0\r\ndeg = 1\r\nfor d in x:\r\n d1 += d * deg\r\n deg *= bx\r\nd2 = 0\r\ndeg = 1\r\nfor d in y:\r\n d2 += d * deg\r\n deg *= by\r\nprint('>' if d1 > d2 else '<' if d1 < d2 else '=')\r\n", "def process(bx, X, by, Y):\r\n n = len(X)\r\n X2 = sum([X[i]*bx**(n-1-i) for i in range(n)])\r\n m = len(Y)\r\n Y2 = sum([Y[i]*by**(m-1-i) for i in range(m)])\r\n if X2 < Y2:\r\n return '<'\r\n elif X2==Y2:\r\n return '='\r\n else:\r\n return '>'\r\n \r\n \r\n \r\n \r\n \r\n \r\nn, bx = [int(x) for x in input().split()]\r\nX = [int(x) for x in input().split()]\r\nm, by = [int(x) for x in input().split()]\r\nY = [int(x) for x in input().split()]\r\nprint(process(bx, X, by, Y))", "a,b = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nl1=l1[::-1]\r\nm,n = map(int,input().split())\r\n\r\nl2 = list(map(int,input().split()))\r\nl2 = l2[::-1]\r\n\r\nans1=0\r\nans2=0\r\n\r\ni=0\r\nj=0\r\n\r\nwhile(i<a):\r\n \r\n ans1+=(b**i)*l1[i]\r\n i+=1\r\n\r\n\r\nwhile(j<m):\r\n \r\n ans2+=(n**j)*l2[j]\r\n j+=1\r\n\r\nif(ans1==ans2):\r\n print(\"=\")\r\nelif ans1>ans2:\r\n print(\">\")\r\nelse:\r\n print(\"<\")\r\n\r\n ", "I = input\r\nn, bx = map(int, I().split())\r\nx = list(map(int, I().split()))\r\nm, by = map(int, I().split())\r\ny = list(map(int, I().split()))\r\nx10 = sum(x[i]*bx**(n-i-1) for i in range(n))\r\ny10 = sum(y[i]*by**(m-i-1) for i in range(m))\r\nif x10 == y10:\r\n print('=')\r\nelif x10 < y10:\r\n print('<')\r\nelse:\r\n print('>')\r\n", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd,e=map(int,input().split())\r\nf=list(map(int,input().split()))\r\nn1=0\r\nn2=0\r\nfor i in range(len(c)):\r\n n1+=c[i]*b**(len(c)-i-1)\r\nfor i in range(len(f)):\r\n n2+=f[i]*e**(len(f)-i-1)\r\nif n1>n2:\r\n print('>')\r\nelif n1==n2:\r\n print('=')\r\nelse:\r\n print('<')", "n, bx = list(map(int, input().split(' ')))\r\nx = list(map(int, input().split(' ')))\r\nn, by = list(map(int, input().split(' ')))\r\ny = list(map(int, input().split(' ')))\r\nx.reverse()\r\ny.reverse()\r\nk = 1\r\nX = 0\r\nfor i in x:\r\n X += i * k\r\n k *= bx\r\nY = 0\r\nk = 1\r\nfor i in y:\r\n Y += i * k\r\n k *= by\r\nif X<Y:\r\n print('<')\r\nelif X>Y:\r\n print('>')\r\nelse :\r\n print('=')", "n, bx = map(int, input().split())\r\nxl = list(map(int, input().split()))\r\nkx = bx ** (n - 1)\r\nx = 0\r\nfor i in range(n) :\r\n x += kx * xl[i]\r\n kx //= bx\r\nn, bx = map(int, input().split())\r\nxl = list(map(int, input().split()))\r\nkx = bx ** (n - 1)\r\ny = 0\r\nfor i in range(n) :\r\n y += kx * xl[i]\r\n kx //= bx\r\nif x < y :\r\n print(\"<\")\r\nelif x > y :\r\n print(\">\")\r\nelse :\r\n print(\"=\")", "x=0\r\ny=0\r\nn=0\r\n\r\na,b = map(int,input().split())\r\nnums1 = [int(n) for n in input().split()]\r\nc,d = map(int,input().split())\r\nnums2 = [int(n) for n in input().split()]\r\n\r\nfor i in range(a-1,-1,-1):\r\n coeff=nums1[i]\r\n x=x+coeff*(b**(a-i-1))\r\n \r\nfor i in range(c-1,-1,-1):\r\n coeff=nums2[i]\r\n y=y+coeff*(d**(c-i-1))\r\n \r\nif x<y:\r\n print('<')\r\nelif x>y:\r\n print('>')\r\nelif x==y:\r\n print('=')\r\nelse:\r\n print('error')\r\n \r\n", "n, bx = map(int,input().split())\r\nx_dig = list(map(int,input().split()))[::-1]\r\nm, by = map(int,input().split())\r\ny_dig = list(map(int,input().split()))[::-1]\r\nx = 0\r\ny = 0\r\nfor i,dig in enumerate(x_dig):\r\n x += dig * (bx**i) \r\nfor i,dig in enumerate(y_dig):\r\n y += dig * (by**i)\r\nif x > y: print('>')\r\nelif x < y: print('<')\r\nelse: print('=')", "n = input()\r\nn = n.split(\" \")\r\nl1 = int(n[0])\r\nx = int(n[1])\r\na = input()\r\na = a.split(\" \")\r\na = a[-1::-1]\r\n\r\nn = input()\r\nn = n.split(\" \")\r\nl2 = int(n[0])\r\ny = int(n[1])\r\nb = input()\r\nb = b.split(\" \")\r\nb = b[-1::-1]\r\n\r\nnum1 = 0\r\nnum2 = 0\r\n\r\nfor i in range(l1):\r\n num1+=int(a[i])*(pow(x, i))\r\n \r\nfor j in range(l2):\r\n num2+=int(b[j])*(pow(y, j))\r\n \r\nif (num1>num2):\r\n print(\">\")\r\n \r\nelif (num1<num2):\r\n print(\"<\")\r\n \r\nelse:\r\n print(\"=\")", "import math\r\nxLen, xBase = map(int, input().split())\r\nxStr = input()\r\nxArr = xStr.split()\r\nyLen, yBase = map(int, input().split())\r\nyStr = input()\r\nyArr = yStr.split()\r\n\r\ndef toDec(base, s):\r\n res = 0;\r\n for i in range(len(s)):\r\n res = res + int(s[len(s)-i-1])*math.pow(base, i)\r\n return round(res)\r\n\r\nx = toDec(xBase, xArr)\r\ny = toDec(yBase, yArr)\r\nif x > y:\r\n res = '>'\r\nelif x < y:\r\n res = '<'\r\nelse:\r\n res = '='\r\nprint(res)\r\n", "n, bx = map(int, input().split())\nx1 = list(map(int, input().split()))\nx = 0\nfor i in range(n):\n\tx *= bx\n\tx += x1[i]\n\nn, by = map(int, input().split())\ny1 = list(map(int, input().split()))\ny = 0\nfor i in range(n):\n\ty *= by\n\ty += y1[i]\n\nif x == y:\n\tprint('=')\nelif x < y:\n\tprint('<')\nelse:\n\tprint('>')\n", "# LUOGU_RID: 101606582\n(_, n), a, (_, m), b = [[*map(int, s.split())] for s in open(0)]\r\nA = 0\r\nfor x in a:\r\n A = A * n + x\r\nB = 0\r\nfor x in b:\r\n B = B * m + x\r\nprint('=' if A == B else '>' if A > B else '<')", "#!/usr/bin/python3\nn,bx = [int(x) for x in input().strip().split()]\nX = [int(x) for x in input().strip().split()]\nNX = 0\nfor idx,x in enumerate(X):\n\tNX *= bx\n\tNX += x\n\nm,by = [int(x) for x in input().strip().split()]\nY = [int(x) for x in input().strip().split()]\nNY = 0\nfor idx,x in enumerate(Y):\n\tNY *= by\n\tNY += x\n\nif NX == NY:print('=')\nelif NX > NY:print('>')\nelse:print('<')\n\n\n", "def f(nums, base):\r\n num = 0\r\n for j in range(len(nums)):\r\n num *= base\r\n num += nums[j]\r\n return num\r\nn, b1 = [int(j) for j in input().split()]\r\nx = [int(j) for j in input().split()]\r\nm, b2 = [int(j) for j in input().split()]\r\ny = [int(j) for j in input().split()]\r\nn1, n2 = f(x, b1), f(y, b2)\r\nif n1 < n2:\r\n print('<')\r\nelif n1 > n2:\r\n print('>')\r\nelse:\r\n print('=')\r\n", "nx, bx = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nm=0\r\nfor i in range(nx):\r\n m += (bx**(nx-i-1))*x[i]\r\n\r\nny, by = map(int, input().split())\r\ny = list(map(int, input().split()))\r\nn=0\r\nfor i in range(ny):\r\n n += (by**(ny-i-1))*y[i]\r\n\r\nif m==n:\r\n print(\"=\")\r\nelif m>n:\r\n print(\">\")\r\nelse:\r\n print(\"<\")", "#!/usr/bin/env python3\n\ndef to_int(digits, base):\n r = 0\n for d in digits:\n r = r*base + d\n return r\n\nif __name__ == '__main__':\n n, bx = map(int, input().split())\n x = to_int(list(map(int, input().split())), bx)\n m, by = map(int, input().split())\n y = to_int(list(map(int, input().split())), by)\n\n if x == y:\n print('=')\n elif x < y:\n print('<')\n else:\n print('>')\n\n\n\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/602/A\r\n\r\ndef calc():\r\n n, b = map(int, input().split())\r\n x =list(map(int, input().split()))\r\n a = 0\r\n for i in x:\r\n a = a * b + i\r\n return a\r\n\r\nl_n = list()\r\n\r\nfor _ in range(2):\r\n l_n.append(calc())\r\n\r\nif l_n[0] < l_n[1]:\r\n print(\"<\")\r\nelif l_n[1] < l_n[0]:\r\n print(\">\")\r\nelse:\r\n print(\"=\")", "_,b = map(int,input().split())\r\none = 0\r\nfor i in [int(x) for x in input().split()]:\r\n\tone = one*b+i\r\n_,b = map(int,input().split())\r\ntwo = 0\r\nfor i in [int(x) for x in input().split()]:\r\n\ttwo = two*b+i\r\nif one<two:\r\n\tprint('<')\r\nif one>two:\r\n\tprint('>')\r\nif one==two:\r\n\tprint('=')\r\n", "# print (\"Input digits and base for number one\")\nn1, b1 = (int(x) for x in input().split())\n# print (\"Input all the digits\")\nd1 = list(int(x) for x in input().split())\nd1.reverse()\n\n# print (\"Input digits and base for number two\")\nn2, b2 = (int(x) for x in input().split())\n# print (\"Input all the digits\")\nd2 = list(int(x) for x in input().split())\nd2.reverse()\n\n# Compute base ten representation of number one\nanswer1 = 0\npower1 = 1\nfor digit in d1:\n answer1 += digit*power1\n power1 *= b1\n# print(answer1)\n\n# Compute base ten representation of number two\nanswer2 = 0\npower2 = 1\nfor digit in d2:\n answer2 += digit*power2\n power2 *= b2\n# print(answer2)\n\nif answer1 < answer2:\n print(\"<\")\nelif answer2 < answer1:\n print(\">\")\nelse:\n print(\"=\")\n\n \n\n", "x =0\r\ny = 0\r\nn, bx = map(int, input().split())\r\nxs = list(map(int, input().split()))\r\nfor i in range(n):\r\n x += xs[i]*(bx**(n-i-1))\r\nm, by = map(int, input().split())\r\nys = list(map(int, input().split()))\r\nfor i in range(m):\r\n y += ys[i]*(by**(m-i-1))\r\nif x == y:\r\n print('=')\r\nelif x < y:\r\n print('<')\r\nelse:\r\n print('>')\r\n", "n, bx = list(map(int, input().split()))\nx = list(map(int, input().split()))\nm,by = list(map(int, input().split()))\ny = list(map(int, input().split()))\n\nX=sum(x[i] * bx**(n-i-1) for i in range(n))\nY=sum(y[i] * by**(m-i-1) for i in range(m))\n# print(X, Y)\nprint('<' if X<Y else ('>' if X>Y else '='))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, x = map(int, input().split())\r\nw = list(map(int, input().split()))[::-1]\r\nm, y = list(map(int, input().split()))\r\ns = list(map(int, input().split()))[::-1]\r\na = 0\r\nfor i in range(n):\r\n a += w[i] * x**i\r\nb = 0\r\nfor i in range(m):\r\n b += s[i] * y**i\r\nif a > b:\r\n print('>')\r\nelif a < b:\r\n print('<')\r\nelse:\r\n print('=')", "import math\n\na, b=map(int,input().split())\n\nls=[]\n\nls=map(int,input().split())\n\nls=list(ls)\n\nnumber=0\nB=1\nfor x in reversed(ls):\n\tnumber+= x*B\n\tB=B*b\n\np, q= map(int,input().split())\n\nlst = []\n\nlst=map(int,input().split())\n\nlst=list(lst)\n\nnumberY=0\nB=1\nfor x in reversed(lst):\n\tnumberY+= x*B\n\tB=B*q\n\nif number>numberY:\n\tprint('>')\nif number < numberY:\n\tprint('<')\nif number == numberY:\n\tprint('=')\n\n \t \t \t \t\t \t\t \t\t \t\t \t\t\t\t", "__author__ = 'sandeepmellacheruvu'\r\nnx, bx = map(int,input().split())\r\nx = list(map(int,input().split()))\r\nny, by = map(int, input().split())\r\ny = list(map(int,input().split()))\r\nnumX = 0\r\nnumY = 0\r\nfor i in range(len(x)):\r\n numX += x[i] * (bx ** (len(x) - i - 1))\r\nfor i in range(len(y)):\r\n numY += y[i] * (by ** (len(y) - i - 1))\r\nif(numX < numY):\r\n print(\"<\")\r\nelif numX > numY:\r\n print(\">\")\r\nelse:\r\n print(\"=\")", "#import sys\r\n\r\n[n, bx] = input().split()\r\n\r\nn = int(n)\r\nbx = int(bx)\r\n\r\nx = input().split()\r\n\r\n[m, by] = input().split()\r\n\r\n\r\nm = int(m)\r\nby = int(by)\r\n\r\ny = input().split()\r\n\r\nansx = 0\r\nansy = 0\r\ndx = 1\r\ndy = 1\r\n\r\nfor i in reversed(x):\r\n ansx = ansx + int(i) * dx\r\n dx = dx * bx\r\n\r\nfor i in reversed(y):\r\n ansy = ansy + int(i) * dy\r\n dy = dy * by\r\n\r\n\r\nif (ansx == ansy):\r\n print (\"=\\n\")\r\nif (ansx > ansy):\r\n print (\">\\n\")\r\nif (ansx < ansy):\r\n print (\"<\\n\")\r\n\r\n\r\n\r\n", "n,b=map(int,input().split())\r\narr=list(map(int,input().split()))\r\np,c=map(int,input().split())\r\nbrr=list(map(int,input().split()))\r\na=0\r\nfor el in arr:\r\n a=a*b+el\r\nb=0\r\nfor el in brr:\r\n b=b*c+el\r\nif a==b:\r\n print(\"=\")\r\nelif a>b:\r\n print(\">\")\r\nelse :\r\n print(\"<\")\r\n", "\r\nres = [0, 0]\r\nfor i in range(2):\r\n n, b = map(int, input().split())\r\n for x in [int(x) for x in input().split()]:\r\n res[i] *= b\r\n res[i] += x\r\nprint('<' if res[0] < res[1] else '>' if res[0] > res[1] else '=')" ]

[ "n, m = [int(x) for x in input().split()]\nM = [[1 if k == 'B' else -1 for k in input()] for i in range(n)]\nP = [[0 for j in range(m+1)] for i in range(n+1)]\nfor i in range(n):\n for j in range(m):\n P[i][j] += M[i][j]\n P[i+1][j+1] += M[i][j]\n P[i+1][j] -= M[i][j]\n P[i][j+1] -= M[i][j]\nprint(n*m - sum(P[i][1:].count(0) for i in range(1, n+1)))\n \n", "n,m=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nla=[0 for i in range(m)]\r\ns=0\r\nfor i in range(n-1,-1,-1):\r\n cv=0\r\n for j in range(m-1,-1,-1):\r\n la[j]+=cv\r\n if l[i][j]=='W':\r\n if la[j]!=1:\r\n cv+=1-la[j]\r\n la[j]=1\r\n s+=1\r\n else:\r\n if la[j]!=-1:\r\n cv+=-1-la[j]\r\n la[j]=-1\r\n s+=1\r\nprint (s)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n,m=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nla=[0 for i in range(m)]\r\ns=0\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]=='W':\r\n if la[j]!=1:\r\n x=1-la[j]\r\n s+=1\r\n for k in range(j,-1,-1):\r\n la[k]+=x\r\n else:\r\n if la[j]!=-1:\r\n x=-1-la[j]\r\n s+=1\r\n for k in range(j,-1,-1):\r\n la[k]+=x\r\nprint (s)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,copy\nfrom itertools import chain, dropwhile, permutations, combinations\nfrom collections import defaultdict, deque\n\ndef VI(): return list(map(int,input().split()))\ndef LIST(n,m=None): return [0]*n if m is None else [[0]*m for i in range(n)]\n\n# interesting problem\n# good to think of this in reverse order\n# and, as usual, KISS helps: keep it simple, stupid!\n\n# cannot break the time limit with this python implementation!\n# but got the idea!\n\ndef run2(n,m,f):\n # works, but doesn't pass time limit\n c = LIST(n,m)\n ans = 0\n for i in range(n-1,-1,-1):\n for j in range(m-1,-1,-1):\n if f[i][j] != c[i][j]:\n ans += 1\n for k in range(i+1):\n for l in range(j+1):\n c[k][l] += f[i][j] - c[i][j]\n print(ans)\ndef main2(info=0):\n n,m = VI()\n f = list(range(n))\n for i in range(n):\n f[i] = [1 if x=='W' else -1 for x in input()]\n run2(n,m,f)\n\n\n# Z = ord('W')-1\n# def run(n,m,f):\n# c = [chr(Z)*m for i in range(n)]\n# ans = 0\n# for i in range(n-1,-1,-1):\n# for j in range(m-1,-1,-1):\n# if f[i][j] != c[i][j]:\n# ans += 1\n# print(ans,c)\n# for k in range(i+1):\n# #c[k] = c[k] --- no, doesn't work with strings as well.\n# # needs some faster language implementation, maybe pypy?\n# for l in range(j+1):\n# c[k][l] += f[i][j] - c[i][j]\n# print(ans)\n# def main(info=0):\n# n,m = VI()\n# f = list(range(n))\n# for i in range(n):\n# f[i] = input().replace('B',chr(Z-1))\n# run(n,m,f)\n\n\nif __name__ == \"__main__\":\n main2()\n", "n, m = map(int,input().split())\nss = [input() for i in range(n)]\ns = []\nadd = []\nfor i in range(n):\n s.append([])\n add.append([])\n for j in range(m):\n s[i].append((1 if (ss[i][j] == \"B\") else -1))\n add[i].append(0)\n\nrm = range(m-1, -1, -1)\n\nans = 0\nfor i in range(n-1, -1, -1):\n cadd = 0\n for j in rm:\n cadd += add[i][j]\n x = cadd+s[i][j]\n if x != 0:\n ans += 1\n cadd -= x\n for k in range(i):\n add[k][j] -= x\n\nprint(ans)\n \n", "def ints():\n return map(int, input().split())\n\nn, m=ints()\nval=[[]]*n\nfor i in range(n):\n val[i]=list(map(lambda ch : 1 if ch=='B' else -1, input().strip()))\n\n# print(val)\nres=0\nfor i in range(n-1, -1, -1):\n for j in range(m-1, -1, -1):\n if val[i][j]!=0:\n res+=1\n t=val[i][j]\n for k in range(i+1):\n for l in range(j+1):\n val[k][l]-=t\n\nprint(res)\n", "n, m = map(int, input().split(' '))\r\np = [input() for i in range(n)]\r\np1 = [[1 if p[i][j] == 'B' else -1 for j in range(m)]\r\n for i in range(n)]\r\ntm = [0 for i in range(m)]\r\nr = 0\r\nfor i in range(n-1, -1, -1):\r\n for j in range(m-1, -1, -1):\r\n if tm[j] != p1[i][j]:\r\n r = r + 1\r\n tp = p1[i][j] - tm[j]\r\n for l in range(j + 1):\r\n tm[l] = tm[l] + tp\r\nprint(r)\r\n", "n,m=map(int,input().strip().split())\r\ns=[]\r\nfor i in range(n):\r\n s.append(input())\r\nf=[[0 for i in range(m+1)] for j in range(n+1)]\r\nans=0\r\nfor k in range(n+m,1,-1):\r\n for i in range(n,0,-1):\r\n j=k-i\r\n if (j>m or j<1):\r\n continue\r\n #print(str(i)+\" \"+str(j)+s[i-1][j-1])\r\n tmp=0\r\n if (s[i-1][j-1]=='W'):\r\n tmp=1-f[i][j]\r\n else:\r\n tmp=-1-f[i][j]\r\n if (tmp!=0):\r\n ans=ans+1\r\n for x in range(1,i+1):\r\n for y in range(1,j+1):\r\n f[x][y]=f[x][y]+tmp\r\nprint(ans)", "import sys\r\n\r\n\r\n\r\ninput = []\r\ninput_index = 0\r\n\r\ndef next(type, number = None):\r\n\tdef next():\r\n\t\tglobal input, input_index\r\n\t\t\r\n\t\t\r\n\t\twhile input_index == len(input):\r\n\t\t\tif sys.stdin:\r\n\t\t\t\tinput = sys.stdin.readline().split()\r\n\t\t\t\tinput_index = 0\r\n\t\t\telse:\r\n\t\t\t\traise Exception()\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\tinput_index += 1\r\n\t\t\r\n\t\treturn input[input_index - 1]\r\n\t\t\r\n\t\t\r\n\tif number is None:\r\n\t\tresult = type(next())\r\n\telse:\r\n\t\tresult = [type(next()) for _ in range(number)]\r\n\t\t\r\n\treturn result\r\n\t\r\n\t\r\n\t\r\nn, m = next(int, 2)\r\niis = [next(str) for _ in range(n)]\r\n\r\n\r\ncount = 0\r\nvs = [0] * n\r\n\r\nfor j in range(m - 1, -1, -1):\r\n\tfor i in range(n - 1, -1, -1):\r\n\t\tc = iis[i][j]\r\n\t\t\r\n\t\tif c == \"W\" and vs[i] != 1:\r\n\t\t\tcount += 1\r\n\t\t\td = 1 - vs[i]\r\n\t\t\t\r\n\t\t\tfor k in range(i + 1):\r\n\t\t\t\tvs[k] += d\r\n\t\telif c == \"B\" and vs[i] != -1:\r\n\t\t\tcount += 1\r\n\t\t\td = -1 - vs[i]\r\n\t\t\t\r\n\t\t\tfor k in range(i + 1):\r\n\t\t\t\tvs[k] += d\r\n\t\t\t\t\r\n\t\t\t\t\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\np = [input() for i in range(n)]\r\nt = [0] * m\r\nk = 0\r\nfor i in range(1, n + 1):\r\n s = 0\r\n for j in range(1, m + 1):\r\n s += t[-j]\r\n q = s + 2 * (p[-i][-j] == 'W') - 1\r\n t[-j] -= q\r\n s -= q\r\n if q: k += 1\r\nprint(k)", "# -*- coding: utf-8 -*-\r\n\r\na = []\r\nk = []\r\n\r\nn, m = map(int, input().split())\r\nfor i in range(n + 1):\r\n if i < n:\r\n a.append(input())\r\n k.append([0 for j in range(m + 1)])\r\n \r\nans = 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n add = 0\r\n for j in range(m - 1, -1, -1):\r\n sign = 1\r\n if a[i][j] == 'B':\r\n sign = -1\r\n k[i][j] = add + k[i + 1][j]\r\n if k[i][j] != sign:\r\n ans += 1\r\n add += sign - k[i][j]\r\n k[i][j] = sign\r\n \r\nprint(ans)" ]

[ "import math,sys,bisect,heapq,os\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\nfrom functools import lru_cache\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ndef input(): return sys.stdin.readline().rstrip('\\r\\n')\r\n#input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\naj = lambda: list(map(int, input().split()))\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\ndef solve():\r\n\r\n\r\n\tn=int(input())\r\n\ta=list(map(int,input().split()))\r\n\r\n\tclass st:\r\n\t\tdef __init__(self, size):\r\n\t\t\tN = 1\r\n\t\t\th = 0\r\n\t\t\twhile N < size:\r\n\t\t\t\tN <<= 1\r\n\t\t\t\th += 1\r\n\t\t\tself.N = N\r\n\t\t\tself.h = h\r\n\t\t\tself.t = [float('inf')] * (2 * N)\r\n\t\t\tself.d = [0] * N\r\n\t \r\n\t\tdef apply(self, p, value):\r\n\t\t\tself.t[p] += value\r\n\t\t\tif (p < self.N):\r\n\t\t\t\tself.d[p] += value\r\n\t \r\n\t\tdef build(self, p):\r\n\t\t\tt = self.t\r\n\t\t\td = self.d\r\n\t\t\twhile p > 1:\r\n\t\t\t\tp >>= 1\r\n\t\t\t\tt[p] = min(t[p<<1], t[p<<1|1]) + d[p]\r\n\t \r\n\t\tdef rebuild(self):\r\n\t\t\tt = self.t\r\n\t\t\tfor p in reversed(range(1, self.N)):\r\n\t\t\t\tt[p] = min(t[p<<1], t[p<<1|1])\r\n\t \r\n\t\tdef push(self, p):\r\n\t\t\td = self.d\r\n\t\t\tfor s in range(self.h, 0, -1):\r\n\t\t\t\ti = p >> s\r\n\t\t\t\tif d[i] != 0:\r\n\t\t\t\t\tself.apply(i<<1, d[i])\r\n\t\t\t\t\tself.apply(i<<1|1, d[i])\r\n\t\t\t\t\td[i] = 0\r\n\t \r\n\t\tdef inc(self, l, r, value):\r\n\t\t\tif l >= r:\r\n\t\t\t\treturn\r\n\r\n\t\t\tl += self.N\r\n\t\t\tr += self.N\r\n\t\t\tl0, r0 = l, r\r\n\t\t\twhile l < r:\r\n\t\t\t\tif l & 1:\r\n\t\t\t\t\tself.apply(l, value)\r\n\t\t\t\t\tl += 1\r\n\t\t\t\tif r & 1:\r\n\t\t\t\t\tr -= 1\r\n\t\t\t\t\tself.apply(r, value)\r\n\t\t\t\tl >>= 1\r\n\t\t\t\tr >>= 1\r\n\t\t\tself.build(l0)\r\n\t\t\tself.build(r0 - 1)\r\n\t \r\n\t\tdef query(self, l, r):\r\n\t\t\tif l >= r:\r\n\t\t\t\treturn float('inf')\r\n\r\n\t\t\tt = self.t\r\n\t\t\tl += self.N\r\n\t\t\tr += self.N\r\n\t\t\tself.push(l)\r\n\t\t\tself.push(r - 1)\r\n\t\t\tres = float('inf')\r\n\t\t\twhile l < r:\r\n\t\t\t\tif l & 1:\r\n\t\t\t\t\tres = min(res, t[l])\r\n\t\t\t\t\tl += 1\r\n\t\t\t\tif r & 1:\r\n\t\t\t\t\tr -= 1\r\n\t\t\t\t\tres = min(t[r], res)\r\n\t\t\t\tl >>= 1\r\n\t\t\t\tr >>= 1\r\n\t\t\treturn res\r\n\r\n\tse=st(n)\r\n\tN=se.N\r\n\tfor i in range(n):\r\n\t\tse.t[i+N]=a[i]\r\n\tse.rebuild()\r\n\r\n\tq=int(input())\r\n\tfor i in range(q):\r\n\t\tb=list(map(int,input().split()))\r\n\t\tif len(b)==2:\r\n\t\t\tl=b[0]\r\n\t\t\tr=b[1]\r\n\t\t\tif l>r:\r\n\t\t\t\tprint(min(se.query(l,n),se.query(0,r+1)))\r\n\t\t\telse:print(se.query(l,r+1))\r\n\t\telse:\r\n\t\t\tl=b[0]\r\n\t\t\tr=b[1]\r\n\t\t\tv=b[2]\r\n\t\t\tif l>r:\r\n\t\t\t\tse.inc(0,r+1,v)\r\n\t\t\t\tse.inc(l,n,v)\r\n\t\t\telse:se.inc(l,r+1,v)\r\n\r\n\t\t\r\n\r\n\r\ntry:\r\n\t#os.system(\"online_judge.py\")\r\n\tsys.stdin = open('input.txt', 'r') \r\n\tsys.stdout = open('output.txt', 'w')\r\nexcept:\r\n\tpass\r\n\r\nsolve()", "import sys\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\nfast_print = lambda p: sys.stdout.write(str(p) + \"\\n\") \n\nfrom math import inf\n\ndef make_segment_tree(arr):\n N = len(arr)\n tree = [inf] * (4*N) # use-case\n lazy = [0] * (4*N)\n build(tree, arr)\n return tree, lazy\n\ndef build(tree, arr):\n q = [(1, 1, 0, len(arr)-1)]\n while q:\n a, v, tl,tr = q.pop()\n if a == 1:\n if tl == tr:\n tree[v] = arr[tl]\n else:\n tm = (tl + tr) // 2\n q.append((2, v, tl, tr))\n q.append((1, v*2, tl, tm))\n q.append((1, v*2+1, tm+1, tr))\n else:\n tree[v] = min(tree[v*2], tree[v*2+1])\n\ndef push(tree, lazy, vertex):\n tree[2 * vertex] += lazy[vertex]\n lazy[2*vertex] += lazy[vertex]\n\n tree[2 * vertex + 1] += lazy[vertex]\n lazy[2*vertex+1] += lazy[vertex]\n \n lazy[vertex] = 0\n\ndef range_update(tree, lazy, l, r, val):\n q = [(1, 1, 0, len(tree)//4-1, l, r)]\n while q:\n a, v, tl, tr, l, r = q.pop()\n if a == 1:\n if l > r:\n continue\n if tl == l and tr == r:\n tree[v] += val\n lazy[v] += val\n else:\n push(tree, lazy, v)\n tm = (tl + tr) // 2\n q.append((2, v, tl, tr, l, r))\n q.append((1, v*2, tl, tm, l, min(r, tm)))\n q.append((1, v*2+1, tm+1, tr, max(l, tm+1), r))\n else:\n tree[v] = min(tree[v*2], tree[v*2+1])\n\ndef range_query(tree, lazy, l, r):\n q = [(1, 1, 0, len(tree)//4 - 1, l, r)]\n res = []\n while q:\n a, v, tl, tr, l, r = q.pop()\n if a == 1:\n if l > r:\n res.append(inf)\n continue\n if l == tl and tr == r:\n res.append(tree[v])\n continue\n push(tree, lazy, v)\n tm = (tl + tr) // 2\n q.append((2, v, tl, tr, l, r))\n q.append((1, v*2, tl, tm, l, min(tm, r)))\n q.append((1, v*2+1, tm+1, tr, max(l, tm+1), r))\n else:\n res.append(min(res.pop(), res.pop()))\n return res[0]\n\nn = int(input())\na = list(map(int,sys.stdin.readline().split()))\nm = int(input())\n\n# print(f\"n = {n}, a = {a}, m = {m}\")\n\ntree, lazy = make_segment_tree(a)\n\ndef circular_range_update(l,r,val):\n # print(f\"CRU called with l = {l}, r = {r}, v = {v}\")\n if l <= r:\n range_update(tree, lazy, l, r, val)\n else:\n # print(f\"circular query: calling {(l, n-1)} and {(0, r)}\")\n range_update(tree, lazy, l, n-1, val)\n range_update(tree, lazy, 0, r, val)\n\ndef circular_range_query(l, r):\n if l <= r:\n return range_query(tree, lazy, l, r)\n else:\n return min(\n range_query(tree, lazy, l, n-1),\n range_query(tree, lazy, 0, r),\n )\n\nfor _ in range(m):\n op_args = list(map(int,sys.stdin.readline().split()))\n if len(op_args) == 3:\n circular_range_update(op_args[0], op_args[1], op_args[2])\n # print(f\"result tree = {tree}\")\n # print(f\"result lazy = {lazy}\")\n else:\n fast_print(circular_range_query(op_args[0], op_args[1]))", "from math import inf\r\nimport sys\r\ninp = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nfp = lambda p: sys.stdout.write(str(p) + \"\\n\")\r\n\r\ndef LazySegmentTree(arr,n):\r\n tree = [inf] * (4 * n)\r\n lazy = [0] * (4 * n)\r\n build(tree,arr)\r\n return tree,lazy\r\ndef build(tree,arr):\r\n q = [(1, 1, 0, n -1)]\r\n while q:\r\n a, index, tl,tr = q.pop()\r\n if a == 1:\r\n if tl == tr:\r\n tree[index] = arr[tl]\r\n else:\r\n tm = (tl + tr) // 2\r\n q.append((2, index, tl, tr))\r\n q.append((1, index*2, tl, tm))\r\n q.append((1, index*2+1, tm+1, tr))\r\n else:\r\n tree[index] = min(tree[index*2], tree[index*2+1])\r\n\r\ndef propagar(tree,lazy, index):\r\n tree[2 * index] += lazy[index]\r\n lazy[2*index] += lazy[index]\r\n tree[2 * index + 1] += lazy[index]\r\n lazy[2*index +1] += lazy[index]\r\n\r\n lazy[index] = 0\r\n\r\ndef update_range(tree,lazy,left, right, val):\r\n q = [(1, 1, 0, len(tree) //4-1, left, right)]\r\n while q:\r\n a, index, tl, tr, left, right = q.pop()\r\n if a == 1:\r\n if left > right:\r\n continue\r\n if tl == left and tr == right:\r\n tree[index] += val\r\n lazy[index] += val\r\n else:\r\n propagar(tree,lazy,index)\r\n tm = (tl + tr) // 2\r\n q.append((2, index, tl, tr, left, right))\r\n q.append((1, index*2, tl, tm, left, min(right, tm)))\r\n q.append((1, index*2+1, tm+1, tr, max(left, tm+1), right))\r\n else:\r\n tree[index] = min(tree[index*2], tree[index*2+1])\r\n\r\ndef query_range(tree,lazy, left, right):\r\n q = [(1, 1, 0, len(tree) //4 - 1, left, right)]\r\n res = []\r\n while q:\r\n a, index, tl, tr, left, right = q.pop()\r\n if a == 1:\r\n if left > right:\r\n res.append(inf)\r\n continue\r\n if left == tl and tr == right:\r\n res.append(tree[index])\r\n continue\r\n propagar(tree,lazy,index)\r\n tm = (tl + tr) // 2\r\n q.append((2, index, tl, tr, left, right))\r\n q.append((1, index*2, tl, tm, left, min(tm, right)))\r\n q.append((1, index*2+1, tm+1, tr, max(left, tm+1), right))\r\n else:\r\n res.append(min(res.pop(), res.pop()))\r\n return res[0]\r\n\r\nn = int(inp())\r\narr = list(map(int,sys.stdin.readline().split()))\r\n#arr = list(map(int, input().split()))\r\ntree,lazy = LazySegmentTree(arr,n)\r\nq = int(inp())\r\nfor _ in range(q):\r\n query = list(map(int, sys.stdin.readline().split()))\r\n #query = list(map(int, input().split()))\r\n if len(query) == 2:\r\n if query[0] <= query[1]:\r\n fp(query_range(tree,lazy,query[0], query[1]))\r\n else:\r\n a = query_range(tree,lazy,0, query[1])\r\n b = query_range(tree,lazy,query[0], n-1)\r\n fp(min(a,b))\r\n else:\r\n if query[0] <= query[1]:\r\n update_range(tree,lazy,query[0], query[1], query[2])\r\n else:\r\n update_range(tree,lazy,0, query[1], query[2])\r\n update_range(tree,lazy,query[0], n-1, query[2])", "#bisect.bisect_left(a, x, lo=0, hi=len(a)) is the analog of std::lower_bound()\r\n#bisect.bisect_right(a, x, lo=0, hi=len(a)) is the analog of std::upper_bound()\r\n#from heapq import heappop,heappush,heapify #heappop(hq), heapify(list)\r\n#from collections import deque as dq #deque e.g. myqueue=dq(list)\r\n#append/appendleft/appendright/pop/popleft\r\n#from bisect import bisect as bis #a=[1,3,4,6,7,8] #bis(a,5)-->3\r\n#import bisect #bisect.bisect_left(a,4)-->2 #bisect.bisect(a,4)-->3\r\n#import statistics as stat # stat.median(a), mode, mean\r\n#from itertools import permutations(p,r)#combinations(p,r)\r\n#combinations(p,r) gives r-length tuples #combinations_with_replacement\r\n#every element can be repeated\r\n \r\nimport sys, threading, os, io \r\nimport math\r\nimport time\r\nfrom os import path\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\nfrom functools import cmp_to_key\r\nimport heapq\r\nfrom bisect import bisect_left as lower_bound\r\nfrom bisect import bisect_right as upper_bound\r\nfrom io import BytesIO, IOBase\t\t\t\t\t\t\t\t\r\n# # # # # # # # # # # # # # # #\r\n# JAI SHREE RAM #\r\n# # # # # # # # # # # # # # # #\r\n \r\n \r\ndef lcm(a, b):\r\n return (a*b)//(math.gcd(a,b))\r\n \r\n \r\nsi= lambda:str(input())\r\nii = lambda: int(input())\r\nmii = lambda: map(int, input().split())\r\nlmii = lambda: list(map(int, input().split()))\r\ni2c = lambda n: chr(ord('a') + n)\r\nc2i = lambda c: ord(c) - ord('a')\r\n \r\n# ------------- Lazy Segment Tree ---------------- #\r\n## Changed the function to minimum since we wish to find the minimum !!\r\n## Changed the default to inf as well\r\n# inf= float('inf')\r\nclass LazySegmentTree:\r\n def __init__(self, data, default=math.inf, func=min):\r\n \"\"\"initialize the lazy segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n self._lazy = [0] * (2 * _size)\r\n\r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n\r\n def __len__(self):\r\n return self._len\r\n\r\n def _push(self, idx):\r\n \"\"\"push query on idx to its children\"\"\"\r\n # Let the children know of the queries\r\n q, self._lazy[idx] = self._lazy[idx], 0\r\n\r\n self._lazy[2 * idx] += q\r\n self._lazy[2 * idx + 1] += q\r\n self.data[2 * idx] += q\r\n self.data[2 * idx + 1] += q\r\n\r\n def _update(self, idx):\r\n \"\"\"updates the node idx to know of all queries applied to it via its ancestors\"\"\"\r\n for i in reversed(range(1, idx.bit_length())):\r\n self._push(idx >> i)\r\n\r\n def _build(self, idx):\r\n \"\"\"make the changes to idx be known to its ancestors\"\"\"\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1]) + self._lazy[idx]\r\n idx >>= 1\r\n\r\n def add(self, start, stop, value):\r\n \"\"\"lazily add value to [start, stop)\"\"\"\r\n start = start_copy = start + self._size\r\n stop = stop_copy = stop + self._size\r\n while start < stop:\r\n if start & 1:\r\n self._lazy[start] += value\r\n self.data[start] += value\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n self._lazy[stop] += value\r\n self.data[stop] += value\r\n start >>= 1\r\n stop >>= 1\r\n\r\n # Tell all nodes above of the updated area of the updates\r\n self._build(start_copy)\r\n self._build(stop_copy - 1)\r\n\r\n def query(self, start, stop, default=math.inf):\r\n \"\"\"func of data[start, stop)\"\"\"\r\n start += self._size\r\n stop += self._size\r\n\r\n # Apply all the lazily stored queries\r\n self._update(start)\r\n self._update(stop - 1)\r\n\r\n res = default\r\n while start < stop:\r\n if start & 1:\r\n res = self._func(res, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res = self._func(res, self.data[stop])\r\n start >>= 1\r\n stop >>= 1\r\n return res\r\n\r\n def __repr__(self):\r\n return \"LazySegmentTree({0})\".format(self.data)\r\n\r\n\r\n\r\n# <-------------- End ---------------------> #\r\nif(os.path.exists(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\")):\r\n sys.stdin = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\", 'r')\r\n sys.stdout = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/output.txt\", 'w') \r\nelse:\r\n input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n \r\nn=ii()\r\narr=lmii()\r\nm=ii()\r\n\r\nlazy_st = LazySegmentTree(arr)\r\nfor _ in range(m):\r\n mi=lmii()\r\n if len(mi)==3: ## increment operation\r\n lf,rg,v=mi\r\n # print(lf,rg,v,\"query\")\r\n if lf>rg:\r\n lazy_st.add(lf,n,v)\r\n lazy_st.add(0,rg+1,v)\r\n else:\r\n lazy_st.add(lf,rg+1,v)\r\n\r\n else: ## rmq operation\r\n lf,rg=mi\r\n # print(lf,rg,\"query\")\r\n\r\n if lf>rg:\r\n ans = min(lazy_st.query(0,rg+1), lazy_st.query(lf,n))\r\n else:\r\n ans=lazy_st.query(lf,rg+1)\r\n print(ans)\r\n\r\n# def solve(t):\r\n \r\n \r\n# def main():\r\n# t = 1\r\n# if path.exists(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\"):\r\n# sys.stdin = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\", 'r')\r\n# sys.stdout = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/output.txt\", 'w')\r\n# start_time = time.time()\r\n# print(\"--- %s seconds ---\" % (time.time() - start_time))\r\n \r\n \r\n# sys.setrecursionlimit(10**5)\r\n \r\n# t = int(input())\r\n \r\n# for i in range(t):\r\n# solve(i+1)\r\n \r\n \r\n# if __name__ == '__main__':\r\n# main()\r\n \r\n \r\n\r\n\r\n", "import bisect\r\nimport heapq\r\nimport sys\r\nfrom types import GeneratorType\r\nfrom functools import cmp_to_key\r\nfrom collections import defaultdict, Counter, deque\r\nimport math\r\nfrom functools import lru_cache\r\nfrom heapq import nlargest\r\nfrom functools import reduce\r\nimport random\r\nfrom operator import mul\r\ninf = float(\"inf\")\r\nPLATFORM = \"CF\"\r\nif PLATFORM == \"LUOGU\":\r\n import numpy as np\r\n sys.setrecursionlimit(1000000)\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n\r\nclass LazySegmentTree:\r\n def __init__(self, array):\r\n self.n = len(array)\r\n self.size = 1 << (self.n - 1).bit_length()\r\n self.func = min\r\n self.default = float(\"inf\")\r\n self.data = [self.default] * (2 * self.size)\r\n self.lazy = [0] * (2 * self.size)\r\n self.process(array)\r\n\r\n def process(self, array):\r\n self.data[self.size: self.size + self.n] = array\r\n for i in range(self.size - 1, -1, -1):\r\n self.data[i] = self.func(self.data[2 * i], self.data[2 * i + 1])\r\n\r\n def push(self, index):\r\n \"\"\"Push the information of the root to it's children!\"\"\"\r\n self.lazy[2 * index] += self.lazy[index]\r\n self.lazy[2 * index + 1] += self.lazy[index]\r\n self.data[2 * index] += self.lazy[index]\r\n self.data[2 * index + 1] += self.lazy[index]\r\n self.lazy[index] = 0\r\n\r\n def build(self, index):\r\n \"\"\"Build data with the new changes!\"\"\"\r\n index >>= 1\r\n while index:\r\n self.data[index] = self.func(self.data[2 * index], self.data[2 * index + 1]) + self.lazy[index]\r\n index >>= 1\r\n\r\n def query(self, alpha, omega):\r\n \"\"\"Returns the result of function over the range (inclusive)!\"\"\"\r\n res = self.default\r\n alpha += self.size\r\n omega += self.size + 1\r\n for i in reversed(range(1, alpha.bit_length())):\r\n self.push(alpha >> i)\r\n for i in reversed(range(1, (omega - 1).bit_length())):\r\n self.push((omega - 1) >> i)\r\n while alpha < omega:\r\n if alpha & 1:\r\n res = self.func(res, self.data[alpha])\r\n alpha += 1\r\n if omega & 1:\r\n omega -= 1\r\n res = self.func(res, self.data[omega])\r\n alpha >>= 1\r\n omega >>= 1\r\n return res\r\n\r\n def update(self, alpha, omega, value):\r\n \"\"\"Increases all elements in the range (inclusive) by given value!\"\"\"\r\n alpha += self.size\r\n omega += self.size + 1\r\n l, r = alpha, omega\r\n while alpha < omega:\r\n if alpha & 1:\r\n self.data[alpha] += value\r\n self.lazy[alpha] += value\r\n alpha += 1\r\n if omega & 1:\r\n omega -= 1\r\n self.data[omega] += value\r\n self.lazy[omega] += value\r\n alpha >>= 1\r\n omega >>= 1\r\n self.build(l)\r\n self.build(r - 1)\r\n\r\n\r\ndef main(ac=FastIO()):\r\n\r\n n = ac.read_int()\r\n tree = LazySegmentTree(ac.read_list_ints())\r\n for _ in range(ac.read_int()):\r\n lst = ac.read_list_ints()\r\n if len(lst) == 2:\r\n a, b = lst\r\n cur = [[a, b]] if a <= b else [[0, b], [a, n-1]]\r\n res = inf\r\n for x, y in cur:\r\n res = ac.min(res, tree.query(x, y))\r\n ac.st(res)\r\n else:\r\n a, b, c = lst\r\n cur = [[a, b]] if a <= b else [[0, b], [a, n-1]]\r\n for x, y in cur:\r\n tree.update(x, y, c)\r\n return\r\n\r\n\r\nmain()\r\n", "#from pyrival import *\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\nclass LazySegmentTree:\n def __init__(self, data, default=0, func=max):\n \"\"\"initialize the lazy segment tree with data\"\"\"\n self._default = default\n self._func = func\n\n self._len = len(data)\n self._size = _size = 1 << (self._len - 1).bit_length()\n self._lazy = [0] * (2 * _size)\n\n self.data = [default] * (2 * _size)\n self.data[_size:_size + self._len] = data\n for i in reversed(range(_size)):\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\n\n def __len__(self):\n return self._len\n\n def _push(self, idx):\n \"\"\"push query on idx to its children\"\"\"\n # Let the children know of the queries\n q, self._lazy[idx] = self._lazy[idx], 0\n\n self._lazy[2 * idx] += q\n self._lazy[2 * idx + 1] += q\n self.data[2 * idx] += q\n self.data[2 * idx + 1] += q\n\n def _update(self, idx):\n \"\"\"updates the node idx to know of all queries applied to it via its ancestors\"\"\"\n for i in reversed(range(1, idx.bit_length())):\n self._push(idx >> i)\n\n def _build(self, idx):\n \"\"\"make the changes to idx be known to its ancestors\"\"\"\n idx >>= 1\n while idx:\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1]) + self._lazy[idx]\n idx >>= 1\n\n def add(self, start, stop, value):\n \"\"\"lazily add value to [start, stop)\"\"\"\n start = start_copy = start + self._size\n stop = stop_copy = stop + self._size\n while start < stop:\n if start & 1:\n self._lazy[start] += value\n self.data[start] += value\n start += 1\n if stop & 1:\n stop -= 1\n self._lazy[stop] += value\n self.data[stop] += value\n start >>= 1\n stop >>= 1\n\n # Tell all nodes above of the updated area of the updates\n self._build(start_copy)\n self._build(stop_copy - 1)\n\n def query(self, start, stop, default=0):\n \"\"\"func of data[start, stop)\"\"\"\n start += self._size\n stop += self._size\n\n # Apply all the lazily stored queries\n self._update(start)\n self._update(stop - 1)\n\n res = default\n while start < stop:\n if start & 1:\n res = self._func(res, self.data[start])\n start += 1\n if stop & 1:\n stop -= 1\n res = self._func(res, self.data[stop])\n start >>= 1\n stop >>= 1\n return res\n\n def __repr__(self):\n return \"LazySegmentTree({0})\".format(self.data)\n\nn = int(input())\na = list(map(int, input().split()))\nm = int(input())\n\ntree = LazySegmentTree(a, func = lambda x, y: min(x, y))\nfor _ in range(m):\n oper = list(map(int, input().split()))\n if len(oper) == 2:\n lf, rg = oper\n score = 10**100\n if lf > rg:\n score = tree.query(lf, n, default=10**12)\n lf = 0\n score = min(score, tree.query(lf, rg + 1, default=10**12))\n print(score)\n else:\n lf, rg, v = oper\n if lf > rg:\n tree.add(lf, n, v)\n lf = 0\n tree.add(lf, rg + 1, v)\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\nfast_print = lambda p: sys.stdout.write(str(p) + \"\\n\") \n\nfrom math import inf\n\ndef make_lazy_segment_tree(arr):\n N = len(arr)\n size = 1 << (N-1).bit_length()\n tree = [inf] * (2*size)\n lazy = [0] * (2*size)\n for k in range(N):\n tree[size+k] = arr[k]\n for k in range(size-1,-1,-1):\n tree[k] = min(tree[2*k], tree[2*k+1])\n return tree, lazy\n\ndef push(tree, lazy, v):\n tree[2 * v] += lazy[v]\n lazy[2*v] += lazy[v]\n tree[2 * v + 1] += lazy[v]\n lazy[2*v+1] += lazy[v]\n lazy[v] = 0\n\ndef build(tree, lazy, v):\n v >>= 1\n while v:\n tree[v] = min(tree[2*v], tree[2*v+1]) + lazy[v]\n v >>= 1\n\ndef range_query(tree, lazy, l, r):\n res = inf\n l += len(tree) >> 1\n r += (len(tree) >> 1) + 1\n for k in range(l.bit_length()-1, 0, -1):\n push(tree, lazy, l >> k)\n for k in range((r-1).bit_length()-1,0,-1):\n push(tree, lazy, (r-1) >> k)\n while l < r:\n if l & 1:\n res = min(res, tree[l])\n l += 1\n if r & 1:\n r -= 1\n res = min(res, tree[r])\n l >>= 1\n r >>= 1\n return res\n\ndef range_update(tree, lazy, l, r, val):\n l += len(tree) >> 1\n r += (len(tree) >> 1) + 1\n old_l, old_r = l, r\n while l < r:\n if l & 1:\n tree[l] += val\n lazy[l] += val\n l += 1\n if r & 1:\n r -= 1\n tree[r] += val\n lazy[r] += val\n l >>= 1\n r >>= 1\n build(tree, lazy, old_l)\n build(tree, lazy, old_r-1)\n\nn = int(input())\na = list(map(int,sys.stdin.readline().split()))\nm = int(input())\n\ntree, lazy = make_lazy_segment_tree(a)\n\ndef circular_range_update(l,r,val):\n # print(f\"CRU called with l = {l}, r = {r}, v = {v}\")\n if l <= r:\n range_update(tree, lazy, l, r, val)\n else:\n # print(f\"circular query: calling {(l, n-1)} and {(0, r)}\")\n range_update(tree, lazy, l, n-1, val)\n range_update(tree, lazy, 0, r, val)\n\ndef circular_range_query(l, r):\n if l <= r:\n return range_query(tree, lazy, l, r)\n else:\n return min(\n range_query(tree, lazy, l, n-1),\n range_query(tree, lazy, 0, r),\n )\n\nfor _ in range(m):\n op_args = list(map(int,sys.stdin.readline().split()))\n if len(op_args) == 3:\n circular_range_update(op_args[0], op_args[1], op_args[2])\n # print(f\"result tree = {tree}\")\n # print(f\"result lazy = {lazy}\")\n else:\n fast_print(circular_range_query(op_args[0], op_args[1]))", "import io,os\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\n\r\nclass st:\r\n\tdef __init__(self, size):\r\n\t\tN = 1\r\n\t\th = 0\r\n\t\twhile N < size:\r\n\t\t\tN <<= 1\r\n\t\t\th += 1\r\n\t\tself.N = N\r\n\t\tself.h = h\r\n\t\tself.t = [float('inf')] * (2 * N)\r\n\t\tself.d = [0] * N\r\n \r\n\tdef apply(self, p, value):\r\n\t\tself.t[p] += value\r\n\t\tif (p < self.N):\r\n\t\t\tself.d[p] += value\r\n \r\n\tdef build(self, p):\r\n\t\tt = self.t\r\n\t\td = self.d\r\n\t\twhile p > 1:\r\n\t\t\tp >>= 1\r\n\t\t\tt[p] = min(t[p<<1], t[p<<1|1]) + d[p]\r\n \r\n\tdef rebuild(self):\r\n\t\tt = self.t\r\n\t\tfor p in reversed(range(1, self.N)):\r\n\t\t\tt[p] = min(t[p<<1], t[p<<1|1])\r\n \r\n\tdef push(self, p):\r\n\t\td = self.d\r\n\t\tfor s in range(self.h, 0, -1):\r\n\t\t\ti = p >> s\r\n\t\t\tif d[i] != 0:\r\n\t\t\t\tself.apply(i<<1, d[i])\r\n\t\t\t\tself.apply(i<<1|1, d[i])\r\n\t\t\t\td[i] = 0\r\n \r\n\tdef inc(self, l, r, value):\r\n\t\tif l >= r:\r\n\t\t\treturn\r\n\r\n\t\tl += self.N\r\n\t\tr += self.N\r\n\t\tl0, r0 = l, r\r\n\t\twhile l < r:\r\n\t\t\tif l & 1:\r\n\t\t\t\tself.apply(l, value)\r\n\t\t\t\tl += 1\r\n\t\t\tif r & 1:\r\n\t\t\t\tr -= 1\r\n\t\t\t\tself.apply(r, value)\r\n\t\t\tl >>= 1\r\n\t\t\tr >>= 1\r\n\t\tself.build(l0)\r\n\t\tself.build(r0 - 1)\r\n \r\n\tdef query(self, l, r):\r\n\t\tif l >= r:\r\n\t\t\treturn float('inf')\r\n\r\n\t\tt = self.t\r\n\t\tl += self.N\r\n\t\tr += self.N\r\n\t\tself.push(l)\r\n\t\tself.push(r - 1)\r\n\t\tres = float('inf')\r\n\t\twhile l < r:\r\n\t\t\tif l & 1:\r\n\t\t\t\tres = min(res, t[l])\r\n\t\t\t\tl += 1\r\n\t\t\tif r & 1:\r\n\t\t\t\tr -= 1\r\n\t\t\t\tres = min(t[r], res)\r\n\t\t\tl >>= 1\r\n\t\t\tr >>= 1\r\n\t\treturn res\r\n\r\nse=st(n)\r\nN=se.N\r\nfor i in range(n):\r\n\tse.t[i+N]=a[i]\r\nse.rebuild()\r\n\r\nq=int(input())\r\nfor i in range(q):\r\n\tb=list(map(int,input().split()))\r\n\tif len(b)==2:\r\n\t\tl=b[0]\r\n\t\tr=b[1]\r\n\t\tif l>r:\r\n\t\t\tprint(min(se.query(l,n),se.query(0,r+1)))\r\n\t\telse:print(se.query(l,r+1))\r\n\telse:\r\n\t\tl=b[0]\r\n\t\tr=b[1]\r\n\t\tv=b[2]\r\n\t\tif l>r:\r\n\t\t\tse.inc(0,r+1,v)\r\n\t\t\tse.inc(l,n,v)\r\n\t\telse:se.inc(l,r+1,v)\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nq = []\r\nans = 0\r\nimport heapq\r\nfor i in range(n):\r\n heapq.heappush(q,-a[i])\r\n if -q[0] > a[i]:\r\n T = heapq.heappop(q)\r\n heapq.heappush(q,-a[i])\r\n ans += -T - a[i]\r\nprint(ans)", "import heapq\r\ninput()\r\nans=0\r\na=[]\r\ninf=10**9\r\nfor x in map(int,input().split()):\r\n x=inf-x\r\n heapq.heappush(a,x)\r\n ans+=a[0]-x\r\n heapq.heappop(a)\r\n heapq.heappush(a,x)\r\nprint(-ans)\r\n", "import heapq\r\ninput()\r\nans = 0\r\na = []\r\ninf = 10**9\r\nfor x in map(int, input().split()):\r\n x = inf-x\r\n heapq.heappush(a, x)\r\n ans += a[0] - x\r\n heapq.heappop(a)\r\n heapq.heappush(a, x)\r\nprint(-ans)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nvals = sorted(nums)\r\ndp = [0] * (n + 1)\r\n\r\nfor i in range(n):\r\n dp[i+1] = dp[i] + abs(nums[i] - vals[0])\r\n\r\nfor i in range(1, n):\r\n new_dp = [0] * (n + 1)\r\n for j in range(1, n + 1):\r\n new_dp[j] = min(new_dp[j-1] + abs(nums[j-1] - vals[i]), dp[j])\r\n dp = new_dp\r\n\r\nprint(dp[-1])", "\r\nfrom bisect import insort\r\ndef min_steps_N(arr):\r\n pri_q = []\r\n ans = 0\r\n for n in arr:\r\n if pri_q:\r\n if pri_q[-1] > n:\r\n ans += pri_q[-1] - n\r\n pri_q.pop()\r\n insort(pri_q, n)\r\n insort(pri_q, n)\r\n return ans\r\n\r\nif __name__ == '__main__':\r\n N = input()\r\n arr = list(map(int, input().split(' ')))\r\n print(min_steps_N(arr))\r\n", "import sys\r\nimport random\r\n\r\ninput = sys.stdin.readline\r\nrd = random.randint(10 ** 9, 2 * 10 ** 9)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = sorted(set(a))\r\nd = [0] * len(b)\r\nfor i in range(len(b)):\r\n d[i] = abs(a[0] - b[i])\r\n\r\nfor i in range(1,n):\r\n c = 10**18\r\n for j in range(len(b)):\r\n c = min(c, d[j])\r\n d[j] = c + abs(b[j] - a[i])\r\nprint(min(d))\r\n", "result = []\nN = int(input())\n\nnums = list(map(int, input().split()))\n\nvals = list(set(sorted(nums)))\nvals.sort()\n\ndp = [0] * len(vals)\nfor num in nums:\n ndp = []\n i = 0\n for j in range(len(vals)):\n if i < j and i < len(dp) - 1:\n i += 1\n v = abs(num - vals[j]) + dp[i]\n if not ndp or v < ndp[-1]:\n ndp.append(v)\n else:\n break\n dp = ndp\nprint(dp[-1])" ]

[ "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\na = [[] for _ in range(n)]\r\nfor i in range(n):\r\n a[i] = [int(_) for _ in input().split()]\r\nrow = []\r\ncol = []\r\nrowStat = [1] * n\r\ncolStat = [1] * m\r\nwhile True:\r\n bad = False\r\n for i in range(n):\r\n total = 0\r\n for j in range(m):\r\n total += a[i][j]\r\n if total < 0:\r\n bad = True\r\n rowStat[i] *= -1\r\n for j in range(m):\r\n a[i][j] *= -1\r\n for i in range(m):\r\n total = 0\r\n for j in range(n):\r\n total += a[j][i]\r\n if total < 0:\r\n bad = True\r\n colStat[i] *= -1\r\n for j in range(n):\r\n a[j][i] *= -1\r\n if not bad:\r\n break\r\nfor i in range(n):\r\n if rowStat[i] == -1:\r\n row.append(i + 1)\r\nfor i in range(m):\r\n if colStat[i] == -1:\r\n col.append(i + 1)\r\nprint(len(row), ' '.join(map(str, row)))\r\nprint(len(col), ' '.join(map(str, col)))\r\n" ]

[ "a,b,c=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\n\r\nx=a-x\r\ny=b-y\r\nz=c-z\r\n\r\ndist=x**2+y**2+z**2\r\nif dist==3:\r\n print('NO')\r\n\r\nelse:\r\n print('YES')", "x1,y1,z1=map(int,input().split())\r\nx2,y2,z2=map(int,input().split())\r\nif x1==x2 or y1==y2 or z1==z2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "I=lambda:map(int,input().split())\r\nprint('YNEOS'[all(x!=y for x,y in zip(I(),I()))::2])", "a,b=(int(input().replace(' ',''),2)for p in' '*2)\r\nprint('YNEOS'[a^b==7::2])", "n = input().split()\nm=input().split()\na=[]\nb=[]\ns=0\ns1=0\ns2=0\ns3=0\nc=0\nfor i in n:\n\ta.append(int(i))\nfor i in m:\n\tb.append(int(i))\nfor i in range (len(a)-1):\n\tc=a[s]\n\ta[s]=b[s]\n\tb[s] =c\n\ts1=0\n\tfor i in range (len(a)):\n\t\tif a[i] + b[i] == 1:\n\t\t\ts1+=1\n\tif s1==3:\n\t\tbreak\nif s1==3:\n\t\tprint('NO')\nelse:\n\t\tprint('YES')\n", "I = lambda: map(int, input().split())\r\n\r\nprint('YES' if any(a==b for a,b in zip(I(),I())) else 'NO')", "# LUOGU_RID: 133989237\na,b,c=map(int,input().split())\nw,e,r=map(int,input().split())\nif a==w or b==e or c==r:\n print(\"YES\")\nelse:\n print(\"NO\")", "a, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nif a == x:\r\n print('YES')\r\nelif a != x:\r\n if b == y:\r\n print('YES')\r\n elif b != y:\r\n if c == z:\r\n print('YES')\r\n elif c != z:\r\n print('NO')\r\n", "il = lambda: list(map(int, input().split()))\r\ny=all(i!=j for i,j in zip(il(),il()))\r\nprint('YNEOS'[int(y)::2])", "# LUOGU_RID: 133404489\na,b,c = map(int,input().split())\r\nd,e,f = map(int,input().split())\r\nif (a-d)**2+(b-e)**2+(c-f)**2>2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "coordinates1 = list(map(int, input().split()))\r\ncoordinates2 = list(map(int, input().split()))\r\n\r\nif coordinates1[0] == coordinates2[0] or coordinates1[1] == coordinates2[1] or coordinates1[2] == coordinates2[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a , b , c = (list)(map(int , input().split()))\r\nx , y , z = (list)(map(int , input().split()))\r\nprint(\"YES\" if a is x or b is y or c is z else \"NO\")", "# LUOGU_RID: 133992359\na,b,c=input().split()\nq,w,e=input().split()\nif a==q or b==w or c==e:\n print('YES')\nelse:\n print('NO')", "a = [int(i) for i in input().split()] \r\nb = [int(i) for i in input().split()] \r\nif a[0] == b[0] or a[1] == b[1] or a[2] == b[2] : print(\"YES\") \r\nelse : print(\"NO\")", "x1,x2,x3=map(int,input().split())\r\ny1,y2,y3=map(int,input().split())\r\nif x1==y1 or x2==y2 or x3==y3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\na = list(map(lambda v: int(v), input().split()))\r\nb = list(map(lambda v: int(v), input().split()))\r\nprint(\"NO\" if sum([abs(x-b[i]) for i,x in enumerate(a)])==3 else \"YES\")\r\n", "a,b,c=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nx=a-x\r\ny=b-y\r\nz=c-z\r\nd=x**2+y**2+z**2\r\nif d==3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "a = input()\r\nb = input()\r\nif a != b.replace('0', '2').replace('1', '0').replace('2', '1') :\r\n print('YES')\r\nelse :\r\n print('NO')", "#! /usr/bin/python3\r\n\r\na = input().strip().split()\r\nb = input().strip().split()\r\nc = 0\r\nfor i in range (0, 3):\r\n if a[i] == b[i]:\r\n c = c + 1\r\n\r\nif c >= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c=map(int,input().split())\r\nd,e,f=map(int,input().split())\r\nif(abs(d-a)+abs(e-b)+abs(f-c)==3):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "# LUOGU_RID: 131541216\na,b,c= map(int, input().split())\r\nd,e,f= map(int,input().split())\r\nif a!=d and b!=e and c!=f :\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n", "#39D\r\nfirst = list(map(int, input().split(\" \")))\r\nsecond = list(map(int, input().split(\" \")))\r\nif first[0] == second[0] or first[1] == second[1] or first[2] == second[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# LUOGU_RID: 128747862\nX,Y,Z=map(int,input().split())\nx,y,z=map(int,input().split())\nif X==x or Y==y or Z==z:\n print(\"YES\")\nelse:\n print(\"NO\")", "def cubicalplanet(r,p):\r\n result = False\r\n for i in range(0, 3):\r\n result |= r[i] == p[i]\r\n print(\"YES\")if(result) else print(\"NO\")\r\nr = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\ncubicalplanet(r,p)\r\n", "a,b,c = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\n\r\nif (a==x or b==y or c==z):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x1, y1, z1 = map(int,input().split())\r\nx2, y2, z2 = map(int,input().split())\r\nans = (x1-x2)**2 + (y1-y2)**2 + (z1-z2)**2\r\nif ans==3:\r\n print('NO')\r\nelse:\r\n print('YES')", "l1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\n\r\na=(l1[0]+1)%2\r\nb=(l1[1]+1)%2\r\nc=(l1[2]+1)%2\r\n\r\nl3=[a,b,c]\r\nif(l2==l3):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\r\n", "a1,b1,c1=map(int,input().split())\r\na2,b2,c2=map(int,input().split())\r\nif(a1==a2 or b1==b2 or c1==c2):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "def q39d():\n\tc1 = [int(num) for num in input().split()]\n\tc2 = [int(num) for num in input().split()]\n\tfor i in range(len(c1)):\n\t\tif(c1[i] == c2[i]):\n\t\t\tprint(\"YES\")\n\t\t\treturn\n\tprint(\"NO\")\n\nq39d()", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = [not i for i in a]\r\nif b == c : print(\"NO\")\r\nelse : print(\"YES\")", "a = int(''.join(input().split()), 2)\r\nb = int(''.join(input().split()), 2)\r\nprint(('NO', 'YES')[(a ^ b) != 7])\r\n", "fly1 = list(map(int, input().split()))\r\nfly2 = list(map(int, input().split()))\r\nif fly1[0] == fly2[0] or fly1[2] == fly2[2] or fly1[1] == fly2[1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "print('YES' if any(i == j for i, j in zip(input().split(), input().split())) else 'NO')", "x,y,z = map(int,input().split())\r\np,q,r = map(int,input().split())\r\nif x!=p and y!=q and z!=r:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nq =0\r\nfor i in range(3):\r\n\tq+=abs(a[i]-b[i])\r\nif q<=2:print(\"YES\")\r\nelse:print(\"NO\")", "\r\nw1=input()\r\nw2=input()\r\n\r\nm1 = [int(x) for x in w1.split()]\r\nm2 = [int(x) for x in w2.split()]\r\nif(m1[0]==m2[0]or m1[1]==m2[1] or m1[2]==m2[2]):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "# LUOGU_RID: 125320685\na = []\r\nb = []\r\na.extend(list(map(int,input().split())))\r\nb.extend(list(map(int,input().split())))\r\nc = 0\r\nfor i in range(3):\r\n if a[i] == b[i]:\r\n c += 1\r\nif c > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=[]\r\ny=[]\r\nz=[]\r\nfor i in range(2):\r\n a,b,c=map(int,input().split())\r\n x.append(a)\r\n y.append(b)\r\n z.append(c)\r\nif x[0]!=x[1]and y[0]!=y[1] and z[0]!=z[1]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a,b,c=map(int,input().split())\r\nd,e,f=map(int,input().split())\r\nif d+a==1 and e+b==1 and c+f==1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "a=str(input()).split()\r\na=list(map(int,a))\r\nb=str(input()).split()\r\nb=list(map(int,b))\r\nif a[0]+b[0]==1 and a[1]+b[1]==1 and a[2]+b[2]==1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "# LUOGU_RID: 131542183\na = map(int,input().split())\r\nc = map(int,input().split())\r\nb = list(a)\r\ne = list(c)\r\nfor i in range(3):\r\n if b[i]==e[i]:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nif a == x or b == y or c == z:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x1,y1,z1=map(int,input().split())\r\nx2,y2,z2=map(int,input().split())\r\nif x1!=x2 and y1!=y2 and z1!=z2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "\r\ndef determine_if_on_same_face(pos1,pos2):\r\n distance=((pos1[0]-pos2[0])**2+(pos1[1]-pos2[1])**2+(pos1[2]-pos2[2])**2)**(1/2)\r\n if distance==3**(1/2):\r\n return False\r\n return True\r\n\r\n\r\npos1=tuple(map(int,input().split()))\r\npos2=tuple(map(int,input().split()))\r\nif determine_if_on_same_face(pos1,pos2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "n=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(3):\r\n if n[i]==x[i]:\r\n count+=1\r\n \r\nif count==0:\r\n print('NO')\r\nelse:\r\n print('YES')", "def f(l1,l2):\r\n return sum([l1[i]==l2[i] for i in range(len(l1))])>0\r\n\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nprint('YES' if f(l1,l2) else 'NO')\r\n", "def planet(a, b):\r\n if abs(a[0] - b[0]) + abs(a[1] - b[1]) + abs(a[2] - b[2]) == 3:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\nc = [int(i) for i in input().split()]\r\nd = [int(j) for j in input().split()]\r\nprint(planet(c, d))\r\n", "if (int(input()[::2], 2) + int(input()[::2], 2)) == 7:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "x,y,z=map(int,input().split())\r\na,b,c=[int(x) for x in input().split()]\r\nprint(\"YES\" if a==x or y==b or z==c else \"NO\")\r\n", "# from dust i have come dust i will be\n\n'''\nif the coordinates lie in the same plane then yes\n'''\n\na,b,c=map(int,input().split())\nx,y,z=map(int,input().split())\n\nx=a-x\ny=b-y\nz=c-z\n\ndist=x**2+y**2+z**2\nif dist==3:\n print('NO')\n\nelse:\n print('YES')\n\t\t \t\t \t\t \t \t \t \t\t \t \t \t \t\t", "fly1=list(map(int,input().split()))\r\nfly2=list(map(int,input().split()))\r\nfor i in range(3):\r\n if fly1[i]==fly2[i]:\r\n print(\"YES\")\r\n break\r\n if i==2 and fly1[i]!=fly2[2]:\r\n print(\"NO\") ", "pos1 = int(\"\".join(input().split()))\r\npos2 = int(\"\".join(input().split()))\r\nif pos1 + pos2 == 111:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "#دو تا نقطه تو مختصات سه بعدی میده میگه اینا تو یک وجه از مکعل هستند یا نه\nprint('YES' if any(i == j for i,j in zip(list(input().split()) ,list(input().split()))) else 'NO')", "# LUOGU_RID: 133977900\na,b,c=map(int,input().split())\r\nd,e,f=map(int,input().split())\r\nif (a-d)**2+(b-e)**2+(c-f)**2>2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "l1=input().split()\r\nl2=input().split()\r\ns=0\r\nfor i in range(3):\r\n\tif(l1[i]==l2[i]):\r\n\t\ts+=1\r\nif(s>=1):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "from math import *\r\nimport time\r\nl1=input().split(\" \")\r\nl2=input().split(\" \")\r\nif(l1[0]!=l2[0] and l1[1]!=l2[1] and l1[2]!=l2[2]):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n# print(time.time()-t1)", "a = list(input().split())\r\nb = list(input().split())\r\n\r\nt = 0\r\n\r\nfor i in range(3):\r\n if a[i] == b[i]:\r\n t += 1\r\n\r\nif t > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "one = input().split()\r\ntwo = input().split()\r\nres = any(a == b for a, b in zip(one,two))\r\nprint([\"NO\",\"YES\"][res])", "a, b, c = list(map(int,input().strip().split(' ')))\r\nx, y, z = list(map(int,input().strip().split(' ')))\r\nprint(\"YES\" if a == x or b == y or c == z else \"NO\")", "# LUOGU_RID: 125322850\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ns=0\r\nfor i in range(3):\r\n s=(a[i]-b[i])*(a[i]-b[i])+s\r\nif(s<=2):print('YES')\r\nelse:print('NO')", "a=[int(b) for b in input().split()]\r\nb=[int(a) for a in input().split()]\r\nif a[0]==b[0] or a[1]==b[1] or a[2]==b[2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a, b = (int(input().replace(' ', ''), 2) for _ in' '*2)\r\nprint('YNEOS'[a ^ b == 7::2])", "x1,y1,z1=map(int,input().split())\r\nx2,y2,z2=map(int,input().split())\r\nif((x1-x2)**2+(y1-y2)**2+(z1-z2)**2==3):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a,b,c=list(map(int,input().split()))\r\nx,y,z=list(map(int,input().split()))\r\nif x!=a and y!=b and z!=c:\r\n print('NO')\r\nelse:\r\n print('YES')", "line1 = input().split()\r\nline2 = input().split()\r\nprint('YES' if line1[0] == line2[0] or line1[1] == line2[1] or line1[2] == line2[2] else 'NO')\r\n", "# easy peasy lemon squezy \n# kahini holo jehetu same face bolse tar maen etka co-ordinate same hote hobe\n'''\n |\n |\n | \n | (1,1,1) vashtese \n |\n |\n --------------------------------- toler upor ekta 0 0 1 hoy taile seta hobe xy tole kintu z tol theke 1 upore \n\n tar mane darai je se dekhte parbe\n\n tar mane etaw bjha jasse je dui ta face soman howa lagbena ekta holei hobe inshAllah !!\n\n'''\n\nq,w,e = map(int, input().split())\nr,t,y = map(int, input().split())\n\nif q == r or w == t or e == y:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n \t \t \t\t\t\t\t\t \t\t\t \t \t \t\t", "r = lambda: int(input())\r\nra = lambda: [*map(int, input().split())]\r\na, b = ra(), ra()\r\nc = []\r\nfor i in range(3):\r\n if a[i]==0:\r\n c.append(1)\r\n else:\r\n c.append(0)\r\nif c==b:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "x,y,z=map(int,input().split())\r\na,b,c=map(int,input().split())\r\na=x-a\r\nb=y-b\r\nc=z-c\r\ndis=a**2+b**2+c**2\r\nif dis==3:\r\n print('NO')\r\nelse:\r\n print('YES')", "f1 = list(map(int,input().split()))\r\nf2 = list(map(int,input().split()))\r\n\r\nf=0\r\nfor i in range(3):\r\n\tif f1[i]==f2[i]:\r\n\t\tf=1\r\n\t\tbreak\r\n\r\nif f==0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "lst=[int(i) for i in input().split()]\r\nlst2=[int(i) for i in input().split()]\r\ncount=0\r\nfor i in range(len(lst)):\r\n if (lst[i]==0 and lst2[i]==1) or (lst[i]==1 and lst2[i]==0):\r\n count+=1\r\n else:\r\n pass\r\nif count!=len(lst):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "fly1 = input().split()\r\nfly2 = input().split()\r\n\r\nfly1_ = []\r\nfor i in fly1:\r\n i = bool(int(i))\r\n i = int(not i)\r\n fly1_.append(str(i))\r\n\r\nif fly2 == fly1_:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "A = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nfor i in range(3):\r\n if A[i] == B[i]:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n", "fly1=input().split()\r\nfly2=input().split()\r\n\r\nfor a,b in zip(fly1,fly2):\r\n if a==b:\r\n print('YES')\r\n exit()\r\nprint('NO')", "a,b,c=map(int,input().split())\r\nq,w,e=map(int,input().split())\r\nif not a==q and not b==w and not c==e:\r\n print('NO')\r\nelse:\r\n print('YES')", "a=input().split();b=input().split()\nif a[0]!=b[0] and a[1]!=b[1] and a[2]!=b[2]:\n print('NO')\nelse:\n print('YES')", "x1, y1, z1 = map(int, input().split())\r\nx2, y2, z2 = map(int, input().split())\r\n\r\nif x1 == x2 or y1 == y2 or z1 == z2:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n", "a,b,c=map(int,input().split())\nx,y,z=map(int,input().split())\n\nx=a-x\ny=b-y\nz=c-z\n\ndist=x**2+y**2+z**2\nif dist==3:\n print('NO')\n\nelse:\n print('YES')\n \t\t \t\t \t\t \t \t \t\t\t\t\t\t \t \t", "x1,y1,z1 = input().split()\r\nx1 = int(x1)\r\ny1 = int(y1)\r\nz1 = int(z1)\r\nx2,y2,z2 = input().split()\r\nx2 = int(x2)\r\ny2 = int(y2)\r\nz2 = int(z2)\r\nif x1==x2 or y1==y2 or z1==z2:\r\n print('YES')\r\nelse:\r\n print('NO')", "# LUOGU_RID: 128183269\na,b,c=map(int,input().split())\r\ne,f,g=map(int,input().split())\r\nif ((a==e) or (b==f) or (c==g)):\r\n print('YES')\r\nelse:\r\n print('NO')", "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\ncoord1 = get_list()\r\ncoord2 = get_list()\r\n\r\ncount = 0\r\n\r\nfor i in range(3):\r\n if coord1[i] == coord2[i]:\r\n count += 1\r\nif count >= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def nik(rud,panda):\r\n res = False\r\n for i in range(0, 3):\r\n res |= rud[i] == panda[i]\r\n print(\"YES\")if(res) else print(\"NO\")\r\nrud = list(map(int, input().split()))\r\npanda = list(map(int, input().split()))\r\nnik(rud,panda)\r\n", "x1, y1, z1 = map(int, input().split())\r\nx2, y2, z2 = map(int, input().split())\r\n\r\nif x1 != x2 and y1 != y2 and z1 != z2:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "def get_ints():\r\n return list(map(int, input().split()))\r\n\r\nfrom math import sqrt\r\na = get_ints()\r\nb = get_ints()\r\ns = sqrt(sum((a[i]-b[i] )**2 for i in range(3)) )\r\nprint(\"YES\" if s!=sqrt(3) else \"NO\")", "# LUOGU_RID: 126331458\na,b,c=map(int,input().split())\r\nd,e,f=map(int,input().split())\r\nif a==d or b==e or c==f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a,b,c=[int(x) for x in input().split()] \r\np,q,r=[int(x) for x in input().split()] \r\nif a+p==1 and b+q==1 and c+r==1:\r\n\tprint(\"NO\")\r\nelse:\r\n print(\"YES\")\t", "\r\nx1,y1,z1=map(int,input().split())\r\nx2,y2,z2=map(int,input().split())\r\nif (x1==x2) or (y1==y2) or (z1==z2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nz=0\r\nfor i in range(0,3):\r\n if a[i]==0:\r\n if b[i]==1:\r\n continue\r\n else:\r\n z=1\r\n break\r\n else:\r\n if b[i]==0:\r\n continue\r\n else:\r\n z=1\r\n break\r\nif z==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "c_1 = list(map(int, input().split()))\nc_2 = list(map(int, input().split()))\nisSee = False\n\nfor i in range(3):\n if c_1[i] == c_2[i]:\n isSee = True\n break\n\nif isSee:\n print('YES')\nelse:\n print('NO')\n", "f_1 = list(map(int,input().strip().split()))[:3]\r\nf_2 = list(map(int,input().strip().split()))[:3]\r\n\r\nif f_1[0] + f_2[0] == 1 and f_1[1] + f_2[1] == 1 and f_1[2] + f_2[2] == 1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "# LUOGU_RID: 128752642\nla=[x for x in input().split()]\r\nlb=[x for x in input().split()]\r\nif (la[0]==lb[0]or la[1]==lb[1]or la[2]==lb[2]):\r\n print('YES')\r\nelse:\r\n print('NO')", "# LUOGU_RID: 101448741\na, b, c, d, e, f = map(int, open(0).read().split())\r\nprint((a == d or b == e or c == f) and 'YES' or 'NO')\r\n", "l=list(map(int,input().split(' ')))\r\nl2=list(map(int,input().split(' ')))\r\n\r\nif l[0]!=l2[0] and l[1]!=l2[1] and l2[2]!=l[2]:\r\n print('NO')\r\nelse:\r\n print('YES')", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n \r\nx1, y1, z1 = map(int, input().split(\" \")) # read multiple integers into different variables\r\nx2, y2, z2 = map(int, input().split(\" \")) # read multiple integers into different variables\r\n\r\nif ((x1 == x2) or (y1 == y2) or (z1 == z2)): print(\"YES\")\r\nelse:print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "frs = list(input().split())\r\nsec = list(input().split())\r\nif frs[0] == sec[0] or frs[1] == sec[1] or frs[2] == sec[2]:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-27 22:05:48\nLastEditTime: 2021-11-27 22:11:40\nDescription: Cubical Planet\nFilePath: CF39D.py\n'''\n\n\ndef func():\n x1, y1, z1 = map(int, input().strip().split())\n x2, y2, z2 = map(int, input().strip().split())\n if (x1 ^ x2) + (y1 ^ y2) + (z1 ^ z2) == 3:\n print(\"NO\")\n else:\n print(\"YES\")\n\n\nif __name__ == '__main__':\n func()\n", "import math\r\nf1 = tuple(map(int , input().split(\" \")))\r\nf2 = tuple(map(int , input().split(\" \")))\r\nif ((f1[0]-f2[0])**2+(f1[1]-f2[1])**2+(f1[2]-f2[2])**2) == 3:\r\n print (\"NO\")\r\nelse:\r\n print(\"YES\")", "print('NO' if (int(input().replace(' ', ''))+int(input().replace(' ', '')))==111 else 'YES')", "a, b, c = map(int, input().split())\r\na1, b1, c1 = map(int, input().split())\r\n\r\nif a == a1 or b == b1 or c == c1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(3):\r\n ans+=abs(l1[i]-l2[i])\r\nif ans==3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# LUOGU_RID: 133989348\n'''\r\none=['XXX','..X','XXX','XXX','X.X','XXX','XXX','XXX','XXX','XXX']\r\ntwo=['X.X','..X','..X','..X','X.X','X..','X..','..X','X.X','X.X']\r\nthr=['X.X','..X','XXX','XXX','XXX','XXX','XXX','..X','XXX','XXX']\r\nfou=['X.X','..X','X..','..X','..X','..X','X.X','..X','X.X','..X']\r\nfiv=['XXX','..X','XXX','XXX','..X','XXX','XXX','..X','XXX','XXX']\r\na=int(input())\r\nb=input()\r\nnum=[one,two,thr,fou,fiv]\r\nfor i in range(5):\r\n for j in b:\r\n print(a[i][int(j)],end=' ')\r\n \r\n\r\nfor i in a:\r\n print(i)\r\n'''\r\na=map(int,input().split())\r\na=list(a)\r\nb=map(int,input().split())\r\nb=list(b)\r\nfor i in range(3):\r\n if a[i]==b[i]:\r\n print('YES')\r\n break\r\n if i==2:\r\n print('NO')\r\n", "n = input().split();\r\nk = input().split();\r\nif((int(n[0])+1)%2 == int(k[0]) and (int(n[1])+1)%2 == int(k[1]) and (int(n[2])+1)%2 == int(k[2])):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# LUOGU_RID: 130136520\na,b,c=input().split()\nx,y,z=input().split()\nif a==x or b==y or c==z:\n print('YES')\nelse:\n print('NO')", "# for _ in range(int(input())):\r\nl=list(map(int,input().split()))\r\nz=list(map(int,input().split()))\r\nif z[0]!=l[0] and z[1]!=l[1] and l[2]!=z[2]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a,b,c=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\n\r\nx=a-x\r\ny=b-y\r\nz=c-z\r\n\r\nans=pow(x,2)+pow(y,2)+pow(z,2)\r\n\r\nif ans==3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# LUOGU_RID: 128267618\na = []\r\nb = []\r\na.extend(map(int,input().split()))\r\nb.extend(map(int,input().split()))\r\nc = 0\r\nfor i in range(3):\r\n if a[i] == b[i]:\r\n c += 1\r\nif c > 0:\r\n print(\"YES\",end='\\n')\r\nelse:\r\n print(\"NO\",end='\\n')\r\n", "# LUOGU_RID: 131532289\nc=map(int,input().split())\r\nf=list(c)\r\nx=map(int,input().split())\r\ny=list(x)\r\nif len(f) >= 3 and len(y) >= 3: \r\n if int(f[0])==int(y[0]) or int(f[1])==int(y[1]) or int(f[2])==int(y[2]): \r\n print(\"YES\") \r\n else: \r\n print(\"NO\") \r\nelse: \r\n print(\"Lists f or y are too short.\")", "# LUOGU_RID: 130158723\nimport math \r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nd = math.sqrt((a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1])+(a[2]-b[2])*(a[2]-b[2]))\r\nif d<1.7 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "a = list(input().split())\nb = list(input().split())\nc = \"NO\"\nfor x in range(len(a)):\n\tif a[x] == b[x]:c = \"YES\"\nprint(c)\n", "# LUOGU_RID: 130148082\nx,y,z=list(map(int,input().split()))\r\nj,k,l=list(map(int,input().split()))\r\nif(x==j or y==k or z==l):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# LUOGU_RID: 133990995\na=map(int,input().split())\r\na=list(a)\r\nb=map(int,input().split())\r\nb=list(b)\r\nfor i in range(3): #有三个坐标0-2，没有取到三\r\n if a[i]==b[i]: #当比较到相同的就相遇\r\n print('YES')\r\n break #然后结束\r\n if i==2: #当比较到第三个坐标没有相同就是不相遇\r\n print('NO')", "a = tuple(map(int, input().split()))\nb = tuple(map(int, input().split()))\nfor ax, bx in zip(a, b):\n if ax == bx:\n print('YES')\n import sys; sys.exit()\nprint('NO')\n", "a,b,c=map(int,input().split())\r\nd,e,f=map(int,input().split())\r\n\r\nx=(a^d)+(b^e)+(c^f)\r\n\r\nif x==3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "fly1 = [int(n) for n in input().split()]\r\nfly2 = [int(n) for n in input().split()]\r\n\r\nmismatch = 0\r\n\r\nfor i in range(3) :\r\n if fly1[i] != fly2[i]:\r\n mismatch += 1\r\n \r\nif mismatch == 3 :\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")", "# LUOGU_RID: 128738260\na=input()\nb=input()\na=a.replace(' ','')\nb=b.replace(' ','')\nfor i in range(3):\n if a[i]==b[i]:\n print('YES')\n break\n if i==2:\n print('NO')", "from sys import stdin\r\na = list(map(int, stdin.readline().split()))\r\nb = list(map(int, stdin.readline().split()))\r\nprint('NO' if all(a[i] ^ b[i] for i in range(3)) else 'YES')", "#ROUNIAAUDI\r\nlist1=list(map(int,input().split()))\r\nlist2=list(map(int,input().split()))\r\n\r\nprint(\"YES\" if any(i==k for i,k in zip(list1,list2)) else \"NO\")\r\n ", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A, B):\r\n n = len(A)\r\n for i in range(n):\r\n if A[i] == B[i]:\r\n return True\r\n return False\r\n\r\ndef main():\r\n A = list(map(int, input().split()))\r\n B = list(map(int, input().split()))\r\n if solve(A, B):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a1, b1, c1 = map(int, input().split())\r\na2, b2, c2 = map(int, input().split())\r\n\r\nans = (a1-a2)**2 + (b1-b2)**2 + (c1-c2)**2\r\n\r\nif ans == 3:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "# LUOGU_RID: 128753035\na,b,c=map(int,input().split())\nd,e,f=map(int,input().split())\nif ((a==d) or (b==e) or (c==f)):\n print('YES')\nelse:\n print('NO')", "#aww u r seeing my code?\r\nx1,x2,x3=map(int,input().split())\r\ny1,y2,y3=map(int,input().split())\r\nif x1==y1 or x2==y2 or x3==y3: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "# LUOGU_RID: 125479243\ni=0\r\na,b,c=map(int,input().split())\r\nd,e,f=map(int,input().split())\r\nif(a==d):\r\n i=i+1\r\nif(b==e):\r\n i=i+1\r\nif(c==f):\r\n i=i+1\r\nif(i>=1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A1 = list(map(int, input().split()))\r\nA2 = list(map(int, input().split()))\r\n\r\nans = False\r\n\r\nfor i in range(0, 3):\r\n ans |= A1[i] == A2[i]\r\n \r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# from dust i have come dust i will be\r\n\r\n'''\r\nif the coordinates lie in the same plane then yes\r\n'''\r\n\r\na,b,c=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\n\r\nx=a-x\r\ny=b-y\r\nz=c-z\r\n\r\ndist=x**2+y**2+z**2\r\nif dist==3:\r\n print('NO')\r\n\r\nelse:\r\n print('YES')", "q,w,e=map(int,input().split())\r\nz=0\r\na,s,d=map(int,input().split())\r\nif q==a:\r\n z+=1\r\nif w==s:\r\n z+=1\r\nif e==d:\r\n z+=1\r\nif z>=1:\r\n print(\"YES\")\r\nelse:print(\"NO\")\r\n", "s1 = input()\r\ns2 = input()\r\nif s1[0] == s2[0] or s1[2] == s2[2] or s1[4] == s2[4]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import inf,sqrt,floor,ceil\r\nfrom collections import Counter,defaultdict,deque\r\nfrom heapq import heappush as hpush,heappop as hpop,heapify as h\r\nfrom operator import itemgetter\r\nfrom itertools import product\r\nfrom bisect import bisect_left,bisect_right\r\n\r\n\r\n#for _ in range(int(input())):\r\n#n=int(input())\r\na,b,c=map(int,input().split( ))\r\nd,e,f=map(int,input().split( ))\r\nif (a^d)+(b^e)+(c^f)==3:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n \r\n", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n a = [int(i) for i in input().split(\" \")]\r\n b = [int(i) for i in input().split(\" \")]\r\n is_equal = False\r\n for i in range(len(a)):\r\n if a[i] == b[i]:\r\n print(\"YES\")\r\n is_equal = True\r\n break\r\n if not is_equal:\r\n print(\"NO\")\r\n\r\n\r\nmain_function()", "list1 = input().split()\r\nlist2 = input().split()\r\nfor i in range(3):\r\n if list1[i] == list2[i]:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "# LUOGU_RID: 128180015\na,b,c=map(int,input().split())\r\na1,b1,c1=map(int,input().split())\r\nif a==a1 or b==b1 or c==c1:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "f1 = list(map(int,input().split()))\r\nf2 = list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(3):\r\n if f1[i]==f2[i]:\r\n cnt+=1\r\n\r\nprint(\"YES\") if cnt>0 else print(\"NO\")\r\n", "# LUOGU_RID: 128748662\na,b,c=map(int,input().split())\r\na1,b1,c1=map(int,input().split())\r\nif ((a==a1) or (b==b1) or (c==c1)):\r\n print('YES')\r\nelse:\r\n print('NO')", "ar = input().split()\r\nar2 = input().split()\r\nif(not(ar[0] == ar2[0] or ar[1] == ar2[1] or ar[2] == ar2[2])):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x1,y1,z1=map(int,input().split())\r\nx2,y2,z2=map(int,input().split())\r\nprint(\"YES\")if (x1==x2 or y1==y2 or z1==z2) else print(\"NO\")", "a,b,c = map(int, input().strip().split(' '))\r\na1,b1,c1 = map(int, input().strip().split(' '))\r\nif (a1==a) or (b1==b) or (c1==c):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=[[[0,0,0],[1,0,0],[1,1,0],[0,1,0]],[[0,0,0],[1,0,0],[0,0,1],[1,0,1]],[[0,0,1],[1,0,1],[0,1,1],[1,1,1]],[[0,1,1],[1,1,1],[1,1,0],[0,1,0]],[[0,0,0],[0,0,1],[0,1,0],[0,1,1]],[[1,0,0],[1,0,1],[1,1,0],[1,1,1]]]\nfor i in range(len(c)):\n\t# print(c[i])\n\tif a in c[i] and b in c[i]:\n\t\tprint('YES')\n\t\tquit()\nprint('NO')" ]

[ "s=input()\r\nhs=[[0]*3 for i in range(len(s)+1)]\r\nfor i in range(len(s)):\r\n for j in range(3):\r\n hs[i+1][j]=hs[i][j]\r\n if s[i]=='x':\r\n hs[i+1][0]+=1\r\n if s[i]=='y':\r\n hs[i+1][1]+=1\r\n if s[i]=='z':\r\n hs[i+1][2]+=1\r\nn=int(input())\r\nres=[]\r\nfor i in range(n):\r\n l,r=map(int,input().split(\" \"))\r\n t = [hs[r][i] - hs[l-1][i] for i in range(3)]\r\n res.append('YES' if r - l < 2 or max(t) - min(t) < 2 else 'NO')\r\nprint('\\n'.join(res))\r\n", "def f(x, y, z): return max(x, y, z) - min(x, y, z) > 1\r\nt = input()\r\nn, m, p = len(t), int(input()), {'x': 0, 'y': 1, 'z': 2}\r\ns = [[0] * (n + 1) for i in range(3)]\r\nfor i, c in enumerate(t, 1): s[p[c]][i] = 1\r\nfor i in range(3):\r\n r = s[i]\r\n for j in range(1, n): r[j + 1] += r[j]\r\na, b, c = s\r\nq, d = [map(int, input().split()) for i in range(m)], ['YES'] * m\r\nfor i, (l, r) in enumerate(q):\r\n if r - l > 1 and f(a[r] - a[l - 1], b[r] - b[l - 1], c[r] - c[l - 1]): d[i] = 'NO'\r\nprint('\\n'.join(d))", "s = input()\r\ncnt = list([0] * 3 for _ in range(len(s) + 1))\r\nfor i in range(len(s)):\r\n for j in range(3):\r\n cnt[i+1][j] = cnt[i][j]\r\n if s[i] == 'x': cnt[i+1][0] += 1\r\n elif s[i] == 'y': cnt[i+1][1] += 1\r\n else: cnt[i+1][2] += 1\r\nn = int(input())\r\nres = []\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n t = [cnt[r][i] - cnt[l-1][i] for i in range(3)]\r\n res.append('YES' if r - l < 2 or max(t) - min(t) < 2 else 'NO')\r\nprint('\\n'.join(res))\r\n", "import sys\r\n\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ns = input().strip()\r\nx_c, y_c, z_c = [0], [0], [0]\r\n\r\nfor el in s:\r\n x_c.append(x_c[-1]+int(el==\"x\"))\r\n y_c.append(y_c[-1]+int(el==\"y\"))\r\n z_c.append(z_c[-1]+int(el==\"z\"))\r\n\r\nfor _ in range(int(input())):\r\n l, r = map(int, input().split())\r\n if r - l < 2:\r\n print(\"YES\")\r\n continue\r\n x, y, z = x_c[r]-x_c[l-1], y_c[r]-y_c[l-1], z_c[r]-z_c[l-1]\r\n if max(x, y, z) - min(x, y, z) > 1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "import sys\ns=sys.stdin.readline().split()[0]\n\nm=int(sys.stdin.readline())\n\nNumx=[]\nNumy=[]\nNumz=[]\nx=0\ny=0\nz=0\nfor i in range(len(s)):\n if(s[i]=='x'):\n x+=1\n if(s[i]=='y'):\n y+=1\n if(s[i]=='z'):\n z+=1\n Numx.append(x)\n Numy.append(y)\n Numz.append(z)\n \n\nAns=\"\"\nfor M in range(m):\n s,e=map(int,sys.stdin.readline().split())\n if(e-s+1<=2):\n Ans+=\"YES\\n\"\n continue\n s-=1\n e-=1\n x=Numx[e]\n y=Numy[e]\n z=Numz[e]\n if(s!=0):\n x-=Numx[s-1]\n y-=Numy[s-1]\n z-=Numz[s-1]\n if(x==y==z):\n Ans+=\"YES\\n\"\n continue\n L=[x,y,z]\n L.sort()\n if(L[0]==L[1] and L[2]==L[1]+1):\n Ans+=\"YES\\n\"\n continue\n if(L[1]==L[2] and L[0]==L[1]-1):\n Ans+=\"YES\\n\"\n else:\n Ans+=\"NO\\n\"\nsys.stdout.write(Ans)\n \n \n\n \n", "import sys\r\nimport math\r\n \r\ns = input()\r\n\r\nk = [[0, 0, 0]]\r\nv = [0] * 3\r\n\r\nfor i in range(len(s)): \r\n v[ord(s[i]) - ord('x')] += 1\r\n k.append(list(v))\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n l, r = [int(x) for x in (sys.stdin.readline()).split()]\r\n vmin = min([k[r][0] - k[l - 1][0], k[r][1] - k[l - 1][1], k[r][2] - k[l - 1][2]])\r\n vmax = max([k[r][0] - k[l - 1][0], k[r][1] - k[l - 1][1], k[r][2] - k[l - 1][2]])\r\n if(r - l + 1 <= 2 or vmax - vmin < 2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# https://codeforces.com/contest/368\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\ns = input()\nm = int(input())\n\nn = len(s)\ncx, cy, cz = [0] * (n + 1), [0] * (n + 1), [0] * (n + 1)\nfor i in range(n):\n cx[i + 1] = cx[i] + int(s[i] == \"x\")\n cy[i + 1] = cy[i] + int(s[i] == \"y\")\n cz[i + 1] = cz[i] + int(s[i] == \"z\")\n\nfor _ in range(m):\n l, r = map(int, input().split())\n if r - l < 2:\n print(\"YES\")\n else:\n x = cx[r] - cx[l - 1]\n y = cy[r] - cy[l - 1]\n z = cz[r] - cz[l - 1]\n print(\"YES\" if max(x, y, z) - min(x, y, z) <= 1 else \"NO\")\n", "def f(t): return t[2] - t[0] > 1\r\n\r\nt = input()\r\n\r\nn, m, p = len(t), int(input()), {'x': 0, 'y': 1, 'z': 2}\r\n\r\ns = [[0] * (n + 1) for i in range(3)]\r\n\r\nfor i, c in enumerate(t, 1): s[p[c]][i] = 1\r\n\r\nfor i in range(3):\r\n\r\n for j in range(1, n): s[i][j + 1] += s[i][j]\r\n\r\na, b, c = s\r\n\r\nq, d = [map(int, input().split()) for i in range(m)], ['YES'] * m\r\n\r\nfor i, (l, r) in enumerate(q):\r\n\r\n if r - l > 1 and f(sorted([a[r] - a[l - 1], b[r] - b[l - 1], c[r] - c[l - 1]])): d[i] = 'NO'\r\n\r\nprint('\\n'.join(d))\r\n\r\n" ]

[ "n,m=map(int,input().split())\r\np=list(map(int,input().split()))\r\nfor _ in range(m):\r\n l,r,x=map(int,input().split())\r\n l2=p[l-1:r]\r\n k=l2[x-l]\r\n c=0\r\n for y in l2:\r\n if y<l2[x-l]:\r\n c+=1\r\n if c==x-l:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n \r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\np=[0]+list(map(int,input().split()))\r\nfor _ in range(m):\r\n l,r,x=map(int,input().split())\r\n c=0\r\n for i in range(l,r+1):\r\n if(p[i]<p[x]):\r\n c+=1\r\n if(l+c==x):\r\n print('Yes')\r\n else:\r\n print('No')\r\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\nfor _ in range(m):\r\n l, r, x = map(int, input().split())\r\n d = 0\r\n for i in range(l-1, r):\r\n if w[x-1] > w[i]:\r\n d += 1\r\n if d == x-l:\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor _ in range(m):\r\n l,r,x=map(int,input().split())\r\n id=l-1\r\n for i in range(l-1,r):\r\n if a[x-1]>a[i]: id+=1\r\n print('YNeos'[a[x-1]!=a[id]::2])", "from sys import stdin\nfrom bisect import bisect, insort\n\n\ndef main():\n n, m = map(int, input().split())\n pp = list(map(int, input().split()))\n res = stdin.read().splitlines()\n d, buf = {}, []\n for i, s in enumerate(res):\n l, r, x = map(int, s.split())\n l -= 1\n p = pp[x - 1]\n d[l, p] = 0\n d[r, p] = 0\n res[i] = (l, r, x, p)\n pp.reverse()\n for i, p in sorted(d.keys()):\n while len(buf) < i:\n insort(buf, pp.pop())\n d[i, p] = bisect(buf, p)\n for i in range(m):\n l, r, x, p = res[i]\n res[i] = ('No', 'Yes')[x - l == d[r, p] - d[l, p]]\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "##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\np = list(map(int, input().split()))\r\n\r\nfor i in range(m):\r\n [l, r, x] = list(map(int, input().split()))\r\n a = p[x-1]\r\n cnt = 0\r\n for j in range(l, r+1):\r\n if p[j-1] <= a:\r\n cnt += 1\r\n if cnt == x-l+1:\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "n, m = [int(x) for x in input().split(\" \")]\na = [int(x) for x in input().split(\" \")]\nfor i in range(m):\n l,r,x = [int(x) for x in input().split(\" \")]\n smaller = 0\n for i in range(l-1,r):\n if a[i]<a[x-1]:\n smaller += 1\n if smaller == x-l:\n print(\"Yes\")\n else:\n print(\"No\")\n", "import sys\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\np = list(map(int, input().split()))\r\nfor _ in range(m):\r\n l,r,x = map(int, input().split())\r\n cnt = 0\r\n for i in range(l-1,r):\r\n if p[i] < p[x-1]:\r\n cnt += 1\r\n if cnt == x - l:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nd=defaultdict(list)\r\nn,m=M()\r\nl=L()\r\nfor i in range(m):\r\n le,r,p=M()\r\n c=0\r\n for j in range(le-1,r):\r\n if(l[j]<l[p-1]):\r\n c+=1\r\n if(le+c==p):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "def find_if_position_of_given_element_is_not_changed():\n length, n_repeats = [int(num) for num in input().split(\" \")]\n permutation = [int(num) for num in input().split(\" \")]\n\n for _ in range(n_repeats):\n start, end, position = [int(num) for num in input().split(\" \")]\n start -=1\n position -= 1\n\n if (position < start) or (position >= end):\n print(\"Yes\")\n else:\n \n position_number = permutation[position]\n relative_position = position - start\n counter_of_smaller_numbers = 0\n\n for id in range(start, end):\n if permutation[id] < position_number:\n counter_of_smaller_numbers += 1\n if (counter_of_smaller_numbers == relative_position):\n print(\"Yes\")\n else:\n print(\"No\")\n\n \nif __name__ == \"__main__\":\n find_if_position_of_given_element_is_not_changed()\n\n \n\n\n\n\n \t\t \t\t \t\t \t \t\t \t\t \t\t \t\t\t\t\t\t", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn,m=map(int,input().strip().split())\r\na=input()\r\nb=list(map(int,a.strip().split()))\r\nfor i in range(m):\r\n L,R,k=map(int,input().strip().split())\r\n L-=1\r\n R-=1\r\n k-=1\r\n sum=0\r\n j=L\r\n while j<=R:\r\n if b[j]<b[k]:\r\n sum+=1\r\n j+=1\r\n if sum==(k-L):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n\r\n", "n,m=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nfor i in range(m):\r\n l,r,x=list(map(int,input().split()))\r\n q=p[x-1]\r\n c=0\r\n for j in range(l-1,r):\r\n if q>p[j]:\r\n c=c+1\r\n if l+c==x:\r\n print('Yes')\r\n else:\r\n print('No')", "n, m = map(int, input().split())\r\np = [int(i) for i in input().split()]\r\n\r\nfor _ in range(m):\r\n l, r, x = map(int, input().split())\r\n counter = 0\r\n for ind in range(l - 1, r):\r\n # print(ind)\r\n if p[ind] < p[x - 1]:\r\n counter += 1\r\n print('Yes' if l + counter == x else 'No')\r\n", "n, m = map(int, input().split())\r\nP = list(map(int, input().split()))\r\nR = [0] * n\r\nL = [0] * n\r\n\r\nfor i in range(m):\r\n l, r, x = map(int, input().split())\r\n l, r, x = l - 1, r - 1, x - 1\r\n tmp = 0\r\n for j in range(l, x):\r\n if P[j] > P[x]:\r\n tmp += 1\r\n for j in range(x, r + 1):\r\n if P[j] < P[x]:\r\n tmp -= 1\r\n\r\n if tmp == 0:\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\np = [0] + list(map(int, input().split()))\r\nans = []\r\nfor _ in range(m):\r\n l, r, x = map(int, input().split())\r\n px, y = p[x], l\r\n for i in range(l, r + 1):\r\n if p[i] < px:\r\n y += 1\r\n ans0 = \"Yes\" if x == y else \"No\"\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(ans))", "\ndef countSort(vet):\n upper = max(vet)\n count = [0]*(upper+1)\n output = [0]*len(vet)\n for v in vet:\n count[v]+=1\n for i in range(1, upper+1):\n count[i] += count[i-1]\n for i in range(len(vet)):\n output[count[vet[i]]-1] = vet[i] \n count[vet[i]]-=1\n return output\n \n\n\nn, m = list(map(int, input().strip().split()))\nperm = list(map(int, input().strip().split()))\nfor i in range(m):\n l,r,x = list(map(int, input().strip().split()))\n if (l == r == x):\n print(\"Yes\")\n continue\n print(\"Yes\" if countSort(perm[l-1:r])[x-l] == perm[x-1] else \"No\")\n", "def partition(a,start,end):\r\n pivot=a[end]\r\n pindex=start\r\n \r\n for i in range(start,end):\r\n if a[i]<pivot:\r\n a[i],a[pindex]=a[pindex],a[i]\r\n pindex+=1\r\n return pindex\r\n \r\n \r\n \r\nn,m=map(int, input().split())\r\na=list(map(int, input().split()))\r\nfor _ in range(m):\r\n l,r,x=map(int, input().split())\r\n k=a[x-1]\r\n #print(k)\r\n if l-1<=x-1<=r-1:\r\n \r\n b=a[l-1:r]\r\n i=b.index(k)\r\n b.remove(k)\r\n b.append(k)\r\n ans=partition(b,0,len(b)-1)\r\n #b=sorted(b)\r\n if ans==i:\r\n print('Yes')\r\n else:\r\n print('No')\r\n \r\n else:\r\n print('Yes')\r\n \r\n \r\n", "n, m = map(int,input().split())\r\na = list(map(int, input().split()))\r\nfor _ in range(m):\r\n l,r, x = map(int,input().split())\r\n t = 0\r\n lb = x-l\r\n for i in range(l-1, r):\r\n if a[x-1] > a[i]:\r\n t += 1\r\n print(\"Yes\" if t == lb else \"No\")", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\nm, n = map(int, input().split())\nb = list(map(int, input().split()))\nfor i in range(n):\n\tl, r, x = map(int, input().split())\n\tcnt = 0\n\tfor j in range(l-1, r):\n\t\tif b[j] < b[x-1]:\n\t\t\tcnt += 1\n\tif cnt == x - l:\n\t\tprint(\"Yes\")\n\telse:\n\t\tprint(\"No\")\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(m):\r\n l, r, x = map(int, input().split())\r\n if x < l or x > r:\r\n print(\"Yes\")\r\n else:\r\n cnt = 0\r\n for j in range(l, r+1):\r\n cnt += (a[j-1] < a[x-1])\r\n if l + cnt == x:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n,k = map(int , input().split())\r\nl = input()\r\nz = [int(i) for i in l.split()]\r\nfor i in range(k):\r\n l,r , x = map(int, input().split())\r\n l,r,x =l-1,r-1,x-1\r\n y=0\r\n t = z[x]\r\n\r\n for j in range(l , r+1):\r\n\r\n\r\n if z[j]<t:\r\n\r\n y+=1\r\n if l+y==x:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "n,m=map(int, input().split())\r\na=list(map(int, input().split()))\r\nfor _ in range(m):\r\n l,r,x=map(int, input().split())\r\n k=a[x-1]\r\n #print(k)\r\n if l-1<=x-1<=r-1:\r\n \r\n b=a[l-1:r]\r\n i=b.index(k)\r\n #b.remove(k)\r\n #b.append(k)\r\n #ans=partition(b,0,len(b)-1)\r\n #b=sorted(b)\r\n c=0\r\n for j in range(0,len(b)):\r\n if b[j]<k:\r\n c+=1\r\n if c==i:\r\n \r\n #if ans==i:\r\n print('Yes')\r\n else:\r\n print('No')\r\n \r\n else:\r\n print('Yes')\r\n \r\n \r\n", "from sys import *\r\nfrom heapq import *\r\ninput=stdin.readline\r\nn,m=map(int,input().split())\r\nl=[0]+list(map(int,input().split()))\r\nfor u in range(m):\r\n a,b,x=map(int,input().split())\r\n c=0\r\n for i in range(a,b+1):\r\n if(l[i]<l[x]):\r\n c+=1\r\n if(a+c==x):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "n, m = map(int, input().split())\np = list(map(int, input().split()))\n\nfor _ in range(m):\n l, r, x = map(int, input().split())\n px = p[x - 1]\n cnt = l\n for i in range(l, r + 1):\n if p[i - 1] < px:\n cnt += 1\n if cnt == x:\n print(\"Yes\")\n else:\n print(\"No\")\n", "import sys\r\nfrom collections import *\r\nfrom bisect import *\r\nfrom string import *\r\nfrom itertools import * \r\nfrom statistics import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom re import *\r\nfrom functools import cmp_to_key\r\nfrom queue import *\r\nimport operator\r\ntrue = True;\r\nfalse= False\r\ninp = lambda : input()\r\nI = lambda : int(inp())\r\nM = lambda : map(int,inp().split())\r\nMS = lambda : map(str,inp().split())\r\nS = lambda : list(MS())\r\nL = lambda : list(M())\r\ndef exit():raise SystemExit\r\n#-------------------------------------------------------------------------------------------------------------------------------------\r\n\r\ndef main():\r\n n,q=L()\r\n arr=L()\r\n for i in range(q):\r\n l,r,x=L()\r\n cnt = 0\r\n for j in range(l-1, r):\r\n if arr[j] < arr[x-1]:\r\n cnt+=1;\r\n print(\"Yes\" if cnt == x - l else \"No\")\r\n \r\n#-------------------------------------------------------------------------------------------------------------------------------------\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef IO():\r\n try:sys.stdin = open('input.txt', 'r');sys.stdout = open('output.txt', 'w')\r\n except:pass\r\nif __name__ == \"__main__\":\r\n IO()\r\n main()\r\n", "def get_min(p,l,r, x):\r\n v = p[x-1]\r\n c = 0\r\n for i in range(l-1,r):\r\n if p[i] < v:\r\n c += 1\r\n if c == x - l:\r\n return True\r\n else:\r\n return False\r\n\r\nn,m = map(int, input().split())\r\np = list(map(int, input().split()))\r\nfor _ in range(m):\r\n l,r,x = map(int, input().split())\r\n if x <= r and x >= l:\r\n if get_min(p,l,r,x):\r\n print('Yes')\r\n else:\r\n print('No')\r\n else:\r\n print('No')\r\n", "from sys import stdin,stdout\r\nimport math\r\nfrom collections import Counter,deque\r\nL=lambda:list(map(int, stdin.readline().strip().split()))\r\nM=lambda:map(int, stdin.readline().strip().split())\r\nI=lambda:int(stdin.readline().strip())\r\nS=lambda:stdin.readline().strip()\r\nC=lambda:stdin.readline().strip().split()\r\nmod=1000000007\r\ndef pr(a):return(\"\".join(list(map(str,a))))\r\n#______________________-------------------------------_____________________#\r\n\r\ndef solve():\r\n n, m = M()\r\n a = L()\r\n for i in range(m):\r\n l,r,x=M()\r\n c = 0\r\n for j in range(l-1,r):\r\n if a[x-1]>a[j]:\r\n c+=1\r\n if l+c==x:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nfor _ in range(1):\r\n solve()\r\n\r\n", "from sys import stdin, stdout\r\nn,m=map(int,stdin.readline().split())\r\np=list(map(int,stdin.readline().split()))\r\nfor _ in range(m):\r\n gre=0\r\n sma=0\r\n l,r,x=map(int,stdin.readline().split())\r\n for i in range(l-1,r):\r\n if i<x-1:\r\n if p[i]>p[x-1]:\r\n gre+=1\r\n elif i>x-1:\r\n if p[i]<p[x-1]:\r\n sma+=1\r\n if gre!=sma:\r\n stdout.write(\"No \\n\")\r\n else:\r\n stdout.write(\"Yes \\n\")\r\n \r\n", "import math\r\nimport bisect\r\n\r\nn, m = map(int, input().split())\r\nP = [int(c) for c in input().split()]\r\nb_len = math.ceil(math.sqrt(n))\r\nb = []\r\nfor i in range(1000):\r\n b.append(sorted(P[i*b_len:(i+1)*b_len]))\r\n if n <= (i+1)*b_len:\r\n break\r\nb_cnt = len(b)\r\n#print(b)\r\n\r\nfor i in range(m):\r\n l, r, x = map(int, input().split())\r\n l_b = (l-1) // b_len\r\n r_b = (r-1) // b_len\r\n\r\n if r_b - l_b <= 1:\r\n sorted_a = sorted(P[l-1:r])\r\n print(\"Yes\" if P[x-1] == sorted_a[x-1-(l-1)] else \"No\")\r\n else:\r\n _a = sorted(P[l-1:(l_b+1)*b_len]+P[r_b*b_len:r])\r\n #print(_a)\r\n idx = bisect.bisect_left(_a, P[x-1])\r\n #print(idx)\r\n for j in range(l_b+1, r_b):\r\n #print(b[j])\r\n idx += bisect.bisect_left(b[j], P[x-1])\r\n #print(idx)\r\n print(\"Yes\" if idx+l == x else \"No\")", "\"\"\"\r\n\tAuthor\t\t: Arif Ahmad\r\n\tDate \t\t: \r\n\tAlgo \t\t: \r\n\tDifficulty\t: \r\n\"\"\"\r\nfrom sys import stdin, stdout\r\n\r\ndef main():\r\n\tn, m = [int(_) for _ in input().split()]\r\n\tp = [int(_) for _ in input().split()]\r\n\r\n\tfor i in range(m):\r\n\t\tl, r, x = [int(_) for _ in input().split()]\r\n\t\tl -= 1\r\n\t\tr -= 1\r\n\t\tx -= 1\r\n\t\tval = p[x]\r\n\r\n\t\tsmaller = 0\r\n\t\tfor j in range(l, r+1):\r\n\t\t\tif p[j] < val:\r\n\t\t\t\tsmaller += 1\r\n\r\n\t\tif smaller == x - l: stdout.write('Yes' + '\\n')\r\n\t\telse: stdout.write('No' + '\\n')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n " ]

[ "#!/usr/bin/env python3 \r\n\r\nn = int(input())\r\n\r\ndata = dict()\r\ndata['void'] = 0\r\n\r\ndef parse(definition):\r\n ampersands = definition.count('&')\r\n asterisks = definition.count('*')\r\n name = definition[ampersands:len(definition)-asterisks]\r\n return (name, asterisks - ampersands)\r\n\r\n\r\nfor i in range(n):\r\n line = input().strip().split()\r\n if (line[0] == 'typeof'):\r\n (name, nr) = parse(line[1])\r\n if (name in data) and ((data[name] + nr) >= 0):\r\n print(\"void%s\" % (\"*\"*(data[name] + nr)))\r\n else:\r\n print(\"errtype\")\r\n else:\r\n new_name = line[2]\r\n (old_name, nr) = parse(line[1])\r\n if (old_name in data):\r\n data[new_name] = data[old_name] + nr\r\n if (data[new_name] < 0):\r\n data.pop(new_name)\r\n else:\r\n data.pop(new_name, None)\r\n", "from collections import *\nimport sys,re\nlines = [i[:-1] for i in sys.stdin.readlines()]\nn = int(lines[0])\nlines = lines[1:]\ntypeof = defaultdict(lambda:'errtype')\ntypeof['void'] = 'void'\ndef simplify(s):\n\tglobal typeof\n\tl,r = s.count('&'),s.count('*')\n\tresult = typeof[s[l:len(s)-r]]\n#print(l,r,result,s[l:len(s)-r])\n\tif(result == 'errtype'):\n\t\treturn result\n\tfor i in range(r):\n\t\tresult = result+'*'\n\tfor i in range(l):\n\t\tif(result[-1] == '*'):\n\t\t\tresult = result[:-1]\n\t\telse:\n\t\t\treturn 'errtype'\n\treturn result\n#print(simplify('void*'))\ntypeof['ptv'] = simplify('void*')\n#print(typeof['ptv'])\n#print(simplify('ptv'))\n#exit()\nfor line in lines:\n\tcommands = line.split()\n\tif(commands[0] == 'typeof'):\n\t\tprint(simplify(commands[1]))\n\telse:\n\t\ttypeof[commands[2]] = simplify(commands[1])\n#print(typeof['ptv'])\n", "types = {'void':'void', 'errtype':'errtype'}\n\n\n\ndef getRealType(type_expr):\n\n expr_type = type_expr.strip('&*')\n\n full_type_name = type_expr.replace(expr_type, types.get(expr_type, \"errtype\"))\n\n base_type = full_type_name.strip('&*')\n\n if base_type == \"void\":\n\n addr_count = full_type_name.count('*')\n\n deref_count = full_type_name.count('&')\n\n if deref_count > addr_count:\n\n return \"errtype\"\n\n return base_type + \"*\" * (addr_count - deref_count)\n\n else:\n\n return \"errtype\"\n\n\n\ndef setTypeAlias(type_expr, alias_name):\n\n types[alias_name] = getRealType(type_expr)\n\n\n\nn = int(input())\n\nfor _ in range(n):\n\n operator = input().split()\n\n command = operator[0]\n\n if command == \"typedef\":\n\n setTypeAlias(operator[1], operator[2])\n\n else:\n\n print(getRealType(operator[1]))\n\n\n\n# Made By Mostafa_Khaled", "def tr(v):\n a = v.count('&')\n b = v.count('*')\n v = v.replace('&', '').replace('*', '')\n if a > b:\n a -= b\n b = 0\n else:\n b -= a\n a = 0\n return '&' * a + v + '*' * b\n\ndef go(v):\n i = v.replace('&', '').replace('*', '')\n global val, err\n if i not in val:\n return 'errtype'\n sub = val[i]\n v = v.replace(i, sub)\n v = tr(v)\n for e in err:\n if v.startswith(e) or v.endswith(e):\n v = 'errtype'\n break\n return v\n\n\n\nval = dict()\nval['void'] = 'void'\nerr = ['&void', 'errtype', '&errtype', 'errtype*']\n\nfor i in range(int(input())):\n cmd = input().split()\n if cmd[0] == 'typeof':\n v = cmd[1]\n clean = tr(v)\n print(go(v))\n else:\n fr, to = cmd[1], cmd[2]\n val[to] = go(tr(fr))\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nname = {'void': 'void'}\r\nerrtype = 'errtype'\r\n\r\n\r\ndef resolve(t):\r\n nest = 0\r\n while t[-1] == '*':\r\n nest += 1\r\n t = t[:-1]\r\n while t[0] == '&':\r\n nest -= 1\r\n t = t[1:]\r\n\r\n if t not in name:\r\n return errtype\r\n\r\n t = name[t]\r\n while nest < 0 and t[-1] == '*':\r\n nest += 1\r\n t = t[:-1]\r\n\r\n if nest < 0:\r\n return errtype\r\n else:\r\n return t + '*' * nest\r\n\r\n\r\ndef f(s):\r\n if s[:7] == errtype:\r\n return errtype\r\n else:\r\n return s\r\n\r\n\r\nans = []\r\nfor _ in range(n):\r\n query = input().split()\r\n if query[0] == 'typeof':\r\n ans.append(f(resolve(query[1])))\r\n else:\r\n name[query[2]] = resolve(query[1])\r\n\r\nprint(*ans, sep='\\n')\r\n", "n=int(input())\r\n\r\ndef Ref(v):\r\n stars=0\r\n ands=0\r\n nam=\"\"\r\n for item in v:\r\n if(item=='*'):\r\n stars+=1\r\n elif(item=='&'):\r\n ands+=1\r\n else:\r\n nam+=item\r\n if(nam not in T):\r\n return \"errtype\"\r\n x=T[nam]\r\n if(x==\"errtype\"):\r\n return str(x)\r\n x+=stars\r\n x-=ands\r\n if(x<0):\r\n return \"errtype\"\r\n return x\r\nT={'void':0}\r\nfor i in range(n):\r\n s=input()\r\n if(s[4]=='d'):\r\n s=s[8:].split()\r\n v=str(s[0])\r\n name=str(s[1])\r\n T[name]=Ref(v)\r\n else:\r\n s=s[7:]\r\n x=Ref(str(s))\r\n if(x==\"errtype\"):\r\n print(x)\r\n else:\r\n print(\"void\"+(\"*\"*x))\r\n" ]

[ "# Generated by powerful Codeforces Tool\n# You can download the binary file in here https://github.com/xalanq/cf-tool (Windows, macOS, Linux)\n# Author: djjzz\n# Time: 2023-05-01 17:13:46\n\nn = int(input())\ns = list(map(int, input().split()))\na = [] \nm = len(s)\n\nfor i in range(m):\n min_idx = i\n for j in range(i + 1, m):\n if s[min_idx] > s[j]:\n min_idx = j\n if min_idx != i:\n a.append((i, min_idx))\n s[min_idx], s[i] = s[i], s[min_idx]\n \nprint(len(a))\nfor res in a:\n print(*res)\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nIT = []\r\nfor i in range(n):\r\n ind = -1\r\n minc = a[i]\r\n for j in range(i + 1, n):\r\n if a[j] < minc:\r\n minc = a[j]\r\n ind = j\r\n if ind != -1:\r\n a[i], a[ind] = a[ind], a[i]\r\n IT.append((i, ind))\r\nprint(len(IT))\r\nfor i in IT:\r\n print(i[0], i[1])", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nswaps = []\r\n\r\nfor i in range(n):\r\n mn_index = i\r\n for j in range(i + 1, n):\r\n if a[j] < a[mn_index]:\r\n mn_index = j \r\n if i != mn_index:\r\n swaps.append((i, mn_index))\r\n a[mn_index], a[i] = a[i], a[mn_index]\r\n\r\nprint(len(swaps))\r\nfor i, j in swaps:\r\n print(i, j)", "def min_index(i,arr):\r\n res=i\r\n for j in range(i + 1, n):\r\n if a[j] < a[res]:\r\n res = j\r\n return res\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nswaps = []\r\n\r\nfor i in range(n):\r\n m = min_index(i,a)\r\n if i != m:\r\n a[i], a[m] = a[m], a[i]\r\n swaps.append((i, m))\r\n\r\nprint(len(swaps))\r\nfor swap in swaps:\r\n print(swap[0], swap[1])\r\n", "n = int(input())\r\nv = [int(x) for x in input().split()]\r\nfinal = v.copy()\r\n\r\nfinal = sorted(final)\r\nans = []\r\nfor i in range(n):\r\n\tif v[i] == final[i]:\r\n\t\tcontinue\r\n\telse:\r\n\t\tj = i + 1\r\n\t\twhile j < n and v[j] != final[i]:\r\n\t\t\tj += 1\r\n\t\tv[i], v[j] = v[j], v[i]\r\n\t\tans.append((i, j))\r\nprint(len(ans))\r\nfor i, j in ans:\r\n\tprint(i, j)\r\n", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n\r\nn = int(input())\r\nlst = [x for x in get_ints()]\r\ncnt = 0\r\nr = []\r\nfor i in range(len(lst)):\r\n j = i\r\n for t in range(j,len(lst)):\r\n if lst[t] < lst[j]:\r\n j = t\r\n if i == j:\r\n continue\r\n a = lst[j]\r\n lst[j] = lst[i]\r\n lst[i] = a\r\n if i < j:\r\n r.append([i,j])\r\n else:\r\n r.append([j,i])\r\n cnt += 1\r\n\r\nprint(cnt)\r\nfor x in r:\r\n print(f\"{x[0]} {x[1]}\")\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nprint(n)\r\nfor i in range(n):\r\n j=lst[i:].index(min(lst[i:]))\r\n lst[i],lst[j+i]=lst[j+i],lst[i]\r\n print(i,j+i,end=\" \")\r\n print()", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = sorted(a)\r\nx = []\r\nc = 0\r\nfor i in range(n - 1):\r\n if a[i] == d[i]:\r\n continue\r\n for j in range(i + 1,n):\r\n if a[j] == d[i]:\r\n a[j] = a[i]\r\n x.append([i, j])\r\n c = c + 1\r\n break\r\nprint(c)\r\nfor i in x:\r\n print(*i)", "len1=int(input())\r\nlist1=list(map(int,input().split()))\r\nres=[]\r\npasses=0\r\nfor i in range(len1-1):\r\n idx=i\r\n min1=list1[i]\r\n for j in range(i+1,len1):\r\n if(min1>list1[j]):\r\n idx=j\r\n min1=list1[j]\r\n if(idx!=i):\r\n passes+=1\r\n res.append([i,idx])\r\n list1[i],list1[idx]=list1[idx],list1[i]\r\nprint(passes)\r\nfor i in res:\r\n print(*i)" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef trie():\r\n G, cnt = [[-1] * 26], [0]\r\n return G, cnt\r\n\r\ndef insert(s):\r\n j = 0\r\n for i in s:\r\n if not G[j][i - 97] ^ -1:\r\n G[j][i - 97] = len(cnt)\r\n G.append([-1] * 26)\r\n cnt.append(0)\r\n j = len(cnt) - 1\r\n else:\r\n j = G[j][i - 97]\r\n cnt[j] += 1\r\n return\r\n\r\nn = int(input())\r\nG, cnt = trie()\r\nfor _ in range(n):\r\n s = list(input().rstrip())\r\n insert(s)\r\nm = len(cnt)\r\ninf = pow(10, 9) + 1\r\ndist = [inf] * m\r\ndist[0] = 0\r\nparent = [-1] * m\r\nq, k = [0], 0\r\nwhile len(q) ^ k:\r\n i = q[k]\r\n di = dist[i]\r\n for j in G[i]:\r\n if j ^ -1:\r\n q.append(j)\r\n dist[j] = di + 1\r\n parent[j] = i\r\n k += 1\r\nans = 0\r\nfor i in range(m):\r\n if cnt[i]:\r\n ans += dist[i]\r\nfor i in q[::-1]:\r\n if not cnt[i]:\r\n continue\r\n u = i\r\n while parent[u]:\r\n u = parent[u]\r\n if not cnt[u]:\r\n break\r\n if not cnt[u]:\r\n cnt[u] = 1\r\n ans -= dist[i] - dist[u]\r\nprint(ans)" ]

[ "n = (int)(input())\r\nstack = []\r\nfound = False\r\nfor _ in range(n) :\r\n line = input()\r\n operator = \"\"\r\n index = 0\r\n ln = len(line)\r\n while index < ln and line[index] == ' ' : index += 1\r\n if index == ln : continue\r\n while index < ln :\r\n operator += line[index]\r\n if operator in [\"try\" , \"catch\" , \"throw\"] :\r\n break\r\n index += 1\r\n if \"try\" in operator :\r\n stack.append(not found)\r\n elif \"throw\" in operator :\r\n temp = line.split('throw')[1]\r\n ex = \"\"\r\n for ch in temp :\r\n if ch == '(' or ch == ')' or ch == ' ' : continue\r\n ex += ch\r\n found = True\r\n elif \"catch\" in operator :\r\n if stack[-1] and found :\r\n temp = line.split('catch')[1]\r\n ex_ = \"\"\r\n for x in temp :\r\n if x == '(' or x == ' ' : continue\r\n if x == ',' : break\r\n ex_ += x\r\n msg = line.split('\"')[1]\r\n if ex == ex_ :\r\n print(msg)\r\n quit()\r\n stack.pop()\r\nprint(\"Unhandled Exception\")\r\n ", "import re\n\nn = int(input())\n\nmessage = \"Unhandled Exception\"\n\nS = []\n\n\nthrow_ind = -1\nthrow_symb = None\nfound = False\n\n\nfor i in range(n):\n line = input().strip()\n if len(line) > 0:\n if line[:2] == 'tr':\n S.append(i)\n elif line[:2] == 'ca':\n if throw_ind != -1 and not found and S[-1] < throw_ind:\n tokens = list(map(str.strip, re.split('\\(|\\)|,', line)))\n #tokens = line.split('(').split(')').split(',')\n #tokens = line.split('(')\n if tokens[1] == throw_symb:\n message = eval(tokens[2])\n found = True\n\n S.pop()\n elif line[:2] == 'th':\n line.replace(' ', '')\n throw_ind = i\n #throw_symb = line.split('(').split(')')[1]\n throw_symb = re.split('\\(|\\)', line)[1].strip()\n\nprint(message)\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nlabel = ''\r\ncnt = 0\r\n\r\ndef first(s):\r\n f = ''\r\n \r\n for a in s:\r\n if 'z' >= a >= 'a':\r\n f += a\r\n else:\r\n break\r\n \r\n return f\r\n\r\n\r\nfor i in range(n):\r\n s = stdin.readline().strip()\r\n \r\n if first(s) == 'throw':\r\n label = s[s.index('(') + 1:s.index(')')].strip()\r\n elif first(s) == 'try' and label:\r\n cnt += 1\r\n elif first(s) == 'catch' and cnt:\r\n cnt -= 1\r\n elif first(s) == 'catch' and s[s.index('(') + 1:s.index(',')].strip() == label:\r\n f = s[s.index(',') + 1:s.index(')')].strip()\r\n f = f.strip('\"').strip()\r\n stdout.write(f)\r\n break\r\nelse:\r\n stdout.write('Unhandled Exception')", "\r\n\r\n\r\n# n=int(input())\r\n# l=[]\r\n# t=0\r\n# error=\"-1\"\r\n# error_tb=0\r\n# messsage=\"-1\"\r\n# is_last=0\r\n# for i in range(n):\r\n# s=input().strip()\r\n \r\n# if len(s)==0:\r\n# continue \r\n# if s[:3]==\"try\":\r\n# t+=1 \r\n# is_last=0\r\n# elif s[:5]==\"throw\":\r\n# s=s[5:len(s)-1]\r\n# s=s.strip()\r\n# s=s[1:]\r\n# error=s.strip()\r\n# error_tb = t \r\n# is_last=1\r\n# elif s[:5]==\"catch\" and error_tb>0:\r\n# s=s[5:len(s)-1]\r\n# s=s.strip()\r\n# s=s[1:]\r\n# s=s.split('\"')\r\n# msg = s[1]\r\n# err=s[0]\r\n# err=err.strip()\r\n# err=err[:-1]\r\n# err=err.strip()\r\n# # print(error, err,len(err), len(error), error==err)\r\n# if err==error:\r\n# if is_last==1 and t<=error_tb:\r\n# messsage = msg\r\n# break \r\n\r\n# t-=1 \r\n\r\n# # print(error)\r\n# if messsage!=\"-1\":\r\n# print(messsage)\r\n# else:\r\n# print(\"Unhandled Exception\")\r\n\r\n\r\nimport io, os\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ninput = io.StringIO(os.read(0, os.fstat(0).st_size).decode()).readline\r\nii=lambda:int(input())\r\nkk=lambda:map(int,input().split())\r\nll=lambda:list(kk())\r\nopened=0\r\ncatchd = -1\r\ntyp = \"\"\r\n\r\nfor _ in range(ii()):\r\n\ts = input().strip()\r\n\tif s == \"\": continue\r\n\tif s == \"try\": opened+=1\r\n\telif s[0] == 't':\r\n\t\tcatchd = opened\r\n\t\ttyp = s[5:-1].strip()[1:].strip()\r\n\telse:\r\n\t\tif catchd == opened:\r\n\t\t\te,m,_ = s[5:].strip()[1:-1].strip().split(\"\\\"\")\r\n\t\t\te,_=e.split(\",\")\r\n\t\t\te=e.strip()\r\n\t\t\tif e == typ:\r\n\t\t\t\tprint(m)\r\n\t\t\t\texit()\r\n\t\t\tcatchd-=1\r\n\t\topened-=1\r\nprint(\"Unhandled Exception\")\r\n", "n = int(input())\r\n\r\nstack = []\r\nexc = None\r\nmessage_printed = False\r\nfor _ in range(n):\r\n\tline = input()\r\n\telems = line.replace(' ', '').split('(')\r\n\tif elems[0] == 'throw':\r\n\t\texc = elems[1].split(')')[0]\r\n\t\tfor i in range(len(stack)):\r\n\t\t\tstack[i] = True\r\n\telif elems[0] == 'try':\r\n\t\tstack.append(False)\r\n\telif elems[0] == 'catch':\r\n\t\tlast = stack[-1]\r\n\t\tstack.pop()\r\n\t\tif exc is None or message_printed:\r\n\t\t\tcontinue\r\n\t\te = elems[1].split(',')[0]\r\n\t\tif e == exc and last == True:\r\n\t\t\ti = line.find('\\\"')\r\n\t\t\tprint(line[i+1:i+1+line[i+1:].find('\\\"')])\r\n\t\t\tmessage_printed = True\r\nif not message_printed:\r\n\tprint('Unhandled Exception')\r\n", "def typ(s1):\r\n f = ' '\r\n s = ' '\r\n for i in range(len(s1)):\r\n if s1[i] == 't' or s1[i] == 'c':\r\n f = s1[i]\r\n s = s1[i + 1]\r\n break\r\n if f == 'c':\r\n return 2\r\n elif s == 'h':\r\n return 1\r\n elif s == 'r':\r\n return 0\r\n else:\r\n return -1\r\ndef pism(c):\r\n return c.isalpha()\r\nn = int(input())\r\nA = []\r\nvynimka = \"\"\r\nmam = -1\r\nfor i in range(n):\r\n s = input()\r\n co = typ(s)\r\n if co == 0:\r\n A.append(i)\r\n if co == 1:\r\n mam = i\r\n p1 = 0\r\n while s[p1] != '(':\r\n p1 += 1\r\n while s[p1] != ')':\r\n if pism(s[p1]):\r\n vynimka += s[p1]\r\n p1 += 1\r\n if co == 2:\r\n p1 = 0\r\n while s[p1] != '(':\r\n p1 += 1\r\n v = \"\"\r\n while s[p1] != ',':\r\n if pism(s[p1]):\r\n v += s[p1]\r\n p1 += 1\r\n while s[p1] != '\\\"':\r\n p1 += 1\r\n p1 += 1\r\n sp = \"\"\r\n while s[p1] != '\\\"':\r\n sp += s[p1]\r\n p1 += 1\r\n if mam != -1 and mam >= A[-1] and v == vynimka:\r\n print(sp)\r\n exit(0)\r\n A.pop()\r\nprint(\"Unhandled Exception\")# 1690913463.7310038", "import re\r\n\r\ndef solve(n: int, code: list):\r\n level = 0\r\n raised_exception = None\r\n raised_level = 0\r\n\r\n for line in code:\r\n line = line.strip()\r\n if line == 'try':\r\n level += 1\r\n continue\r\n if line.startswith('catch'):\r\n exception = re.findall(r'\\(\\s*(\\w+)\\s*\\,', line)[0]\r\n message = re.findall(r'\"(.+)\"', line)[0]\r\n if exception == raised_exception and level <= raised_level:\r\n print(message)\r\n return\r\n elif level <= raised_level:\r\n raised_level -= 1\r\n level -= 1\r\n continue\r\n if line.startswith('throw') and raised_level == 0:\r\n raised_exception = re.findall(r'\\(\\s*(\\w+)\\s*\\)', line)[0]\r\n raised_level = level\r\n print('Unhandled Exception')\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n code = []\r\n for _ in range(n):\r\n line = input()\r\n code.append(line)\r\n solve(n, code)\r\n", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n sys.stdout.write()\n pass\n\n\ndef solve(parsedprog):\n stack = []\n for op in parsedprog:\n # print(stack)\n # print(op)\n if op and op[0] in (\"try\", \"throw\"):\n stack.append(op)\n elif op and op[0] == \"catch\":\n k = stack.pop()\n if k[0] == \"throw\":\n if op[1] == k[1]:\n return op[2]\n else:\n stack.append(k)\n\n return \"Unhandled Exception\"\n\n\ndef multisplit(string):\n \"\"\"splits at a bracket, comma, quote, or text\"\"\"\n \"\"\"does not split within quotes.\"\"\"\n parsedstring = []\n curstring = []\n insidequotes = False\n for i in string:\n\n if insidequotes:\n if i == '\"':\n insidequotes = False\n parsedstring.append(\"\".join(curstring))\n curstring = []\n else:\n curstring.append(i)\n\n elif i in (\"(\", \")\", \",\", \" \"):\n if curstring:\n parsedstring.append(\"\".join(curstring))\n curstring = []\n\n elif i == '\"':\n insidequotes = True\n if curstring:\n parsedstring.append(\"\".join(curstring))\n curstring = []\n\n else:\n curstring.append(i)\n\n if curstring:\n parsedstring.append(\"\".join(curstring))\n return parsedstring\n\n\ndef readinput():\n proglen = getInt()\n parsedprog = []\n for _ in range(proglen):\n parsedprog.append(multisplit(getString()))\n print(solve(parsedprog))\n\n\nreadinput()\n", "import sys\n\nn = int(input())\n\nflag = False\nan = \"\"\n\nqueue = []\nexc = \"\"\nfor x in range(n):\n strr = input().split('(');\n if strr[0].strip() == 'try':\n queue.append(x)\n elif strr[0].strip() == 'throw':\n exc = strr[1].split(\")\")[0].strip()\n pos = x\n elif strr[0].strip() == 'catch':\n cat = strr[1].split(\",\")[0].strip()\n if cat == exc and queue[len(queue) - 1] < pos and flag == False:\n an = strr[1].split(\",\")[1]\n an = an.split('\"')\n an = an[1].strip()\n flag = True\n queue.pop()\n\nif flag == False:\n print(\"Unhandled Exception\")\nelse:\n print(an)" ]

[ "# import sys\r\n# sys.stdout = open('editor/output.txt', 'w')\r\n# sys.stdin = open('editor/input.txt', 'r')\r\n\r\n# Add custom packages imports here\r\n\r\n# Write solution here\r\ndef solution(m):\r\n def check(mid):\r\n ans = 0\r\n i = 2\r\n while i * i * i <= mid:\r\n ans += mid // (i * i * i)\r\n i += 1\r\n return ans\r\n \r\n n = -1\r\n low = 0\r\n high = 5e15\r\n\r\n while low < high:\r\n mid = int(low + ((high-low) // 2))\r\n if check(mid) < m:\r\n low = mid + 1\r\n else:\r\n high = mid\r\n \r\n if check(low) == m:\r\n n = low\r\n \r\n return int(n)\r\n\r\n\r\n# drive code\r\nif __name__ == '__main__':\r\n m = int(input())\r\n ans = solution(m)\r\n print(ans)\r\n\r\n", "n = int(input())\r\nl, r = 0, 10**16\r\nD = [x ** 3.0 for x in range(2, 170417)]\r\nDD = [x*x*x for x in range(2, 170417)]\r\nwhile l < r:\r\n m = (l+r) // 2\r\n if sum(int(m/d) for d in D) < n:\r\n l = m + 1\r\n else:\r\n r = m;\r\nif sum(l//d for d in DD) == n:\r\n print(l);\r\nelse :\r\n print(-1);\r\n", "from sys import stdin\r\nfrom math import floor\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef calc(val):\r\n mx = floor(val ** 0.34)\r\n curr = 0\r\n for i in range(mx, 1, -1):\r\n curr += val // (i ** 3)\r\n return curr\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n low, high = 0, 10 ** 16\r\n while low < high:\r\n mid = low + (high - low) // 2\r\n if calc(mid) >= n:\r\n high = mid\r\n else:\r\n low = mid + 1\r\n print(low if calc(low) == n else -1)\r\n\r\n\r\nsolve()\r\n", "# [https://codeforces.com/contest/689/submission/38003624]\r\n\r\ncubes = [i**3.0 for i in range(2, int(1.8e5+5))]\r\n\r\ndef valid(mid):\r\n return sum([mid//i for i in cubes if i <= mid])\r\n\r\ndef binary_search(k):\r\n l = int(4.8 * k)\r\n r = min(8.0 * k, 5.0 * (10**15))\r\n while (l+1 < r):\r\n mid = (l+r) / 2.0\r\n res = valid(mid)\r\n if (res < k):\r\n l = mid\r\n else:\r\n r = mid\r\n return int(r) if int(valid(r)) == k else -1\r\n\r\nk = int(input())\r\nprint(binary_search(k))", "def main():\r\n m = int(input())\r\n if m < 1000000:\r\n lo = m*4\r\n hi = m*8\r\n else:\r\n lo = int(4.949 * m)\r\n hi = int(4.9492 * m)\r\n while lo < hi - 1:\r\n mid = (lo + hi)//2\r\n nposs = countposs(mid)\r\n if nposs < m:\r\n lo = mid\r\n else:\r\n hi = mid\r\n if m == countposs(hi):\r\n print(hi)\r\n else:\r\n print(-1)\r\n\r\ndef countposs(maxtake):\r\n k = 2\r\n ans = 0\r\n while True:\r\n term = maxtake//(k*k*k)\r\n if term == 0:\r\n return ans\r\n ans += term\r\n k += 1\r\n\r\nmain()", "def main():\r\n m = int(input())\r\n lo = m*4\r\n hi = m*8\r\n loposs = countposs(lo)\r\n hiposs = countposs(hi)\r\n while lo < hi - 1:\r\n if hi - lo > 10000:\r\n mid = lo + int((m-loposs)/(hiposs-loposs)*(hi-lo))\r\n mid = max(lo + 1, min(hi - 1, mid))\r\n else:\r\n mid = (hi + lo)//2\r\n nposs = countposs(mid)\r\n if nposs < m:\r\n lo = mid\r\n else:\r\n hi = mid\r\n if m == countposs(hi):\r\n print(hi)\r\n else:\r\n print(-1)\r\n\r\ndef countposs(maxtake):\r\n k = 2\r\n ans = 0\r\n while True:\r\n term = maxtake//(k*k*k)\r\n if term == 0:\r\n return ans\r\n ans += term\r\n k += 1\r\n\r\nmain()", "m = int(input())\n\n\ndef helper(x):\n k = 2\n res = 0\n while x//k**3:\n res += (x//k**3)\n k += 1\n\n return res\n\n\nn = 1\nwhile helper(n) <= m:\n n *= 2\n\nl, r = n//2, n\nwhile l <= r:\n mid = l + (r-l)//2\n if helper(mid) < m:\n l = mid+1\n else:\n r = mid-1\nprint(l) if helper(l) == m else print(-1)\n", "m = int(input())\r\n\r\ndef ways(x):\r\n k = 2\r\n c = 0\r\n while x//(k**3): \r\n c += x//(k**3)\r\n k += 1\r\n return c\r\n\r\nans = -1\r\nl = 0; r = 8*m\r\nwhile l <= r:\r\n mid = (l+r)//2\r\n k = ways(mid)\r\n if k < m: l = mid + 1\r\n elif k > m: r = mid-1\r\n else:\r\n ans = mid\r\n r = mid-1\r\n\r\nprint(ans)", "def no_ways(n):\r\n count = 0\r\n curr = True\r\n k = 2\r\n while curr:\r\n curr = n//(k*k*k)\r\n count+=curr\r\n k+=1\r\n return count\r\n\r\nm = int(input())\r\nlo = 8\r\nhi = 10**16\r\nans = None\r\nwhile lo<=hi:\r\n mid = (lo+hi)//2\r\n val = no_ways(mid)\r\n if val==m:\r\n ans = mid\r\n hi = mid-1\r\n elif val<m:\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\nif ans!=None:\r\n print(ans)\r\nelse:\r\n print(-1)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nA = []\r\nfor i in range(2,10**6+1):\r\n A.append(pow(i,3))\r\n \r\ndef check(m):\r\n cnt = 0\r\n for a in A:\r\n if a>m:break\r\n cnt+=m//a\r\n return cnt\r\n\r\nl,r = 0,10**18+1\r\nwhile l+1<r:\r\n m = (l+r)//2\r\n if check(m)<N:\r\n l = m\r\n else:\r\n r = m\r\n \r\nif check(r)==N:\r\n print(r)\r\nelse:\r\n print(-1)\r\n ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_search(c1, c2):\r\n c = (c1 + c2 + 1) // 2\r\n while abs(c1 - c2) > 1:\r\n c = (c1 + c2 + 1) // 2\r\n if ok(c):\r\n c2 = c\r\n else:\r\n c1 = c\r\n c = max(c - 1, 0)\r\n while not ok(c):\r\n c += 1\r\n return c\r\n\r\ndef ok(c):\r\n u = 0\r\n for i in p:\r\n u += c // i\r\n return True if u >= m else False\r\n\r\nm = int(input())\r\np = [pow(i, 3) for i in range(2, pow(10, 6) + 5)]\r\nn = binary_search(0, pow(10, 18) + 5)\r\nu = 0\r\nfor i in p:\r\n u += n // i\r\nif u ^ m:\r\n n = -1\r\nprint(n)", "import math \r\n\r\ndef get_m(n):\r\n ans = 0; k = 2\r\n while True:\r\n curr = n // k ** 3\r\n ans += curr\r\n k += 1\r\n if curr == 0: break\r\n\r\n return ans\r\n\r\n\r\nm = int(input())\r\n\r\nlo = 1; hi = 8 * 10 ** 15\r\nits = 0\r\nwhile lo < hi:\r\n mid = (lo + hi) // 2\r\n m_ = get_m(mid)\r\n prev_lo, prev_hi = lo, hi\r\n if m_ > m:\r\n hi = mid - 1\r\n elif m_ < m:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n if [lo, hi] == [prev_lo, prev_hi]: \r\n break\r\n\r\nif get_m(lo) != m and get_m(hi) != m:\r\n print(-1)\r\nelse:\r\n n = float('inf')\r\n if get_m(lo) == m:\r\n n = min(n, lo)\r\n\r\n if get_m(hi) == m:\r\n n = min(n, hi)\r\n\r\n print(n)\r\n\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nw = Counter(map(lambda x:(bin(int(x))[2:]).count('1'), input().split()))\r\nc = 0\r\nfor i in w:\r\n c += (w[i]*(w[i]-1))//2\r\n\r\nprint(c)", "n = int(input())\r\nlis=list(map(int,input().split()))\r\nans=[0]*(n)\r\nfor i in range(n):\r\n k=lis[i]\r\n c=0\r\n while k>0:\r\n if k%2!=0:\r\n c+=1\r\n k=k//2 \r\n ans[i]=c \r\nans.sort()\r\nc=1\r\nfin=0\r\n#print(ans)\r\nfor i in range(1,n):\r\n if ans[i-1]==ans[i]:\r\n c+=1\r\n else:\r\n fin+=((c*(c-1))//2)\r\n c=1 \r\nfin+=((c*(c-1))//2)\r\nprint(fin) \r\n\r\n\r\n", "def C(x):\n s=bin(x)[2:]\n c=0\n for t in s:\n if t=='1':\n c+=1\n return c\n\nn = input();\n\nar=list(map(int,input().split()))\nbu={}\n\nfor e in ar:\n c=C(e)\n if c not in bu:\n bu[c]=0\n bu[c]+=1\n\nS = 0\nfor v in bu.values():\n S += v*(v-1)//2\n\nprint(S)\n", "import collections\r\nimport math\r\nimport sys\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n d = collections.defaultdict(int)\r\n for x in a:\r\n c = 0\r\n while x > 0:\r\n c += x % 2\r\n x //= 2\r\n d[c] += 1\r\n ans = 0\r\n for v in d.values():\r\n ans += v * (v - 1) // 2\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1 # int(input())\r\n while t > 0:\r\n main()\r\n t -= 1\r\n", "n=int(input())\r\nx=[bin(int(i)).count('1') for i in input().split()]\r\ns=0\r\nfor i in range(max(x)+1):\r\n s=s+x.count(i)*(x.count(i)-1)\r\nprint(int(s/2))", "def f(x):\r\n\treturn str(bin(x)).count('1')\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = [f(x) for x in a]\r\ns = set(ans)\r\ncounts = {x:ans.count(x) for x in s}\r\nans = 0\r\nfor i in counts:\r\n\tans += (counts[i]*(counts[i]-1))//2\r\nprint(ans)", "y=[]\r\na=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in x:\r\n y.append(bin(i).count('1'))\r\ny.sort()\r\n\r\nt=0\r\nif a==1:\r\n print(0)\r\nelse:\r\n streak=1\r\n for i in range(1,a):\r\n if y[i]==y[i-1]:\r\n streak+=1\r\n\r\n else:\r\n t+=streak*(streak-1)/2\r\n streak=1\r\n\r\n\r\n t+=streak*(streak-1)/2\r\n print(int(t))\r\n", "def num(x):\r\n return bin(x).count(\"1\")\r\n \r\ndef main():\r\n n = int(input())\r\n line = list(map(int, input().split()))\r\n cou = dict()\r\n for i in range(n):\r\n new = num(line[i])\r\n if new not in cou:\r\n cou[new] = 0\r\n cou[new] += 1\r\n ans = 0\r\n for el in cou:\r\n ans += cou[el] * (cou[el] - 1) // 2\r\n print(ans)\r\nmain()\r\n", "def f(x):\r\n return bin(x).count(\"1\")\r\n\r\n\r\nfrom math import comb\r\n\r\n\r\ndef solve():\r\n # Reading input\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n freq = {}\r\n for ai in a:\r\n ai = f(ai)\r\n freq[ai] = freq.get(ai, 0) + 1\r\n\r\n count = sum([comb(f, 2) for f in freq.values()])\r\n print(count)\r\n\r\n\r\nsolve()\r\n", "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\npopcount=[0]*(32)\r\nn=int(input())\r\na=list(map(int,stdin.readline().split()))\r\nfor i in a:\r\n temp=0\r\n for j in range(31):\r\n if(i & 1<<j):\r\n temp+=1\r\n popcount[temp]+=1\r\nans=0\r\nfor i in popcount:\r\n if(i>1):\r\n ans+=(i*(i-1))//2\r\nprint(ans)", "n = int(input())\r\na = list(map(int , input().split()))\r\nv = {}\r\nfor i in a:\r\n\tc = 0\r\n\twhile (i!=1):\r\n\t\tif i%2 == 0:\r\n\t\t\ti /= 2\r\n\t\telse:\r\n\t\t\ti = (i-1)/2\r\n\t\t\tc += 1\r\n\tif c in v:\r\n\t\tv[c] += 1\r\n\telse:\r\n\t\tv[c] = 1\r\n\r\nt = 0\r\nfor u in v:\r\n\tx = v[u]\r\n\tt += (x*(x-1))/2\r\n\r\nprint(int(t))", "from sys import stdin,stdout\r\nfrom bisect import bisect_right as br\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import insort_left as il\r\nfrom math import gcd\r\ndef cho(n):\r\n return n*(n-1)//2\r\ndef val(n):\r\n ans=0\r\n while n:\r\n if n&1:\r\n ans+=1\r\n n//=2\r\n return ans\r\nn=int(stdin.readline())\r\nlst=[int(i) for i in stdin.readline().split()]\r\nlst2=[]\r\nfor i in lst:\r\n lst2+=[val(i)]\r\nlst2.sort()\r\ntemp=lst2[0]\r\nc=[1]\r\nans=0\r\nfor i in lst2[1:]:\r\n if i==temp:\r\n c[-1]+=1\r\n else:\r\n c+=[1]\r\n temp=i\r\nfor i in c:\r\n ans+=cho(i)\r\nstdout.write(str(ans))\r\n", "def f(x):\r\n\treturn str(bin(x)).count('1')\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = [f(x) for x in a]\r\n# print(ans)\t\r\ns = set(ans)\r\ncounts = {x:ans.count(x) for x in s}\r\n# print(counts)\r\ncount = 0\r\n\r\nfor item in counts:\r\n\tcount += (counts[item]*(counts[item]-1))//2\r\n\r\nprint(count)\t\t\t", "def rec(x):\r\n if x == 1:\r\n return 1\r\n\r\n if x%2 == 0:\r\n return rec(x//2)\r\n\r\n else:\r\n return rec(x//2)+1\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nd = {}\r\nans = 0\r\nfor i in l:\r\n som = rec(i)\r\n if som in d:\r\n d[som] += 1\r\n\r\n else:\r\n d[som] = 1\r\n\r\nfor i in d:\r\n ans = ans+int(((d[i]-1)/2)*(d[i]))\r\n\r\nprint(ans)", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\ndef f(x):\r\n cnt = 0\r\n while True:\r\n if x == 1:\r\n cnt += 1\r\n break\r\n elif x % 2 == 1:\r\n cnt += 1\r\n x = (x-1)/2\r\n else:\r\n x = x/2\r\n return cnt\r\n\r\nmy_dict = {}\r\n\r\nfor i in range(n):\r\n d = f(a[i])\r\n if d in my_dict.keys():\r\n my_dict[d] += 1\r\n else:\r\n my_dict[d] = 1\r\n\r\n\r\n\r\nresult = 0\r\nfor key in my_dict.keys():\r\n t = my_dict[key]\r\n result += int(t*(t-1)/2)\r\n\r\nprint(result)", "n=int(input())\r\nz=10**5\r\na=[0]*z\r\nfor x in map(int,input().split()):\r\n a[bin(x).count(\"1\")]+=1\r\nans=0\r\nfor x in a:\r\n ans+=x*(x-1)//2\r\nprint(ans)\r\n", "n=int(input())\r\np=[int(x) for x in input().split()]\r\nfor i in range (0,n):\r\n p[i]=str(bin(p[i])).count('1')\r\ns=set(p)\r\nt=0\r\nfor j in s:\r\n t+=p.count(j)*(p.count(j)-1)/2\r\nprint(int(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\ndef main():\r\n input()\r\n return nPairsWithCommonFX(map(int, input().split()))\r\n\r\n\r\ndef nPairsWithCommonFX(sequence):\r\n storage = {}\r\n for value in sequence:\r\n y = f(value)\r\n if y not in storage:\r\n storage[y] = [value]\r\n else:\r\n storage[y].append(value)\r\n\r\n return sum(len(storage[y])*(len(storage[y])-1)//2 for y in storage)\r\n\r\n\r\ndef f(n):\r\n y = 1\r\n while n != 1:\r\n if n%2:\r\n y += 1\r\n n //= 2\r\n\r\n return y\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n input()\r\n return nPairsWithCommonFX(tuple(map(int, input().split())))\r\n\r\n\r\ndef nPairsWithCommonFX(sequence):\r\n storage = {}\r\n FXs = []\r\n for value in sequence:\r\n y = f(value)\r\n if y not in storage:\r\n storage[y] = [value]\r\n FXs.append(y)\r\n else:\r\n storage[y].append(value)\r\n\r\n return (sum(len(storage[y])*len(storage[y]) for y in FXs) - sum(len(storage[y]) for y in FXs))//2\r\n\r\n\r\nmemo = {128, 1, 2, 256, 4, 512, 1024, 2048, 8, 4096, 32768, 131072, 262144, 524288, 8192, 1048576, 16, 16384, 4194304,\r\n 32, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 64, 65536, 2097152}\r\n\r\n\r\ndef f(n):\r\n global memo\r\n y = 1\r\n while n != 1:\r\n if n%2:\r\n y += 1\r\n elif n in memo:\r\n return y\r\n n //= 2\r\n\r\n return y\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nd = {}\r\nfor i in arr:\r\n c = bin(i).count('1')\r\n d[c] = d.get(c, 0) + 1\r\nres = [v * (v - 1) // 2 for v in d.values()]\r\nprint(sum(res))\r\n" ]

[ "n,m = map(int,input().split())\r\narr = [i for i in range(n)]\r\nv = list(map(int,input().split()))\r\nwhile len(arr)>1:\r\n # print(arr)\r\n v[arr[0]]-=m\r\n if v[arr[0]]<=0:\r\n arr.pop(0)\r\n else:\r\n n = arr.pop(0)\r\n arr.append(n)\r\nprint(arr[0]+1)\r\n", "import collections\r\nd = collections.deque()\r\nnm = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nz = d\r\nfor i in range(nm[0]):\r\n d.append(a[i])\r\n z.append(i+1)\r\ndop = 0\r\ndops = 0\r\nwhile len(d) > 1:\r\n dop = d.popleft()\r\n dops = z.popleft()\r\n if dop > nm[1]:\r\n dop -= nm[1]\r\n d.append((dop))\r\n z.append((dops))\r\n dop += nm[1]\r\nprint(dops)\n# Sat Jul 09 2022 20:00:29 GMT+0000 (Coordinated Universal Time)\n", "from collections import deque\r\n\r\n_, m = map(int, input().split())\r\nvls = list(map(int, input().split()))\r\n\r\ncola = deque()\r\nfor i, v in enumerate(vls):\r\n cola.append([i + 1, v])\r\n\r\nwhile len(cola) != 1:\r\n x = cola.popleft()\r\n if x[1] > m:\r\n cola.append([x[0], x[1] - m])\r\n\r\nprint(cola.pop()[0])\r\n", "n, m=map(int, input().split(\" \"))\r\np=0\r\nmx=0\r\na=list(map(int, input().split(\" \")))\r\nfor i in range(n):\r\n\tif (a[i]+m-1)//m>=mx:\r\n\t\tp=i\r\n\t\tmx=(a[i]+m-1)//m\r\nprint(p+1)\n# Sat Apr 29 2023 20:48:17 GMT+0300 (Moscow Standard Time)\n", "n=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\narr2=[]\r\ndict={}\r\nfor i in range(n[0]):\r\n if(arr[i]%n[1]==0):\r\n arr2.append(arr[i]/n[1])\r\n else:\r\n arr2.append(int(arr[i]/n[1])+1)\r\nx=max(arr2)\r\nfor i in range(len(arr2)):\r\n if(arr2[i]==x):\r\n dict[i]=x\r\nprint(list(dict.keys())[-1]+1)\r\n\r\n\r\n", "#https://codeforces.com/problemset/problem/450/A\r\nimport math\r\n(n,m) = (int(x) for x in input().split())\r\na = [int(x) for x in input().split()]\r\nmax_value = 0\r\nfor index in range(n):\r\n curr_value = math.ceil(a[index]/m)\r\n if curr_value >= max_value:\r\n max_value = curr_value\r\n answer = index+1\r\nprint(answer)", "n,m= map(int,input().split())\r\na=list(map(int,input().split()))\r\na_idx=list( [a[i],i] for i in range(len(a)))\r\nj=0\r\nwhile len(a_idx)>1:\r\n if a_idx[j][0]<=m:\r\n a_idx.remove(a_idx[j])\r\n elif a_idx[j][0]>m:\r\n a_idx[j][0]-=m\r\n a_idx.append(a_idx[j])\r\n a_idx.pop(0)\r\nprint(a_idx[0][1]+1)\r\n\r\n", "import math\r\nn, m = list(map(int, input().split()))\r\ncandies = list(map(int, input().split()))\r\na = []\r\nb = []\r\nfor i in range(len(candies)):\r\n x = candies[i] / m\r\n x = math.ceil(x)\r\n a.append(x)\r\nhighest_demand = max(a)\r\nfor j in range(len(a)):\r\n if a[j] == highest_demand:\r\n b.append(j)\r\nans = max(b)\r\nprint(ans + 1)", "n,m=map(int,input().split())\r\na=[[k,i] for i,k in enumerate([*map(int,input().split())])]\r\nwhile a:\r\n if len(a)==1:\r\n print(a[0][1]+1)\r\n break\r\n if a[0][0]-m>0:a.append([a[0][0]-m,a[0][1]])\r\n del a[0]", "import math\r\n\r\nn,m = input().split()\r\nn,m = [int(n),int(m)]\r\narr = [int(x) for x in input().split()]\r\nans = -1\r\np = -1\r\nfor i in range(n):\r\n d = math.ceil(arr[i]/m)\r\n if d >= ans:\r\n ans = d\r\n p = i+1\r\nprint(p)", "n = list(map(int, input().split()))\nm = list(map(int, input().split()))\nm.insert(0, None)\n\nm = [(x, i) for i, x in enumerate(m)]\n\nli = None\n\nwhile not len(m) == 1:\n for i in m[1:]:\n if n[1] >= i[0]:\n li = i[1]\n m.remove(i)\n elif n[1] < i[0]:\n li = i[1]\n move = (i[0] - n[1], i[1])\n m.pop(m.index(i))\n m.append(move)\n\nif li is not None:\n print(li)\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=list(map(int,input().split()))\r\nmaxi=0\r\nimport math\r\nfor i in range(len(lst)):\r\n x=math.ceil(lst[i]/b)\r\n if x>=maxi:\r\n maxi=x\r\n idx=i+1\r\nprint(idx)", "import sys\r\nimport math\r\nn,m= map(int,sys.stdin.readline().split())\r\ns=input()\r\ns=(s.split())\r\nss=s\r\nfor i in range(n):\r\n s[i]=int(s[i])\r\n ss[i]=(math.ceil(s[i]/m))\r\nm=-1\r\nfor i in range(n):\r\n if ss[i]>=m:\r\n a=i\r\n m=ss[i]\r\nprint(a+1)\r\n", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nline = list(range(1, n + 1))\r\nlastChild = 0\r\n\r\nwhile line: #list is not empty\r\n child = line.pop(0)\r\n candies_given = min(m, a[child - 1])\r\n \r\n a[child - 1] -= candies_given\r\n \r\n if a[child - 1] > 0:\r\n line.append(child)\r\n else:\r\n lastChild = child\r\n\r\nprint(lastChild)", "from math import ceil\r\nn,m=map(int,input().split())\r\nx=list(map(int,input().split()));l=1;j=0\r\nif max(x)>m:\r\n for i in range(n):\r\n if ceil((x[i]/m))>=l:j=i+1;l=ceil(x[i]/m)\r\n print(j)\r\nelse:print(n)", "x,y=map(int,input().split())\r\nsozluk={k+1:w for k,w in enumerate(map(int,input().split()))}\r\nen_buyuk=sozluk[1]/y\r\nkonum=1\r\nfor i in range(2,x+1):\r\n if(sozluk[i]/y>en_buyuk):\r\n en_buyuk=sozluk[i]/y\r\n konum=i\r\n else:\r\n if(en_buyuk==int(en_buyuk) and sozluk[i]/y>en_buyuk-1):\r\n en_buyuk = sozluk[i] / y\r\n konum = i\r\n elif(en_buyuk!=int(en_buyuk) and (sozluk[i]/y)>int(en_buyuk)):\r\n en_buyuk = sozluk[i] / y\r\n konum = i\r\nprint(konum)", "n,m=map(int,input().split())\r\ndef interpr(s,a):\r\n global m\r\n return ((int(s)-1)//m+1,a)\r\na=list(map(interpr,input().split(),range(n)))\r\nprint(sorted(a)[n-1][1]+1)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if a[i]%m==0:\r\n a[i]=(a[i]//m)-1\r\n else:\r\n a[i]=(a[i]//m)\r\nc=a[::-1].index(max(a))\r\nprint(n-c)", "import math\nn,c=map(int,input().split())\nlst=list(map(int,input().split()))\nmaxi=0\nid=0\nfor i in range(n):\n if math.ceil(lst[i]/c)>=maxi:\n maxi=(math.ceil(lst[i]/c))\n id=i\n\nprint(id+1)\n\t\t\t\t\t \t\t \t \t\t\t\t \t \t\t\t", "from collections import *\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na = deque(a)\r\nkk = deque()\r\nfor i in range(1, n+1):\r\n kk.append(i)\r\nwhile m and len(a):\r\n if a[0] <= m:\r\n a.popleft()\r\n last = kk.popleft()\r\n elif a[0] > m:\r\n k = a.popleft()\r\n kk.append(kk.popleft())\r\n a.append(k-m)\r\nprint(last)\r\n", "n,m=map(int,input().split())\na=[(int(i)-1)//m for i in input().split()]\na.reverse()\nprint(n-a.index(max(a)))", "from queue import Queue\n\nn , m = input().split()\n\nn = int(n)\n\nm = int(m)\n\nmylist = list(map(int , input().split()))\n\nque = Queue()\n\nfor index in range(len(mylist)):\n que.put([mylist[index] , index + 1])\n\npos = 0\nwhile not que.empty():\n element = que.get()\n element[0] -= m\n\n if element[0] > 0:\n que.put(element)\n else:\n pos = element[1]\n\nprint(pos)\n\n#Time Complexity : O(n)\n\n \t\t\t\t \t \t\t \t\t \t \t \t\t\t \t \t", "\n\nn,m = map(int,input().split())\n\narr = list(map(int,input().split()))\nt = 0\nidx = 0\nfor i ,x in enumerate(arr):\n\tr=0\n\twhile x>0:\n\t\tx-=m\n\t\tr+=1\n\tif t<=r:\n\t\tt=r\n\t\tidx = i+1\n\nprint(idx)", "n,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nc=[x//m if x%m==0 else x//m+1 for x in a]\r\nma=max(c)\r\nc.reverse()\r\nprint(len(c)-c.index(ma))", "def ceil_div(a, b):\n return -(-a // b)\n\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nb = [ceil_div(ai, m) for ai in a]\nprint(max(range(n), key=lambda i: (b[i], i)) + 1)\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nqueue = list(range(1, n+1))\r\nlast_child = -1\r\n\r\nwhile queue:\r\n child = queue.pop(0)\r\n a[child-1] -= m\r\n if a[child-1] > 0:\r\n queue.append(child)\r\n else:\r\n last_child = child\r\n\r\nprint(last_child)\r\n", "n,m=map(int,input().split())\r\nlist_=list(map(int,input().split()))\r\ni=0\r\nremoved=set()\r\nflag=True\r\nindex=0\r\nwhile flag:\r\n if len(removed)==n:\r\n flag=False\r\n elif list_[i]==0:\r\n if i==(len(list_)-1):\r\n i=(-1)\r\n i+=1\r\n continue\r\n elif list_[i]!=0:\r\n if list_[i]>=m:\r\n list_[i]-=m\r\n else:\r\n list_[i]=0\r\n removed.add(i)\r\n index=i\r\n if list_[i]==0:\r\n removed.add(i)\r\n index=i\r\n if i==(n-1):\r\n i=(-1)\r\n i+=1\r\nprint(index+1)", "n, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nmx = 0\r\nidxMx = -1\r\nfor i in range(n):\r\n if (lst[i]//m)+bool(lst[i]%m) >= mx:\r\n mx = (lst[i]//m)+bool(lst[i]%m)\r\n idxMx = i\r\n\r\nprint(idxMx + 1)\r\n", "n,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nc=0;k=0\r\nwhile(True):\r\n for i in range(0,len(a)):\r\n if a[i]>0:\r\n if a[i]-m<=0:\r\n a[i]=a[i]-m\r\n c=c+1\r\n if c==n:\r\n k=1\r\n break\r\n else:\r\n a[i]=a[i]-m\r\n if k==1:\r\n print(i+1)\r\n break\r\n", "n, m = map(int, input().split())\r\n\r\nlast_removed = 0\r\ncandies = list(map(int, input().split()))\r\ntemp = []\r\ncounter = 0\r\nwhile counter != n:\r\n for x in range(n):\r\n if candies[x] > 0:\r\n candies[x] -= m\r\n if candies[x] <= 0:\r\n last_removed = x+1\r\n counter += 1\r\nprint(last_removed)", "import math\nn, m = list(map(int, input().split()))\na = list(map(int, input().split()))\ndiv = []\nmaxi = 0\nout = 0\nfor i in range(len(a)):\n x = math.ceil(a[i]/m)\n if x >= maxi:\n out = i + 1\n maxi = x\nprint(out)\n\n", "import math\r\ndef ys():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\nn,m = map(int,input().split())\r\nls = list(map(int, input().split()))\r\nfor i in range(n):\r\n if ls[i]%m==0:\r\n ls[i]=(ls[i]//m)-1\r\n else:\r\n ls[i]//=m\r\nc=max(ls)\r\nif not(c):\r\n print(n)\r\nelse:\r\n for i in range(n-1,-1,-1):\r\n if ls[i]==c:\r\n print(i+1)\r\n break", "from collections import deque\ndq1 = deque()\ndq2 = deque()\nn, k = map(int,input().split())\narr = list(map(int,input().split()))\nfor i in range(len(arr)):\n dq1.append(arr[i])\n dq2.append((i+1))\nans= 0\nwhile not len(dq1) == 0:\n ans = dq2[-1]\n x1 = dq1[0]\n x2 = dq2[0]\n dq1.popleft()\n dq2.popleft()\n if x1 - k > 0:\n dq1.append((x1-k))\n dq2.append(x2)\n\n\nprint(ans)\n\n\n\n\n\n \t \t \t \t\t \t\t\t \t \t\t", "def aux(m):\r\n def times(el):\r\n c = el // m\r\n r = el % m\r\n if r == 0:\r\n return c\r\n return c + 1\r\n return times\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(aux(m), a))\r\n\r\nmaxx = 0\r\nans = -1\r\nfor i in range(n):\r\n if t[i] > maxx:\r\n maxx = t[i]\r\n ans = i\r\n if t[i] == maxx:\r\n ans = i\r\n\r\nprint(ans + 1)\r\n\r\n\r\n", "n,m = [int(a) for a in input().split()]\r\n\r\nl = [int(a) for a in input().split()]\r\nind = 0\r\ni = 0\r\n\r\nwhile sum(l) > 0:\r\n for n in range(len(l)):\r\n if l[n] - m <= 0:\r\n if l[n] == 0:\r\n l[n] = 0\r\n else:\r\n l[n] = 0\r\n ind = n\r\n else:\r\n l[n] -= m\r\n\r\n\r\nprint(ind+1)", "import math\nz, y=map(int, input().split())\nlst = list(map(int, input().split()))\nmx = 0\nidx = -1\nfor i in range(z):\n x = math.ceil(lst[i] / y)\n if x >= mx:\n mx = x\n idx = i\n\nprint(idx+1)\n\t\t\t \t\t\t\t\t\t \t\t\t\t \t\t\t \t\t\t\t", "n, m = map(int, input().split())\r\nline_up = list(map(lambda x: (int(x)-1) // m, input().split()))\r\nmx = line_up[0]\r\nidx = 0\r\nfor i in range(1, n):\r\n if line_up[i] >= mx:\r\n mx = line_up[i]\r\n idx = i\r\nprint(idx+1)", "n, m = [int(i) for i in input().split()]\r\nb = input().split()\r\na = [[int(b[i]), i + 1] for i in range(len(b))]\r\n\r\nwhile len(a) > 1:\r\n if a[0][0] <= m:\r\n a.pop(0)\r\n else:\r\n a[0][0] = a[0][0] - m\r\n a.append(a[0])\r\n a.pop(0)\r\n\r\nprint(a[0][1])", "c = {}\r\nv1, v2 = map(int, input().split())\r\nv = list(map(int, input().split()))\r\nfor i in range(v1):\r\n c[i + 1] = v[i]\r\nq = list(range(1, v1 + 1))\r\nwhile q:\r\n cc1 = q.pop(0)\r\n cc2= min(v2, c[cc1])\r\n c[cc1] -= cc2\r\n if c[cc1] > 0:\r\n q.append(cc1)\r\nprint(cc1)\r\n", "import math\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n l[i]=math.ceil(l[i]/m)\r\nl=l[::-1]\r\nprint(n-l.index(max(l)))", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n a[i]=(a[i]-1)//m\r\na.reverse()\r\nprint(n-a.index(max(a)))", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nx = None\r\nd = []\r\ni = 0\r\nfor nm in a:\r\n d.append([nm,i])\r\n i +=1 \r\nwhile d!=[]:\r\n x = d.pop(0)\r\n if x[0]>m:\r\n x[0]-=m\r\n d.append(x)\r\nprint(x[1]+1)", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter, deque\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QIA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return list(input())\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n n,m = IA()\r\n a = IA()\r\n ma = (0,0)\r\n top = False \r\n for i in range(n):\r\n if a[i] > m:\r\n top = True \r\n g = ceil(a[i]/m)\r\n if g >= ma[1]:\r\n ma = (i+1, g)\r\n return ma[0] if top else n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\norder = []\r\nwhile True:\r\n for i in range(n):\r\n if a[i] > 0:\r\n if a[i] <= m:\r\n order.append(i + 1)\r\n a[i] = 0\r\n else:\r\n a[i] -= m\r\n \r\n if sum(a) == 0:\r\n break\r\n\r\nprint(order[-1])\r\n", "from math import ceil as up\r\nn, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nif max(l)<=k:\r\n print(n)\r\nelse:\r\n a = []\r\n for j in range(n):\r\n a.append([l[j], j])\r\n tem = 0\r\n while True:\r\n new = []\r\n for i in a:\r\n\r\n if i[0]>k:\r\n new.append([i[0]-k,i[1]])\r\n a = new\r\n\r\n if len(new) == 0:\r\n break\r\n else:\r\n tem = new[-1][1]\r\n print(tem+1)", "n, candies = map(int, input().split(\" \"))\r\nchildren = list(map(int, input().split(\" \")))\r\n\r\nwentHome = 0\r\nlastOne = 0\r\nwhile lastOne == 0:\r\n for i in range(len(children)):\r\n if children[i] > 0:\r\n children[i] -= candies\r\n if children[i] <= 0:\r\n wentHome += 1\r\n if (wentHome == len(children)):\r\n lastOne = i +1\r\n break\r\n\r\nprint(lastOne)\r\n", "def candies(children,cantidad):\r\n casa=[]\r\n while len(casa)<children[0]:\r\n for ninos in range(len(cantidad)):\r\n if ninos+1 not in casa and cantidad[ninos]<=children[1]:\r\n casa.append(ninos+1)\r\n else:\r\n cantidad[ninos]-=children[1]\r\n print(casa[len(casa)-1])\r\n\r\ndef main():\r\n children=[int(x) for x in input().split()]\r\n cantidad=[int(x) for x in input().split()]\r\n candies(children,cantidad)\r\nmain()", "from math import ceil\r\nn, m = [int(i) for i in input().split()] \r\nl = [int(i) for i in input().split()] \r\nQ = [] \r\nM = -1\r\nfor i in range(n-1, -1, -1): \r\n if ceil(l[i] / m) > M: \r\n M = ceil(l[i] / m)\r\n idx = i\r\nprint(idx+1)", "import math\r\n\r\nMOD = 1000000007\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if a[i] % m == 0:\r\n a[i] = (a[i] // m) - 1\r\n else:\r\n a[i] = a[i] // m\r\n\r\nmax_index = max(range(n), key=lambda i: a[n - i - 1])\r\n\r\nif a[n - max_index - 1] > 0:\r\n print(n - max_index)\r\nelse:\r\n print(n)", "n, m = map(int, input().split())\r\ninp = input().split()\r\ncandiesWanted = []\r\nfor i in range(n):\r\n candiesWanted.append(i+1)\r\n candiesWanted.append(int(inp[i]))\r\nwhile len(candiesWanted) > 2:\r\n candiesWanted[1] -= m\r\n if candiesWanted[1] > 0:\r\n candiesWanted.append(candiesWanted.pop(0))\r\n candiesWanted.append(candiesWanted.pop(0))\r\n else:\r\n candiesWanted.pop(0)\r\n candiesWanted.pop(0)\r\nprint(candiesWanted[0])\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nk=[]\r\nfor i in lis :\r\n if i % m ==0 :\r\n k.append(i//m)\r\n else:\r\n k.append((i//m)+1)\r\ni=n-1\r\nl=max(k)\r\nwhile i >=0 :\r\n if k[i]== l :\r\n print(i+1)\r\n break\r\n i-=1", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmx = 0\r\np = 0\r\nfor i in range(n):\r\n if (a[i] + m - 1) // m >= mx:\r\n p = i + 1\r\n mx = (a[i] + m - 1) // m\r\nprint(p)", "\nfrom collections import deque\n\nn, m = map(int, input().split())\nlst = list(map(int, input().split()))\nqueue = deque()\n[queue.append([i, x]) for i, x in enumerate(lst)]\nwhile len(queue) > 0:\n front = queue.popleft()\n front[1] -= m\n if front[1] > 0:\n queue.append(front)\nprint(front[0] + 1)\n\n\t \t\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\ncount=0\r\nwhile(1):\r\n for i in range(0,n,1):\r\n if a[i]!=0:\r\n if a[i]<=m:\r\n a[i]=0\r\n k=i\r\n count=count+1\r\n else:\r\n a[i]=a[i]-m\r\n if count==n:\r\n break\r\nprint(k+1)", "n, m = list(map(int, input().split(\" \")))\r\na = list(map(int, input().split(\" \")))\r\nposa = []\r\n\r\nfor i in range(len(a)):\r\n posa.append(i+1)\r\n\r\nwhile len(a) != 1:\r\n a[0] -= m\r\n if a[0] <= 0:\r\n del(a[0])\r\n del(posa[0])\r\n else:\r\n a.append(a[0])\r\n posa.append(posa[0])\r\n del(a[0])\r\n del(posa[0])\r\n\r\nprint(posa[0])", "n, m = list(map(int, input().split()))\r\nchildren = list(map(lambda c: int((int(c) - 0.5) // m + 1), input().split()))\r\n\r\nprint(n - children[::-1].index(max(children)))", "n,m= map(int,input().split())\r\nl=list(map(int,input().split()))\r\na= list(range(1,n+1))\r\ni=0\r\n\r\nwhile (len(a)>1):\r\n if m>=l[a[0]-1]:\r\n a=a[1:]\r\n elif m<l[a[0]-1]:\r\n l[a[0]-1]-=m\r\n a=a[1:]+[a[0]]\r\n \r\nprint(a[0])\r\n\r\n \r\n", "import math\r\n\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nans = -1\r\np = -1\r\nfor i in range(n):\r\n d = math.ceil(arr[i]/m)\r\n if d >= ans:\r\n ans = d\r\n p = i+1\r\nprint(p)", "a = [int(x) for x in input().split()]\r\nn,m = a[0],a[1]\r\n\r\narr = [int(x) for x in input().split()]\r\narr1 = [int(x) for x in range(1,n+1)]\r\n\r\n\r\nwhile len(arr)>1:\r\n if arr[0]<=m:\r\n arr = arr[1:]\r\n arr1 = arr1[1:]\r\n else:\r\n arr[0]= arr[0]-m \r\n arr.append(arr[0])\r\n arr1.append(arr1[0])\r\n arr1 = arr1[1:]\r\n arr=arr[1:]\r\n\r\nelse:\r\n print(arr1[-1])", "import math\nx,y = map(int,input().split())\nlst = list(map(int,input().split()))\nidx =-1\nmx = 0\nfor i in range(x):\n z =math.ceil(lst[i]/y)\n if z>= mx:\n mx = z\n idx = i\nprint(idx+1)\n\n\n\n \t \t\t\t\t \t\t \t\t \t\t \t\t \t \t\t", "from math import ceil\r\nn,m = map(int,input().split())\r\n\r\nx = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n\tx[i] = ceil(x[i]/m)\r\n\t\r\nmax = x[0]\r\nc = 1\r\n\r\nfor i in range(n):\r\n\tif(x[i]>=max):\r\n\t\tmax= x[i]\r\n\t\tc=i+1\r\n\t\t\r\nprint(c)", "import math\r\nn, m = map(int,input().split())\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n\tl[i] = math.ceil(l[i]/m)\r\n \r\nl.reverse()\r\nk = l.index(max(l))\r\n \r\nprint(n-k)", "from math import ceil\r\na,b=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\n \r\nk=[0]*a\r\nfor i in range(a):\r\n k[i]=ceil(x[i]/b)\r\n \r\nm,mi=0,0\r\nfor i in range(a-1,-1,-1):\r\n if k[i]>m:\r\n m=k[i]\r\n mi=i\r\n \r\nprint(mi+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 8 23:10:16 2021\r\n\r\n@author: dell\r\n\"\"\"\r\n\r\nfrom math import ceil\r\narr = [int(i) for i in input().split(\" \")]\r\nn = arr[0]\r\nm = arr[1]\r\narr = [ceil(int(i)/m) for i in input().split(\" \")]\r\nmaxx = -1\r\nans = -1\r\nfor i in range(n):\r\n if(maxx <= arr[i]):\r\n maxx = arr[i]\r\n ans = i+1\r\nprint(ans)\r\n", "line1 = input()\r\nline2 = input()\r\nnum1 = line1.split()\r\nnum2 = line2.split()\r\nnum3 = []\r\nnum4 = []\r\nlast = 0\r\n\r\nn = num1[0]\r\nm = num1[1]\r\nfor i in range(len(num2)):\r\n num3.append(i+1)\r\n num4.append(int(num2[i]))\r\n \r\nwhile(len(num4) > 0):\r\n num4[0]-= int(m)\r\n if(num4[0] <= 0):\r\n num4.pop(0)\r\n last = num3[0]\r\n num3.pop(0)\r\n else:\r\n num4.append(num4[0])\r\n num4.pop(0)\r\n last = num3[0]\r\n num3.append(num3[0])\r\n num3.pop(0)\r\nprint(last)\r\n", "n,m=map(int,input().split());l=list(map(int,input().split()));c=0\r\nwhile c>=0:\r\n for i in range(len(l)):\r\n if l[i]>0:\r\n l[i]-=m\r\n if l[i]<=0:c+=1\r\n if c==n:print(i+1);c=-1", "n, m = [int(i) for i in input().split()]\nn_candy = [int(i) for i in input().split()]\n\nn_child = []\nfor i in range(n):\n n_child.append(i+1)\n\nwhile len(n_candy) > 1:\n if n_candy[0] <= m:\n del n_candy[0]\n del n_child[0]\n else:\n value = n_candy.pop(0)\n value2 = n_child.pop(0)\n n_candy.append(value-m)\n n_child.append(value2)\n\nprint(n_child[0])", "n,m=map(int,input().split(\" \"))\r\nl=[int(num) for num in input().split(\" \")]\r\ndic={i+1:l[i] for i in range(0,n)}\r\ndef chil(dic,m):\r\n if dic==1:\r\n return dic.keys[0]\r\n else:\r\n new={}\r\n count=0\r\n k=list(dic.keys())\r\n v=list(dic.values())\r\n for i in range(len(dic)):\r\n if v[i]>m:\r\n new[k[i]]=v[i]-m\r\n count=count+1\r\n if count==0:\r\n return k[len(dic)-1]\r\n else:\r\n return chil(new,m)\r\nprint(chil(dic,m))", "from math import ceil\r\n\r\nn,m = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nnmval = 0\r\nmind = -1\r\nfor i in range(n):\r\n if ceil(lst[i]/m) >= nmval:\r\n nmval = ceil(lst[i]/m)\r\n mind = i+1\r\nprint(mind)", "n,m=map(int,input().split())\r\na=[int(x) for x in input().split()]; k=0\r\ndef empty(k):\r\n for i in k:\r\n if i>0:\r\n return 0\r\n return 1\r\nwhile True:\r\n z=0\r\n for i in a:\r\n if i>0:\r\n a[z] -=m\r\n k=z\r\n z+=1\r\n if empty(a):\r\n break\r\nprint(k+1)\r\n", "import math\nn,m = map(int,input().split())\narr=[int(i) for i in input().split()]\n\nmx=-1\nmx_idx=-1\n\nfor i in range(n):\n d=math.ceil(arr[i]/m)\n if d >= mx:\n mx=d\n mx_idx=i+1\n\nprint(mx_idx)\n\n\n \t \t\t\t\t\t \t\t \t\t\t \t \t\t\t\t\t", "n,m=map(int, input().split())\r\na=[int(i) for i in input().split()]\r\nb=[]\r\nfor i in range(len(a)):\r\n b.append([a[i],i+1])\r\nwhile len(b)>1:\r\n if b[0][0]-m>0:\r\n b[0][0]-=m\r\n b.append([b[0][0],b[0][1]])\r\n b.pop(0)\r\n else: b.pop(0)\r\nprint(b[0][1])", "\r\nn, m = map(int, input().split())\r\n\r\nvalue = list(map(int, input().split()))\r\nindex = []\r\nfor i in range(1, n+1):\r\n index.append(i)\r\n\r\nwhile(len(index) > 1):\r\n if((value[0]-m) > 0):\r\n value.append(value[0]-m)\r\n value.remove(value[0])\r\n index.append(index[0])\r\n index.remove(index[0])\r\n else:\r\n value.remove(value[0])\r\n index.remove(index[0])\r\nprint(index[0])\r\n", "import math\r\na=input().split()\r\nn=int(a[0])\r\nk=int(a[1])\r\nm=list(map(int,input().split()))\r\nfor i in range(n):\r\n m[i] = m[i]//k + 1*(m[i]%k != 0)\r\nr=0\r\nfor i in range(len(m)):\r\n if m[i]>=m[r]:\r\n r=i\r\nprint(r+1)", "import math\r\nn,m = map(int,input().split())\r\n\r\nls = list(map(int,input().split()))\r\nqs = []\r\nfor i in ls:\r\n qs.append(math.ceil(i/m))\r\nmaxe = qs[0]\r\nmaxe_index = 0\r\nfor i in range(len(qs)):\r\n if(qs[i]>=maxe):\r\n maxe_index = i\r\n maxe = qs[i]\r\n\r\nprint(maxe_index+1)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n c=0\r\n if(a[i]%m!=0):\r\n c=1\r\n a[i]=a[i]//m +c\r\nm=max(a)\r\nl=0\r\nfor i in range(n):\r\n if(a[i]==m):\r\n if(l<i):\r\n l=i\r\nprint(l+1)", "def main() :\r\n n,m = map(int,input().split())\r\n array = list(map(int,input().strip().split()))\r\n aux = []\r\n for i in range(1,n+1):\r\n aux.append(i)\r\n while len(array) != 1 :\r\n if array[0] <= m :\r\n del array[0]\r\n del aux[0]\r\n else :\r\n array[0]-=m\r\n a = array.pop(0)\r\n array.append(a)\r\n b = aux.pop(0)\r\n aux.append(b)\r\n print(aux[0]) \r\n\r\n\r\n\r\nmain() ", "n,m=map(int,input().split())\r\na=list((int(i)-1)//m for i in input().split())\r\nprint(n-a[::-1].index(max(a)))", "import math\r\n\r\ndef solve(n, m, children):\r\n children_with_indices = []\r\n for i in range(n):\r\n children_with_indices.append([i, children[i]])\r\n while len(children_with_indices) != 1:\r\n temp = children_with_indices[0][1] - m\r\n if temp <= 0:\r\n children_with_indices.remove(children_with_indices[0])\r\n else:\r\n temp2 = children_with_indices[0]\r\n children_with_indices.remove(temp2)\r\n temp2[1] = temp2[1] - m\r\n children_with_indices.append(temp2)\r\n return children_with_indices[0][0] + 1\r\n\r\ndef main():\r\n l = list(map(int, input().strip().split()))\r\n children = [int(a) for a in input().strip().split()]\r\n print(solve(l[0], l[1], children))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ndef allNeg(l):\r\n for i in l:\r\n if(i>0):\r\n return 0\r\n return 1\r\n\r\ndef greater(l):\r\n for i in l[::-1]:\r\n if (i>0):\r\n return n-l[::-1].index(i)\r\n return -1\r\nlast=n\r\nwhile(allNeg(l)==0):\r\n l=[x-m for x in l]\r\n ind=greater(l)\r\n if(ind!=-1):\r\n last=ind\r\nprint(last)", "import math\r\na,b=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nm=0\r\nfor i in range(len(arr)):\r\n if(math.ceil(arr[i]/b)>=m):\r\n k=i \r\n m=math.ceil(arr[i]/b)\r\nprint(k+1)", "from math import ceil\r\n\r\nkids, candy = map(int, input().split())\r\nline = map(int, input().split())\r\n\r\nline = list(map(lambda x: ceil(x/candy), line))\r\n\r\nmost_wanted = max(line)\r\nposition = kids - (line[::-1].index(most_wanted))\r\n#\r\nprint(position)", "import math\r\nn = input().split()\r\nl = int(n[0])\r\nm = int(n[1])\r\na = input().split()\r\np = [int(i) for i in a]\r\nmax = 0\r\nlast=0\r\nfor i in range(l):\r\n b = math.ceil(p[i]/m)\r\n if b>=max:\r\n max=b\r\n last = i+1\r\nprint(last)", "n,m = map(int, input().split())\r\na = [(c-1)//m for c in list(map(int, input().split()))]\r\nprint(n-a[::-1].index(max(a)))", "from collections import deque\nn,m = map(int,input().split())\na = list(map(int,input().split()))\nq = deque()\nfor i in range(n):\n q.append([a[i],i+1])\n \nwhile q:\n x = q.popleft()\n if x[0] - m > 0:\n x[0] = x[0] - m\n q.append(x)\nprint(x[1])", "n,m = list(map(int,input().split()))\r\nnums = list(map(int,input().split()))\r\nindices = [i+1 for i in range(n)]\r\nwhile len(nums) > 1:\r\n if nums[0] > m:\r\n x = nums[0] - m\r\n nums.pop(0)\r\n nums.append(x)\r\n index = indices[0]\r\n indices.pop(0)\r\n indices.append(index)\r\n else:\r\n nums.pop(0)\r\n indices.pop(0)\r\n\r\nprint(indices[0])\r\n", "'''\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>> বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\r\n\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@\r\n''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@@\r\n\r\n PROBLEM :A. Jzzhu and Children\r\n SOLUTATOIN:........\r\n\r\n ========================================================================\r\n ========================================================================\r\n '''\r\nx,y=list(map(int,input().split()))\r\nn=list(map(int,input().split()))\r\nm=list(range(1,x+1))\r\nwhile len(n)>1:\r\n n[0]-=y\r\n if n[0]>0:\r\n n.append(n[0])\r\n m.append(m[0])\r\n n.pop(0)\r\n m.pop(0)\r\nprint(m[0])", "n, m = map(int, input().split())\r\ns = [int(x) for x in input().split()]\r\nt = 0\r\nif max(s) % m == 0:\r\n t = max(s) // m\r\nelse:\r\n t = max(s) // m + 1\r\nans = 0\r\nfor j in range(t):\r\n for i in range(n):\r\n if s[i] > 0:\r\n s[i] -= m\r\n ans = i +1\r\nprint(ans)\r\n", "#n, m, k =map(int,input().split())\r\n\r\nn, m =map(int,input().split())\r\n\r\nmass = list(map(int,input().split()))\r\na =[i for i in range(0,n)]\r\n\r\nwhile(1):\r\n i = 0\r\n while(i<len(mass)):\r\n mass[i] -= m\r\n if(mass[i] <= 0):\r\n mass.pop(i)\r\n if(len(a)==1):\r\n p = a[0]\r\n a.pop(i)\r\n i -= 1\r\n i +=1\r\n if(len(a)==0):\r\n break\r\n\r\nprint(p+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", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nposition = list(range(1, n + 1))\r\nwhile len(a) > 1:\r\n if a[0] > m:\r\n b = a[0] - m\r\n del a[0]\r\n a += [b]\r\n p = position[0]\r\n del position[0]\r\n position += [p]\r\n else:\r\n del a[0]\r\n del position[0]\r\nprint(position[0])", "from math import ceil as c\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nma,mai=0,-1\r\nfor i in range(n-1,-1,-1):\r\n\tpma=ma\r\n\tma=max(ma,c(l[i]/m))\r\n\tif pma!=ma:\r\n\t\tmai=i\r\nprint(mai+1)", "x,y=map(int,input().split())\r\nsozluk={k+1:int((w-1)/y) for k,w in enumerate(map(int,input().split()))}\r\nenbuyuk=sozluk[1]\r\nkonum=1\r\nfor i in range(2,x+1):\r\n if(sozluk[i]>=enbuyuk):\r\n enbuyuk=sozluk[i]\r\n konum=i\r\nprint(konum)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nfor j in range(n):\r\n a[j] = a[j] if a[j]%m == 0 else a[j]+m-a[j]%m\r\nmx = 0\r\nfor j in range(n):\r\n if a[j]>=a[mx]:\r\n mx = j\r\nprint(mx+1)", "n,m = map(int, input().split())\r\n\r\nhashmap = {}\r\ni = 0\r\nfor k in map(int, input().split()):\r\n hashmap[i] = k\r\n i+=1\r\n\r\ni=0\r\nwhile len(hashmap) > 1:\r\n if i in hashmap.keys():\r\n el = hashmap[i]\r\n el = el - m\r\n if el > 0:\r\n hashmap[i] = el\r\n else:\r\n hashmap.pop(i)\r\n i+=1\r\n i = i%n\r\n\r\nfor i in hashmap.keys():\r\n print(i+1)\r\n \r\n\r\n# while len(cand) > 0:\r\n# el = cand.pop(0)\r\n# el = el - m\r\n# if el > 0:\r\n# cand.append(el)\r\n# i+=2\r\n# else:\r\n# i+=1\r\n# print(cand)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif max(a)<=m:\r\n\tprint(n)\r\nelse:\r\n\ts=0\r\n\twhile max(a)>0:\r\n\t\tfor i in range(n):\r\n\t\t\tif a[i]>0:\r\n\t\t\t\ta[i]-=m\r\n\t\t\t\tif a[i]<=0:\r\n\t\t\t\t\ts=i+1\r\n\tprint(s)", "from collections import deque\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nq=deque()\r\nfor i in range(n):\r\n q.append([a[i],i+1])\r\nwhile len(q)!=1:\r\n cur=q.popleft()\r\n if (cur[0]-m)>0:\r\n q.append([cur[0]-m,cur[1]])\r\nprint(q[0][1])\n# Sat Jul 09 2022 08:53:41 GMT+0000 (Coordinated Universal Time)\n", "from math import *\r\n\r\nn, m = map(int, input().split())\r\nq = [int(a) for a in input().split()]\r\nw = []\r\nf = max(q)\r\nf = (f - 1) // m\r\nf = f * m\r\nfor i in range(n):\r\n r = q[i]\r\n if r > f:\r\n w.append(i)\r\nprint(w[len(w) - 1] + 1)\r\n", "n,m=map(int,input().split())\r\naa=list(map(int,input().split()))\r\nfor i in range(n):\r\n if aa[i]%m==0:\r\n aa[i]=(aa[i]//m)-1\r\n else:\r\n aa[i]=(aa[i]//m)\r\nc=aa[::-1].index(max(aa))\r\nprint(n-c)", "from math import ceil\r\n\r\nn, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nmx = 0\r\nfor i in range(n):\r\n lst[i] = ceil(lst[i]/m)\r\n mx = max(mx, lst[i])\r\n\r\ni = n - 1\r\nwhile lst[i] != mx:\r\n i -= 1\r\n\r\nprint(i + 1)\r\n\r\n\r\n", "from queue import Queue\r\n\r\nn,m = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nq = Queue()\r\nfor i in range(n):\r\n q.put([i,a[i]])\r\nwhile q.empty() == False:\r\n t = q.get()\r\n t[1] -= m\r\n if t[1] > 0:\r\n q.put(t)\r\nprint(t[0]+1)", "\nfrom queue import Queue\n\nque = Queue()\n\nn , m = input().split()\n\nn = int(n)\n\nm = int(m)\n\nmylist = list(map(int , input().split()))\n\nfor i in range(len(mylist)):\n que.put( [mylist[i] , i + 1] )\n\npos = 0\nwhile not que.empty():\n element = que.get()\n element[0] -= m\n\n if element[0] > 0 :\n que.put(element)\n else:\n pos = element[1]\n\nprint(pos)\n\n#time Complexity : O(n)\n\n \t \t \t \t\t \t \t\t\t\t \t \t", "from collections import deque\r\n\r\n\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nd=deque([(l[x],x+1) for x in range(len(l))])\r\n\r\nx=0\r\nwhile len(d)>1:\r\n val=d.popleft()\r\n if val[0]-m>0:\r\n d.append((val[0]-m,val[1]))\r\n\r\nprint(d[-1][1])\r\n \r\n \r\n\r\n", "from collections import deque\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n q = deque()\r\n for i,kid in enumerate(arr):\r\n q.append([kid,i])\r\n\r\n while len(q) > 1:\r\n kid, i = q.popleft()\r\n if kid <= m:\r\n continue\r\n kid -=m\r\n q.append([kid,i])\r\n\r\n lastkid, pos = q.popleft()\r\n\r\n print(pos+1)", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nmx = max(l)//m + [0,1][max(l)%m > 0]\r\nr = l.index(max(l))\r\nk = \" \"\r\nif mx == 1:\r\n print(n)\r\nelse:\r\n for i in range(r,n):\r\n if l[i] > (mx-1)*m:\r\n k = i \r\n print(k+1) \r\n\r\n\r\n\r\n \r\n", "import math\r\n\r\nn,m = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\nmx = 0\r\nans = 0\r\n\r\nfor i in range(1, n+1):\r\n if math.ceil(lst[i-1]/m) >= mx:\r\n ans = i\r\n mx = math.ceil(lst[i-1]/m)\r\n \r\nprint(ans)", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\nn,m=mi()\r\na=li()\r\n\r\npos = []\r\n\r\nfor i in range(n):\r\n pos.append((a[i],i+1))\r\n \r\n\r\nwhile len(pos)>1:\r\n if pos[0][0]<=m:\r\n pos.pop(0)\r\n \r\n else:\r\n rem,po = pos.pop(0)\r\n rem-=m\r\n pos.append((rem,po))\r\n \r\nprint(pos[0][1])\r\n \r\n ", "import copy\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndef f(i):\r\n z=i//m\r\n if i/m==z:\r\n return z\r\n return z+1\r\nk=[f(i) for i in a]\r\nj=copy.copy(k[::-1])\r\nx=j.index(max(k))\r\nprint(n-x)", "import math\ndef main():\n lst = input().split()\n num_candies = int(lst[1])\n candies_for_each_child = input().split()\n greatest = 0\n dict = {}\n for i in range(len(candies_for_each_child)):\n if math.ceil(int(candies_for_each_child[i]) / num_candies) not in dict:\n dict[math.ceil(int(candies_for_each_child[i]) / num_candies)] = [i]\n else:\n dict[math.ceil(int(candies_for_each_child[i]) / num_candies)].append(i)\n if greatest < math.ceil(int(candies_for_each_child[i]) / num_candies):\n greatest = math.ceil(int(candies_for_each_child[i]) / num_candies)\n print(dict[greatest][-1] + 1)\nmain()\n", "from sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef map_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n, k = map_input()\r\n a = list_input()\r\n mval = -1\r\n ans = -1\r\n for i in range(n):\r\n cval = (a[i]+k-1)//k\r\n if cval >= mval:\r\n mval = cval\r\n ans = i\r\n print(f\"{ans+1}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def result(n,m,lis):\n\ta=max(lis)\n\tdic={}\n\tfor i in range(len(lis)):\n\t\ta=lis[i]\n\t\tcount=0\n\t\tif a<=m:\n\t\t\tcontinue \n\t\telse:\n\t\t\tj=a\n\t\t\twhile j>m:\n\t\t\t\tj=j-m\n\t\t\t\tcount+=1 \n\t\t\tdic[count]=i \t\n\tlis2=[]\n\tfor key in dic.keys():\n\t\tlis2.append(key)\n\tif len(lis2)>0:\t\n\t\tc=max(lis2)\n\t\tif lis2.count(c)==1:\n\t\t\tprint(dic[c]+1)\n\t\telse:\n\t\t\tlis3=[]\n\t\t\tfor key,value in dic.items():\n\t\t\t\tif key==c:\n\t\t\t\t\tlis3.append(value)\n\t\t\tk=lis3[-1] \n\t\t\tprint(k+1)\t\t\t\t\n\telse:\n\t\tprint(len(lis))\t\n\t\t\t \n\t\t\t\n\nn,m=map(int,input().split())\nlis=list(map(int,input().split()))\nresult(n,m,lis)\n", "n, m = map(int, input().split())\r\nq = [int(x) for x in input().split()]\r\na = list(map(lambda x: (x-1)//m, q))\r\na.reverse()\r\nprint(n-a.index(max(a)))", "n, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nlst = [[lst[i], i] for i in range(n)]\r\nind_ = 0\r\nwhile len(lst) > 1:\r\n if lst[0][0] - m > 0:\r\n lst[0][0] -= m\r\n lst.append(lst[0])\r\n del lst[0]\r\nprint(lst[0][1] + 1)\r\n", "# Jzzhu and Children\r\ns = list(map(int,input().split()))\r\nn,m = s[0],s[1]\r\ns = list(map(int,input().split()))\r\nfor i in range(n):\r\n if s[i] % m != 0:\r\n s[i] = s[i] // m + 1\r\n else:\r\n s[i] = s[i] // m\r\nl = max(s)\r\nfor i in range(n-1,-1,-1):\r\n if s[i] == l:\r\n print(i+1)\r\n break", "from collections import deque\n\nn, m = [int(s) for s in input().split()]\na = [int(s) for s in input().split()]\n\nfor i in range(n):\n a[i] = [i + 1, a[i]]\nqueue = deque(a)\n\nwhile len(queue) != 1:\n val = queue.popleft()\n if val[1] - m > 0:\n val[1] -= m\n queue.append(val)\n\nprint(queue.pop()[0])\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import ceil\r\nfrom collections import Counter\r\n #X,Y,Z = list(map(int,input().strip().split()))\r\nn,m = list(map(int,input().strip().split()))\r\narr = list(map(int,input().strip().split()))\r\nlst = []\r\nfor i in arr :\r\n lst.append(ceil(i/m))\r\nlst.reverse()\r\nprint(n-lst.index(max(lst)))", "n,m=map(int,input().split())\r\n\r\na=[int(x) for x in input().split()]\r\n\r\nwhile(True):\r\n\tfor i in range(n):\r\n\t\tif a[i] !=0:\r\n\t\t\tans=i\r\n\t\ta[i]=a[i]-m\r\n\r\n\t\tif a[i]<0:\r\n\t\t\ta[i]=0\r\n\r\n\tif len(set(a))==1:\r\n\t\tbreak\r\n\r\n\r\n\r\nprint(ans+1)\t\t\r\n\r\n\t\t\t", "def Jzzhu_and_Children():\r\n strInput1 = input()\r\n strInput1 = strInput1.split(' ')\r\n total_children = int(strInput1[0])\r\n candy_each_gets = int(strInput1[1])\r\n\r\n strInput2 = input()\r\n each_student_minimum = strInput2.split(' ')\r\n each_student_minimum = [eval(i) for i in each_student_minimum]\r\n\r\n index = 0\r\n\r\n while max(each_student_minimum) != 0:\r\n #print(each_student_minimum)\r\n if each_student_minimum[index] != 0:\r\n each_student_minimum[index] = max(0, (each_student_minimum[index]- candy_each_gets))\r\n index = (index + 1) % total_children\r\n\r\n if (index == 0):\r\n print(total_children)\r\n else:\r\n print(index)\r\n\r\n\r\nJzzhu_and_Children()", "import math\r\n# for i in range(int(input())):\r\n# a,b,n,s=map(int,input().split())\r\nn,m=map(int,input().split())\r\nval=list(map(int,input().split()))\r\nmx=max(val)\r\nif mx<=m:\r\n print(n)\r\nelse:\r\n prev_ceil=0\r\n prev_idx=0\r\n for i in range(n-1,-1,-1):\r\n if val[i]>m:\r\n cei=math.ceil(val[i]/m)\r\n idx=i\r\n if cei>prev_ceil:\r\n prev_ceil=cei\r\n prev_idx=idx\r\n elif cei==prev_ceil:\r\n if idx>prev_idx:\r\n prev_idx=idx\r\n \r\n print(prev_idx+1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\ndef count_otr(nums):\r\n cnt = 0\r\n for i in nums:\r\n if i <= 0:\r\n cnt +=1\r\n\r\n return cnt\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n n, m = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n a = [i//m if i % m == 0 else i//m + 1 for i in a]\r\n for i in range(n-1, -1, -1):\r\n if a[i] == max(a):\r\n print(i+1)\r\n break\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\n\r\nn, m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nnums = []\r\n\r\nfor i in range(len(a)):\r\n nums.append(math.ceil(a[i] / m))\r\n \r\nb = len(a)\r\nwhile (nums[b - 1] != max(nums)):\r\n b -= 1\r\n \r\nprint(b)", "n,m=map(int,input().split())\r\na=[int(x)for x in input().split()]\r\nidx,mx=n,-1\r\nfor i in range(n):\r\n if a[i]>m:\r\n curr=a[i]//m\r\n if a[i]%m:\r\n curr+=1\r\n if curr>=mx:\r\n mx=curr;idx=i+1\r\n\r\nprint(idx)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntemp = [1, 1]\r\nfor i in range(n):\r\n if a[i] % m == 0 and a[i] // m >= temp[1]:\r\n temp[1] = a[i] // m\r\n temp[0] = i + 1\r\n elif a[i] % m != 0 and a[i] // m + 1 >= temp[1]:\r\n temp[1] = a[i] // m + 1\r\n temp[0] = i + 1\r\nprint(temp[0])\r\n", "a,b=map(int,input().split())\nstartlist=list(map(int,input().split()))\n\nwhile max(startlist)>b:\n startlist=[x-b for x in startlist]\n\nfor x in range(0,a):\n if startlist[x]>0:\n final=x\n\nprint(final+1)", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ntotal = n\r\nx = 0\r\nwhile total > 0:\r\n for i in range(n):\r\n if a[i] <= 0:\r\n continue\r\n a[i] -= m\r\n if a[i] <= 0:\r\n total -= 1\r\n x = i + 1\r\nprint(x)", "l1=[int(i) for i in input().split()]\r\nn=l1[0]\r\nm=l1[1]\r\nl2=[int(j) for j in input().split()]\r\nk=0\r\nwhile l2.count(0)!=n-1:\r\n if k!=n-1:\r\n if l2[k]<=m:\r\n l2[k]=0\r\n k+=1\r\n else :\r\n l2[k]=l2[k]-m\r\n k+=1\r\n else :\r\n if l2[k]<=m:\r\n l2[k]=0\r\n k=0\r\n else :\r\n l2[k]=l2[k]-m\r\n k=0\r\nz=max(l2)\r\nprint(l2.index(z)+1)", "# \t450A - Jzzhu and Children\r\nimport math\r\nif __name__== '__main__' :\r\n n,m = [int(x) for x in input().split()]\r\n lst = [int(x) for x in input().split()]\r\n position = 0\r\n max = 0\r\n i = 1\r\n for number in lst :\r\n if math.ceil(number/m) >= max :\r\n max = math.ceil(number/m)\r\n position = i\r\n i += 1\r\n print(position)", "\r\nimport math\r\nn,m = map(int,input().split())\r\n\r\narr = list(map(int,input().split()))\r\n\r\n\r\n\r\nindex = 0\r\nmaxVal = float(\"-inf\")\r\n\r\nfor i,num in enumerate(arr):\r\n val = math.ceil(num/m)\r\n\r\n if val>=maxVal:\r\n maxVal = val\r\n index = i\r\n\r\n'''\r\nprint(index)\r\nprint(maxVal)\r\n'''\r\n\r\nprint(index+1)\r\n", "# // Problem: A. Jzzhu and Children\r\n# // Contest: Codeforces - Codeforces Round #257 (Div. 2)\r\n# // URL: https://codeforces.com/problemset/problem/450/A\r\n# // Memory Limit: 256 MB\r\n# // Time Limit: 1000 ms\r\nfrom math import ceil\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=[]\r\nfor i in l:\r\n\tl2.append(ceil(i/m))\r\nm=max(l2)\r\n# print(m)\r\n\r\nres=0\r\nc=l2.count(m)\r\n\r\nif c==n:\r\n\tprint(n)\r\nelse:\r\n\tfor i in range(n-1,-1,-1):\r\n\t\t# print(l[i],i)\r\n\t\tif l2[i]==m:\r\n\t\t\tres=i+1\r\n\t\t\tbreak\r\n\tprint(res)\r\n\r\n", "n, m = map(int, input().split())\r\nseq = tuple(map(int, input().split()))\r\n\r\nlines = [[] for _ in range((max(seq) - 1) // m + 1)]\r\nfor i in range(n):\r\n lines[(seq[i] - 1) // m].append(i)\r\n\r\nprint(lines[-1][-1] + 1)\r\n", "n,m=(int(x) for x in input().split())\r\nl=[int(x) for x in input().split()]\r\nl1=[]\r\nfor i in range(0,n):\r\n a=l[i]//m\r\n if(a==l[i]/m):\r\n l1.append(a)\r\n else:\r\n l1.append(a+1)\r\n\r\nmax1=max(l1)\r\n\r\nif(l1.count(max1)==1):\r\n print(l1.index(max1)+1)\r\nelse:\r\n l1.reverse()\r\n ans=l1.index(max1)\r\n print(n-ans)", "z, y = map(int, input().split())\nlst = list(map(int, input().split()))\nmx, idx =0, -1\nfor i in range(z):\n x=(lst[i]//y)+bool(lst[i]%y)\n if x >= mx:\n mx = x\n idx = i\nprint(idx+1)\n\t \t \t \t\t \t \t\t \t", "li = []\r\nn, c = map(int, input().split())\r\ns = list(map(int, input().split()))\r\n\r\nwhile len(li) != n:\r\n \r\n for i in range(1, n+1):\r\n if s[i-1] <= c and s[i - 1] != 0:\r\n s[i-1] = 0\r\n li.append(i)\r\n elif s[i -1] != 0:\r\n s[i-1] -= c \r\n\r\nprint(li[n-1])", "from math import ceil\r\n\r\n\r\nN, M = [int(x) for x in input().split()]\r\n\r\nnumbers = [int(x) for x in input().split()]\r\nmaxi = 0\r\nmaxi_i = 0\r\nfor i in range(len(numbers)):\r\n\r\n numbers[i] = ceil(numbers[i]/M)\r\n\r\n if numbers[i] >= maxi:\r\n maxi = numbers[i]\r\n maxi_i = i\r\n\r\nprint(maxi_i + 1)\r\n", "n, m = input().split()\r\nn, m = int(n), int(m)\r\ns = list(map(int,input().split()))\r\ns = list(enumerate(s))\r\nwhile len(s) > 1:\r\n curr = s.pop(0)\r\n if m < curr[1]:\r\n s.append((curr[0], curr[1]-m))\r\nprint(s[0][0] + 1)\r\n\r\n", "import math\nn,m = map(int,input().split())\na_lst = list(map(int,input().split()))\na_max = 0\nans = 0\nfor i in range(n):\n t_max = math.ceil(a_lst[i]/m)\n if t_max>=a_max:\n a_max=t_max\n ans = i+1\nprint(ans)", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nx=[(x[i],i+1) for i in range(n)]\r\nwhile len(x)>1:\r\n value,index=x.pop(0)\r\n if value>m:\r\n x.append((value-m,index))\r\nprint(x[0][1])\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nf=False\r\nfor i in range(n):\r\n if l[i]<m:\r\n l[i]=0\r\n else:\r\n f=True\r\n if l[i]%m==0:\r\n l[i]=(l[i]//m)-1\r\n else:\r\n l[i]=l[i]//m\r\nif not f:\r\n print(n)\r\nelse:\r\n mx=max(l)\r\n for i in range(n):\r\n if l[n-1-i]==mx:\r\n index=n-i\r\n break\r\n print(index)", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nmainList = l.copy()\r\nindex = []\r\n\r\n\r\ndef mostCanides():\r\n length = 0\r\n for x in l:\r\n if x > m:\r\n break\r\n else:\r\n length = length + 1\r\n\r\n if length == len(mainList):\r\n return length\r\n\r\n while True:\r\n for i in range(n):\r\n if l[i] <= 0:\r\n continue\r\n l[i] -= m\r\n if l[i] <= 0:\r\n last_child = i + 1\r\n if all(candy <= 0 for candy in l):\r\n break\r\n return last_child\r\n\r\n\r\nprint(mostCanides())", "n,m=map(int,input().split())\nl=list(map(int,input().split()))\nls=[]\nls+=[0]*n\na=0\nf=0\nf1=0\nwhile f!=1:\n f1=0\n for i in range(len(l)):\n# print(ls[i],' ',i)\n if ls[i]<l[i] and ls[i]!=-1:\n ls[i]+=m\n a=i+1\n else:\n ls[i]=-1\n f1+=1\n if f1==len(l):\n f=1\nprint(a)", "n , m = map(int,input().split())\nlst = list(map(int,input().split()))\nmx , idx = 0 ,-1\nfor i in range(n):\n x = (lst[i]//m)+bool(lst[i]%m)\n if x >= mx :\n mx = x\n idx = i\nprint(idx+1)\n\t \t\t \t\t \t\t\t\t\t \t \t \t \t \t\t \t \t", "from sys import stdin\r\n\r\nmn = input()\r\nmn = mn.split(' ')\r\nn = int(mn[0])\r\nm = int(mn[1])\r\ncandies = input()\r\ncandies = candies.split(' ')\r\ncandies = [int(i) for i in candies]\r\n\r\nhighest = 0\r\npos = 0\r\nfor i in range(0,n):\r\n times = candies[i] // m\r\n #print(candies[i], m)\r\n if candies[i] % m == 0:\r\n times -= 1\r\n if times >= highest:\r\n highest = times\r\n pos = i + 1\r\n #print('highest', highest, 'pos', pos, 'times', times, 'i', i)\r\n\r\nprint(pos)\r\n\r\n", "l=list(map(int,input().split()))\r\nn,m=l[0],l[1]\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n l[i]=(l[i]//m+(l[i]%m>0),i)\r\nl.sort()\r\nprint(l[-1][1]+1)\r\n", "from collections import deque\r\n\r\nx = input()\r\nn = int(x.split()[0])\r\nm = int(x.split()[1])\r\na = input()\r\na = a.split()\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\na = deque(a)\r\n\r\nb = []\r\nfor i in range(n):\r\n b.append(i + 1)\r\nb = deque(b)\r\n\r\nwhile len(a) != 0:\r\n if a[0] <= m:\r\n a.popleft()\r\n if len(b) > 1:\r\n b.popleft()\r\n else:\r\n a.append(a[0] - m)\r\n a.popleft()\r\n b.append(b[0])\r\n b.popleft()\r\n\r\nprint(b[0])\r\n \r\n", "import math\r\nn,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nma=0\r\nind=0\r\nfor i in range(n):\r\n if(math.ceil(lst[i]/m)>=ma):\r\n ind=i+1\r\n ma=math.ceil(lst[i]/m)\r\nprint(ind)", "v1,v2=map(int,input().split())\r\nv=list(map(int,input().split()))\r\nvv=[]\r\nfor i in v:\r\n vv.append((i-1)//v2)\r\nvv=vv[::-1]\r\nprint(v1-vv.index(max(vv)))", "n, m = map(int, input().split())\r\na = list(map(list, zip(range(n), map(int, input().split()))))\r\n\r\nout = 0\r\nwhile a:\r\n out = a[0][0]\r\n a[0][1] -= m\r\n if a[0][1] > 0:\r\n a.append(a[0])\r\n del a[0]\r\n\r\nprint(out + 1)\r\n\r\n", "a = list(map(int, input().split()))\r\n\r\n# print(a)\r\n\r\nn = a[0]\r\nm = a[1]\r\n\r\nstu = list(map(int, input().split()))\r\n\r\n# print(stu)\r\n\r\nstu_position = []\r\n\r\nk = 0\r\nwhile k< len(stu):\r\n stu_position.append([stu[k], k+1])\r\n k = k+1\r\n\r\n# print(stu_position)\r\n\r\n\r\nwhile(len(stu_position) >= 1):\r\n if(len(stu_position) == 1):\r\n print(stu_position[0][1])\r\n break\r\n else:\r\n if(stu_position[0][0] <= m):\r\n del stu_position[0]\r\n else:\r\n d = [stu_position[0][0] - m, stu_position[0][1]]\r\n del stu_position[0]\r\n stu_position.append(d)\r\n\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\n\r\ncount = n\r\nlastChild = 0\r\nwhile count > 0:\r\n for i in range(n):\r\n if a[i] <= 0:\r\n continue\r\n a[i] -= m\r\n if a[i] <= 0:\r\n count -= 1\r\n lastChild = i + 1\r\n\r\nprint(lastChild)\r\n\r\n \r\n", "import math\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\n\nmaxRounds = 0\nlastChildIndex = -1\n\nfor i in range(n):\n rounds = math.ceil(a[i] / m)\n if rounds >= maxRounds:\n maxRounds = rounds\n lastChildIndex = i\n\nprint(lastChildIndex + 1)\n\n \t \t\t \t \t \t\t\t\t\t \t\t \t\t \t\t", "n, m = map(int, input().split())\r\nliste = []\r\nsira = list(map(int, input().split()))\r\nfor i in range(n):\r\n liste.append((sira[i]/m).__ceil__())\r\nliste.reverse()\r\nprint(len(liste)-liste.index(max(liste)))\r\n", "import math\r\nn,m= input().split()\r\nn=int(n)\r\nm=int(m)\r\nlst = list(map(float, input().rstrip().split()))\r\nmax=0\r\nfor i in range(len(lst)):\r\n c = math.ceil(lst[i]/m)\r\n if c >= max:\r\n index=i\r\n max= c\r\nprint(index+1)", "n, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na = [((x + m - 1) // m, i) for i, x in enumerate(a)]\r\na.sort()\r\nprint(a[-1][1] + 1)\r\n", "import math\nn, m = map(int,input().split())\nlst = list(map(int,input().split()))\nmx = 0\nidx = 0\nfor i in range(n):\n if math.ceil(lst[i] / m) >= mx:\n mx = math.ceil(lst[i] / m)\n idx = i\n\nprint(idx+1)\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())\nlst=list(map(int,input().split()))\nmaxi=0\nidx=-1\nfor i in range(a):\n x=(lst[i]//b)+bool(lst[i]%b)\n if x>=maxi:\n maxi=x\n idx=i\nprint(idx+1)\n \t\t\t \t \t\t \t\t \t\t", "from queue import Queue\r\nfrom collections import deque\r\nn, m = map(int, input().split())\r\nmops = Queue()\r\nnumbers = Queue()\r\nmas=list(map(int, input().split()))\r\nfor i in range(n):\r\n mops.put(mas[i])\r\n numbers.put(i+1)\r\n\r\nwhile (mops.empty() == False):\r\n z = mops.queue[0] - m\r\n \r\n if z <=0:\r\n num = numbers.get()\r\n mops.get()\r\n \r\n else:\r\n mops.put(z)\r\n numbers.put(numbers.queue[0])\r\n numbers.get()\r\n mops.get()\r\n \r\nprint(num)\n# Mon Dec 19 2022 00:12:09 GMT+0300 (Moscow Standard Time)\n", "n, m = map(int, input().split())\r\n*a, = map(int, input().split())\r\nfor i in range(n):\r\n a[i] = [a[i], i + 1]\r\nwhile len(a) - 1:\r\n a[0][0] -= m\r\n if a[0][0] > 0:\r\n a.append(a[0])\r\n del a[0]\r\nprint(a[0][1])\r\n", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\nimport math\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmaxo=1\r\nlast=-1\r\nindex=1\r\nfor i in a:\r\n e=math.ceil(i/m)\r\n if e>=maxo:\r\n maxo=e\r\n last=index\r\n index+=1\r\nprint(last)\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", "from math import ceil\r\n\r\nn, m = [int(x) for x in input().split()]\r\n\r\nl = [int(x) for x in input().split()]\r\n\r\ntest = []\r\nfor i in l:\r\n test.append(ceil(i/m))\r\n\r\nmx = max(test)\r\n\r\nl_main = n - test[::-1].index(mx) - 1\r\n\r\n\r\nprint(l_main+1)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nx=0\r\nwhile a.count(0)<n-1:\r\n if x>n-1:\r\n x=0\r\n if m>=a[x]:\r\n a[x]=0\r\n else:\r\n a[x]-=m\r\n x+=1\r\nfor x in a:\r\n if x>0:\r\n print(a.index(x)+1)\r\n break", "from math import ceil\r\nkids, candies_per_kid = map(int, input().split())\r\ncandies_asked = list(map(int, input().split()))\r\naux = 0\r\nlst = []\r\nfor i in range(kids):\r\n parcial = (ceil(candies_asked[i]/candies_per_kid))\r\n i += 1\r\n if parcial >= aux:\r\n aux = parcial\r\n lst.append(i)\r\nprint(max(lst)) ", "n, m = (int(i) for i in input().split())\na = (int(i) for i in input().split())\nma = 0\nfor i, e in enumerate(a):\n cur = (e + m - 1) // m\n if cur >= ma:\n res = i + 1\n ma = cur\nprint(res)\n", "import math\nn,m = map(int, input().split())\nlst = list(map(int, input().split()))\nidx = -1\nmx = 0\nfor i in range(n):\n x = math.ceil(lst[i]/m)\n if x>=mx:\n mx=x\n idx=i\nprint(idx+1)\n \t\t\t\t \t\t\t \t \t \t\t\t \t \t \t\t", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\na = 0\r\ny = 0\r\nfor i in range(n):\r\n diff = x[i] - m\r\n count = 0\r\n while diff > 0:\r\n diff -= m\r\n count += 1\r\n if count >= a:\r\n a = count\r\n y = i+1\r\nif y == 0:\r\n print(n)\r\nelse:\r\n print(y)", "import math\r\nn,b=map(int,input().split())\r\na=[*map(int,input().split())]\r\nm=0\r\nfor i in range(n):\r\n t=math.ceil(a[i]/b)\r\n if t>=m:\r\n k=i\r\n m=t\r\nprint(k+1)", "n,m=map(int,input().rstrip().split())\r\ncandies=list(map(int,input().rstrip().split()))\r\na=[]\r\nfor i in range(n):\r\n a.append(i)\r\ni=0\r\nwhile len(a)>1:\r\n if candies[i]<=m:\r\n candies.pop(i)\r\n a.pop(i)\r\n else: \r\n candies[i]-=m\r\n b=candies.pop(i)\r\n c=a.pop(i)\r\n candies.append(b)\r\n a.append(c)\r\n\r\nprint(a[0]+1)\r\n \r\n", "n, m = map(int, input().split())\r\na = [(i, int(x)) for i, x in enumerate(input().split())]\r\n\r\ni = 0\r\nlast = 0\r\nwhile i < len(a):\r\n if a[i][1] <= m:\r\n last = a[i][0]\r\n else:\r\n a.append((a[i][0], a[i][1] - m))\r\n i += 1\r\nprint(last + 1)\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = [0] * n\nfor i in range(n):\n b[i] = i + 1\n#print(b)\nwhile (len(a) > 1):\n if (a[0] <= m):\n a = a[1:]\n b = b[1:]\n #print(a)\n continue\n a = a[1:] + [a[0] - m]\n b = b[1:] + [b[0]]\n # print(a)\nprint(b[0])", "n,m = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\n\r\nchList = [[a[i],i+1] for i in range(n)]\r\n\r\nwhile len(chList)>1:\r\n val,idx = chList.pop(0)\r\n if val>m:\r\n chList.append([val-m,idx])\r\n \r\nprint(chList[0][1])", "import math\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = math.ceil(max(a) / m)\r\n\r\nfor i in range(n, 0, -1):\r\n if math.ceil(a[i-1] / m) == ans:\r\n print(i)\r\n break", "import math\r\n\r\nn,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nmax_value=0\r\n\r\nfor i in range(1,n+1):\r\n if math.ceil(arr[i-1]/m)>=max_value:\r\n max_value=math.ceil(arr[i-1]/m)\r\n max_index=i\r\nprint(max_index)", "n,m=[int(x) for x in input().split()]\r\na=[(int(x)-1)//m for x in input().split()]\r\na.reverse()\r\nprint(n-a.index(max(a)))", "z,s=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nmaaax=0\r\nx=1\r\nwhile(x):\r\n x=0\r\n for i in range(z):\r\n if l[i]!=0:\r\n l[i]=max(0,l[i]-s)\r\n maaax=i\r\n x=1\r\nprint(maaax+1)", "import math\r\n\r\nn, m = map(int, input().split())\r\na = [math.ceil(int(i) / m) for i in input().split()]\r\nidx = 0\r\nfor i, ai in enumerate(a):\r\n if ai >= a[idx]:\r\n idx = i\r\nprint(idx+1)\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nqueue = list(range(n))\ncandies = [0] * n\nlast_child = -1\n\nwhile queue:\n child = queue[0]\n candies[child] += m\n if candies[child] < a[child]:\n queue.append(queue.pop(0))\n else:\n last_child = queue.pop(0)\n\nprint(last_child + 1)\n", "n, m = [int(i) for i in input().split()]\r\nnums = list(map(int, input().split()))\r\nplaces = [i for i in range(1, len(nums)+1)]\r\n\r\nwhile len(places) > 1:\r\n nums[0] -= m\r\n if nums[0] > 0:\r\n nums.append(nums[0])\r\n places.append(places[0])\r\n nums.pop(0)\r\n places.pop(0)\r\n\r\nprint(*places)\r\n", "from math import*\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nmaxd=0\r\nfor i in range(n):\r\n delitel=ceil(a[i]/m)\r\n if delitel>=maxd:\r\n maxd=delitel\r\n ans=i+1\r\nprint(ans)", "n, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nb = [i for i in range(n)]\r\nwhile len(a) > 1:\r\n x = a.pop(0)\r\n y = b.pop(0)\r\n if x > m:\r\n a.append(x-m)\r\n b.append(y)\r\nprint(b[0]+1)\r\n\r\n", "import math\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nfor i in range(len(l)):\r\n if l[i]<=m:\r\n l[i]=0\r\n \r\nmaxi=0\r\nans=0\r\nfor x in range(len(l)):\r\n if math.ceil(l[x]/m)>=maxi:\r\n maxi=math.ceil(l[x]/m)\r\n ans=x\r\nprint(ans+1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import deque\r\na = [int(i) for i in input().split()]\r\nnumOfCandy = a[1]\r\nb = deque([int(i) for i in input().split()])\r\nbLen = len(b)\r\nindexList = deque([])\r\nindexStart = 1\r\nwhile indexStart <= bLen:\r\n indexList.append(indexStart)\r\n indexStart += 1\r\n\r\nwhile len(b) != 1:\r\n if b[0] - numOfCandy <= 0:\r\n b.popleft()\r\n indexList.popleft()\r\n else:\r\n b.append(b[0] - numOfCandy)\r\n b.popleft()\r\n indexList.append(indexList[0])\r\n indexList.popleft()\r\n\r\nprint(indexList[0])\r\n", "import math\r\ns=input().split()\r\namount,candy=int(s[0]),int(s[1])\r\nchild=[int(x) for x in input().split()]\r\namountcan=[]\r\nfor i in child:\r\n amountcan.append(math.ceil(i/candy))\r\ntimes=amountcan.count(max(amountcan))\r\nans=[]\r\nfor q in range(times):\r\n index=amountcan.index(max(amountcan))\r\n ans.append(index)\r\n amountcan[index]=0\r\nprint(max(ans)+1)\r\n", "n,c=list(map(int,input().rstrip().split()))\r\nlst=list(map(int,input().strip().split()))\r\nd={}\r\nfor i in range(n):\r\n d[i+1]=lst[i]\r\n\r\ni=1\r\nans=None\r\n\r\nwhile True:\r\n if i not in d:\r\n pass\r\n else:\r\n d[i]-=c\r\n if d[i]<=0:\r\n del d[i]\r\n if d=={}:\r\n ans=i\r\n break\r\n i=(i+1)%(n+1)\r\n \r\nprint(ans)\r\n", "n,*candy=input().split(' ')\r\ncandy=int(*candy)\r\nn=int(n)\r\nchildCandy=list(map(int,input().split()))\r\nindexList=[x+1 for x in range(len(childCandy))]\r\nwhile len(indexList)!=1:\r\n if childCandy[0] - candy > 0:\r\n childCandy.append(childCandy[0]-candy)\r\n indexList.append(indexList[0])\r\n childCandy.pop(0)\r\n indexList.pop(0)\r\nprint(indexList[0])", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\ns=[]\r\nfor i in range(n):\r\n if(a[i]%k==0):\r\n p=a[i]//k\r\n s.append(p)\r\n else:\r\n p=a[i]//k+1 \r\n s.append(p)\r\nt=s[0]\r\nfor i in range(n):\r\n if(t<=s[i]):\r\n t=s[i]\r\n m=i\r\nprint(m+1)", "import math\nn , m = (map(int,input().split()))\nlst = list(map(int , input().split()))\nmaxx = 0\nindex = 0\nfor i in range(n):\n if math.ceil(lst[i] / m ) >= maxx:\n maxx = math.ceil(lst[i] / m)\n index = i\nprint(index+1)\n\t\t \t \t \t\t\t\t \t\t \t \t\t\t\t\t\t\t \t \t", "from collections import deque\r\nn,m = (int(x) for x in input().split())\r\na_deque = deque(list(x) for x in enumerate(map(int,input().split())))\r\nchild = a_deque.popleft()\r\nlast_child = -1\r\nchildren_gone = 0\r\nwhile True:\r\n if m >= child[1]:\r\n children_gone +=1\r\n last_child = child[0]\r\n else:\r\n child[1] = child[1] - m\r\n a_deque.append(child)\r\n try:\r\n child = a_deque.popleft()\r\n except:\r\n break\r\nprint(last_child+1)\r\n", "n, m = map(int, input().split())\r\nsp_det = list(map(int, input().split()))\r\nn_det = [i for i in range(1, n + 1)]\r\nj = 0\r\nwhile len(sp_det) > 1:\r\n sp_det[0] -= m\r\n if sp_det[0] <= 0:\r\n del sp_det[0], n_det[0]\r\n else:\r\n sp_det = sp_det[1:] + [sp_det[0]]\r\n n_det = n_det[1:] + [n_det[0]]\r\nprint(n_det[0])", "from collections import deque\r\nn,m = map(int,input().split())\r\nline_up = list(map(int,input().split()))\r\n#create new list of elements with their indeces\r\nfor i in range(n):\r\n line_up[i] = [i+1,line_up[i]]\r\nline_up = deque(line_up)\r\n\r\nwhile len(line_up) > 1:\r\n popped = line_up.popleft()\r\n if popped[1] > m:\r\n popped[1] -= m\r\n line_up.append(popped)\r\n\r\nprint(line_up[0][0])", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=[0]*n\r\nwhile ans.count(0)>1:\r\n x=0\r\n while ans.count(0)>1 and x<n:\r\n if a[x]<1:\r\n ans[x]=1\r\n a[x]-=m\r\n x+=1\r\nprint(ans.index(0)+1)\r\n", "(n, m) = map(int, input().split())\r\nchildren = list(map(int, input().split()))\r\n\r\ngiven = 0\r\nwanted = sum(children)\r\n\r\nwhile given < wanted:\r\n for i in range(len(children)):\r\n if children[i] == 0:\r\n continue\r\n\r\n given += min(m, children[i])\r\n children[i] -= min(m, children[i])\r\n if wanted == given:\r\n print(i+1)\r\n", "import math\n\nn, m = input().split()\nn = int(n)\nm = int(m)\nwl = input().split()\n\ncnt = 0\nloc = 0\n\nfor i in range(n):\n a = int(wl[i])\n if(math.ceil(a/m) >= cnt):\n loc = i\n cnt = math.ceil(a/m)\n\nprint(loc+1)\n \t \t\t \t \t \t \t \t \t", "n,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\na=[x//m if x%m==0 else x//m+1 for x in a]\r\na.reverse()\r\nprint(n-a.index(max(a)))", "n,m=list(map(int,input().split())) \r\na=list(map(int,input().split())) \r\nk=0 \r\nnum=-1\r\nfor i in range(n):\r\n\tg=a[i]//m \r\n\tif(a[i]%m!=0): \r\n\t\tg+=1\r\n\tif(g>=k):\r\n\t\tk=g\r\n\t\tnum=i \r\nprint(num+1)", "from math import ceil\r\nn,cnd = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\na = max(lst)\r\nif a<=cnd:\r\n print(n)\r\nelse :\r\n for i in range(len(lst)):\r\n lst[i] = ceil(lst[i]/cnd)\r\n print(n-lst[::-1].index(max(lst)))\r\n \r\n\r\n\r\n ", "n,m=[int(i) for i in input().split()]\r\narr=[int(i) for i in input().split()]\r\n\r\ndef last_one(arr,n):\r\n p=0\r\n for i in arr:\r\n if i>0:p+=1\r\n return p==1\r\n\r\nwhile True:\r\n for i in range(n):\r\n if last_one(arr,n):\r\n ans=arr.index(max(arr))+1\r\n print(ans)\r\n exit()\r\n if arr[i]>0:\r\n arr[i]=arr[i]-m\r\n \r\n ", "n,m = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\n\r\ntracker=1\r\na=0\r\nwhile max(lst)>0:\r\n lst[a]-=m\r\n if lst[a]<=0:\r\n tracker = a+1\r\n a+=1\r\n a%=n\r\n\r\nprint(tracker)\r\n\r\n\r\n", "import math\na,b = map(int,input().split())\nlst = list(map(int,input().split()))\nidx = -1\nmx = 0\nfor i in range(a):\n q = math.ceil(lst[i]/b)\n if q >= mx :\n mx = q\n idx = i\nprint(idx+1)\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 Dec 22 12:07:40 2022\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nx = input()\r\nx = x.split()\r\nn = int(x[0])\r\nm = int(x[1])\r\ny = input()\r\ny = y.split()\r\nd = {}\r\nfor i in range(1,n+1):\r\n d[i]=int(y[i-1])\r\nz = list(range(1,n+1))\r\n\r\ni =1\r\nwhile len(z)>1:\r\n\r\n z.remove(i)\r\n if d[i]>m:\r\n d[i]-=m\r\n z.append(i)\r\n i=z[0]\r\nprint(i)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(range(1, n+1))\r\ni = 0\r\nwhile a.count('h') < n - 1:\r\n if a[i] != 'h':\r\n a[i] -= m\r\n if a[i] <= 0:\r\n a[i] = 'h'\r\n b[i] = 'h'\r\n else:\r\n a.append(a[i])\r\n a.pop(i)\r\n b.append(b[i])\r\n b.pop(i)\r\n i -= 1\r\n i += 1\r\n if i > n-1:\r\n i = 0\r\n\r\nfor i in range(len(b)):\r\n if b[i] != 'h':\r\n print(b[i])\r\n break\r\n \r\n \r\n", "import math\r\n\r\nn,k=([int(x) for x in input().split()])\r\nl1=[]\r\nl1.append(([int(x) for x in input().split()]))\r\nl2=l1[0]\r\na=max(l2)\r\nb=math.ceil(a/k)\r\nl3=[]\r\nfor i in range(n):\r\n if math.ceil(l2[i]/k)==b:\r\n l3.append(i+1)\r\nprint(l3[-1])", "import math\r\n\r\nn,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nstr1 = ''\r\nfor i in range(len(arr)):\r\n arr[i] = math.ceil(arr[i]/m).__round__()\r\nprint(n-arr[::-1].index(max(arr)))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na1 = []\r\nval = -1\r\nmaxi = max(a)\r\nif maxi <= m:\r\n print(len(a))\r\nelse:\r\n for i in range(n):\r\n if a[i] % m == 0:\r\n a1.append(a[i] // m)\r\n else:\r\n a1.append((a[i] // m) + 1)\r\n # print(a1)\r\n for i in range(n):\r\n if a1[i] >= val:\r\n val = a1[i]\r\n ans = i + 1\r\n print(ans)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n a[i] = (a[i] + m - 1) // m\r\nx = max(a)\r\nprint(n - a[::-1].index(x))", "from math import ceil\r\nchild_count, candies = (int(x) for x in input().split())\r\ni = 0\r\nmax_step = 0\r\nchild_needs = [int(x) for x in input().split()]\r\ncur_child_index = 0\r\nsecond_circle = False\r\nwhile i < len(child_needs):\r\n\tif candies < child_needs[i]:\r\n\t\tsecond_circle = True\r\n\t\tcur_child = child_needs[i] - candies\r\n\t\tif ceil(cur_child/candies) >= max_step:\r\n\t\t\tmax_step = ceil(cur_child/candies)\r\n\t\t\tcur_child_index = i + 1\r\n\ti += 1\r\nif second_circle == True:\r\n\tprint(cur_child_index)\r\nelse:\r\n\tprint(child_count)", "import math\nh,m = map(int,input().split())\nlst = list(map(int, input().split()))\nmxidx = -1\nfor i in range(h):\n if math.ceil(lst[i]/m) >= math.ceil(lst[mxidx]/m):\n mxidx = i\n\nprint(mxidx + 1)\n \t\t\t \t\t \t \t \t \t \t\t", "import math\r\n\r\nn, m = map(int, input().split())\r\nv = list(map(int, input().split()))\r\nans = []\r\nmax_val = v[0] / m\r\nind = 0\r\nfor i in range(n):\r\n if math.ceil(v[i] / m) >= max_val:\r\n max_val = math.ceil(v[i] / m)\r\n ind = i+1\r\nprint(ind)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nf={}\r\ny=1\r\nfor f1 in a:\r\n f[f1]=y\r\n y+=1\r\ny=1\r\nwhile len(a)>1:\r\n for i in range(len(a)):\r\n d=a[i]-m*y\r\n if d<=0:\r\n del a[i]\r\n break\r\n else:\r\n y+=1\r\nprint(f[a[0]])", "import math\r\nimport queue\r\n\r\n\r\n# -------- info --------\r\n\r\n# https://codeforces.com/profile/Wolxy\r\n\r\n# -------- solve --------\r\n\r\ndef solve() -> None:\r\n n, m = map(int, input().split(' '))\r\n q = queue.Queue(n)\r\n ls = list(map(int, input().split(' ')))\r\n for i in range(n):\r\n q.put([i + 1, ls[i]])\r\n while q.qsize() > 1:\r\n temp = q.get()\r\n temp[1] -= m\r\n if temp[1] > 0:\r\n q.put(temp)\r\n print(q.get()[0])\r\n\r\n\r\n# -------- main --------\r\n\r\n\r\nT = 1\r\n# T = int(input())\r\nfor _ in range(T):\r\n solve()\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nk=2\r\nfor i in range(n):\r\n if l[i]>m*(k-1):\r\n l1.append(i+1)\r\n while True:\r\n if l[i]<=m*k:\r\n break\r\n else:\r\n k+=1\r\nif len(l1)==0:\r\n print(n)\r\nelse:\r\n print(l1[-1])\r\n\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na=[((a[i]+k-1)//k,i) for i in range(n)]\r\na.sort()\r\nprint(a[-1][1]+1)", "from math import *\r\n\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nt = 0\r\nfor elem in a:\r\n r = ceil(elem/m)\r\n t = max(r,t)\r\n\r\nind = 0\r\nfor i in range(n):\r\n if ceil(a[i]/m) == t:\r\n ind = i + 1\r\n\r\nprint(ind)\r\n", "n, m = map(int, input().split())\r\nh = 0\r\np = 0\r\nv = [i for i in range(1, n + 1)]\r\ng = list(map(int,input().split()))\r\nwhile len(g) != 0:\r\n if g[0] <= m:\r\n g.remove(g[0])\r\n p = v[0]\r\n v.remove(v[0])\r\n\r\n else:\r\n g[0] -= m\r\n h = g[0]\r\n g.remove(g[0])\r\n g.append(h)\r\n h = v[0]\r\n v.remove(v[0])\r\n v.append(h)\r\nprint(p)", "n,m = map(int,input().split())\r\nx = list(map(lambda q:int(q), input().split(\" \")))\r\nc=0\r\nfor i in range(n):\r\n if x[i]%m==0:\r\n a=x[i]//m\r\n else:\r\n a=x[i]//m+1\r\n if c<=a:\r\n c=a\r\n ans=i\r\nprint(ans+1)\r\n\r\n\r\n ", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nbm=0\r\ncm=0\r\nfor i in range(n):\r\n cm=a[i]//m\r\n b=a[i]%m\r\n if b!=0:\r\n cm=cm+1\r\n if cm>=bm:\r\n bm=cm\r\n r=i+1\r\n \r\nprint(r)", "from collections import*\r\nq = deque()\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n q.append([a[i],i+1])\r\nwhile len(q) != 1:\r\n cur = q.popleft()\r\n if (cur[0] - m) > 0:\r\n q.append([cur[0]-m, cur[1]])\r\nprint(q[0][1])\r\n# Sat Nov 19 2022 18:45:12 GMT+0300 (Moscow Standard Time)\r\n# Sat Nov 19 2022 18:48:19 GMT+0300 (Moscow Standard Time)\n# Sat Nov 19 2022 18:54:28 GMT+0300 (Moscow Standard Time)\n", "import math\nn,m=map(int,input().split())\nlst=list(map(int,input().split()))\nmaxi=0\nfor i in range(len(lst)):\n if math.ceil(lst[i]/m)>=maxi:\n maxi=math.ceil(lst[i]/m)\n id=i\nprint(id+1)\n\n\t \t \t \t\t\t\t\t \t\t\t\t \t \t \t \t\t\t", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(enumerate(a, 1))\r\np = None\r\nwhile b:\r\n p = b[-1][0]\r\n b = [(e[0], e[1] - m) for e in b if e[1] - m > 0]\r\nprint(p)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt = []\r\nfor i in range(n):\r\n if a[i] % m != 0:\r\n t.append((a[i] // m + 1,1 + i))\r\n else:\r\n t.append((a[i] // m, 1 + i))\r\n\r\nt.sort()\r\ntimes, pos = t[-1]\r\nprint(pos)", "from collections import deque\n\n_, price = map(int, input().split())\narr = list(map(int, input().split()))\nq = deque()\nfor i, n in enumerate(arr):\n q.append((n, i))\nans = 0\nwhile q:\n n, i = q.popleft()\n if n - price > 0:\n q.append((n-price, i))\n ans = i\n\nprint(ans+1)\n\n", "n,m= map(int,input().strip().split())\r\nA = list(map(int,input().strip().split()))\r\n\r\nB = max(enumerate(A,1),key=lambda x: ((x[1]//m) + (x[1]%m !=0),x[0]))\r\n\r\nprint(B[0])\r\n\r\n", "import math\r\n\r\nn,m = map(int,input().split(\" \"))\r\nlst = list(map(int,input().split(\" \")))\r\nlast=-1\r\nmaxi =0\r\nfor i in range(n):\r\n if math.ceil(lst[i]/m) >= maxi:\r\n maxi = math.ceil(lst[i]/m) \r\n last = i+1 \r\nprint(last)", "'''input\r\n5 2\r\n1 3 1 4 2\r\n'''\r\nfrom math import ceil\r\nn,m = map(int, input().strip().split())\r\nl = list(map(int, input().strip().split()))\r\nx = max(l)\r\ny = ceil(x/m)\r\nans = -1\r\nfor i,e in enumerate(l):\r\n\tif ceil(e/m)==y:\r\n\t\tans = i+1\r\nprint(ans)", "import math\r\nn,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nli = [0]*n\r\nfor i in range(n):\r\n li[i] = math.ceil(arr[i]/m)\r\nmaxi = max(li)\r\nfor i in range(n-1,-1,-1):\r\n if maxi==li[i]:\r\n print(i+1)\r\n break", "a,b=input().split()\r\nx=int(a)\r\ny=int(b)\r\nlis_2=[]\r\nlis_3=[]\r\nlis_1=list(map(int,input().split()))#lis_1=[1,3,1,5]\r\nfor i in range(1,len(lis_1)+1):\r\n lis_2.append(i)#lis_2=[1,2,3,4]\r\nfor i in range(0,len(lis_1)):\r\n lis_3.append(0)#lis_3=[0,0,0,0]\r\ni=0\r\nwhile(len(lis_1)!=1):\r\n if(lis_1[i]>lis_3[i]):\r\n if(lis_3[i]+y>=lis_1[i]):\r\n elem=lis_1[i]\r\n lis_1.remove(elem)\r\n elem=lis_2[i]\r\n lis_2.remove(elem)\r\n elem=lis_3[i]\r\n lis_3.remove(elem)\r\n else:\r\n elem=lis_1[i]\r\n lis_1.remove(elem)\r\n lis_1.append(elem)\r\n elem=lis_2[i]\r\n lis_2.remove(elem)\r\n lis_2.append(elem)\r\n elem=lis_3[i]\r\n lis_3.remove(elem)\r\n elem=elem+y\r\n lis_3.append(elem)\r\nprint(lis_2[0])", "n, m = map(int,input().split())\na = [int(i) for i in input().split()]\nmx = 0\nans = 0\nfor i in range(n):\n x = a[i]//m\n if a[i] % m != 0:\n x += 1\n if x >= mx:\n mx = x\n ans = i+1\nprint(ans)\n \t \t \t\t \t \t \t\t\t \t\t\t \t", "import math\n\nn, m = map(int,input().split())\narr = list(map(int,input().split()))\n\nans = -1\np = -1\nfor i in range(n):\n d = math.ceil(arr[i] / m)\n\n if d >= ans:\n ans = d\n p = i + 1\nprint(p)\n\n \t \t \t\t\t \t\t\t \t\t", "from math import ceil\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=list(map(lambda x:ceil(x/m),l))\r\nprint(n-(l[::-1].index(max(l))))", "import math\r\nx, y = input().split()\r\nlist= input().split()\r\nlist= [float(i) for i in list]\r\nmax=0\r\nans=0\r\nvar=1\r\nfor i in range(len(list)):\r\n if (math.ceil(float(list[i]/int(y))))>=max:\r\n max= math.ceil(float(list[i]/int(y)))\r\n ans= i+1\r\n continue\r\n else:\r\n continue\r\nprint(ans)", "\r\nn,m=(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nans=0\r\nwhile sum(l)>0:\r\n for i in range(n):\r\n if sum(l)>0:\r\n if l[i]-m>=0:\r\n l[i]=l[i]-m\r\n ans=i+1\r\n elif l[i]>=0:\r\n l[i]=0\r\n ans=i+1\r\n # print(l)\r\n else:\r\n break\r\nprint(ans)\r\n\r\n", "n,m = map(int,input().split())\na = list(map(int, input().split()))\ni = []\nfor x in range(n):\n i.append(x)\nwhile len(a) > 1:\n a[0] -= min(a[0],m)\n if(a[0] != 0):\n a.append(a[0])\n i.append(i[0])\n a.pop(0)\n i.pop(0)\n \nprint(i[0]+1)\n", "import math\nn,m = map(int, input().split())\narr = list(map(int, input().split()))\nans = -1\np = -1\nfor i in range(n):\n d = math.ceil(arr[i]/m)\n if d >= ans:\n ans = d\n p = i + 1\nprint(p)\n\n", "n,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nfor i in range(len(a)):\r\n a[i]=[a[i],i]\r\nqueue=list()\r\nx=0\r\nqueue=a\r\nwhile len(queue)!=1:\r\n if queue[0][0]>m:\r\n w=queue.pop(0)\r\n queue.append([w[0]-m,w[1]])\r\n else:\r\n queue.pop(0)\r\nprint(queue[0][-1]+1)", "## solution a20j_32 ## this is really nice problem\r\ns=input().split()\r\nn,m=[int(e) for e in s]\r\ns2=input().split()\r\na=[int(e) for e in s2]\r\ntimes=int(max(a)/m)+1\r\nlast=a\r\niter=1\r\nwhile iter<=times :\r\n if iter==1 :\r\n last=last\r\n new=[max(x-m,0) for x in a]\r\n if (sum(new)==0) :\r\n break \r\n iter+=1\r\n else :\r\n last=new\r\n new=[max(x-m,0) for x in last]\r\n if (sum(new)==0) :\r\n break \r\n iter+=1\r\ncounter=n-1\r\nwhile counter >=0 :\r\n if (last[counter]>0):\r\n break\r\n else :\r\n counter-=1\r\nprint(counter+1)", "s=[int(i) for i in input().split()]\r\na=s[1]\r\nc=[int(k) for k in input().split()]\r\nl=[]\r\nfor j in range(1,s[0]+1):\r\n l.append(j)\r\n \r\n \r\nwhile(len(l)!=1):\r\n if c[0]<=a:\r\n c.pop(0)\r\n l.pop(0)\r\n else:\r\n c.append(c[0]-a)\r\n c.pop(0)\r\n l.append(l[0])\r\n l.pop(0)\r\n \r\nprint(l[0])\r\n", "n,m=(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\ni=0\r\nj=0\r\n# print(l)\r\n\r\n\r\nwhile j<n: #check\r\n \r\n # print(i)\r\n if l[i]<=0:\r\n i+=1\r\n if i==n:\r\n i=0\r\n continue\r\n else:\r\n l[i]-=m\r\n if l[i]<=0:\r\n j+=1\r\n i+=1\r\n if i==n:\r\n i=0\r\nif i==0:\r\n print(n)\r\nelse:\r\n print(i)\r\n\r\n", "n,m = map(int,input().split())\nmx, idx = 0, -1\nlst = list(map(int,input().split()))\nfor i in range(n):\n x =(lst[i]//m)+bool(lst[i]%m)\n if x >= mx:\n mx = x\n idx = i\nprint(idx+1)\n\n \t\t\t \t\t\t \t\t\t \t\t \t \t \t\t\t\t\t\t\t", "a = list(map(int, input().split()))\r\nchild, konfeta = a[0],a[1]\r\ns = list(map(int, input().split()))\r\nfor i in range(len(s)):\r\n\tif s[i] % konfeta == 0:\r\n\t\tshag = s[i] // konfeta\r\n\telse:\r\n\t\tshag = s[i] // konfeta + 1\r\n\ts[i] = shag\r\nk = 0\r\nfor i in range(1, child):\r\n\tif s[i] >= s[k]:\r\n\t\tk = i \r\nprint(k + 1)\r\n\r\n\r\n", "n = [int(i)for i in input().split()]\r\nl = [int(i)for i in input().split()]\r\nans = []\r\nmax = -10000000\r\nj=0\r\n \r\nfor i in range(len(l)) :\r\n div=0\r\n if(l[i]%n[1]==0):\r\n div=(l[i]//n[1])-1\r\n else:\r\n div=l[i]//n[1] \r\n \r\n if (div >= max):\r\n \r\n max = div \r\n j=i\r\n\r\n\r\nprint(j+1)\r\n ", "n, m = map(int, input().split())\r\na = list((int(i) - 1) // m for i in input().split())\r\nprint(n - a[::-1].index(max(a)))", "import math\r\nl=[int(i) for i in input().split()]\r\nn=l[0]\r\nm=l[1]\r\nl1=[int(i) for i in input().split()]\r\nind=0\r\nma=0\r\nfor i in l1:\r\n if math.ceil(i/m)>ma:\r\n ma=math.ceil(i/m)\r\nfor i in range(len(l1)):\r\n if math.ceil(l1[i]/m)==ma:\r\n ind=i\r\nprint(ind+1)", "from collections import deque\r\nm, n = map(int, input().split())\r\nlst = deque((num + 1, int(i)) for num, i in enumerate(input().split()))\r\nwhile len(lst) > 1:\r\n num, candys = lst.popleft()\r\n if candys > n:\r\n lst.append((num, candys - n))\r\nprint(lst[0][0])\n# Tue Dec 20 2022 12:05:46 GMT+0300 (Moscow Standard Time)\n", "import math\na,b=map(int,input().split())\nlst=list(map(int,input().split()))\nmaxi=0\nidx=-1\nfor i in range(a):\n x=math.ceil(lst[i]/b)\n if x>=maxi:\n maxi=x\n idx=i\nprint(idx+1)\n\t \t\t \t \t \t \t \t\t \t \t\t", "import math\r\nn,m = [int (x) for x in input().split()]\r\nlst = [int (x) for x in input().split()]\r\nlst2=[]\r\nfor i in lst:\r\n lst2.append(int(math.ceil(i/m)))\r\nmax1 = max(lst2)\r\nfor i in range(0,n):\r\n if(lst2[i]==max1):\r\n c=i \r\nprint(c+1)", "n,m = list(map(int,input().split()))\r\nchildlist = list(map(int,input().split()))\r\nchildren = []\r\n\r\nclass Child:\r\n def __init__(self, wanted, has, place):\r\n self.wanted =wanted\r\n self.has = has\r\n self.place= place\r\n \r\n def is_satisfied(self):\r\n if self.has >= self.wanted:\r\n return True\r\n\r\nfor i in range(len(childlist)):\r\n children.append(Child(childlist[i],0,i+1))\r\n\r\nwhile len(children) != 1:\r\n curr = children[0]\r\n curr.has += m\r\n if curr.is_satisfied():\r\n children.pop(0)\r\n else:\r\n children.pop(0)\r\n children.append(curr)\r\nprint(children[0].place)\r\n \r\n ", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\ndq = map(int, input().split())\r\n\r\ndq = deque(dq)\r\ndqIndex = deque()\r\n\r\nfor i in range(n):\r\n dqIndex.append(i + 1)\r\n\r\n# deque([1, 3, 1, 4, 2])\r\n# (1, 1), (2, 3), (3, 1), (4, 4), (5, 2)\r\n# (2, 3), (3, 1), (4, 4), (5, 2)\r\n# (3, 1), (4, 4), (5, 2), (2, 1)\r\n# (4, 4), (5, 2), (2, 1)\r\n# (5, 2), (2, 1), (4, 2)\r\n# (2, 1), (4, 2)\r\n# (4, 2)\r\n\r\nwhile len(dq) > 1:\r\n if dq[0] <= m:\r\n dq.popleft()\r\n dqIndex.popleft()\r\n else:\r\n dq.append(dq[0] - m)\r\n dqIndex.append(dqIndex[0])\r\n dq.popleft()\r\n dqIndex.popleft()\r\n\r\nprint(dqIndex[0])\r\n\r\n\r\n\r\n\r\n", "n, m = list(map(int, input().strip().split()))\r\n\r\ncandies = list(map(int, input().strip().split()))\r\n\r\nCanDict = {}\r\nfor i in range(1,n+1):\r\n CanDict[i] = candies[i-1]\r\n\r\nchildren = list(range(1,n+1))\r\n\r\nwhile len(children) != 1:\r\n if CanDict[children[0]] <= m:\r\n children.remove(children[0])\r\n continue\r\n else:\r\n temp = children[0]\r\n CanDict[children[0]] -= m\r\n children.remove(children[0])\r\n children.append(temp)\r\n\r\nprint(children[0])", "def remove_less_than_n(arr, n):\r\n return [x for x in arr if x > n]\r\n\r\nx, y = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nd = {i: v for i, v in enumerate(arr)}\r\ni = 1\r\n\r\nwhile True:\r\n b = remove_less_than_n(arr, y * i)\r\n if len(b) == 0:\r\n krish = arr[-1]\r\n break\r\n else:\r\n arr = b\r\n i += 1\r\n\r\nitems = list(d.items())[::-1]\r\nfor key, value in items:\r\n if value == krish:\r\n print(key+1)\r\n break\r\n", "n, m = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\nx = []\r\nfor i in arr:\r\n if i % m == 0:\r\n x.append(i // m)\r\n else:\r\n x.append(i // m + 1)\r\nif x.count(max(x)) == 1:\r\n print(x.index(max(x)) + 1)\r\nelse:\r\n x = x[::-1]\r\n print(n - (x.index(max(x))))", "info = [int(x) for x in input().split()]\nmore_info = [int(x) for x in input().split()]\nsomething = []\nfor i in range(1,info[0] + 1):\n something.append([])\n something[-1].append(i)\n something[-1].append(more_info[i- 1])\nwhile len(something) != 1:\n something[0][1] -= info[1]\n if something[0][1] <= 0:\n x = something.pop(0)\n else:\n x = something.pop(0)\n something.append(x)\nprint(something[0][0])", "n,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nif a[0]%m==0:\r\n res=a[0]//m\r\nelse:\r\n res=a[0]//m+1\r\npos=0\r\nfor i in range(1,n):\r\n if a[i]%m==0:\r\n if a[i]//m>=res:\r\n res=a[i]//m\r\n pos=i\r\n else:\r\n if a[i]//m+1>=res:\r\n res=a[i]//m+1\r\n pos=i\r\nprint(pos+1)", "import math\r\ninputs = [int(num) for num in input().split()]\r\nn = inputs[0]\r\nm = inputs[1]\r\nlist1 = [int(num) for num in input().split()]\r\nmax1=0\r\nind=0\r\nfor i in range(0,n):\r\n if(math.ceil(list1[i]/m)>=max1):\r\n max1=math.ceil(list1[i]/m)\r\n ind=i\r\nprint(ind+1)", "from collections import deque\r\nfrom math import ceil\r\n# n, m = [int(x) for x in input().split()]\r\nn, m = map(int, input().split())\r\ncandies = [int(x) for x in input().split()]\r\n \r\n# children = deque([int(x) for x in range(1, n + 1)])\r\n# home = []\r\n \r\nmax_num = 0\r\ncounter = 0\r\ncandies_dict = {}\r\n \r\nfor k in candies:\r\n counter += 1\r\n candies_dict[counter] = k\r\n \r\n \r\nfor i in candies:\r\n result = ceil(i / m)\r\n if result >= max_num:\r\n max_num = result\r\n max_candies = i\r\n \r\n# print(candies_dict)\r\n# print(max_candies)\r\n \r\nmax_keys = []\r\n \r\nfor k, v in candies_dict.items():\r\n if v == max_candies:\r\n max_keys.append(k)\r\n \r\nprint(max_keys[-1])", "import math\r\n\r\ndef findTheLastToGo():\r\n data = input().split(maxsplit=1)\r\n noOfChild= int(data[0]) #Number of Child\r\n candToFirst=int(data[1]) #Number of candies to give to the first kid in the line\r\n candToEachKid=input().split(maxsplit=noOfChild) #Number of candies to give to each child\r\n \r\n #Casting the Str Array to a Int Array\r\n for x in range (noOfChild):\r\n candToEachKid[x]=int(candToEachKid[x])\r\n \r\n maxLaps=-1\r\n numOfLaps=0\r\n index=1\r\n lastKidToGo=0\r\n for cand in candToEachKid:\r\n numOfLaps=math.ceil(cand/candToFirst)\r\n if(numOfLaps>=maxLaps):\r\n maxLaps=numOfLaps\r\n lastKidToGo=index\r\n index+=1\r\n print(f\"{lastKidToGo}\")\r\nfindTheLastToGo()", "import math\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nq=[i+1 for i in range(n)]\r\nj=0\r\nwhile(j<len(q)):\r\n if (a[j]>m):\r\n a.append(a[j]-m)\r\n q.append(q[j])\r\n j+=1 \r\nprint(q[-1])\r\n", "n,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nch=[i for i in range(1,n+1)]\r\nj=0\r\nwhile len(ch)!=1:\r\n\tif(l[j]>c):\r\n\t\tch.append(ch[0])\r\n\t\tch.pop(0)\r\n\t\tl.append(l[j]-c)\r\n\t\tl.pop(0)\r\n\telse:\r\n\t\tch.pop(0)\r\n\t\tl.pop(0)\r\nprint(ch[0])\t", "import math \r\nn,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nind=n\r\nmx=0\r\n\r\nfor i in range(n):\r\n if(arr[i]==m):\r\n arr[i]=0\r\n else:\r\n \r\n arr[i]=int(math.ceil(arr[i]/m))\r\n \r\nfor i in range(n):\r\n if(arr[i]>=mx):\r\n mx=arr[i]\r\n ind=i+1\r\n \r\n \r\n \r\nprint(ind)\r\n \r\n\r\n \r\n \r\n \r\n \r\n", "n,m = map(int,input().split())\narr = list(map(int,input().split()))\nfor i in range(n):\n arr[i] = (arr[i]-1)//m\narr.reverse()\nprint(n - arr.index(max(arr)))\n \t\t\t \t \t\t\t \t\t \t\t", "def inp(): # int inputs\r\n return (int(input()))\r\n\r\n\r\ndef inlt(): # list inputs\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr(): # string inputs\r\n s = input()\r\n return (list(s[:len(s)]))\r\n\r\n\r\ndef invr(): # space sepreated intergel varibales\r\n return (map(int, input().split()))\r\n\r\n\r\ncal = inlt()\r\nn = cal[0]\r\nm = cal[1]\r\nfingers = inlt()\r\n\r\n# making my own logical queue\r\ny = []\r\nhead = 0\r\ntail = n-1\r\n\r\nfor i in range(0, n):\r\n y.append((i, fingers[i]))\r\n\r\nwhile True:\r\n (a, b) = y[head]\r\n if (head == tail):\r\n print(a+1)\r\n break\r\n else:\r\n ammended = b - m\r\n if (ammended <= 0):\r\n head += 1\r\n else:\r\n y.append((a, ammended))\r\n head += 1\r\n tail += 1", "from collections import deque\r\n\r\n\r\ndef main():\r\n n, m = get_list_int()\r\n children = deque([(val, i + 1) for i, val in enumerate(get_list_int())])\r\n last_num = 0\r\n\r\n while children:\r\n remaining, num = children.popleft()\r\n if m >= remaining:\r\n last_num = num\r\n else:\r\n children.append((remaining - m, num))\r\n\r\n print(last_num)\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\n\r\nchildren, candies = input().split()\r\n\r\nline = list(int(i) for i in input().split())\r\n\r\nmax = 0\r\nlast = 0\r\n\r\nfor i in range(int(children)):\r\n\r\n var = math.ceil(line[i]/int(candies))\r\n\r\n if var >= max:\r\n max = math.ceil(line[i]/int(candies))\r\n last = i+1\r\n\r\nprint(last)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nif max(a) <= m:\r\n print(n)\r\nelse:\r\n f =True\r\n ans = 0\r\n while f:\r\n f = False\r\n for i in range(n):\r\n if a[i] > 0:\r\n a[i] -= m\r\n ans = i+1\r\n f = True\r\n print(ans)\r\n\r\n \r\n\r\n\r\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nmax_div=(max(x)+m-1)//m\r\nfor i in range(n):\r\n if ((x[i]+m-1)//m==max_div):\r\n ans=i\r\nprint(ans+1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\np = max(a)\nif p%m == 0:\n p = max(a)//m -1\nelse :\n p = max(a)//m\n# print(p, a, m)\nfor i in range(n):\n if a[i] > m*p:\n a[i] = a[i] - m*p\n else :\n a[i] = 0\n# print(a)\nans = 0\nfor i in range(n-1, -1, -1):\n if a[i] != 0:\n ans = i+1\n break\nprint(ans)", "n_, m = input().split()\r\nn_ = int(n_)\r\nm = int(m)\r\nn = input().split()\r\nfor i in range(n_):\r\n n[i] = int(n[i])\r\nflag = True\r\nwhile flag:\r\n for i in range(n_):\r\n if n[i] != '.' and flag:\r\n j = i + 1\r\n if n[i] - m <= 0:\r\n n[i] = '.'\r\n else:\r\n n[i] -= m\r\n if n.count('.') == len(n):\r\n flag = False\r\nprint(j)", "amount, give = [int(x) for x in input().split()]\r\nchildren = [int(x) for x in input().split()]\r\nanswer = 0\r\ncounter = 0\r\ni = 0\r\n\r\nwhile True:\r\n if i == amount:\r\n i = 0\r\n if counter == amount:\r\n break\r\n if children[i] <= 0:\r\n counter += 1\r\n answer = i\r\n else:\r\n counter = 0\r\n answer = 0\r\n children[i] -= give\r\n i += 1\r\n\r\nprint(answer + 1)", "\r\n\r\ndef xqc():\r\n n , m = [int(x) for x in input().split()]\r\n q = [int(x) for x in input().split()]\r\n\r\n\r\n ans = 0\r\n index = 0\r\n for i in range(n):\r\n if q[i]//m == q[i]/m:\r\n if ans <= q[i]//m:\r\n ans = q[i]//m\r\n index = i\r\n else:\r\n if ans <= q[i]//m+1:\r\n ans = q[i]//m+1\r\n index = i\r\n\r\n print(index+1)\r\n\r\n\r\n\r\n\r\nxqc()\r\n", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nr = l[:]\r\nindex = []\r\nfor i in range(1, n+1):\r\n index.append(i)\r\n\r\nwhile(len(l) != 0):\r\n r[0] -= m\r\n if r[0] <= 0:\r\n temp = index[0]\r\n r.pop(0)\r\n l.pop(0)\r\n index.pop(0)\r\n else:\r\n trash1 = r[0]\r\n trash2 = l[0]\r\n trash3 = index[0]\r\n r.pop(0)\r\n l.pop(0)\r\n index.pop(0)\r\n r.append(trash1)\r\n l.append(trash2)\r\n index.append(trash3)\r\n\r\nprint(temp) \r\n \r\n ", "from collections import deque\n\ndef solve(l,m):\n ll = []\n for i in range(len(l)):\n ll.append((l[i], i))\n q = deque(ll)\n last = -1\n while len(q) > 0:\n if q[0][0] > m:\n q[0] = (q[0][0]-m,q[0][1])\n last = q[0][1]\n q.rotate(-1)\n else:\n last = q[0][1]\n q.popleft()\n return last\n\nn,m=map(int,input().split(\" \"))\nl=list(map(int, input().split(\" \")))\nprint (solve(l,m)+1)\n \n ", "class Queue:\r\n def __init__ (self):\r\n self.data = []\r\n self.index = 0 # where to be added also says the size with help of prev\r\n self.prev = 0\r\n return \r\n def put(self, key):\r\n self.data.append(key)\r\n self.index += 1\r\n return \r\n def empty(self):\r\n return self.index - self.prev == 0\r\n def front(self):\r\n if self.empty():\r\n return None\r\n else:\r\n return self.data[self.prev]\r\n def get(self):\r\n # just make sure empty na ho !\r\n x = self.front()\r\n self.data[self.prev] = None\r\n self.prev += 1\r\n if self.prev > len(self.data)//2 and self.prev >= 4: ##### reallyy good to adjust accordingly\r\n self.resize()\r\n return x\r\n def resize (self):\r\n self.data = self.data[self.prev :]\r\n self.prev = 0\r\n self.index = len(self.data)\r\n return \r\n def show(self):\r\n print(self.data)\r\n print(self.prev)\r\n print(self.index)\r\n print(len(self))\r\n return \r\n def __len__(self):\r\n return self.index - self.prev\r\nq = Queue()\r\n\r\n\r\n\r\n[n, m] = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n q.put([l[i], i])\r\n# q.show()\r\nwhile (len(q) > 1):\r\n [x, y] = q.get()\r\n x -= m \r\n if x > 0 :\r\n q.put([x, y])\r\nprint(q.front()[1]+1)\r\n\r\n", "from sys import stdin, stdout\r\n\r\ntotChildren, candyPerChild = map(int, stdin.readline().strip().split())\r\nchildren = list(map(int, stdin.readline().strip().split()))\r\n\r\nchildren_idx = [int(x) for x in range(0, totChildren)]\r\nhome = -1\r\nwhile len(children_idx):\r\n new_idx = []\r\n for i in children_idx:\r\n if children[i] <= candyPerChild:\r\n home = i\r\n # children_idx.remove(i)\r\n else:\r\n children[i] -= candyPerChild\r\n # children_idx.remove(i)\r\n new_idx.append(i)\r\n children_idx = new_idx\r\n\r\n\r\nstdout.write(f\"{home+1}\")\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\nj=0\r\nwhile a.count(0)!=len(a)-1: \r\n for i in range(n):\r\n if a.count(0)==len(a)-1:\r\n break\r\n a[i]-=m\r\n if a[i]<0:\r\n a[i]=0\r\n \r\nprint(a.index(max(a))+1)", "import sys\r\ninput = sys.stdin.readline\r\nls = list(map(int , input().split()))\r\nn , m = ls[0] , ls[1]\r\nls = list(map(int , input().split()))\r\nlst = list(range(1 , n+1))\r\nwhile len(ls) > 1:\r\n if m >= ls[0]:\r\n ls.pop(0)\r\n lst.pop(0)\r\n else:\r\n ls.append(ls[0] - m)\r\n ls.pop(0)\r\n lst.append(lst[0])\r\n lst.pop(0)\r\nprint(lst[0])", "def main():\n n, m = list(map(int, input().split(\" \")))\n data = list(enumerate(map(int, input().split(\" \"))))\n last_idx = 0\n\n while data:\n idx, next_ch = data.pop(0)\n if m >= next_ch:\n last_idx = idx\n continue\n data.append((idx, next_ch - m))\n\n print(last_idx + 1)\n \n\nif __name__ == \"__main__\":\n main()\n", "from math import*\r\nfrom random import*\r\nn,m=list(map(int,input().split()))\r\nc=list(map(lambda x:ceil(x/m)+(0,1)[x==0],list(map(int,input().split()))))\r\nj=max(c)\r\nid=0\r\nfor i in range(len(c)):\r\n if c[i]==j:id=i\r\nprint(id+1)", "n, m = [int(i) for i in input().split()]\r\n\r\na = list(zip([int(i) for i in input().split()], range(n)))\r\n\r\nwhile len(a) > 1:\r\n if a[0][0] - m > 0:\r\n a.append((a[0][0] - m, a[0][1]))\r\n a.pop(0)\r\n \r\nprint(a[0][1] + 1)", "k = input()\r\nk1 = [int(i) for i in k.split() if i.isdigit()]\r\nl1 = input()\r\nh = [int(i) for i in l1.split() if i.isdigit()]\r\nl = []\r\nfor j in range(0,len(h)):\r\n l.append([j+1,0]) \r\nm = k1[1]\r\nans = 0\r\nwhile(len(l) != 0):\r\n ans = l[0][0]\r\n l[0][1] = l[0][1] + m\r\n if h[l[0][0]-1] <= l[0][1]:\r\n l.remove(l[0])\r\n else:\r\n u = l[0]\r\n l.remove(l[0])\r\n l.append(u)\r\nprint(ans) \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from queue import Queue as Q\r\nn, m = map(int, input().split())\r\na = enumerate(list(map(int, input().split())), start=1)\r\nq = Q()\r\nfor i in a:\r\n q.put(i)\r\nwhile not q.empty():\r\n p, nm = q.get()\r\n nm -= m\r\n if nm > 0:\r\n q.put((p, nm))\r\nprint(p)\r\n", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\nchildren = deque(map(int, input().split()))\r\n\r\nqueue = deque(range(1, n + 1))\r\n\r\nwhile len(queue) > 1:\r\n currVal = children.popleft()\r\n currChild = queue.popleft()\r\n if currVal - m > 0:\r\n children.append(currVal - m)\r\n queue.append(currChild) \r\n\r\nprint(queue.pop())", "\"\"\"\r\n5 2\r\n(1, 0) (3, 1) (1, 2) (4, 3) (2, 4)\r\n\r\nn=5\r\nm=2\r\n\r\n3 1 4 2\r\n1 4 2 1\r\n4 2 1\r\n2 1 2\r\n1 2\r\n2\r\n<empty>\r\n\r\n\"\"\"\r\n\r\n\r\n\r\nn, m = [int(a) for a in input().split(' ')]\r\nstart_arr = input().split(\" \")\r\nres = []\r\nfor i in range(n):\r\n res.append((int(start_arr[i]), i+1))\r\n\r\n\r\nwhile len(res) > 1:\r\n if res[0][0] <= m:\r\n res = res[1:]\r\n else:\r\n res = res[1:] + [((res[0][0] - m), res[0][1])]\r\nprint(res[0][1])\r\n", "n, m = map(int, input().split())\nlst = list(map(int, input().split()))\nmx, idx = 0, 0\nfor i in range(n):\n x=(lst[i]//m)+bool(lst[i]%m)\n if x >= mx:\n mx = x\n idx = i\nprint(idx+1)\n\n \t\t\t\t\t\t \t\t\t\t \t \t\t\t\t \t\t \t\t\t", "n,m = map(int,input().split())\r\nc = [(m-1+int(x))//m for x in input().split()][::-1]\r\nprint (n-c.index(max(c)))\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nres = 1\r\nt = []\r\nfor i in range(n):\r\n if m < l[i]: # Corrected the condition to m < l[i]\r\n t.append(l[i] // m)\r\n if(l[i]%m != 0):\r\n t[i] += 1\r\n else:\r\n t.append(1)\r\ntemp =t[0]\r\nfor i in range(1,n):\r\n if t[i]>=temp:\r\n temp = t[i]\r\n res = i+1\r\nprint(res)\r\n", "import math\nn, m = map(int, input().split())\nli = list(map(int, input().split()))\nstd = -1\nlast = -1\nfor i in range(n):\n d = math.ceil(li[i] / m)\n if d >= std:\n std = d\n last = i+1\nprint(last)\n\n \t \t\t\t\t\t \t\t\t\t \t \t\t \t\t \t", "import math\r\nn,m=map(int,input().split())\r\nl=list(map(lambda x:math.ceil(int(x)/m),input().split()))\r\nl.reverse()\r\nprint(n-l.index(max(l)))", "a,b=map(int,input().split())\nfrom collections import deque\ndq=deque()\nl = list(map(int,input().split()))\nfor i in range(1, a + 1):\n dq.append([l[i - 1], i])\nwhile len(dq) > 1:\n if dq[0][0] <= b:\n dq.popleft()\n else:\n dq.append([dq[0][0] - b, dq[0][1]])\n dq.popleft()\nprint(dq[0][1])\n\n# Tue Dec 20 2022 12:56:10 GMT+0300 (Moscow Standard Time)\n", "x = input().split(\" \")\nm = int(x[1])\nx = input().split(\" \")\nli=[]\nfor i in x:\n i = int(i)\n li.append(i)\n\nl=len(li)\nchild=[]\nfor item in range(1,l+1):\n child.append(item)\n\nfor i,item in enumerate(li):\n if(item<=m):\n temp=child[i]\n child[i]=0\n else:\n li.append(item-m)\n child.append(child[i])\n child[i]=0\nprint(temp)\n\n\n\n\n\t\t\t\t \t\t\t \t \t \t\t \t\t\t\t\t\t \t\t", "# 450A - Jzzhu and Children\r\n[n, m], l, d = list(map(int, input().split())), list(\r\n map(int, input().split())), {}\r\nfor i in range(n):\r\n d[i+1] = l[i]\r\nwhile len(d) > 1:\r\n if list(map(int, d.values()))[0] <= m:\r\n d.pop(list(map(int, d.keys()))[0])\r\n else:\r\n k, v = list(map(int, d.keys()))[0], list(map(int, d.values()))[0]\r\n d.pop(k)\r\n d[k] = v-m\r\nprint(list(map(int, d.keys()))[0])\r\n", "class Student:\n def __init__(self, index, capacity) -> None:\n self.index = index\n self.capacity = capacity\n\nclass Queue:\n def __init__(self) -> None:\n self.q = []\n\n def enqueue(self, i):\n self.q.append(i)\n \n def dequeue(self):\n return self.q.pop(0)\n\n def is_not_empty(self):\n return len(self.q) != 0\n\ndef solution(q: Queue, m:int):\n student = None\n while q.is_not_empty():\n student: Student = q.dequeue()\n if student.capacity > m:\n student.capacity -= m\n q.enqueue(student)\n return student.index\n\n\nif __name__ == '__main__':\n n, m = [int(i) for i in input().split()]\n q = Queue()\n l = [int(i) for i in input().split()]\n for i in range(n):\n student = Student(i + 1, l[i])\n q.enqueue(student)\n\n print(solution(q, m))\n\n \t\t\t\t\t\t \t \t\t \t\t\t\t \t\t \t\t", "from collections import deque\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ndq = deque(range(1, n+1))\r\nwhile len(dq) > 1:\r\n i = dq.popleft()\r\n a[i-1] -= m\r\n if a[i-1] > 0:\r\n dq.append(i) \r\nprint(dq[0])", "n, m = map(int, input().split())\r\nzz = list(map(int, input().split()))\r\nmx = -10**10\r\nfor i in range(len(zz)):\r\n a = zz[i]\r\n if (a + m - 1) // m >= mx:\r\n p = i + 1\r\n mx = (a + m - 1) // m\r\nprint(p)\n# Fri Jul 08 2022 08:29:11 GMT+0000 (Coordinated Universal Time)\n", "from collections import deque\r\nn, m = map(int, input().split())\r\n\r\nd = deque(map(int, input().split()))\r\n\r\nd2 = deque( i for i in range(1, n+1))\r\np = 0\r\ni = 0\r\nwhile len(d) !=0:\r\n if d[i] <= m:\r\n \r\n d.popleft()\r\n p = d2.popleft()\r\n \r\n else:\r\n b = d.popleft()\r\n d.append(b - m)\r\n q = d2.popleft()\r\n d2.append(q)\r\n \r\nprint(p)", "class child:\r\n def __init__(self, expected, index):\r\n self.times = expected // m + (expected % m > 0)\r\n self.pos = index + 1\r\n def __lt__(self, other):\r\n return self.times < other.times or (self.times == other.times and self.pos < other.pos)\r\n\r\nn, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nchildren = [child(a[i], i) for i in range(n)]\r\nprint(sorted(children)[-1].pos)", "from queue import Queue\n\nq=Queue()\nn,d=list(map(int,input().split()))\nlist=list(map(int,input().split()))\n\nfor i in range(len(list)):\n q.put([list[i],i+1])\n\npos=0\nwhile q.empty()==False:\n val=q.get()\n val[0]-=d\n if val[0]>0:\n q.put(val)\n else:\n pos=val[1]\n\nprint(pos)\n\n\n\n\n\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\nb=[i for i in range(1,n+1)]\r\nwhile len(a)!=0 and len(b)>1:\r\n if m>=a[0]:\r\n del a[0]\r\n del b[0]\r\n else:\r\n a.append(a[0]-m)\r\n del a[0]\r\n b.append(b[0])\r\n del b[0]\r\nprint(b[0])\r\n \r\n\r\n", "import math\r\nn,m=map(int,input().split(\" \"))\r\nl=list(map(int,input().split(\" \")))\r\nmax_l=-1\r\nfor i in range(n):\r\n if (math.ceil(l[i] / m) >= max_l):\r\n last = i\r\n max_l = math.ceil(l[i] / m);\r\n\r\n\r\nprint(last+1)\r\n", "from math import ceil\r\nn,m=map(int,input().split())\r\n\r\nnl = [int(x) for x in input().split()]\r\nmaxi = 0\r\nfor i in range(0,n):\r\n \r\n if ceil(nl[i]/m) >= maxi:\r\n last=i+1\r\n maxi = ceil(nl[i]/m)\r\n \r\nprint(last)\r\n\r\n\r\n\r\n", "n,m= map(int, input().split())\r\narr= list(map(int, input().split()))\r\n\r\nl=[]\r\nfor i in range(n):\r\n l.append([arr[i],i+1])\r\n#print(l[0][1])\r\nwhile(len(l)!=1):\r\n i=0\r\n if l[i][0]>m:\r\n l[i][0]-=m\r\n l.append(l[i])\r\n l.pop(i)\r\n#print(l)\r\nprint(l[0][1])", "import math\r\na,b=map(int, input().split())\r\ns1=[int(i) for i in input().split()]\r\ns=[math.ceil(i/b) for i in s1]\r\nprint(len(s)-s[::-1].index(max(s)))", "n, m = [int(i) for i in input().split()]\r\nchildren = [int(i) for i in input().split()]\r\nindexes = [int(i) for i in range(len(children))]\r\nwhile len(children) != 1:\r\n children[0] -= m\r\n if children[0] <= 0:\r\n del children[0]\r\n del indexes[0]\r\n else:\r\n children.append(children.pop(0))\r\n indexes.append(indexes.pop(0))\r\n\r\nprint(indexes[0] + 1)", "import math\r\nn, m = map(int, input().split())\r\narr = (list(map(int, input().split())))\r\np = -1\r\nq = -1\r\n\r\nfor i in range(n):\r\n if math.ceil(arr[i]/m) >= p:\r\n p = math.ceil(arr[i]/m)\r\n q = i+1\r\n\r\nprint(q)", "import math\n\nn,m=input().split()\nn=int(n)\nm=int(m)\nlist=list(map(int,input().split()))\n\narr=[]\n\nfor i in range(n):\n times=math.ceil(list[i]/m)\n arr.append(times)\n\npos=-1\nmx=max(arr)\n\nfor i in range(n):\n if arr[i]==mx:\n pos=i+1\n\nprint(pos)\n\t\t \t \t \t\t \t \t \t\t \t\t\t \t", "n,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nk=0\r\nc=1\r\nindex=0\r\nfor i in lst:\r\n if(i%m>0):\r\n x=i//m\r\n if(x>=k):\r\n index=c\r\n k=x\r\n else:\r\n x=i//m -1\r\n if(x>=k):\r\n index=c\r\n k=x\r\n c+=1\r\nprint(index)", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nline = deque(range(n))\r\ncandies = [0] * n\r\nhome = []\r\n\r\nwhile line:\r\n child = line.popleft()\r\n candies[child] += m\r\n if candies[child] < a[child]:\r\n line.append(child)\r\n else:\r\n home.append(child)\r\n\r\nlast_child = home[-1] + 1\r\nprint(last_child)\r\n", "n,m=map(int,input().split())\r\nimport math\r\nA=list(map(int,input().split()))\r\n\r\nma=0\r\nans=0\r\nfor i in range(n):\r\n if math.ceil(A[i]/m)>=ma:\r\n ma=math.ceil(A[i]/m)\r\n ans=i\r\n\r\nprint(ans+1) ", "n, m = map(int, input().split())\r\n\r\nm_i = -1\r\nm_t = -1\r\n\r\ni = 0\r\nfor c in list(map(int, input().split())):\r\n n_t = c // m + (0 if c % m == 0 else 1)\r\n if n_t >= m_t:\r\n m_t = n_t\r\n m_i = i\r\n i += 1\r\n \r\nprint(m_i + 1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n b.append([a[i], i])\r\nwhile len(b) != 1:\r\n if b[0][0] > m:\r\n b.append([b[0][0] - m, b[0][1]])\r\n b.pop(0)\r\nprint(b[0][1] + 1)", "n,m = map(int,input().split())\r\nl= list(map(int,input().split()))\r\nl1 = [i for i in range(n)]\r\n\r\nwhile len(l)>1:\r\n l[0] -= m\r\n if l[0]>0:\r\n l.append(l[0])\r\n l1.append(l1[0])\r\n l.pop(0)\r\n l1.pop(0)\r\n else:\r\n l.pop(0)\r\n l1.pop(0)\r\nprint(l1[0]+1)", "from sys import stdin\r\nfrom math import ceil \r\ninput = stdin.readline\r\n\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nlast_home = 0\r\nindex = 0\r\nfor i in range(n):\r\n home_after = ceil(arr[i]/m)\r\n if home_after >= last_home :\r\n last_home = home_after\r\n index = i\r\n \r\n \r\nprint(index+1 if last_home > 1 else n )\r\n", "n,m=map(int,input().split())\r\ncandy=[]\r\ncandy=list(map(int,input().split()))\r\nindex=[]\r\nfor i in range(1,n+1):\r\n index.append(i)\r\n\r\nwhile(len(candy)!=1):\r\n if(candy[0]<=m):\r\n candy.remove(candy[0])\r\n index.remove(index[0])\r\n else:\r\n candy[0]=candy[0]-m\r\n for i in range(0,len(candy)-1):\r\n candy[i],candy[i+1]=candy[i+1],candy[i]\r\n index[i],index[i+1]=index[i+1],index[i]\r\n #print(candy)\r\n #print(index)\r\n \r\nprint(index[0])", "import math;\r\n\r\nn, m = list(map(int, input().split(\" \")));\r\nc = list(map(int, input().split(\" \")));\r\n\r\nmax = -1;\r\nr = -1;\r\n\r\nfor i, v in enumerate(c):\r\n x = math.ceil(v / m);\r\n if x >= max:\r\n max = x;\r\n r = i+1;\r\n\r\nprint (r);", "import math\nn,d=map(int,input().split())\nc=list(map(int,input().split()))\nmaxi=0\nfor i in range(len(c)):\n if math.ceil(c[i]/d)>=maxi:\n maxi=math.ceil(c[i]/d)\n id=i\nprint(id+1)\n\t \t\t\t\t\t \t \t \t\t \t \t \t\t \t", "x = input().split()\r\ntemp = input().split()\r\nlist1 = []\r\nfor i in temp:\r\n list1.append(int(i))\r\nn = int(x[0])\r\nm = int(x[1])\r\nb1 = False\r\nstart = 0\r\nlist2 = []\r\nfor i in range(1,n+1):\r\n list2.append(i)\r\n\r\nwhile b1==False:\r\n if m >= list1[0]:\r\n if len(list1) == 1:\r\n break\r\n list1.pop(0)\r\n list2.pop(0)\r\n continue\r\n if list1[0] > m:\r\n if len(list1) == 1:\r\n break\r\n list1[0] = list1[0] - m\r\n temp1 = list1[0]\r\n temp2 = list2[0]\r\n list1.pop(0)\r\n list1.append(temp1)\r\n list2.pop(0)\r\n list2.append(temp2)\r\n continue\r\n\r\nprint(list2[-1])\r\n ", "rounds = lambda count, n: count // n if count % n == 0 else (count // n) + 1\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nmax_rounds = rounds(max(arr), m)\r\nkids = []\r\nfor i in range(n):\r\n if rounds(arr[i], m) == max_rounds:\r\n kids.append(i)\r\nprint(kids[-1] + 1)", "s = []\r\n\r\n\r\ndef roll(a):\r\n global s\r\n if all(i <= 0 for i in a):\r\n return s[len(s)-1]+1\r\n else:\r\n for i in range(len(a)):\r\n if a[i] > m:\r\n a[i] = a[i] - m\r\n elif a[i] <= 0:\r\n continue\r\n else:\r\n a[i] = a[i] - m\r\n s.append(i)\r\n\r\n return roll(a)\r\n\r\n\r\nn, m = map(int, input().split(\" \"))\r\na = list(map(int, input().split(\" \")))\r\nprint(roll(a))\r\n", "import math\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ntrack, ans = [], []\r\nfor i in range(len(arr)):\r\n track.append(math.ceil(arr[i] / m))\r\na = max(track)\r\nfor i in range(len(track)):\r\n if track[i] == a:\r\n ans.append(i + 1)\r\nprint(max(ans))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\n(n, m)= map(int, input().split(\" \"))\r\na= list(map(int, str(input()).split(\" \")))\r\nb= []\r\nfor i in range(n):\r\n b.append(math.ceil(a[i]/m))\r\n \r\nma= n-1\r\nfor j in range(n-1,-1,-1):\r\n if b[j]>b[ma]:\r\n ma=j\r\n \r\nprint(ma+1)", "n,m = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nwhile(max(ls)>m):\r\n for j in range(len(ls)):\r\n ls[j]= ls[j]-m\r\nfor i in range(len(ls)-1,-1,-1):\r\n if ls[i]>0:\r\n print(i+1)\r\n break", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nfor i in range(a):\r\n c[i] = (c[i]-1)//b\r\nc.reverse()\r\nprint(a-((c.index((max(c))))))\r\n", "import math\r\n\r\nn, m = list(map(int, input().split()))\r\n\r\nk = list(map(int, input().split()))\r\nk_i = [i+1 for i in range(len(k))]\r\n\r\nwhile True:\r\n if len(k_i) == 1:\r\n break\r\n if k[0] > m:\r\n k.append(k[0]-m)\r\n k_i.append(k_i[0])\r\n del k[0]\r\n del k_i[0]\r\n\r\nprint(k_i[0])", "import collections\n\nn, m = map(int, input().split())\n\nque = collections.deque()\ncan = list(map(int, input().split()))\n\nfor i in range(n):\n que.append((i, can[i]))\n\nwhile len(que) > 1:\n index, val = que.popleft()\n if val - m > 0:\n que.append((index, val - m))\n\nprint(que[0][0] + 1)\n \t \t\t\t\t \t \t\t\t \t\t \t\t \t \t\t \t", "n,m = list(map(int,input().split()))\r\nchild = [int(x) for x in input().split()]\r\nnos = list(range(n))\r\n\r\ni=0\r\nwhile(len(child)>1):\r\n child[i] = child[i] - m\r\n if(child[i]<=0):\r\n child.pop(i)\r\n nos.pop(i)\r\n else:\r\n x = child.pop(i)\r\n y = nos.pop(i)\r\n child.append(x)\r\n nos.append(y)\r\n \r\nprint(nos[0]+1)", "import math\r\ndef solve():\r\n n, m = map(int, input().split(' '))\r\n\r\n tempList = []\r\n tempList += map(int, input().split(' '))\r\n\r\n maximum = max(tempList)\r\n cntValid = n\r\n while(True):\r\n i = 0\r\n while i < len(tempList):\r\n if cntValid == 1 and tempList[i] > 0:\r\n print(i+1)\r\n return 0\r\n elif tempList[i] > 0:\r\n tempList[i] -= m\r\n if tempList[i] < 1:\r\n cntValid -= 1\r\n i += 1\r\nsolve()", "from math import ceil\r\n\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nd = [(ceil(v/m),i) for i,v in enumerate(a)]\r\nd.sort(key=lambda x: (x[0],x[1]))\r\n\r\nprint(d[-1][1]+1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n a[i] = (a[i]+m-1)//m\r\nmx = max(a)\r\na.reverse()\r\nprint(n - a.index(mx))\r\n", "from math import ceil\r\n\r\nn, m = map(int, input().split())\r\n\r\na = [int(i) for i in input().split()]\r\nans, mx = 0, 0\r\nfor i in range(n):\r\n j = ceil(a[i] / m)\r\n if j >= mx:\r\n ans = i + 1\r\n mx = j\r\nprint(ans)\r\n", "n,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nfor i in range(n):\r\n arr[i] = (arr[i]-1)//m\r\narr.reverse()\r\nprint(n - arr.index(max(arr)))", "from collections import deque\nd = deque()\nc = 0\n\nn, m = map(int, input().split())\ns = list(map(int, input().split()))\nfor i in range(len(s)):\n d.append({0:i+1, 1: s[i]})\n\nwhile len(d)>1:\n c = d.popleft()\n if c[1]-m > 0:\n c[1] -= m\n d.append(c)\nc = d.popleft()\nprint(c[0])\n# Tue Dec 20 2022 14:08:31 GMT+0300 (Moscow Standard Time)\n", "a, b = map(int,input().split())\nfrom collections import deque\ndq = deque()\nl = list (map(int,input().split()))\nfor i in range (1, a + 1):\n dq.append([l[i - 1], i])\nwhile len(dq) > 1:\n if dq[0][0] <= b:\n dq.popleft()\n else:\n dq.append([dq[0][0] - b, dq[0][1]])\n dq.popleft()\nprint (dq[0][1])\n# Tue Dec 20 2022 14:27:18 GMT+0300 (Moscow Standard Time)\n", "from math import ceil\r\nn,m = [int(x) for x in input().split()]\r\ncandy = [(ceil(int(x)/m)) for x in input().split()]\r\nlast = max(candy)\r\nfor i in range(n-1,-1,-1):\r\n if (candy[i]==last):\r\n print(i+1)\r\n exit()", "n,m=map(int,input().split())\r\nl=list((i-1)//m for i in map(int,input().split()))\r\nl.reverse()\r\nprint(n-l.index(max(l)))", "import math\r\ndef solve():\r\n n, m = map(int, input().split())\r\n v = list(map(int, input().split()))\r\n ans = []\r\n max_val = v[0] / m\r\n ind = 0\r\n for i in range(n):\r\n if math.ceil(v[i] / m) >= max_val:\r\n max_val = math.ceil(v[i] / m)\r\n ind = i + 1\r\n print(ind)\r\n\r\nsolve()", "n, m = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\nx = []\r\nfor i in range(n):\r\n x.append([arr[i], i + 1])\r\nwhile len(x) > 1:\r\n if x[0][0] - m <= 0:\r\n x.pop(0)\r\n else:\r\n x[0][0] -= m\r\n x.append(x.pop(0))\r\nprint(x[0][1])", "n,m=map(int,input().split())\r\nb = list(map(int,input().split())) \r\nk=[] \r\nfor i in range(0,n):\r\n j=0\r\n while(b[i]>0):\r\n j=j+1\r\n b[i]=b[i]-m\r\n k.append(j)\r\nmax=k[0]\r\nfor i in range(0,n):\r\n if (max<=k[i]):\r\n max=k[i]\r\nfor i in range(0,n):\r\n if(k[i]==max):\r\n x=i\r\nmax2=0\r\nfor i in range(0,n):\r\n if(max2<=x):\r\n max2 =x\r\nprint(max2+1)", "def juzzhuAndChildren(n,m,c):\r\n while True:\r\n for i in range(n):\r\n if check(n,c):\r\n ans = c.index(max(c)) + 1\r\n return ans\r\n else:\r\n c[i] -= m\r\n \r\n\r\ndef check(n,c):\r\n p = 0\r\n for i in range(n):\r\n if c[i]>0:\r\n p += 1\r\n return p==1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = [int(i) for i in input().split()]\r\n c = list(map(int, input().split()))\r\n \r\n ans = juzzhuAndChildren(n,m,c)\r\n print(ans)\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 _, m = map(int, input().split())\n z = 0\n a = [(x, int(y)) for x, y in enumerate(input().split())]\n last = a[-1][0]\n while a:\n last = a[-1][0]\n z += m\n a = [x for x in a if x[1] > z]\n print(last + 1)\n\n\nif __name__ == \"__main__\":\n main()\n", "n,m=map(int,input().split())\r\nlst=[int(x) for x in input().split()]\r\nbest,pos=0,1\r\nfor i in lst:\r\n if i%m:\r\n if (i//m)+1>=best:\r\n best=(i//m)+1\r\n ans=pos\r\n else:\r\n if (i//m)>=best:\r\n best=(i//m)\r\n ans=pos\r\n pos+=1\r\nprint(ans)\r\n", "n,m=map(int,input().split(' '))\r\na=list(map(int,input().split(' ')))\r\nb=list(range(1,n+1))\r\ni=0\r\nwhile (len(a)!=1):\r\n if(m>=a[i]):\r\n b.pop(i)\r\n a.pop(i)\r\n else:\r\n temp=a[i]-m\r\n temp2=b[i]\r\n a.pop(i)\r\n a.append(temp)\r\n b.pop(i)\r\n b.append(temp2)\r\n \r\n\r\nprint(b[0])\r\n", "n, m = map(int, input().split())\r\ns = list((int(i) - 1)//m for i in input().split())\r\nprint(n - s[::-1].index(max(s)))", "import math\nn, m = map(int, input().split())\nl = list(map(int, input().split()))\nmx = 0\nidx = 0\nfor i in range(n):\n x = math.ceil(l[i] / m)\n if x >= mx:\n mx = x\n idx = i\nprint(idx+1)\n\t\t \t\t\t\t\t\t \t\t\t \t\t\t\t \t\t \t \t\t\t\t\t\t", "n,m=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nl=[i for i in range(1,n+1)]\r\nc=0\r\nwhile len(arr)>1:\r\n if arr[0]<=m:\r\n arr=arr[1::]\r\n l=l[1::]\r\n else:\r\n arr=arr[1::]+[arr[0]-m]\r\n l=l[1::]+[l[0]]\r\nprint(l[0])", "import math\r\nn,m=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nif max(a)<=m or len(a)==1:\r\n print(n)\r\nelse:\r\n ans=0\r\n ciel=0\r\n for i in a:\r\n if math.ceil(i/m)>=ciel:\r\n ciel=math.ceil(i/m)\r\n ans=i\r\n fans=0\r\n for i in range(n-1,-1,-1):\r\n if a[i]==ans:\r\n print(i+1)\r\n break", "import math\r\n\r\nn,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlist1=[]\r\n\r\nfor i in lst:\r\n x=math.ceil(i/m)\r\n list1.append(x)\r\n \r\nmaximum=max(list1)\r\nindex=0\r\nfor i in range(len(list1)):\r\n if list1[i]==maximum:\r\n index=i\r\n\r\nprint(index+1)\r\n", "def solve():\r\n n,m = list(map(int,input().split()))\r\n a = list(map(int,input().split()))[::-1]\r\n for i in range(n):\r\n a[i] = a[i]//m + (a[i] % m > 0)\r\n return n - a.index(max(a))\r\nprint(solve())", "l = []\nd = {}\nn, m = map(int, input().split())\nl2 = list(map(int, input().split()))\n\nfor i in range(1, n+1):\n l.append(i)\n d[i] = l2[i-1]\n\nwhile(len(l) > 1):\n d[l[0]] -= m\n if(d[l[0]] > 0):\n l.append(l.pop(0))\n else:\n l.pop(0)\n\nprint(l[0])", "L = list(map(int, input().split()))\r\nL1 = list(map(int, input().split()))\r\nd = {}\r\n\r\nm, n = L[0], L[1]\r\n\r\nfor i in range(m):\r\n if L1[i] > n:\r\n if L1[i] % n != 0:\r\n d[L1[i] // n] = i + 1\r\n else:\r\n d[L1[i] // n - 1] = i + 1\r\nif len(d) == 0:\r\n print(m)\r\nelse:\r\n L2 = list(d.keys())\r\n print(d[max(L2)])\r\n", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nq = deque(range(1, n + 1))\r\nlast_child = 0\r\n\r\nwhile q:\r\n child = q.popleft()\r\n a[child - 1] -= m\r\n if a[child - 1] > 0:\r\n q.append(child)\r\n else:\r\n last_child = child\r\n\r\nprint(last_child)\r\n", "import math\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()[:n]))\r\nans=-1\r\np=-1\r\nfor i in range(n):\r\n temp=math.ceil(l[i]/k)\r\n if temp>=ans:\r\n ans=temp\r\n p=i+1\r\nprint(p)", "from collections import deque\n\nn, m = (int(i) for i in input().split())\na = deque(enumerate(int(i) for i in input().split()))\nwhile a:\n i, e = a.popleft()\n if e > m:\n a.append((i, e - m))\nres = i + 1\nprint(res)\n", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nq = deque(range(1, n + 1))\r\n\r\nwhile len(q) > 1:\r\n child = q.popleft()\r\n candies = min(m, a[child - 1])\r\n a[child - 1] -= candies\r\n if a[child - 1] > 0:\r\n q.append(child)\r\n else:\r\n continue\r\n\r\nprint(q[0])\r\n", "from collections import deque\r\n\r\nn,m = [int(x) for x in input().split()]\r\narr = [(int(x),i+1) for i,x in enumerate(input().split())]\r\nwhile arr:\r\n new = []\r\n for i in range(len(arr)):\r\n x,idx = arr[i]\r\n if x - m > 0:\r\n new.append((x-m, idx))\r\n arr = new\r\n\r\nprint(idx)\r\n\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nnumbers = list(map(int, input().split()))\r\nstack = []\r\nmtp = 1\r\ngot = False\r\nwhile True:\r\n for i in range(n):\r\n if numbers[i] - mtp * m <= 0 and i not in stack:\r\n stack.append(i)\r\n if len(stack) == n:\r\n got = True\r\n break\r\n if got:\r\n break\r\n mtp += 1\r\nprint(stack[-1] + 1)", "childrenNumber, candiesNumber = [int(x) for x in input().split()]\r\ncandiesNumberPerChild = list(map(int, input().split()))\r\nanswers = list()\r\nfor i in range(childrenNumber):\r\n answers.append(0)\r\nindexes = list()\r\nwhile(max(candiesNumberPerChild) > 0):\r\n for (index,candie) in enumerate(candiesNumberPerChild):\r\n if(candiesNumberPerChild[index] > 0):\r\n candiesNumberPerChild[index] = candie - candiesNumber\r\n answers[index]+=1\r\nmaxn = max(answers)\r\nfor(index, answer) in enumerate(answers):\r\n if answer == maxn:\r\n indexes.append(index+1)\r\nprint(indexes[-1])", "import math\nfrom collections import deque\n\nn,m = input().split()\n\nn = int(n)\nm = int(m)\n\nq = deque()\n\narr = [int(i)for i in input().split()]\n\nmx = -1\n\nmx_idx = -1\n\nfor i in range(n):\n d = math.ceil(arr[i]/m)\n if d >= mx:\n mx = d\n mx_idx = i +1\n\nprint(mx_idx)\n \t \t\t\t\t\t\t \t\t \t \t \t\t \t \t \t \t", "import math\nn ,m=map(int,input().split())\nlst = list(map(int,input().split()))\nidx,mx=0,0\nfor i in range (n):\n if math.ceil(lst[i]/m) >=mx:\n mx=math.ceil(lst[i]/m)\n idx = i+1\nprint(idx) \n####\n\t \t \t \t \t \t \t\t \t\t \t \t\t", "n, m = map(int, input().split())\r\nline = list(map(int, input().split()))\r\nbiggest = -(-max(line) // m)\r\nfor i in range(n-1, -1, -1):\r\n if -(-line[i]//m) == biggest:\r\n print(i+1)\r\n break", "from collections import deque\r\nn, m = list(map(int, input().split()))\r\n\r\na = list(map(int,input().split()))\r\na1 = list(range(n))\r\nq = deque(zip(a,a1))\r\nlast =0\r\nwhile q:\r\n f = q.popleft()\r\n if f[0]-m>0:\r\n q.append([f[0]-m,f[1]])\r\n else:\r\n last = f[1]\r\nprint(last+1)\r\n" ]

[ "n=int(input())\r\nL=[]\r\naG=0;\r\nmini = 1000000000\r\nmaxi = -1000000000;\r\nfor i in range(0,n):\r\n a=input().rstrip().split(' ')\r\n L.append(a)\r\n if int(a[0])<=mini and int(a[1])>=maxi:\r\n G=int(a[0]);\r\n H=int(a[1]);\r\n S=i;\r\n mini = int(a[0])\r\n maxi = int(a[1])\r\n#print(S,mini,maxi)\r\nfor i in range(0,len(L)):\r\n A=L[i];\r\n # print(A)\r\n if int(A[0])>=mini and int(A[0])<=maxi and int(A[1])>=mini and int(A[1]) <= maxi:\r\n continue;\r\n else:\r\n aG=1;\r\n break;\r\n # print(i)\r\nif aG==1:\r\n print(-1)\r\nelse:\r\n print(S+1);", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom typing import Counter\nimport math\nhpop = heappop\nhpush = heappush\n\"\"\"\n num = int(input())\n arr = list(map(int, input().split()))\n a,b = map(int, input().split())\n graph = defaultdict(list)\n for i in range(#)\n graph[a].append(b)\n graph[b].append(a)\n MOD = 10**9 + 7\n\"\"\"\n\ndef solution():\n n = int(input())\n mn = float(\"inf\")\n mx = float(\"-inf\")\n res = [-1,mn,mx]\n for i in range(n):\n a,b = map(int, input().split())\n mn = min(mn, a)\n mx = max(mx, b)\n if a == mn and b == mx:\n res = [i,a,b]\n\n if mn == float(\"inf\") or mx == float(\"-inf\"):\n print(-1)\n\n i,a,b = res\n if mn == a and mx == b:\n print(i+1)\n else:\n print(-1)\n\n\n\n\n\ndef main():\n t = 1\n #t = int(input())\n # n + 1 diffrences\n\n for _ in range(t):\n solution()\n \n \nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n\n#main()\n", "n = int(input())\r\n\r\nlst = []\r\n\r\nfor i in range(n):\r\n lst.append(list(map(int, input().split())))\r\n\r\nmax_val = lst[0][0]\r\nmin_val = lst[0][1]\r\n\r\nfor index in range(len(lst)):\r\n if lst[index][0] <= min_val:\r\n min_val = lst[index][0]\r\n if lst[index][1] >= max_val:\r\n max_val = lst[index][1]\r\n\r\nif [min_val, max_val] in lst: print(lst.index([min_val, max_val]) + 1)\r\nelse: print(-1)", "# LUOGU_RID: 101472716\n(n,),*a=[tuple(map(int,s.split()))for s in open(0)]\r\nt=(min(x[0]for x in a),max(x[1]for x in a))\r\nprint(t in a and a.index(t)+1 or -1)", "n = int(input())\r\narr = []\r\nbest_length = -1\r\nbest_lo = None\r\nbest_hi = None\r\nbest_idx = 0\r\nfor i in range(n):\r\n lo, hi = [int(x) for x in input().split()]\r\n if hi-lo > best_length:\r\n best_length = hi-lo\r\n best_lo = lo\r\n best_hi = hi\r\n best_idx = i+1\r\n arr.append([lo,hi])\r\n\r\noverlaps = True\r\nfor l,h in arr:\r\n overlaps &= best_lo <= l <= h <= best_hi\r\n\r\nif overlaps:\r\n print(best_idx)\r\nelse:\r\n print(\"-1\")", "n = int(input())\r\nl = []\r\nr = []\r\n# đọc dữ liệu\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n l.append(a)\r\n r.append(b)\r\nminL = min(l)\r\nmaxR = max(r)\r\n# Tìm minL, maxR\r\n\r\nfound = False\r\n\r\nfor i in range(n):\r\n if l[i] == minL and r[i] == maxR:\r\n print(i+1)\r\n found = True\r\n\r\n \r\nif found == False:\r\n print(-1)\r\n", "n=int(input())\r\nmina,maxb=map(int,input().split())\r\nx=[[mina,maxb]]\r\nfor i in range(n-1):\r\n a,b=map(int,input().split())\r\n mina=min(a,mina)\r\n maxb=max(b,maxb)\r\n x.append([a,b])\r\nf=True\r\nfor i in range(n):\r\n if x[i][0]==mina and x[i][1]==maxb:\r\n print(i+1)\r\n f=False\r\n break\r\nif f:\r\n print(-1)\r\n\r\n", "n=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n mat.append(l)\r\nmini=10**10\r\nmaxi=0\r\nfor i in range(n):\r\n mini=min(mini,mat[i][0])\r\n maxi=max(maxi,mat[i][1])\r\nflag=0\r\nfor i in range(n):\r\n if(mat[i][0]==mini and mat[i][1]==maxi):\r\n flag=1\r\n p=i+1\r\n break\r\nif(flag==0):\r\n print(-1)\r\nelse:\r\n print(p)\r\n \r\n\r\n\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n S = []\r\n for i in range(n):\r\n S.append(list(map(int, input().split()))+[i+1])\r\n S.sort()\r\n\r\n min_a = S[0][0]\r\n max_b = 0\r\n for x in S:\r\n if max_b < x[1]:\r\n max_b = x[1]\r\n\r\n\r\n for p in range(n):\r\n if S[p][0] == min_a and S[p][1] == max_b:\r\n print(S[p][2])\r\n exit()\r\n\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ndict_seg = {}\r\ncover_seg = 1\r\n\r\nfor i in range(1, n+1):\r\n dict_seg[i] = list(map(int, input().split(' ')))\r\n\r\nmax_seg = dict_seg[1][1]\r\nmin_seg = dict_seg[1][0]\r\n\r\nfor i in range(2, n+1):\r\n if min_seg >= dict_seg[i][0] and max_seg <= dict_seg[i][1]:\r\n min_seg = dict_seg[i][0]\r\n max_seg = dict_seg[i][1]\r\n cover_seg = i\r\n\r\nfor i in range(1, n+1):\r\n if min_seg > dict_seg[i][0] or max_seg < dict_seg[i][1]:\r\n print(\"-1\")\r\n exit(0)\r\n\r\nprint(cover_seg)\r\nexit(0)\r\n", "def main():\n n = int(input())\n l, r = [], []\n for _ in range(n):\n a, b = map(int, input().split())\n l.append(a)\n r.append(b)\n m = min(l), max(r)\n for i, a in enumerate(zip(l, r)):\n if a == m:\n print(i + 1)\n return\n print(-1)\n\n\nif __name__ == '__main__':\n main()", "n = int(input())\n\na, b = map(int, input().split())\n\nm_val = a\nM_val = b\nm = set()\nm.add(0)\nM = set((0,))\n\nfor i in range(1, n):\n a, b =map(int, input().split())\n\n if a < m_val:\n m_val = a\n m = set((i,))\n elif a == m_val:\n m.add(i)\n \n if b > M_val:\n M = set((i,))\n M_val = b\n elif b == M_val:\n M.add(i)\n\ninterset = m & M\nif len(interset):\n \n print(next(iter(interset)) + 1)\nelse:\n print(-1)\n", "#python33\r\ndef program():\r\n num=-1\r\n R=[]\r\n L=[]\r\n n=int (input ())\r\n for i in range(n):\r\n l,r=((map(int,input().split()))) \r\n R.append(r)\r\n L.append(l) \r\n MAXR=max(R)\r\n MINL=min(L)\r\n\r\n for i in range(n):\r\n if R[i] == MAXR and L[i] == MINL:\r\n print (i+1)\r\n return \r\n\r\n print(num) \r\nprogram() \r\n", "a = []\r\nb = []\r\nn = int(input())\r\nfor _ in range(n):\r\n x,y = map(int,input().split());a.append(x);b.append(y)\r\nmn = min(a)\r\nmx = max(b)\r\nfor i in range(n):\r\n if a[i] <= mn and b[i] >= mx:print(i + 1);exit()\r\nelse:print(-1)\r\n", "n = int(input())\r\n\r\nleft = []\r\nright = []\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n left.append(a)\r\n right.append(b)\r\n\r\nmin_left = min(left)\r\nmax_right = max(right)\r\n\r\nans = -1\r\n\r\nfor i in range(n):\r\n if left[i] == min_left and right[i] == max_right:\r\n ans = i + 1\r\n break\r\n\r\nprint(ans)\r\n", "import sys\r\n\r\nf = sys.stdin\r\n\r\nn = int(f.readline().strip())\r\nl, r = [], []\r\n\r\nfor line in f:\r\n l.append(int(line.strip().split()[0]))\r\n r.append(int(line.strip().split()[1]))\r\n\r\nls = list(set(l))\r\nrs = list(set(r))\r\n\r\nls.sort();\r\nrs.sort(reverse=True)\r\n\r\nind = -1\r\nfor i in range(n):\r\n if l[i] <= ls[0] and r[i] >= rs[0]:\r\n ind = i+1\r\n\r\nprint(ind)", "# http://codeforces.com/problemset/problem/242/B\r\n\r\nnum_segments = int(input())\r\nstart_segments = []\r\nend_segments = []\r\n\r\n\r\ndef find_max_of_end(my_list):\r\n max = my_list[0]\r\n for index, item in enumerate(my_list):\r\n if item > max:\r\n max = item\r\n return max\r\n\r\n\r\ndef find_index_of_min(my_list):\r\n min = my_list[0]\r\n min_indexs = []\r\n for index, item in enumerate(my_list):\r\n if item < min:\r\n min = item\r\n for index, item in enumerate(my_list):\r\n if item == min:\r\n min_indexs.append(index)\r\n return min_indexs\r\n\r\n\r\nfor _ in range(num_segments):\r\n start, end = list(map(int, input().split()))\r\n start_segments.append(start)\r\n end_segments.append(end)\r\n\r\nmin_start_indexes = find_index_of_min(start_segments)\r\nmax_end = find_max_of_end(end_segments)\r\nresult = -1\r\nfor index in min_start_indexes:\r\n if end_segments[index] == max_end:\r\n result = index\r\n break\r\nif result == -1:\r\n print(result)\r\nelse:\r\n print(result + 1)\r\n", "n = int(input())\r\nsett = []\r\nmini = float('inf')\r\nmaxi = -float('inf')\r\nfor _ in range(n):\r\n x,y = [int(x) for x in input().split()]\r\n mini = min(x,mini)\r\n maxi = max(y,maxi)\r\n sett.append((x,y))\r\nif (mini,maxi) in sett:\r\n print(sett.index((mini,maxi))+1)\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\nline=[]\r\nline1=[]\r\nline2=[]\r\nfor i in range(n):\r\n z=input().split()\r\n line.append(list(map(int,z)))\r\n line1.append(int(z[0]))\r\n line2.append(int(z[1]))\r\nl=min(line1)\r\nr=max(line2)\r\nif [l,r] in line:\r\n out = line.index([l,r])+1\r\nelse:\r\n out = -1\r\nprint(out)", "n = int(input());\r\nindex = -1;\r\nmaxNum = 0;\r\nminNum = 0;\r\nm = [];\r\n\r\nfor i in range(n):\r\n a = list(map(int, input().split()));\r\n m.append(a);\r\n if(a[0] < minNum or minNum == 0): minNum = a[0];\r\n if(a[1] > maxNum): maxNum = a[1];\r\n\r\nfor j in range(n):\r\n if(m[j][0]==minNum and m[j][1]==maxNum): index = j+1;\r\n\r\nprint(index);", "n = int(input())\nl = []\nbest = [0, -1]\nk = -1\nfor i in range(n):\n\tl.append([int(x) for x in input().split()])\n\tif l[-1][1] - l[-1][0] > best[1] - best[0]:\n\t\tbest = l[-1]\n\t\tk = i\nfor a, b in l:\n\tif a < best[0] or best[1] < b:\n\t\tprint(-1)\n\t\texit(0)\nprint(k + 1)\n", "n = int(input())\r\n\r\nranges = {}\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n ranges[(l, r)] = i\r\n_min = 10**9\r\n_max = 0\r\nfor range in ranges:\r\n _min = min(_min, range[0])\r\n _max = max(_max, range[1])\r\n\r\nif (_min, _max) in ranges:\r\n print(ranges[(_min, _max)]+1)\r\nelse:\r\n print(-1)", "n=int(input())\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\ncount=1\r\nfor i in range (n):\r\n (l,r)=map(int,input().split(' '))\r\n l1.append(l)\r\n l2.append(r)\r\na=min(l1)\r\nb=max(l2)\r\nfor i in range (n):\r\n if l1[i]==a and l2[i]==b:\r\n l3.append(i)\r\n break\r\n \r\nif len(l3)>0:\r\n print(l3[0]+1)\r\nelse:\r\n print(-1)", "from typing import List\r\n\r\n\r\ndef solve(borders: List[List[int]], n: int) -> int:\r\n \"\"\"\r\n Ref: https://codeforces.com/contest/242/problem/B\r\n \"\"\"\r\n left = min(list(map(lambda b: b[0],borders)))\r\n right = max(list(map(lambda b: b[1],borders)))\r\n\r\n for i in range(n):\r\n if left == borders[i][0] and right == borders[i][1]:\r\n return i + 1\r\n\r\n return -1\r\n \r\nn = int(input())\r\nborders = [list(map(int, input().split(' '))) for _ in range(n)]\r\nprint(solve(borders, n))\r\n", "import sys\r\n\r\n# Get input from console\r\nlist_input = []\r\nno_of_lines = sys.stdin.readline().strip()\r\nfor i in range(int(no_of_lines)):\r\n line = sys.stdin.readline().strip()\r\n list_input.append(tuple(line.split(' ')))\r\n\r\n# Get list first li and list second ri\r\nls = []\r\nrs = []\r\nfor item in list_input:\r\n ls.append(int(item[0].strip()))\r\n rs.append(int(item[1].strip()))\r\n\r\n# Sort li and sort reverse ri\r\n# Then get tuple result that can cover range\r\nls.sort()\r\nrs.sort(reverse=True)\r\nresult = (ls[0], rs[0])\r\n\r\n# Default index\r\nindex = -1\r\nindex_incr = 0\r\n\r\nfor item in list_input:\r\n index_incr += 1\r\n if int(result[0]) == int(item[0].strip()) and int(result[1]) == int(item[1].strip()):\r\n index = index_incr\r\n\r\nprint(str(index))\r\n", "import sys,os,io,time,copy\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\nimport math\r\n\r\ndef main():\r\n n=int(input())\r\n arr=[]\r\n for i in range(n):\r\n x,y=map(int,input().split())\r\n arr.append((x,y))\r\n m_x=1000000007\r\n m_y=-1\r\n for x,y in arr:\r\n if x<m_x:\r\n m_x=x\r\n if y>m_y:\r\n m_y=y\r\n pos=-1\r\n for i in range(n):\r\n x,y=arr[i]\r\n if x==m_x and y==m_y:\r\n pos=i+1\r\n print(pos)\r\nmain()\r\n\r\n", "n = int(input())\r\nl = 1e9+10\r\nr = 0\r\nline = []\r\nfor i in range(n):\r\n inp = input().split(' ')\r\n line.append([int(inp[0]), int(inp[1])])\r\n if line[i][0] < l:\r\n l = line[i][0]\r\n if line[i][1] > r:\r\n r = line[i][1]\r\n \r\ncover = -1\r\n\r\nfor i in range(n):\r\n if line[i][0] == l and line[i][1] == r:\r\n cover = i+1\r\n break\r\n\r\nprint(cover)\r\n ", "n=int(input())\r\nans=-1\r\n\r\nmi=1e12\r\nma=0\r\ndata=[]\r\nfor i in range(1,n+1):\r\n x,y=map(int,input().split())\r\n if x<=mi:\r\n mi=x\r\n if y>=ma:\r\n ma=y \r\n data.append([x,y])\r\n# data.sort(key= lambda x:x[1])\r\nfor i,item in enumerate(data):\r\n if item[0]==mi and item[1]==ma:\r\n ans=i+1\r\nprint(ans) ", "from sys import stdin, stdout, setrecursionlimit\r\nfrom gc import disable\r\n\r\n#stdin = open(\"apbtest.in\",\"r\")\r\n#stdout = open(\"apbtest.out\",\"w\")\r\n \r\n#setrecursionlimit((1<<31)-1)\r\n \r\n \r\ngets = input\r\nputs = print\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\n\r\ndef main() -> int:\r\n disable()\r\n n = int(input())\r\n ma = -1\r\n mi = 10**10\r\n s = []\r\n for i in range(n):\r\n l,r = map(int,input().split())\r\n if (l < mi):\r\n mi = l\r\n if (r > ma):\r\n ma = r\r\n s.append((l,r))\r\n try:\r\n print(\"%i\"%(1+s.index((mi,ma))))\r\n except:\r\n print(\"-1\")\r\n return 0;\r\n \r\nif (__name__ == \"__main__\"):\r\n main()\r\n \r\n#stdin.close()\r\n#stdout.close()", "# đọc dòng đầu chứa số lượng phần tử, hay số segment\r\nn = int(input())\r\nlist_segments = []\r\n\r\n# duyệt qua từng dòng trong n dòng tiếp theo, với dòng thứ i đọc vào thông tin của segment i\r\nfor i in range(n):\r\n\tlist_segments.append(list(map(int, input().split())))\r\n\r\n# duyệt tìm min_l theo các left của segment\r\n# nó cũng tương tự với lệnh for sau:\r\n# min_l = list_segments[0][0]\r\n# for i in range(n):\r\n# min_l = min(min_l, list_segments[i][0])\r\nmin_l = min(segment[0] for segment in list_segments)\r\n\r\n# duyệt tìm max_r theo các right của segment\r\nmax_r = max(segment[1] for segment in list_segments)\r\n\r\n# for lại để kiểm tra xem có đoạn nào trùng với [min_l, max_r] không\r\nresult = -1\r\nfor i in range(n):\r\n\tif min_l == list_segments[i][0] and max_r == list_segments[i][1]:\r\n\t\tresult = i + 1\r\n\t\tbreak\r\nprint(result)", "n=int(input())\r\nc=[]\r\nd=[]\r\nfor _ in range(n):\r\n\ta,b=map(int,input().split())\r\n\tc.append(a)\r\n\td.append(b)\r\nx=min(c)\r\ny=max(d)\r\nf=-1\r\nfor i in range(n):\r\n\tif x>=c[i] and y<=d[i]:\r\n\t\tf=i\r\n\t\tbreak\r\nif f==-1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(f+1)\r\n", "n=int(input())\r\na1=[]\r\na2=[]\r\narr=[]\r\nfor i in range(n):\r\n t=list(map(int,input().split()))\r\n a1.append(t[0])\r\n a2.append(t[1])\r\n arr.append(t)\r\n\r\nmin1=min(a1)\r\nmax1=max(a2)\r\nt1=[]\r\nt1.append(min1)\r\nt1.append(max1)\r\nif(t1 in arr):\r\n print(arr.index(t1)+1)\r\nelse:\r\n print(-1)\r\n\r\n", "n = int(input())\r\nA = tuple([tuple(map(int, input().split())) for i in range(n)])\r\n\r\nL = [l for l, r in A]\r\nR = [r for l, r in A]\r\n\r\nL = min(L)\r\nR = max(R)\r\n\r\np = (L, R)\r\nif p in A:\r\n print(A.index(p) + 1)\r\nelse:\r\n print(-1)", "def main():\r\n\r\n N = int(input())\r\n segments = []\r\n\r\n iN = 0\r\n while iN < N:\r\n segments.append(list(map(int, input().split()))) # append([x1, x2])\r\n iN += 1\r\n\r\n indexOfGreatest = -1\r\n\r\n # first step find \"great left\" and \"great right\"\r\n greatLeft = segments[0][0]\r\n greatRight = segments[0][1]\r\n for i in range(1, N):\r\n if segments[i][0] < greatLeft:\r\n greatLeft = segments[i][0]\r\n\r\n if segments[i][1] > greatRight:\r\n greatRight = segments[i][1]\r\n\r\n # find one have \"left\" equal \"great left\", \"right\" equal \"great right\"\r\n for i in range(0, N):\r\n if segments[i] == [greatLeft, greatRight]:\r\n indexOfGreatest = i + 1\r\n\r\n # return \"greatest\" index\r\n print(indexOfGreatest)\r\n\r\n return True\r\n\r\nmain()", "import math\r\nmin_start,max_end,segments = math.inf, -math.inf, {}\r\nfor i in range(int(input())):\r\n start,end = map(int,input().split(\" \"))\r\n segments[(start,end)] = i + 1\r\n min_start = min(min_start,start)\r\n max_end = max(max_end,end)\r\nif (min_start,max_end) in segments:\r\n print(segments[min_start,max_end])\r\nelse: print(-1)\r\n\r\n\r\n''' \r\nO(n)\r\n\r\nWe need to find segment which consists every single other one.\r\n\r\nThe solution for this problem is to get the earliest start (beginning)\r\nand the latest end among segments, and check whether this segments from these cords exists,\r\nbecause if we want to cover all other segments this segment should start \r\nearlier or in the same place as the second earliest (or be first itself) and end in the place \r\nat least as late as the latest second interval.\r\n\r\n\r\nWe need to remember that it needs to be the 'first beginnning' and the 'last end'\r\nsince otherwise we are not able to cover all segments.\r\n\r\n'''\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[204]:\n\n\n# # n = int(input())\n# # line = list(map(int, input().split()))\n# # line = list(str(input()))\n\n\n# In[360]:\n\n\nx, y = [], [] \n\nn = int(input())\nfor _ in range(n):\n line = list(map(int, input().split()))\n x.append(line[0])\n y.append(line[1])\n\n\n# In[365]:\n\n\nmin_val = min(x)\nmax_val = max(y)\nflag = 1\nc = 0\nfor i, j in zip(x, y):\n c += 1\n if i == min_val and j == max_val:\n print(c)\n flag = 0\n break\n \nif flag:\n print(\"-1\")\n\n\n# In[ ]:\n\n\n\n\n", "n = int(input())\r\nmin_start, max_end = None, None\r\nres_start, res_end = None, None\r\nres = 1\r\nfor i in range(n):\r\n L, R = map(int, input().split())\r\n if min_start == None == max_end: \r\n min_start, max_end = L, R\r\n res_start, res_end = min_start, max_end\r\n else:\r\n if L <= min_start and R >= max_end: \r\n res_start, res_end = L, R\r\n res = i + 1\r\n if L < min_start: min_start= L\r\n if R > max_end: max_end = R\r\n#print( res_start, res_end, min_start, max_end)\r\nif res_start <= min_start and res_end >= max_end: print(res)\r\nelif n == 1: print(1)\r\nelse: print(-1)", "class segment:\r\n def __init__(self, l, r):\r\n self.L = l;\r\n self.R = r;\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n b = segment(l, r)\r\n a.append(b)\r\n\r\ninf = 1000000009\r\nmaxi = -inf\r\nmini = inf\r\nfor i in a:\r\n if mini > i.L:\r\n mini = i.L\r\n if maxi < i.R:\r\n maxi = i.R\r\n\r\nres = -1\r\nfor i in range(1, n + 1):\r\n if mini == a[i-1].L and maxi == a[i-1].R:\r\n res = i\r\nprint(res)", "import math,sys\r\nfrom collections import Counter\r\ndef li(): return list(map(int,sys.stdin.readline().split()))\r\ndef ls(): return list(map(int,list(input())))\r\ndef la(): return list(input())\r\ndef ii(): return int(input())\r\ndef isPrime(n):\r\n i= 2\r\n if n == 1:\r\n return False\r\n while i <= int(math.sqrt(n)):\r\n if n%i == 0:\r\n return False\r\n i = i + 1\r\n return True\r\ndef gcd(a,b):\r\n if b == 0:\r\n return a\r\n return gcd(b,a%b)\r\nn = ii()\r\na = []\r\nb = []\r\nfor _ in range(n):\r\n l,r = li()\r\n a.append(l)\r\n b.append(r)\r\nx = min(a)\r\ny = max(b)\r\nflag =0\r\nfor i in range(len(a)):\r\n if a[i] == x and y == b[i]:\r\n flag = 1\r\n print(i+1)\r\n break\r\nif flag == 0:\r\n print(-1)\r\n \r\n \r\n\r\n \r\n \r\n \r\n ", "n = int(input())\n\na = []\nb = -1\nmn = 10000000000\nmx = 0\nfor i in range(n):\n a.append(list(map(int,input().split(' '))))\n mn = min(mn, a[i][0])\n mx = max(mx, a[i][1])\n if b == -1 or (a[b][0] >= a[i][0] and a[b][1] <= a[i][1]):\n b = i\n\nif a[b][0] <= mn and a[b][1] >= mx:\n print(b + 1)\nelse:\n print(-1)\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A, B):\r\n n = len(A)\r\n l = min(A)\r\n r = max(B)\r\n for i in range(n):\r\n if A[i] <= l and B[i] >= r:\r\n return i + 1\r\n return -1\r\n\r\ndef main():\r\n n = int(input())\r\n A = []\r\n B = []\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n A.append(a)\r\n B.append(b)\r\n ans = solve(A, B)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n x.append(a)\r\n y.append(b)\r\nt = min(x)\r\nv = max(y)\r\ns = [(x[i],y[i]) for i in range(n)]\r\nif (t,v) in s:\r\n print(s.index((t,v))+1)\r\nelse:\r\n print(-1)\r\n ", "n=int(input())\nchuoinho=[0]*n\nchuoilon=[0]*n\nfor i in range(n):\n chuoinho[i],chuoilon[i]=map(int,input().split())\nx=min(chuoinho)\ny=max(chuoilon)\nfor i in range(n):\n if chuoinho[i]==x and chuoilon[i]==y:\n print(i+1)\n exit(0)\nprint(-1)", "def bigSegment(n,li):\n\timport sys\n\tmin_=sys.maxsize\n\tmax_=-99\n\tmax_index = 0\n\tmin_index = 0\n\tfor j in range(2):\n\t\tfor i in range(n):\n\t\t\tif j == 0:\n\t\t\t\tif li[i][0] <= min_:\n\t\t\t\t\tmin_ = li[i][0]\n\t\t\telse:\n\t\t\t\tif li[i][1] >= max_:\n\t\t\t\t\tmax_ = li[i][1]\n\t\t\t\t\t\n\tfor i in range(n):\n\t\tif li[i][0] == min_ and li[i][1] == max_:\n\t\t\treturn i+1\n\n\telse:\n\t\treturn -1\n\nn=int(input())\nli=[]\nfor i in range(n):\n\ta=[int(x) for x in input().split()]\n\tli.append(a) \n\nprint(bigSegment(n,li))\n\n\n\t# if max_index == min_index:\n\t# \treturn min_index\n\t# elif li[min_index-1][1] == max_:\n\t# \treturn min_index\n\t# elif li[max_index-1][0] == min_:\n\t# \treturn max_index", "number = int(input())\ncoordinates = []\nx = []\ny = []\n\nfor i in range(number):\n coordinate = input().split(' ')\n coordinates.append(coordinate)\n x.append(int(coordinate[0]))\n y.append(int(coordinate[1]))\n\nmin_x = min(x)\nmax_y = max(y)\n\nres = -1\n\nfor i in range(number):\n if int(coordinates[i][0]) == min_x and int(coordinates[i][1]) == max_y:\n res = i + 1\n break\n\nprint(res)\n", "n = int(input())\r\nmx = float(\"inf\")\r\nmxs = set()\r\nmy = -1\r\nmys = set()\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if x < mx:\r\n mx = x\r\n mxs = {i + 1}\r\n elif x == mx:\r\n mxs.add(i + 1)\r\n if y > my:\r\n my = y\r\n mys = {i + 1}\r\n elif y == my:\r\n mys.add(i + 1)\r\nif mxs & mys:\r\n print(list(mxs & mys)[0])\r\nelse:\r\n print(-1)", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\n\r\nn = I()\r\nans = (1000000000,1)\r\nmini = 1000000000\r\nmaxi = 1\r\nindex = -1\r\n\r\nfor i in range(n):\r\n l,r = M()\r\n if l<=ans[0] and r>=ans[1]:\r\n ans = (l,r)\r\n index = i+1\r\n if l<mini:\r\n mini = l\r\n if r>maxi:\r\n maxi = r \r\n\r\nif mini ==ans[0] and maxi==ans[1]:\r\n print(index)\r\nelse:\r\n print(-1)", "from collections import defaultdict, deque, Counter, OrderedDict\r\n\r\ndef main():\r\n n = int(input())\r\n mi,ma = 10**10,-1\r\n l = []\r\n for i in range(n):\r\n a,b = map(int,input().split())\r\n mi = min(mi,a)\r\n ma = max(ma,b)\r\n l.append((a,b))\r\n\r\n check,ind = False,0\r\n for i,v in enumerate(l):\r\n if check: break\r\n check |= (v[0] <= mi and v[1] >= ma)\r\n ind = i+1\r\n\r\n print(ind if check else -1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n \"\"\"sys.setrecursionlimit(400000)\r\n threading.stack_size(40960000)\r\n thread = threading.Thread(target=main)\r\n thread.start()\"\"\"\r\n main()", "# RawCoder : https://bit.ly/RCyouTube\r\n# Author : MehulYK\r\nn = int(input())\r\nar, br = [], []\r\nfor i in range(n):\r\n a, b = map(int, input().split()) \r\n ar.append(a)\r\n br.append(b)\r\n #diff.append((b - a) + 1)\r\nmi = min(ar)\r\nma = max(br)\r\nind = [index for index, element in enumerate(ar) if element == mi]\r\nfor k in ind:\r\n if(br[k] == ma):\r\n print(k + 1)\r\n exit()\r\nprint(-1)", "from math import radians\r\n\r\n\r\ni=int(input())\r\nl=[]\r\nm1=float(\"inf\")\r\nm2=-float(\"inf\")\r\nfor x in range(i):\r\n l1,r=map(int,input().split())\r\n m2=max(m2,r)\r\n m1=min(m1,l1)\r\n l.append((l1,r))\r\n\r\nk=sorted(l,key=lambda x:x[1],reverse=True)\r\nj=m2-m1\r\nans=-1\r\nfor x in range(len(l)):\r\n if l[x][1]-l[x][0]==j:\r\n ans=x+1\r\n break\r\nprint(ans)\r\n\r\n", "import math\nn = int(input())\nl = math.inf\nr = - math.inf\na = []\nfor _ in range(n):\n x,y = map(int,input().split())\n if x<l:\n l=x\n if y>r:\n r=y\n a.append((x,y))\nflag = True\nfor i in range(n):\n if a[i][0]== l and a[i][1]==r:\n break\nelse:\n flag = False\n print(-1)\nif flag:\n print(i+1)", "n=int(input())\r\na=[0]*n\r\nb=[0]*n\r\ncount=0\r\nfor i in range(n):\r\n a[i],b[i]=map(int,input().split())\r\nx=min(a)\r\ny=max(b)\r\nfor i in range(n):\r\n if a[i]==x and b[i]==y:\r\n print(i+1)\r\n exit(0)\r\nprint(-1)", "n=int(input())\r\nl1=[]\r\nr1=[]\r\nfor i in range(n):\r\n #lst = list(map(int, input().strip().split(' ')))\r\n l,r = map(int, input().strip().split(' '))\r\n l1.append(l)\r\n r1.append(r)\r\nm1=10**9 + 1\r\nm2=0\r\nt=0\r\nfor i in range(n):\r\n if l1[i]<=m1 and r1[i]>=m2:\r\n t=i\r\n m1=l1[i]\r\n m2=r1[i]\r\nif m1==min(l1) and m2==max(r1):\r\n print(t+1)\r\nelse:\r\n print(-1)\r\n ", "n = int(input())\r\nli=[]\r\nL,R = float(\"inf\"),0\r\nfor _ in range(n):\r\n l,r = map(int,input().split())\r\n L=min(l,L)\r\n R=max(r,R)\r\n li.append((l,r))\r\nf=0\r\nfor c in li:\r\n if c[0]==L and c[1]==R:\r\n f=1\r\n print(li.index(c)+1)\r\n\r\nif f==0:\r\n print(-1)\r\n", "n = int(input())\r\nl, r = [], []\r\nLmin = 1e9\r\nRmax = 0\r\nfor i in range(0, n):\r\n a, b = map(int, input().split())\r\n l.append(a)\r\n r.append(b)\r\n Lmin = min(Lmin, l[i])\r\n Rmax = max(Rmax, r[i])\r\n\r\nflag = 0\r\nfor i in range(0, n):\r\n if l[i] == Lmin and r[i] == Rmax: \r\n flag = 1\r\n print(i+1)\r\n\r\nif (flag == 0): print(-1)", "n = int(input())\nl = []\nl1 = []\nfor i in range(n):\n a,b = map(int,input().split())\n l1.append(a)\n l1.append(b)\n l.append((a,b))\nzmin = min(l1)\nzmax = max(l1)\nflag = True\nfor i in range(n):\n if l[i][0] <= zmin and l[i][1] >= zmax:\n print(i+1)\n flag = False\n break\nif flag:\n print(-1)\n", "n, mn, mx, arr = input(), 1000000000, 0, []; \r\nfor _ in range(int(n)):\r\n\t*a, = map(int, input().split())\r\n\tmn, mx = min(mn, a[0]), max(mx, a[1])\r\n\tarr.append(a)\r\nprint(arr.index([mn,mx])+1 if([mn, mx] in arr) else -1) ", "# coding: utf-8\nn = int(input())\nsegments = [[int(i) for i in input().split()] for j in range(n)]\nleft = segments[0][0]\nright = segments[0][1]\nfor seg in segments:\n if seg[0]<left:\n left = seg[0]\n if seg[1]>right:\n right = seg[1]\nfor i in range(n):\n if segments[i][0]<=left and segments[i][1]>=right:\n print(i+1)\n break\nelse:\n print(-1)\n", "a = list(tuple(map(int, input().split())) for _ in range(int(input())))\r\n\r\nlm = 1000000001\r\nrm = 0\r\n\r\nfor seg in a:\r\n lm = min(seg[0], lm)\r\n rm = max(seg[1], rm)\r\n\r\ntry:\r\n print(a.index((lm, rm)) + 1)\r\nexcept ValueError:\r\n print(-1)\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################", "n=int(input())\r\nA=[]\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n A.append([x,y])\r\nl=10**9+1\r\nr=0\r\nfor i in A:\r\n l=min(l,i[0])\r\n r=max(r,i[1])\r\nloc=-1\r\nfor i in range(n):\r\n if(A[i][0]==l and A[i][1]==r):\r\n loc=i+1\r\n break\r\nprint(loc)", "def big_segment(list_segment):\r\n if (len(list_segment) <= 1):\r\n print(1)\r\n return\r\n min = list_segment[0][0]\r\n max = list_segment[0][1]\r\n for segment in list_segment:\r\n if (segment[0] < min):\r\n min = segment[0]\r\n if (segment[1] > max):\r\n max = segment[1]\r\n for index in range(len(list_segment)):\r\n if ((list_segment[index][0] == min) and (list_segment[index][1] == max)):\r\n print(index + 1)\r\n return\r\n print(-1)\r\n\r\n# Input\r\nlist_segment = []\r\nnum_segment = int(input())\r\nfor index in range(num_segment):\r\n segment = list(map(int, input().split()))\r\n list_segment.append(segment)\r\n\r\n# Run and get output\r\nbig_segment(list_segment)", "n=int(input())\r\n\r\nl=[]\r\nr=[]\r\n\r\nfor i in range(0,n):\r\n a,b=map(int, input().split())\r\n\r\n l.append(a)\r\n r.append(b)\r\n\r\na=min(l)\r\nb=max(r)\r\n\r\ns1=set()\r\n\r\nfor i in range(0,n):\r\n if l[i]==a:\r\n s1.add(i)\r\n\r\nfor j in range(0,n):\r\n if r[j]==b:\r\n if j in s1:\r\n print (j+1)\r\n break\r\nelse:\r\n print (-1)", "import sys\r\nimport functools\r\ninput = sys.stdin.readline\r\n\r\nN = int(input().strip())\r\nsegments = [list(map(int, input().strip().split())) for _ in range(N)]\r\nmn = min(s[0] for s in segments)\r\nmx = max(s[1] for s in segments)\r\ns, e = None, None\r\nfor i, segs in enumerate(segments):\r\n x, y = segs\r\n if mn == x and mx == y:\r\n print(i + 1)\r\n quit()\r\n\r\nprint(-1)", "l = list( list(map(int, input().split())) for _ in range(int(input())))\r\nx = min(i[0] for i in l)\r\ny = max(i[1] for i in l)\r\nprint(l.index([x,y])+1 if [x,y] in l else -1)", "R=input\r\nI=lambda:map(int,R().split())\r\nn=int(R())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n x,y=I()\r\n a.append(x)\r\n b.append(y)\r\nx=min(a)\r\ny=max(b)\r\nfor i in range(n):\r\n\tif a[i]==x and b[i]==y:\r\n\t print(i+1)\r\n\t exit()\r\nprint(-1)", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n temp = list(map(int, input().split()))\r\n a.append(temp)\r\n\r\nminL = a[0][0]\r\nfor i in range(n):\r\n if(a[i][0] <= minL):\r\n minL = a[i][0]\r\n\r\nmaxR = a[0][1]\r\nfor i in range(n):\r\n if(a[i][1] >= maxR):\r\n maxR = a[i][1]\r\n\r\nk = -1\r\nfor i in range(n):\r\n if(a[i][0] == minL and a[i][1] == maxR):\r\n k = i\r\nif(k != -1):\r\n print(k+1)\r\nelse:\r\n print(k)", "import sys\r\nn = int(input())\r\nseg = []\r\nseg1 = []\r\nall = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n seg.append(a)\r\n seg1.append(b)\r\n all.append([a,b])\r\nlo,hi = min(seg),max(seg1)\r\nfor i in range(n):\r\n if all[i][0]<=lo and all[i][1]>=hi:\r\n print(i+1)\r\n sys.exit()\r\nprint(-1)", "n = int(input())\r\nl, r = [0] * n, [0] * n\r\nL, R = 1000000001, 0\r\nfor i in range(n):\r\n l[i], r[i] = map(int, input().split())\r\n L, R = min(L, l[i]), max(R, r[i])\r\nf = True\r\nfor i in range(n):\r\n if l[i] == L and r[i] == R:\r\n print(i + 1)\r\n f = False\r\n break\r\nif f:\r\n print(-1)", "a = [list(map(int,input().split())) for _ in ' '*int(input())]\r\nl = min([x[0] for x in a])\r\nr = max([x[1] for x in a])\r\ntry: print(a.index([l,r])+1)\r\nexcept ValueError: print(-1)", "a = []\r\nb = []\r\nc = [] \r\nt = int(input())\r\nfor i in range (t):\r\n seg = list(map(int,input().split()))\r\n a.append(seg[0])\r\n b.append(seg[1])\r\n c.append(seg)\r\nmin_a = min(a)\r\nmax_b = max(b)\r\nbig_seg = [min_a,max_b]\r\nif big_seg in c:\r\n print (c.index(big_seg)+1)\r\nelse: print (-1)", "n = int(input())\r\nlist_segment = []\r\nlist_min = []\r\nlist_max = []\r\n\r\nfor _ in range(n):\r\n segment = list(map(int, input().split()))\r\n list_min.append(segment[0])\r\n list_max.append(segment[1])\r\n list_segment.append(segment)\r\n\r\nmin = min(list_min)\r\nmax = max(list_max)\r\ncount = 1\r\n\r\nfor s in list_segment:\r\n if ((s[0] == min) & (s[1] == max)):\r\n print(count)\r\n exit()\r\n else:\r\n count += 1\r\n\r\nprint(-1)", "n = int(input())\r\narr = []\r\nflatArr = []\r\n\r\nfor i in range(n):\r\n tmpArr = list(map(int, input().split()))\r\n arr.append(tmpArr)\r\n flatArr.append(tmpArr[0])\r\n flatArr.append(tmpArr[1])\r\n\r\nflatArr.sort()\r\nsmallest = flatArr[0]\r\nbiggest = flatArr[-1]\r\n\r\nfor i in range(len(arr)):\r\n if (arr[i][0] <= smallest) & (arr[i][1] >= biggest):\r\n print(i + 1)\r\n exit(0)\r\n\r\nprint('-1')", "from collections import Counter\nfrom math import ceil\n\ndef main():\n n = int(input())\n segs = [tuple(map(int, input().split())) for _ in range(n)]\n poss = max(segs, key=lambda seg: seg[1]-seg[0])\n posx, posy = poss\n for x, y in segs:\n if posx > x or y > posy:\n print(-1)\n break\n else:\n print(segs.index(poss) + 1)\n\nmain()\n", "def solve():\r\n n = int(input())\r\n x = []\r\n y = []\r\n for i in range(n):\r\n a,b = map(int, input().split())\r\n x.append(a)\r\n y.append(b)\r\n maxm = max(y)\r\n minm = min(x)\r\n c = -100\r\n for i in range(n):\r\n if y[i] == maxm and x[i] == minm:\r\n c = i+1\r\n break\r\n if c == -100:\r\n print(-1)\r\n return\r\n print(c)\r\n return\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\nd = []\r\n\r\nvmin = 1000000001\r\nvmax = 0\r\n\r\nfor i in range(n):\r\n l, r = [int(x) for x in (sys.stdin.readline()).split()]\r\n d.append((i + 1, (l, r)))\r\n if(l < vmin):\r\n vmin = l\r\n if(r > vmax):\r\n vmax = r\r\n \r\n#d.sort(key = lambda x: x[1][0]) \r\n\r\nk = -1\r\nfor i in d:\r\n if(i[1][0] <= vmin and i[1][1] >= vmax):\r\n k = i[0]\r\n\r\nprint(k) \r\n", "n = int(input())\r\nminert, maxert = map(int, input().split())\r\nlefed = 1\r\nfor i in range(2, n+1):\r\n\ta, b = map(int, input().split())\r\n\tif a < minert:\r\n\t\tminert = a\r\n\t\tlefed = -1\r\n\tif b > maxert:\r\n\t\tmaxert = b\r\n\t\tlefed = -1\r\n\tif a == minert and b == maxert:\r\n\t\tlefed = i\r\nprint(lefed)", "n=int(input())\r\nlist1=[]\r\nmaxi,mini=-float(\"inf\"),float(\"inf\")\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n list1.append([a,b])\r\n maxi=max(maxi,b)\r\n mini=min(mini,a)\r\ncount=0\r\ntemp=0\r\nfor data1,data2 in list1:\r\n if mini==data1 and maxi==data2:\r\n temp=1\r\n break\r\n count+=1\r\nif temp==0:\r\n print(-1)\r\nelse:\r\n print(count+1)", "n = int(input())\r\np = []\r\nal = []\r\nbl = []\r\nwhile n > 0:\r\n n -= 1\r\n a, b = map(int, input().split())\r\n p.append([a, b])\r\n al.append(a)\r\n bl.append(b)\r\nt1 = min(al)\r\nt2 = max(bl)\r\nif [t1, t2] in p:\r\n print(p.index([t1, t2]) + 1)\r\nelse:\r\n print(-1)\r\n", "def solve():\r\n n = int(input())\r\n arr = [[] for _ in range(n)]\r\n n_max = 0\r\n n_min = 10000000000\r\n for i in range(n):\r\n l,r = map(int,input().split())\r\n arr[i].append(l)\r\n arr[i].append(r)\r\n if(l < n_min):\r\n n_min = l\r\n if(r > n_max):\r\n n_max = r\r\n for i in range(len(arr)):\r\n if(arr[i][0] == n_min and arr[i][1] == n_max):\r\n return i+1\r\n return -1\r\nprint(solve())\r\n\r\n", "#!/usr/bin/env python3\nimport sys\n\nif __name__ == \"__main__\":\n\tn = int(sys.stdin.readline())\n\tminn = None\n\tmaxx = None\n\tcurr = None\n\tlr = []\n\tfor i in range(n):\n\t\tl, r = map(int, sys.stdin.readline().split())\n\t\tlr.append((l,r))\n\t\tif not minn:\n\t\t\tminn = l\n\t\tif l < minn:\n\t\t\tminn = l\n\t\tif not maxx:\n\t\t\tmaxx = r\n\t\tif r > maxx:\n\t\t\tmaxx = r\n\t\tif (l, r) == (minn, maxx):\n\t\t\tcurr = i\n\tif lr[curr] == (minn, maxx):\n\t\tprint(curr + 1)\n\telse:\n\t\tprint(-1)\n", "n = int(input())\r\nL = n*[0]\r\nR = n*[0]\r\nfor i in range(n):\r\n L[i], R[i] = map(int, input().split())\r\n\r\nleft = min(L)\r\nright = max(R)\r\nfor i in range(n):\r\n if L[i] == left and R[i] == right:\r\n print(i+1)\r\n exit()\r\nprint(-1)", "templ = None\r\nfor i in range(int(input())):\r\n l, r = map(int, input().split())\r\n if templ == None:\r\n templ = l\r\n tempr = r\r\n Ans = 1\r\n elif (l <= templ and r >= tempr):\r\n templ = l\r\n tempr = r\r\n Ans = i + 1\r\n elif l < templ:\r\n templ = l\r\n Ans = -1\r\n elif r > tempr:\r\n tempr = r\r\n Ans = -1\r\nprint(Ans) \r\n", "z=[]\r\nx1=y=[]\r\nn=int(input())\r\nfor x in range(n):\r\n\tp,q=map(int,input().split())\r\n\tx1.append(p)\r\n\ty.append(q)\r\n\tz.append([p,q])\r\nn1=min(x1)\r\nn2=max(y)\r\nfor x in range(n):\r\n\tif z[x][0]==n1 and z[x][1]==n2:\r\n\t\tprint(x+1)\r\n\t\tbreak\r\nelse:print(-1)", "n=int(input())\r\nmaxi,mini=0,2**31\r\nx=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n mini=min(mini,a)\r\n maxi=max(b,maxi)\r\n x.append([a,b])\r\nc=-1\r\nfor i,j in enumerate(x):\r\n if j[0]==mini and j[1]==maxi:\r\n c=i+1\r\n break\r\nprint(c)", "import math\nif __name__ == \"__main__\":\n n = int(input())\n MIN, MAX, segments, answer = math.inf, 0, [], -1\n for i in range(n):\n [x, y] = [int(i) for i in input().split()]\n MIN = MIN if MIN < x else x\n MAX = MAX if MAX >= y else y\n segments.append([x, y])\n for i, s in enumerate(segments):\n if s[0] == MIN and s[1] == MAX:\n answer = i + 1\n break\n print(answer)\n", "n=int(input())\nHashTable={}\nMin=float('inf')\nMax=-float('inf')\nfor i in range(n):\n\ta,b=list(map(int,input().split()))\n\tHashTable[(a,b)]=i+1\n\tMin=min(Min,a)\n\tMax=max(Max,b)\ntry:\n\tprint(HashTable[(Min,Max)])\nexcept Exception:\n\tprint(-1)\n", "n=int(input())\r\nl=[]\r\nli=[]\r\ngoon=True\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n l.append(a)\r\n li.append(b)\r\nc=min(l)\r\nd=max(li)\r\nfor i in range(n):\r\n if l[i]==c and li[i]==d:\r\n print(i+1)\r\n goon=False\r\nif goon:\r\n print(\"-1\")\r\n \r\n", "from sys import stdin\r\na = [list(map(int,stdin.readline().split())) for _ in ' '*int(stdin.readline())]\r\nl = min([x[0] for x in a])\r\nr = max([x[1] for x in a])\r\ntry: print(a.index([l,r])+1)\r\nexcept ValueError: print(-1)", "from sys import stdin\r\nimport math\r\n\r\nn = int(stdin.readline().rstrip())\r\n\r\nml, mr = math.inf, -math.inf\r\nsegs = []\r\n\r\nfor _ in range(n):\r\n l, r = map(int, stdin.readline().rstrip().split(' '))\r\n segs.append((l,r))\r\n ml = min(ml, l); mr = max(mr, r)\r\n\r\nfor i, e in enumerate(segs):\r\n l, r = e\r\n if l == ml and r == mr:\r\n print(i+1)\r\n exit()\r\n\r\nprint(-1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jul 1 15:58:42 2018\r\n\r\n@author: Quang Huy\r\n\"\"\"\r\n\r\nn = int(input())\r\nl = [0] * n\r\nr = [0] * n\r\nfor i in range(n):\r\n l[i], r[i] = map(int, input().split())\r\nLeft = min(l)\r\nRight = max(r)\r\nfor i in range(n):\r\n if l[i] == Left and r[i] == Right:\r\n print(i + 1)\r\n exit()\r\n\r\nprint(-1)", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n a, b = [int(j) for j in input().split()]\r\n arr.append((a, a-b, -i))\r\n arr.append((b, b-a, i))\r\n \r\n\r\narr.sort()\r\n\r\nif -arr[0][2] == arr[-1][2]:\r\n print(arr[-1][2]+1)\r\n \r\nelse:\r\n print(-1)", "n = int(input())\r\na = []\r\nl = []\r\nr = []\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n a.append([x,y])\r\n l.append(x)\r\n r.append(y)\r\nif([min(l),max(r)] in a):\r\n print(a.index([min(l),max(r)])+1)\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\np = -1\r\n\r\nl_array = []\r\nr_array = []\r\n\r\nfor i in range (n):\r\n l, r = map(int, input().split())\r\n l_array.append(l)\r\n r_array.append(r)\r\nx = max(r_array)\r\ny = min(l_array)\r\n\r\nfor i in range (n):\r\n if l_array[i] == y and r_array[i] == x:\r\n p = i + 1\r\n\r\nprint(p)\r\n\r\n\r\n\r\n \r\n", "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\nl1=[]\r\nl2=[]\r\nfor i in l:\r\n l1.append(i[0])\r\n l2.append(i[1])\r\nmi=min(l1)\r\nma=max(l2)\r\nif [mi,ma] in l:\r\n print(l.index([mi,ma])+1)\r\n exit()\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nmaxi = 0\r\nmini = float(\"inf\")\r\nd = []\r\nc = -1\r\nfor i in range(n):\r\n\ta,b = map(int,input().split())\r\n\tmini = min(mini,a,b)\r\n\tmaxi = max(maxi,a,b)\r\n\td.append((a,b))\r\n\r\na = (mini,maxi)\t\r\nfor i in range(n):\r\n\tif d[i]==a:\r\n\t\tc = i+1\r\n\r\nprint(c)", "a,n=[],int(input())\r\nfor i in range(n):\r\n L,R=map(int,input().split())\r\n a.append([L,R,i])\r\n\r\na=sorted(a,key=lambda x:(x[0],-x[1]))\r\n\r\nfor i in range(1,n):\r\n if a[i][1]>a[0][1]:\r\n print(-1)\r\n exit()\r\nprint(a[0][2]+1)\r\n", "import sys\r\n\r\nn = int(input())\r\narr1 = []\r\narr2 = []\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n arr1.append(a)\r\n arr2.append(b)\r\nx,y = min(arr1),max(arr2)\r\nfor i in range(n):\r\n if(arr1[i]==x and arr2[i]==y):\r\n print(i+1)\r\n sys.exit()\r\nprint(-1)\r\n\r\n", "t=int(input())\r\nl1,r1=map(int,input().split())\r\nc=l1\r\nd=r1\r\nf=idx=0\r\na=[(l1,r1)]\r\nfor _ in range(t-1):\r\n l,r=map(int,input().split())\r\n a.append((l,r))\r\n if c>l:c=l\r\n if d<r:d=r\r\n\r\nfor i in range(t):\r\n if a[i][0]==c and a[i][1]==d:\r\n f=1\r\n idx=i+1\r\n break\r\nif f==1:print(idx)\r\nelse:print(-1)", "from math import inf\nn = int(input())\nlesl = inf\ngrr = 0\nindl = -1\nindr = -1\nlar = []\nrar = []\nfor i in range(n):\n\tiarr = list(map(int,input().split()))\n\tl = iarr[0]\n\tr = iarr[1]\n\tlar.append(l)\n\trar.append(r)\n\t#lesl = min(l,lesl)\n\tif l<lesl:\n\t\tlesl = l\n\t\tindl = i\n\tif r>grr:\n\t\tgrr = r\n\t\tindr = i\nflag = 0\nfor i in range(n):\n\tif lar[i]==lesl and rar[i]==grr:\n\t\tprint(i+1)\n\t\tflag=1\n\t\tbreak\nif flag==0:\n\tprint(-1)\n", "n = int(input())\n#a = list(map(int, input().split()))\nL = [0]*n\nR = [0]*n\nfor i in range(n):\n L[i], R[i] = map(int, input().split())\n\nsmallest = min(L)\nlargest = max(R)\n\nfor i in range(n):\n if L[i] == smallest and R[i] == largest:\n print(i+1)\n exit()\nprint(-1)", "n = int(input())\r\nl = []\r\n\r\nfor i in range(n):\r\n\tl.append(list(map(int, input().split())))\r\n\r\nmin = l[0][0]\r\nmax = l[0][0]\r\ncheck = True\r\n\r\nfor i in l:\r\n\tif i[0] < min:\r\n\t\tmin = i[0]\r\n\tif i[1] > max:\r\n\t\tmax = i[1]\r\n\r\nfor i in range(len(l)):\r\n\tif l[i][0] == min and l[i][1] == max:\r\n\t\tprint(i+1)\r\n\t\tcheck = False\r\n\r\nif check:\r\n\tprint(-1)\r\n\r\n", "\r\na=int(input())\r\nmini=float(\"inf\")\r\nmaxi=-float(\"inf\")\r\nval=1 \r\ng={}\r\nfor i in range(a):\r\n b,c=list(map(int,input().split()))\r\n mini=min(mini,b)\r\n maxi=max(maxi,c)\r\n #g.append((b,c))\r\n g[(b,c)]=val\r\n val=val+1 \r\nif (mini,maxi) in g:\r\n print(g[(mini,maxi)])\r\nelse:\r\n print(-1)", "n = int(input())\nmin_l, max_r = 10 ** 9 + 1, 0\nalls = []\nfor i in range(n):\n l, r = map(int, input().split())\n min_l = min(min_l, l)\n max_r = max(max_r, r)\n alls.append([l, r])\n\nfor item in alls:\n if item[0] == min_l and item[1] == max_r:\n print(alls.index(item) + 1)\n exit()\nprint(-1)\n", "n = int(input())\nsegments = []\nminL = pow(10,10)\nmaxR = -1\nfor i in range(n):\n l,r = map(int,input().split())\n segments.append([l,r])\n minL = min(l,minL)\n maxR = max(r,maxR)\nfor i in range(len(segments)):\n if segments[i][0] == minL and segments[i][1] == maxR:\n print(i+1)\n exit()\nprint(-1)\n\n\n\n", "n = int(input())\r\narrL = []\r\narrR = []\r\n\r\nfor i in range(n):\r\n tempL, tempR = map(int, input().split())\r\n arrL.append(tempL)\r\n arrR.append(tempR)\r\n\r\nminL = min(arrL)\r\nmaxR = max(arrR)\r\n\r\n'''segment i covers all of the others should have min Li and max Ri'''\r\n\r\nans = False\r\n\r\nfor i in range(n):\r\n if arrL[i] == minL and arrR[i] == maxR:\r\n ans = True\r\n break\r\nif ans:\r\n print(i + 1)\r\nelse:\r\n print(-1)", "n = int(input())\r\ns1 = list(map(int, input().split()))\r\nlongest = s1\r\nlowest = s1[0]\r\nhighest = s1[1]\r\nret = 0\r\n\r\nfor i in range(1,n):\r\n s = list(map(int, input().split()))\r\n if s[1] - s[0] > longest[1] - longest[0]:\r\n longest = s\r\n ret = i\r\n if s[0] < lowest:\r\n lowest = s[0]\r\n if s[1] > highest:\r\n highest = s[1]\r\n\r\nif longest == [lowest, highest]:\r\n print(ret + 1)\r\nelse:\r\n print(-1)", "n = int(input())\nm = []\nfor i in range(n):\n\ta, b = map(int, input().split())\n\tm.append([a,b])\n\nmi = min([ x[0] for x in m])\nma = max([ x[1] for x in m])\nseg = [mi, ma]\nif seg in m:\n\tprint(m.index(seg)+1)\nelse:\n\tprint(-1)", "n=int(input())\r\nans=0\r\na,b=0,0\r\nmina,maxb=map(int,input().split())\r\nfor i in range(1,n):\r\n a,b=map(int,input().split())\r\n if a<mina:\r\n mina=a\r\n ans=-1\r\n if b>maxb:\r\n maxb=b\r\n ans=-1\r\n if a==mina and b==maxb:\r\n ans=i\r\nif ans==-1:\r\n print(ans)\r\nelse:\r\n print(ans+1)\r\n\r\n \r\n", "n=int(input());k=[];mi,ma=10**10,0;x,y=0,0\r\nfor i in range(n):\r\n\tl,r=map(int,input().split())\r\n\tmi=min(mi,l);ma=max(r,ma)\r\n\tk.append([l,r])\r\nfor i in range(n):\r\n\tif k[i][0]==mi and k[i][1]==ma:print(i+1);break\r\nelse:print(-1)", "n = int(input())\r\n\r\nleft_arr = []\r\nright_arr = []\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n left_arr.append(a)\r\n right_arr.append(b)\r\n\r\nmin_left_element = min(left_arr)\r\nmax_right_element = max(right_arr)\r\nans = -1\r\n\r\nfor i in range(n):\r\n if left_arr[i] == min_left_element and right_arr[i] == max_right_element:\r\n ans = i + 1\r\n break\r\n\r\nprint(ans)\r\n", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\n\r\n\r\ndef ip(n):\r\n if n % 2 == 0:\r\n return n == 2\r\n d = 3\r\n while d * d <= n and n % d != 0:\r\n d += 2\r\n return d * d > n\r\nk=[];mi=pow(10,10);ma=-1\r\nfor x in range(nt()):\r\n a,b=mn()\r\n mi=min(mi,a)\r\n ma=max(b,ma)\r\n k.append((a,b))\r\nif (mi,ma) in k:\r\n print(k.index((mi,ma))+1)\r\nelse:\r\n print(-1)", "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\nIntMx=sys.maxsize\r\nIntMn=-sys.maxsize-1\r\n\r\na=[]\r\nmn,mx=IntMx,IntMn\r\nfor _ in range(int(input())):\r\n x,y=map(int,input().split())\r\n mn=min(x,mn)\r\n mx=max(mx,y)\r\n a.append((x,y))\r\ncmp=(mn,mx)\r\n\r\nflag=-1\r\n\r\nfor i in range(len(a)):\r\n if(a[i]==cmp):\r\n flag=i+1\r\n break\r\n\r\nprint(flag)", "class doanthang:\r\n def __init__(self,n,ls):\r\n self.n=n\r\n self.ls=ls\r\n self.idx=0\r\n def tim(self):\r\n min=self.ls[0][0]\r\n max=self.ls[0][1]\r\n mx=self.ls[0][1]\r\n for i in range(1,self.n):\r\n if min>self.ls[i][0]:\r\n min=self.ls[i][0]\r\n max=self.ls[i][1]\r\n self.idx=i\r\n elif min==self.ls[i][0] and max<self.ls[i][1]:\r\n max=self.ls[i][1]\r\n self.idx=i\r\n if mx<self.ls[i][1]:\r\n mx=self.ls[i][1]\r\n if self.ls[self.idx][1]>=mx:\r\n return self.idx+1\r\n return -1\r\n def print(self):\r\n print(self.tim())\r\ndef main():\r\n n=int(input())\r\n ls=[]\r\n for i in range(n):\r\n ls.append(list(map(int,input().split())))\r\n dt=doanthang(n,ls)\r\n dt.print()\r\nmain()\r\n\r\n\r\n\r\n", "n = int(input())\r\nsegments = []\r\n\r\nmin_l, max_r = float('inf'), 0\r\n\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n segments.append((l, r))\r\n min_l = min(min_l, l)\r\n max_r = max(max_r, r)\r\n\r\nfor i, segment in enumerate(segments):\r\n l, r = segment\r\n if l == min_l and r == max_r:\r\n print(i + 1)\r\n break\r\nelse:\r\n print(-1)", "n = int(input())\r\na, b = 10**9, -1\r\nl = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n a = min(a, x)\r\n b = max(b, y)\r\n l.append((x, y))\r\ntry:\r\n print(l.index((a, b))+1)\r\nexcept ValueError:\r\n print(-1)", "def segment(lst, lst1):\r\n pair = [lst1[0], lst1[- 1]]\r\n if pair in lst:\r\n return lst.index(pair) + 1\r\n return -1\r\n\r\n\r\nn = int(input())\r\na, b = list(), list()\r\nfor i in range(n):\r\n l, r = [int(x) for x in input().split()]\r\n a.append([l, r])\r\n b.append(l)\r\n b.append(r)\r\nprint(segment(a, sorted(b)))\r\n", "n = int(input())\r\nsegments = []\r\nfor i in range(n):\r\n l,r = map(int, input().split())\r\n segments.append([l,r])\r\n\r\nminL = segments[0][0]\r\nmaxR = segments[0][1]\r\nfor i in segments:\r\n minL = min(minL, i[0])\r\n maxR = max(maxR, i[1])\r\nfor i in range(n):\r\n if(segments[i][0] == minL and segments[i][1] == maxR):\r\n print(i + 1)\r\n break\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nlst = []\r\n\r\nminl, maxr = map(int, input().split())\r\nlst.append([minl,maxr])\r\n\r\nfor i in range(1, n):\r\n\tl, r = map(int, input().split())\r\n\tlst.append([l,r])\r\n\tif l < minl:\r\n\t\tminl = l\r\n\tif r > maxr:\r\n\t\tmaxr = r\r\nans = -1\r\nfor i in range(len(lst)):\r\n\tif lst[i][0] == minl and lst[i][1] == maxr:\r\n\t\tans = i + 1\r\nprint(ans)", "n = int(input())\r\nlmin, rmax = tuple(map(int, input().split()))\r\nans = 1\r\nfor i in range(2,n+1):\r\n l, r = tuple(map(int, input().split()))\r\n if l <= lmin and r >= rmax:\r\n ans = i\r\n elif l < lmin or r > rmax:\r\n ans = -1\r\n lmin = min(l, lmin)\r\n rmax = max(r, rmax)\r\nprint(ans)", "from sys import *\r\nfrom collections import Counter\r\ninput = lambda:stdin.readline()\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\nmn,mx = float('inf'),float('-inf')\r\nn = int(input())\r\nlst = []\r\nfor i in range(n):\r\n l,r = get_int()\r\n lst.append([l,r])\r\n if l < mn:\r\n mn = l\r\n if r > mx:\r\n mx = r\r\n\r\nind = -1\r\nfor i in range(n):\r\n if lst[i][0] <= mn and lst[i][1] >= mx:\r\n ind = i\r\nprint(ind + 1 if ind != -1 else -1)", "n = int(input())\n\na = 1000000000\nb = 0\nc = []\nd = []\nl = 0\n\nfor i in range(n):\n auxa, auxb = list(map(int, input().split(' ')))\n if auxa < a:\n a = auxa\n if auxb > b:\n b = auxb\n c.append(auxa)\n d.append(auxb)\n l += 1\n\nfor i in range(l):\n if c[i] == a and d[i] == b:\n print(i+1)\n exit()\n\nprint(-1)\n \t\t \t\t \t \t \t\t \t\t\t\t \t \t\t\t\t\t", "number_of_segments = int(input())\r\n\r\nsegments = []\r\nmin_left = 1000000001\r\nmax_right = 0\r\nindex_of_largest_segment = -1\r\n\r\nfor index in range(number_of_segments):\r\n\tleft, right = map(int, input().split())\r\n\tif left < min_left:\r\n\t\tmin_left = left\r\n\tif right > max_right:\r\n\t\tmax_right = right \r\n\t\r\n\tsegments.append([left, right])\r\n\t\r\nfor index, segment in enumerate(segments):\r\n\tif segment[0] == min_left and segment[1] == max_right:\r\n\t\tindex_of_largest_segment = index + 1\r\n\t\r\nprint(index_of_largest_segment)", "Narray = int(input())\r\nct = list(input().split())\r\nct = [int(x) for x in ct]\r\ntmin = min(ct)\r\ntmax = max(ct)\r\nAarray = [ct]\r\nfor i in range(Narray-1):\r\n Barray = input().split()\r\n Barray = [int(y) for y in Barray]\r\n Aarray.append(list(Barray))\r\n dmax = max(Barray)\r\n dmin = min(Barray)\r\n if dmax >= tmax:\r\n tmax = dmax\r\n else:\r\n tmax = tmax\r\n if dmin <= tmin:\r\n tmin = dmin\r\n else:\r\n tmin = tmin\r\ntry:\r\n Type_value = Aarray.index([tmin, tmax]) + 1\r\nexcept ValueError:\r\n Type_value = -1\r\nprint(Type_value)", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n\tl, r = map(int, input().split())\r\n\ta.append(l)\r\n\tb.append(r)\r\nLeft = min(a)\r\nRight = max(b)\r\nfor i in range(n):\r\n\tif a[i] == Left and b[i] == Right:\r\n\t\tprint(i + 1)\r\n\t\texit()\r\n\r\nprint(-1)", "n = int(input())\r\nlst = []\r\nx = float(\"inf\")\r\ny = float(\"-inf\")\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n lst.append((a,b))\r\n x = min(a,x)\r\n y = max(b,y)\r\nif (x,y) in lst:\r\n print(lst.index((x,y))+1)\r\nelse:\r\n print(-1)\r\n", "N = int(input())\nA = []\n\nfor n in range(N):\n l, r = map(int, input().split())\n\n A.append((-(r - l), l, r, n + 1))\nA.sort()\n\nvalid = True\nfor _, l, r, id in A[1:]:\n if l < A[0][1] or r > A[0][2]:\n valid = False\n break\nprint(A[0][3] if valid else -1)", "import collections,math,itertools,bisect,heapq,copy\nclass Solution:\n def solve(self):\n n = int(input())\n # A = list(map(int, input().rstrip().split()))\n left = float('inf')\n right = float('-inf')\n res = False\n ans = -1\n for i in range(n):\n start,end = list(map(int, input().rstrip().split()))\n if (start <= left and end >= right):\n res = True\n ans = i + 1\n left = start\n right = end\n elif (start >= left and start <= right) and (end <= right and end >= left):\n continue\n else:\n res = False\n left = min(start,left)\n right = max(end,right)\n if res: print(ans)\n else: print(-1)\n \nif __name__ == \"__main__\":\n solution = Solution()\n solution.solve()", "n = int(input())\r\nl = []\r\nl1 = []\r\nl2 = []\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\n l1.append(l[i][0]) \r\n l2.append(l[i][1])\r\nminn = min(l1)\r\nmaxx = max(l2)\r\n\r\nresutl = -1\r\nfor i in range(n):\r\n if l1[i] == minn and maxx == l2[i]:\r\n resutl = i + 1\r\n break\r\nprint(resutl)", "# http://codeforces.com/problemset/problem/242/B\n\nn = int(input())\nl = [0]*n\nr = [0]*n\n\nfor i in range(n):\n l[i],r[i] = map(int, input().split())\nmn=min(l)\nmx=max(r)\nans = -1\nfor i in range(n):\n if l[i] == mn and r[i]==mx:\n ans = i+1\nprint(ans)\n", "import math,sys,bisect\r\ndef solve():\r\n n=int(input())\r\n mins=[]\r\n maxs=[]\r\n for _ in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n mins.append(a)\r\n maxs.append(b)\r\n \r\n mini=min(mins)\r\n maxi=max(maxs)\r\n index=-1\r\n for i in range(n):\r\n a=mins[i]\r\n b=maxs[i]\r\n if a==mini and b==maxi:\r\n index=i+1\r\n return index\r\n \r\n \r\n \r\nif __name__==\"__main__\":\r\n print(solve())\r\n ", "n=int(input())\r\nS=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split(\" \")))\r\n S.append(a)\r\nS1=max([j for i,j in S])\r\nS2=min([i for i,j in S])\r\nxx=[S2,S1]\r\nif xx in S:\r\n print(S.index(xx)+1)\r\nelse:\r\n print(-1)", "n=int(input())\r\nl1=[]\r\nl2=[]\r\nfor i in range(0,n):\r\n x,y=map(int,input().split())\r\n l1.append((x,-1*y,i+1))\r\n l2.append((y,-1*x))\r\nl1.sort()\r\nl2.sort()\r\nif -1*l1[0][1]==l2[n-1][0]:\r\n print(l1[0][2])\r\nelse :\r\n print(-1)\r\n", "# http://codeforces.com/problemset/problem/242/B \nn = int(input())\na = []\nfor i in range(n):\n temp = list(map(int, input().split()))\n a.append(temp)\n\nminL = a[0][0]\nfor i in range(n):\n if(a[i][0] <= minL):\n minL = a[i][0]\n\nmaxR = a[0][1]\nfor i in range(n):\n if(a[i][1] >= maxR):\n maxR = a[i][1]\n\nk = -1\nfor i in range(n):\n if(a[i][0] == minL and a[i][1] == maxR):\n k = i\nif(k != -1):\n print(k+1)\nelse:\n print(k)", "n = int(input())\r\na = []\r\nmx = 0\r\nfor i in range(n):\r\n pair = input().split()\r\n trip = (int(pair[0]), int(pair[1]), i)\r\n mx = max(mx, int(pair[1]))\r\n a.append(trip)\r\na.sort()\r\nfound = 0\r\nfor i in range(n):\r\n if (found == 0 and a[i][0] <= a[0][0] and a[i][1] >= mx):\r\n print(a[i][2] + 1) \r\n found = 1\r\nif (found == 0):\r\n print(-1) ", "numberOfSegment = int(input())\r\nlistOfSegment = []\r\n\r\nlistOfValueSegment = []\r\nmaxValue = -1\r\nminValue = -1\r\n\r\nfor index in range(numberOfSegment):\r\n\tlistOfSegment.append(input().split())\r\n\r\nfor segment in listOfSegment:\r\n\tfor value in segment:\r\n\t\tlistOfValueSegment.append(int(value))\r\n\r\nfor value in listOfValueSegment:\r\n\tif maxValue < value:\r\n\t\tmaxValue = value\r\n\tif minValue == -1 or minValue > value:\r\n\t\tminValue = value\r\n\r\nfinalSegment = [str(minValue), str(maxValue)]\r\nprint(str(listOfSegment.index(finalSegment) + 1) if finalSegment in listOfSegment else str(-1))", "n=int(input())\r\ns=[]\r\nfor i in range (n):\r\n a=list(map(int, input().split()))\r\n s.append(a)\r\nmax=-1\r\nk=0\r\nt=0\r\nans=0\r\nfor i in range (n):\r\n if s[i][1]>max:\r\n max=s[i][1]\r\n k=i\r\n t=s[i][0]\r\n elif s[i][1]==max:\r\n if s[i][0]<t:\r\n max=s[i][1]\r\n k=i\r\n t=s[i][0]\r\nmin=1000000001\r\nfor i in range (n):\r\n if s[i][0]<min:\r\n min=s[i][0]\r\nif min==t:\r\n print(k+1)\r\nelse:\r\n print('-1')", "n=int(input())\r\na=[]\r\nl=1e15\r\nr=0\r\nbool=False\r\nans=0\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n a.append(x)\r\n l=min(l,x[0])\r\n r=max(r,x[1])\r\nfor i in range(n):\r\n if a[i][0]==l and a[i][1]==r:\r\n bool=True\r\n ans=i\r\n break\r\nif bool==True:\r\n print(ans+1)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n\r\n", "N = int(input())\r\nmin_ = 10**9+1 # az eddig talált legbaloldalibb szakaszhatár\r\nmax_ = 0 # az eddig talált legjobboldalibb szakaszhatár\r\nminmaxsorszam = -1 # annak a szakasznak a sorszáma, amely minmax\r\nminmax_l = 10**9+1 # az eltárolt minmax szakasz baloldali széle\r\nminmax_r = 0 # az eltárolt minmax szakasz jobboldali széle\r\nfor i in range(1,N+1):\r\n l, r = map(int, input().split())\r\n # új min_ és max_ értékeket állítunk be, ha akár balról, akár jobbról kilóg a mostani\r\n min_ = min(min_, l)\r\n max_ = max(max_, r)\r\n # borul-e az eddigi minmax, mert a jelenlegi kilóg az eddigi minmaxból?\r\n if l < minmax_l or r > minmax_r:\r\n minmaxsorszam = -1 # nincs minmax! visszaállítom a kiindulási értékeket\r\n minmax_l = 10**9+1\r\n minmax_r = 0\r\n # a mostani (l,r) szakasz vajon minmax-e, azaz lefedi-e az eddigieket mindkét irányból?\r\n if l <= min_ and r >= max_: # ha igen, akkor új minmax szakaszt találtunk\r\n minmaxsorszam = i # és elmentjük az adatait\r\n minmax_l = l\r\n minmax_r = r\r\n# ha volt minmax, akkor annak a sorszáma minmaxsorszam-ban, egyébként -1\r\nprint(minmaxsorszam)\r\n", "\r\nn=int(input())\r\nl=[]\r\nlow=pow(10,9)\r\nhigh=-1\r\nfor t1 in range(0,n):\r\n\ta,b=map(int,input().split())\r\n\tl.append((a,b))\r\n\tlow=min(low,a)\r\n\thigh=max(high,b)\r\n\r\ncheck=-1\r\nfor i in l:\r\n\tif( i[0] <=low and i[1]>=high):\r\n\t\tcheck=1\r\n\t\tprint(l.index(i)+1)\r\n\t\tbreak\r\nif(check==-1):\r\n\tprint(-1)\r\n\t", "# https://codeforces.com/problemset/problem/242/B\r\n\r\n\"\"\"\r\nA coordinate line has n segments. The ith segment starts at l_i ad ends at r_i\r\nSegment i is denoted with [l_i, r_i]\r\n\r\nGiven a set of segments check if there is a segment that contains all segments\r\nWe say that [a, b] covers [c, d] if a <= c <= d <= b\r\n\r\nWe pass through the array two times (hence O(2n)):\r\n * once to check the extremities we must satisfy\r\n * another to check if such a segment exists\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n\r\n segment_upper = []\r\n segment_lower = []\r\n\r\n for i in range(n):\r\n lower, upper = map(int, input().split())\r\n segment_upper.append(upper)\r\n segment_lower.append(lower)\r\n\r\n max_upper = max(segment_upper)\r\n min_lower = min(segment_lower)\r\n\r\n for i in range(n):\r\n if segment_upper[i] == max_upper and segment_lower[i] == min_lower:\r\n return i+1\r\n\r\n return -1\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n\r\n", "n = int(input())\r\n\r\nsegs = []\r\nfor i in range(n):\r\n tmp = input()\r\n s = [int(x) for x in tmp.split()]\r\n segs.append(s)\r\n\r\nprev = segs[0]\r\nmaxEnd = segs[0][1]\r\nans = 0\r\nfor j in range(1, len(segs)):\r\n if segs[j][0] < prev[0]:\r\n prev = segs[j]\r\n ans = j\r\n if segs[j][0] == prev[0] and segs[j][1] > prev[1]:\r\n prev = segs[j]\r\n ans = j\r\n if segs[j][1] > maxEnd:\r\n maxEnd = segs[j][1]\r\n \r\nif prev[1] < maxEnd:\r\n print(-1)\r\nelse:\r\n print(ans+1)", "# Tìm segment đồng thời phần tử 1 nhỏ nhất và phần tử thứ 2 lớn nhất\r\n\r\nn = int(input())\r\ndict_seg = {}\r\ncover_seg = 1\r\n\r\nfor i in range(1, n + 1):\r\n dict_seg[i] = list(map(int, input().split(' ')))\r\n\r\nmax_seg = dict_seg[1][1]\r\nmin_seg = dict_seg[1][0]\r\n\r\nfor i in range(2, n + 1):\r\n if min_seg >= dict_seg[i][0] and max_seg <= dict_seg[i][1]:\r\n min_seg = dict_seg[i][0]\r\n max_seg = dict_seg[i][1]\r\n cover_seg = i # Lưu lại vị trí của segment cần tìm.\r\n\r\n# Kiểm tra các trường hợp segment có 2 hai phần tử giống nhau.\r\nfor i in range(1, n + 1):\r\n if min_seg > dict_seg[i][0] or max_seg < dict_seg[i][1]:\r\n print(\"-1\")\r\n exit(0)\r\n\r\nprint(cover_seg)\r\nexit(0)\r\n", "n = int(input())\r\nl, r = [], []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n l.append(x)\r\n r.append(y)\r\nminX, maxY = 1000000000, 0\r\nans = -1\r\nfor i in range(n):\r\n if l[i] <= minX and r[i] >= maxY:\r\n minX = l[i]\r\n maxY = r[i]\r\n ans = i+1\r\nif minX <= min(l) and maxY >= max(r):\r\n print(ans)\r\nelse:\r\n print(-1)", "n = int(input())\r\nx = [0]*n\r\ny = [0]*n\r\nfor i in range(0,n):\r\n x[i],y[i] = input().split()\r\n x[i],y[i] = int(x[i]),int(y[i])\r\n\r\nminx = x[0]\r\nmaxy = y[0]\r\nminxIndices = []\r\nmaxyIndices = []\r\n\r\nfor i in range(0,n):\r\n if minx > x[i]:\r\n minx = x[i]\r\n minxIndices = []\r\n minxIndices.append(i) \r\n elif minx == x[i]:\r\n minxIndices.append(i)\r\n \r\n if maxy < y[i]:\r\n maxy = y[i]\r\n maxyIndices = []\r\n maxyIndices.append(i) \r\n elif maxy == y[i]:\r\n maxyIndices.append(i)\r\n\r\nanswer = list(set(minxIndices) & set(maxyIndices))\r\nif len(answer) == 0:\r\n print(\"-1\")\r\nelse:\r\n print(int(answer[0])+1)\r\n\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tl.append([i+1,a,b])\r\nl.sort(key=lambda x:x[1:])\r\nmn=l[0][1]\r\nmx=l[0][2]\r\nidx=l[0][0]\r\nfor i in range(n-1):\r\n\tif l[i][1]==l[i+1][1]:\r\n\t\tif mx<l[i+1][2]:\r\n\t\t\tmx=l[i+1][2]\r\n\t\t\tidx=l[i+1][0]\r\n\telse:\r\n\t\tbreak\r\nfor i in range(n):\r\n\tif l[i][2]>mx:\r\n\t\tprint(-1)\r\n\t\tbreak\r\nelse:\r\n\tprint(idx)", "n = int(input())\r\nw, h = 2, n;\r\na = [[0 for x in range(w)] for y in range(h)]\r\n\r\nfor i in range(n):\r\n a[i][0], a[i][1] = map(int, input().split(' '))\r\n\r\nlow = 1000000000\r\nhigh = 0\r\nfor i in range(n):\r\n if a[i][0] < low: low = a[i][0]\r\n if a[i][1] > high: high = a[i][1]\r\n\r\nfound = False\r\nfor i in range(n):\r\n if a[i][0] <= low and a[i][1] >= high:\r\n print(i+1)\r\n found = True\r\n\r\nif not found: print(-1)", "n=int(input())\r\nmaxx,minn=-1,1e10\r\narr=[]\r\nfor i in range(n):\r\n l,r=list(map(int,input().split()))\r\n maxx=max(maxx,r)\r\n minn=min(minn,l)\r\n arr.append([l,r])\r\ntry:\r\n print(1+arr.index([minn,maxx]))\r\nexcept:\r\n print(-1)\r\n", "a=int(input())\n\nb=[0 for i in range(a)]\nc=[0 for i in range(a)]\nxmin=1000000000\nymax=0\nmini=-1\n\nfor i in range(a):\n b[i],c[i]=[int(i) for i in input().split()]\nxmin=min(b)\nymax=max(c)\n\nfor i in range(a):\n if(b[i]==xmin and c[i]==ymax):\n mini=i+1\n\nprint(mini)\n", "n = int(input())\r\nL, R = [],[]\r\n\r\nfor _ in range(n):\r\n x1, x2 = map(int, input().split())\r\n L.append(x1)\r\n R.append(x2)\r\n \r\nleft, right = min(L), max(R)\r\n\r\nfor i in range(n):\r\n if left == L[i] and right == R[i]:\r\n print(i+1)\r\n exit()\r\n\r\nprint(-1)", "#242B\r\nn = int(input())\r\nls = []\r\nfor _ in range(n):\r\n ls.append(list(map(int, input().split(\" \"))))\r\n# print(ls)\r\na = 10**9\r\nb = 0\r\nfor i in range(n):\r\n a = min(a,ls[i][0])\r\n b = max(b,ls[i][1])\r\nans = [a,b]\r\nif ans in ls:\r\n print(ls.index(ans) +1)\r\nelse:\r\n print(-1)", "n=int(input())\r\nmi=float(\"inf\"); ma=-1\r\nmi, ma=map(int,input().split())\r\nk = (mi, ma)\r\nans = 0\r\nfor x in range(1, n):\r\n a,b=map(int,input().split())\r\n mi=min(mi,a); ma=max(b,ma)\r\n if (mi, ma) != k:\r\n if (mi, ma) == (a, b):\r\n k = (a, b)\r\n ans = x\r\n else:\r\n ans = -2\r\nprint(ans+1)", "n=int(input())\r\nc=[];d=[];a1=-1\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c.append(a);d.append(b)\r\nc1 = min(c)\r\nd1 = max(d)\r\nfor i in range(n):\r\n if c[i]==c1 and d[i]==d1:\r\n a1=i+1\r\n break\r\nprint(a1)", "n = int(input())\nl = []\nr = []\n\nfor i in range(n):\n segment = list(map(int, input().split()))\n l.append(segment[0])\n r.append(segment[1])\n\nleft = min(l)\nright = max(r)\nres = -1\n\nfor i in range(n):\n if l[i] == left and r[i] == right:\n res = i + 1\n\nprint(res)\n", "'''\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 = int(input())\r\n\tmic ,mac = map(int,input().split())\r\n\tindex = 1\r\n\tmix ,may = mic,mac\r\n\tfor i in range(2,N+1):\r\n\t\ta ,b = map(int,input().split())\r\n\t\tif a<mix:\r\n\t\t\tmix =a \r\n\t\tif b>may:\r\n\t\t\tmay= b\r\n\t\tif a<=mic and b>=mac:\r\n\t\t\tmic,mac = a,b\r\n\t\t\tindex = i\r\n\tif mic==mix and mac==may:\r\n\t\tprint(index)\r\n\telse:\r\n\t\tprint(-1)\r\nmain()", "n = int(input())\r\n\r\nli = []\r\nx = list(map(int,input().split()))\r\nli.append(x)\r\nl = x[0]\r\nr = x[1]\r\n\r\nfor i in range(n-1):\r\n x = list(map(int,input().split()))\r\n if l>x[0]:\r\n l = x[0]\r\n if r<x[1]:\r\n r = x[1]\r\n li.append(x)\r\n\r\ncheck = []\r\ncheck.append(l)\r\ncheck.append(r)\r\n\r\nif check in li:\r\n for i in range(n):\r\n if li[i] == check:\r\n print(i+1)\r\nelse:\r\n print('-1')", "def solve(lines):\n # #just see if min, max of start, end is together.\n # if not lines:\n # return -1\n\n # l, r = lines[0][0], lines[0][1]\n # res = 1\n\n # for i in range(1, len(lines)):\n\n # left = lines[i][0]\n # right = lines[i][1]\n\n # if left <= l and r <= right:\n # res = i + 1\n\n # elif left < l or r < right:\n # res = -1\n\n\n # l = min(left, l)\n # r = max(right, r)\n\n # return res\n\n minidx = set()\n minidx.add(0)\n maxidx = set()\n maxidx.add(0)\n\n mincand = 0\n maxcand = 0\n\n if len(lines) == 0:\n return -1\n \n if len(lines) == 1:\n return 1\n for i in range(1, len(lines)):\n if lines[i][0] < lines[mincand][0]:\n minidx = set()\n minidx.add(i)\n mincand = i\n elif lines[i][0] <= lines[mincand][0]:\n minidx.add(i)\n\n if lines[i][1] > lines[maxcand][1]:\n maxidx = set()\n maxidx.add(i)\n maxcand = i\n elif lines[i][1] >= lines[maxcand][1]:\n maxidx.add(i)\n\n res = list(minidx.intersection(maxidx))\n if res:\n return res[0] + 1\n return -1\n\nn = int(input())\nlines = []\nfor i in range(n):\n nums = list(map(int, input().split()))\n lines.append(nums)\n\n\nprint (solve(lines))\n", "n = int(input())\nlist_l = []\nlist_r = []\n\nfor i in range(n):\n l, r = list(map(int, input().split()))\n list_l.append(l)\n list_r.append(r)\n\nleft = min(list_l)\nright = max(list_r)\nres = -1\n\nfor i in range(n):\n if list_l[i] == left and list_r[i] == right:\n res = i + 1\n\nprint(res)\n", "n=int(input())\r\nl=[]\r\nmi,ma=11**11,0\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n if x<mi: mi=x\r\n if y>ma: ma=y\r\n l+=[(x,y)]\r\nif (mi,ma) in l: print(l.index((mi,ma))+1)\r\nelse: print(-1)", "import math\r\nimport sys\r\n\r\n#imgur.com/Pkt7iIf.png\r\n\r\n#n, m = map(int, input().split())\r\n#n = int(input())\r\n#d = list(map(int, input().split()))\r\n\r\nn = int(input())\r\nl = 10**9\r\nr = 0\r\nt = []\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n l = min(l, a)\r\n r = max(r, b)\r\n t.append([a, b])\r\n\r\nfor i, p in enumerate(t):\r\n if p[0] == l and p[1] == r:\r\n exit(print(i+1))\r\n\r\nprint(-1)\r\n", "\r\n\r\nn = int(input())\r\nsegments = []\r\nlow = 10 ** 9\r\nhigh = 1\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n low = min(low, l)\r\n high = max(high, r)\r\n segments.append((l, r))\r\n\r\nans = -1\r\nfor i in range(n):\r\n if (segments[i] == (low, high)):\r\n ans = i + 1\r\n break\r\n\r\nprint (ans)", "n=int(input())\r\nl=[]\r\nr=[]\r\nfor i in range(n):\r\n o = list(map(int,input().split()))\r\n x = o[0]\r\n y = o[1]\r\n l.append(x)\r\n r.append(y)\r\ntup=(min(l),max(r))\r\nrep=zip(l,r)\r\nflag=0\r\ncounter=1\r\nfor i in rep:\r\n if(i==tup):\r\n flag+=1\r\n break\r\n else:\r\n counter+=1\r\nif(flag==0):\r\n print(-1)\r\nelse:\r\n print(counter)", "class line:\r\n def __init__(self, l, r):\r\n self.l = l\r\n self.r = r\r\n def cover(self, d2):\r\n if self.l <= d2.l <= d2.r <= self.r:\r\n return True\r\n else:\r\n return False\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n temp = line(l, r)\r\n arr.append(temp)\r\n\r\nco = arr[0]\r\n\r\nfor k in range(n):\r\n if (arr[k].l <= co.l and arr[k].r >= co.r):\r\n co = arr[k]\r\n h = k\r\nr = True\r\nfor f in range(n):\r\n if not co.cover(arr[f]):\r\n r = False\r\n break\r\nif r:\r\n print(h+1)\r\nelse:\r\n print(-1)", "class Segment:\r\n\tdef __init__(self, start, end):\r\n\t\tself.start = start\r\n\t\tself.end = end\r\n\t\t\r\nnumber_of_segments = int(input())\r\nmin_left = 10**9+1\r\nmax_right = 0\r\nsegments = []\r\n\r\nfor index in range(number_of_segments):\r\n\tleft, right = map(int, input().split())\r\n\tsegment = Segment(left, right)\r\n\tif min_left > left:\r\n\t\tmin_left = left\r\n\tif max_right < right:\r\n\t\tmax_right = right\r\n\tsegments.append([left, right])\r\n\r\nresult = -1\r\n\r\nfor index in range(number_of_segments):\r\n\tif segments[index][0] == min_left and segments[index][1] == max_right:\r\n\t\tresult = index+1\r\n\t\tbreak\r\n\t\t\r\nprint(result)", "n = int(input())\r\nL = n*[0]\r\nR = n*[0]\r\nfor i in range(n):\r\n L[i], R[i] = map(int, input().split())\r\nl = min(L)\r\nr = max(R)\r\nfor i in range(n):\r\n if L[i] == l and R[i] == r:\r\n print(i+1)\r\n exit()\r\nprint(-1) \r\n", "a=[]\r\nl=10**9+1\r\nr=0\r\nfor _ in range(int(input())):\r\n a.append(list(map(int,input().split())))\r\n l=min(a[-1][0],l)\r\n r=max(a[-1][1],r)\r\nif [l,r] in a:\r\n print(a.index([l,r])+1)\r\nelse:\r\n print(-1)", "def getPositionBigSegment(lstSegment,lstLi,lstRi,amountSegment):\r\n minSegment = min(lstLi)\r\n maxSegment = max(lstRi)\r\n for segment in lstSegment:\r\n if segment[0] == minSegment and segment[1] == maxSegment:\r\n return lstSegment.index(segment) + 1\r\n return -1\r\n\r\namountSegment = int(input())\r\nlstLi = []\r\nlstRi = []\r\nlstSegment = []\r\nfor i in range(amountSegment):\r\n l,r = map(int,input().split())\r\n lstLi.append(l)\r\n lstRi.append(r)\r\n lstSegment.append([l,r])\r\n \r\nprint(getPositionBigSegment(lstSegment,lstLi,lstRi,amountSegment))", "n = int(input())\r\nilines = []\r\nminl = 10**9\r\nmaxr = 0\r\nfor j in range(n):\r\n l,r = list(map(int, input().split()))\r\n if(l<minl):\r\n minl = l\r\n if(r > maxr):\r\n maxr = r\r\n ilines.append((l,r))\r\nindex = -1\r\nfor i in range(n):\r\n if ilines[i][0] == minl and ilines[i][1] == maxr:\r\n index = i +1\r\nprint(index)\r\n\r\n", "n = int(input())\r\nl = [0] * n \r\nr = [0] * n\r\nfor i in range(0, n):\r\n l[i], r[i] = map(int,input().split())\r\n\r\nleftEnd = min(l)\r\nrightEnd = max(r)\r\n\r\nfor i in range(0, n):\r\n if leftEnd == l[i] and rightEnd == r[i]:\r\n print(i+1)\r\n exit()\r\n\r\n\r\nprint(-1)", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n n = N()\r\n MIN, MAX = 10 ** 9 + 1, 0\r\n a, f = list(), False\r\n for i in range(n):\r\n l, r = map(int, input().split())\r\n MIN = min(l, MIN)\r\n MAX = max(r, MAX)\r\n a.append((l, r))\r\n for i in range(n):\r\n if a[i][0] == MIN and a[i][1] == MAX:\r\n f = True\r\n break\r\n print(i + 1 if f else -1)", "n=int(input())\r\nlst=[]\r\nfor i in range(n):lst.append([int(x) for x in input().split()])\r\nans=[min(lst,key=lambda lst:lst[0])[0],max(lst,key=lambda lst:lst[1])[1]]\r\nif ans in lst:print(lst.index(ans)+1)\r\nelse:print(-1)\r\n", "n = int(input())\r\narr = []\r\n\r\nfor i in range(n):\r\n arr.append(list(map(int, input().split(\" \"))))\r\n\r\nmin_val = arr[0][0]\r\nmax_val = arr[0][1]\r\n\r\nfor i in range(1, len(arr)):\r\n if(min_val>arr[i][0]):\r\n min_val = arr[i][0]\r\n \r\n if(max_val<arr[i][1]):\r\n max_val = arr[i][1]\r\n\r\npt = [min_val, max_val]\r\n\r\nflag = 0\r\nfor i in range(len(arr)):\r\n if(arr[i][0]==min_val and arr[i][1]==max_val):\r\n flag = 1\r\n print(i+1)\r\n\r\nif(flag==0):\r\n print(-1)\r\n \r\n\r\n\r\n ", "n=int(input())\r\na=[]\r\nl=[]\r\nr=[]\r\nlm=10000000000000000000000000000000\r\nrm=-1\r\nfor i in range(n):\r\n aa,ba=map(int,input().split())\r\n lm=min(lm,aa)\r\n rm=max(rm,ba)\r\n l.append(aa)\r\n r.append(ba)\r\n a.append((aa,ba))\r\n\r\nfor i in range(n):\r\n if a[i][0]==lm and a[i][1]==rm:\r\n print(i+1)\r\n exit()\r\nprint(-1)", "n = int(input())\r\nlMap = []\r\nrMap = []\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n lMap.append([l,i])\r\n rMap.append([r,i])\r\n\r\n\r\n\r\nlMap.sort()\r\nrMap.sort(reverse=True)\r\n\r\nminVal = lMap[0][0]\r\nmaxVal = rMap[0][0]\r\n\r\nminIdx = set()\r\nmaxIdx = set()\r\n\r\nfor l,i in lMap:\r\n if l ==minVal:\r\n minIdx.add(i)\r\n\r\nfor r,i in rMap:\r\n if r== maxVal:\r\n maxIdx.add(i)\r\n\r\nfor c in minIdx:\r\n if c in maxIdx:\r\n print(c+1)\r\n exit()\r\n\r\nprint(-1)", "\r\nfrom math import inf \r\n\r\nn = int(input())\r\ns = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nmn, mx = inf, -inf\r\nfor l, r in s:\r\n mn = min(mn, l)\r\n mx = max(mx, r)\r\n\r\nfor i, (l, r) in enumerate(s):\r\n if l == mn and r == mx:\r\n print(i + 1)\r\n break \r\nelse:\r\n print(-1)", "n = int(input())\r\nsegments = []\r\nleft = 10**9+1\r\nright = 0\r\nfor i in range(n):\r\n\tl,r = map(int,input().split())\r\n\tsegments.append([l,r])\r\n\tif l<left:\r\n\t\tleft = l\r\n\tif r>right:\r\n\t\tright = r\r\n\r\nans = -2\r\nfor i in range(n):\r\n\tif segments[i][0] <= left and segments[i][1]>=right:\r\n\t\tans = i\r\n\t\tbreak\r\nprint(ans+1)\r\n", "def main():\n #elems = list(sorted(map(int, input().split(' '))))\n n = int(input())\n minv, maxv = float('inf'), 0\n elems = []\n\n for _ in range(n):\n x, y = list(map(int, input().split(' ')))\n if x < minv:\n minv = x\n if y > maxv:\n maxv = y\n elems.append((x, y))\n\n for i, pair in enumerate(elems):\n if pair[0] == minv and pair[1] == maxv:\n print(i+1)\n return\n\n print(-1)\n\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\r\nsegments=[[int(x) for x in input().split()] for _ in range(n)]\r\nstart = [segments[i][0] for i in range(n)]\r\nend = [segments[i][1] for i in range(n)]\r\nans=[min(start),max(end)]\r\ntry:\r\n print(segments.index(ans)+1)\r\nexcept:\r\n print(-1)\r\n", "def main():\r\n segments = []\r\n for _ in range(get_int()):\r\n segments.append(get_list_int())\r\n\r\n left, right = segments[0]\r\n for l, r in segments:\r\n if l < left:\r\n left = l\r\n if r > right:\r\n right = r\r\n\r\n for i, (l, r) in enumerate(segments):\r\n if l <= left and r >= right:\r\n print(i + 1)\r\n return\r\n\r\n print(-1)\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nlmin, rmax = map(int, input().split())\r\nlset = set()\r\nrset = set()\r\nlset.add(1)\r\nrset.add(1)\r\nfor i in range(2,n+1):\r\n l, r = map(int, input().split())\r\n if l==lmin:\r\n lset.add(i)\r\n elif l < lmin:\r\n lmin = l\r\n lset.clear()\r\n lset.add(i)\r\n\r\n if r==rmax:\r\n rset.add(i)\r\n elif r > rmax:\r\n rmax = r\r\n rset.clear()\r\n rset.add(i)\r\ninter = lset & rset\r\nif len(inter) == 0:\r\n print(-1)\r\nelse:\r\n print(inter.pop())\r\n\r\n", "'''\r\n @Author:Pham T. Nhan\r\n @Date: 26-10-2018\r\n'''\r\n\r\n\r\ndef main():\r\n '''[summary]\r\n The cover segment is the one which have the smallest first value & largest last value\r\n '''\r\n\r\n n = int(input())\r\n segment = []\r\n for i in range(n):\r\n first, last = map(int, input().split())\r\n segment.append((first, last, i + 1))\r\n\r\n # Sort increasing by first\r\n segment.sort(key=lambda seg: seg[0])\r\n # Push only min value of first to SET\r\n Cover_segment = set()\r\n start = segment[0][0]\r\n for i in range(n):\r\n if (segment[i][0] == start):\r\n Cover_segment.add(segment[i][2])\r\n else:\r\n break\r\n\r\n # Sort decreasing by last\r\n segment.sort(key=lambda seg: seg[1], reverse=True)\r\n end = segment[0][1]\r\n for i in range(n):\r\n if (segment[i][1] == end):\r\n if segment[i][2] in Cover_segment:\r\n print(segment[i][2])\r\n break\r\n # When come to lower last, then it means result = -1\r\n else:\r\n print(-1)\r\n break\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx, y = -1, 0\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n if y == 0:\r\n c, d = a, b\r\n x = 1\r\n y = 1\r\n else:\r\n if a <= c and b >= d:\r\n x = i+1\r\n c, d = a, b\r\n elif a < c or b > d:\r\n x = -1\r\n c = min(a, c)\r\n d = max(b, d)\r\nprint(x)", "segment_arr = []\r\nsize = int(input())\r\nmax_right = 0\r\nmin_left = 1000000000\r\nindex = 0\r\nfor i in range(size):\r\n li, ri = map(int, input().split())\r\n if li <= min_left and ri >= max_right:\r\n index = i + 1\r\n elif li < min_left or ri > max_right:\r\n index = -1\r\n max_right = max(ri, max_right)\r\n min_left = min(li, min_left)\r\n\r\nprint(index)\r\n", "\r\nimport math\r\n\r\nn = int(input())\r\nf,s = [],[]\r\nfor i in range(n):\r\n a,b = [int(c) for c in input().split()]\r\n f.append(a)\r\n s.append(b)\r\nmn = min(f)\r\nmx = max(s) \r\nfor i in range(n):\r\n if f[i] == mn and s[i] == mx:\r\n print(i+1)\r\n break\r\n elif i == n-1:\r\n print(-1) \r\n break\r\n\r\n\r\n\r\n", "n = int(input())\r\nniz = 10e9\r\nverh = 0\r\ncurrent = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a <= niz and b >= verh:\r\n current = i + 1\r\n niz = a\r\n verh = b\r\n elif a < niz and niz <= b <= verh:\r\n niz = a\r\n current = -1\r\n elif a < niz and b < niz:\r\n niz = a\r\n current = -1\r\n elif niz <= a <= verh and verh < b:\r\n verh = b\r\n current = -1\r\n elif verh < a and verh < b:\r\n verh = b\r\n current =-1\r\nprint(current)", "R, L = [], []\r\nfor i in range(int(input())):\r\n l, r = map(int, input().split())\r\n L.append(l)\r\n R.append(r)\r\nmi, mx = min(L), max(R)\r\nt = True\r\nfor i in range(len(L)):\r\n if L[i] == mi and R[i] == mx:\r\n print(i + 1)\r\n t = False\r\n break\r\nif t:\r\n print(-1)\r\n", "n = int(input())\r\nleft, right = [], []\r\nfor x in range(n):\r\n string = input()\r\n numbers = string.split()\r\n left.append(int(numbers[0]))\r\n right.append(int(numbers[1]))\r\na, b = min(left), max(right)\r\nfor x in range(n):\r\n if left[x] == a and right[x] == b:\r\n print(x + 1)\r\n break\r\nelse:\r\n print(-1)", "n = int(input())\r\nls, rs = [], []\r\nlmin, rmax = float('inf'), -float('inf')\r\nfor i in range(n):\r\n x1, x2 = map(int, input().split())\r\n ls.append(x1)\r\n rs.append(x2)\r\n lmin = min(lmin, x1)\r\n rmax = max(rmax, x2)\r\nflg = 0\r\nfor i in range(n):\r\n if ls[i]==lmin and rs[i]==rmax:\r\n flg = 1\r\n print(i+1)\r\n break\r\nif not flg:\r\n print(-1)\r\n \r\n", "n=int(input())\r\nl=[]\r\nx,y=[],[]\r\nfor i in range(n):\r\n d=list(map(int,input().split()))\r\n l.append(d)\r\n x.append(d[0])\r\n y.append(d[1])\r\nm=min(x)\r\nmm=max(y)\r\nf=-1\r\nfor i in range(n):\r\n if(l[i][0]==m and mm==l[i][1]):\r\n f=i+1\r\n break\r\nprint(f)\r\n", "l=list( list(map(int,input().split())) for _ in range(int(input())))\r\nx=min(i[0] for i in l)\r\ny=max(i[1] for i in l)\r\nif [x,y] in l:print(l.index([x,y])+1)\r\nelse:print(\"-1\")", "n = int(input())\r\n\r\nseg = []\r\n\r\nfor i in range(n):\r\n x,y = [int(i) for i in input().split()]\r\n seg.append([x,y,i])\r\n\r\nseg.sort(key = lambda x: x[1], reverse=True)\r\nseg.sort(key = lambda x: x[0])\r\n\r\nres = seg[0][2]+1\r\n\r\nfor i in range(1, n):\r\n if seg[i][1] > seg[0][1]:\r\n res = -1\r\n break\r\n\r\nprint(res)", "class lines:\r\n def __init__(self, l, r):\r\n self.r = r\r\n self.l = l\r\n\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n arr.append(lines(l, r))\r\n\r\nindex = -1\r\nlc = 10 ** 9\r\nrc = 0\r\nfor i in range(0, n):\r\n if arr[i].l < lc:\r\n lc = arr[i].l\r\nfor i in range(0, n):\r\n if arr[i].r > rc:\r\n rc = arr[i].r\r\nfor i in range(n):\r\n if arr[i].l == lc and arr[i].r == rc:\r\n index = i + 1\r\n break\r\n\r\nprint(index)", "n = int(input())\r\nm = []\r\nfor i in range(n):\r\n\ta, b = map(int, input().split())\r\n\tm.append([a,b])\r\n\r\nmi = min([ x[0] for x in m])\r\nma = max([ x[1] for x in m])\r\nseg = [mi, ma]\r\nif seg in m:\r\n\tprint(m.index(seg)+1)\r\nelse:\r\n\tprint(-1)", "n=int(input())\r\na=1000000000000000000000000000000000\r\nb=0\r\nc1=100000000000000000000000000000000\r\nc2=0\r\nh=0\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n if l<=a:\r\n a=l\r\n if r>=b:\r\n b=r\r\n if c1>=l and r>=c2:\r\n c1=l\r\n c2=r\r\n h=i+1\r\nif c1==a and c2==b:\r\n print(h)\r\nelse:\r\n print(-1)", "n = int(input())\r\nl = [] \r\nr = [] \r\nfor i in range(n):\r\n\tx, y = map(int, input().split())\r\n\tl.append(x)\r\n\tr.append(y)\r\nleft = min(l)\r\nright = max(r)\r\nfor i in range(n):\r\n\tif left == l[i] and right == r[i]:\r\n\t\tprint(i + 1)\r\n\t\texit()\r\nprint(-1)", "n = int(input())\narray = []\nfor i in range(n):\n array.append(list(map(int,input().split())))\nans = True\nmaxi = array[0][1]\nmini = array[0][0]\nindex = 1\nfor i in range(1, n):\n x = array[i][0]\n y = array[i][1]\n if(x<=mini and y>=maxi):\n maxi = y\n mini = x\n index = i+1\n ans = True\n continue\n if(x<mini):\n mini =x\n index = -1\n ans = False\n if(y>maxi):\n maxi = y\n index = -1\n ans = False\nif(ans==False):\n print(-1)\nelse:\n print(index)\n", "from collections import Counter\r\ndef solve():\r\n n=int(input())\r\n l=[]\r\n for _ in range(n):\r\n l.append(list(map(int,input().split())))\r\n mn=min(l,key=lambda x:x[0])[0]\r\n mx=max(l,key=lambda x:x[1])[1]\r\n ans=-1\r\n # print(mn,mx)\r\n for i in range(n):\r\n if l[i][0]==mn and l[i][1]==mx:\r\n print(i+1)\r\n return\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "# ý tưởng: lúc đọc vô r,l thi luu vao 2 mang s1, s2\r\n# tim min s1, max s2 vao gan vao bien, sau do duyet qua s1\r\n# nêu s1[i] = min thi kiểm tra coi s2[i] có = max khong?\r\n# neu bang thi return kết qua luôn, khong bang thi chạy tiếp\r\n# khi het mang mà vẫn không tim duoc thi return -1\r\n\r\ndef big_segment (right,left):\r\n highest = max(left)\r\n lowest = min (right)\r\n for i in range (len(right)):\r\n if right[i]== lowest and left[i] == highest:\r\n return i+1\r\n return -1\r\n\r\nn = int(input())\r\nleft =[]\r\nright =[]\r\nfor i in range (n):\r\n r, l = map(int, input().split())\r\n right.append(r)\r\n left.append(l)\r\n\r\nprint(big_segment(right,left))\r\n", "'''input\r\n3\r\n1 1\r\n2 2\r\n3 3\r\n\r\n'''\r\ndef getints():\r\n\treturn list(map(int, input().strip().split()))\r\nn = int(input().strip())\r\narr = [[0,0] for _ in range(n)]\r\nmini = 99999999999999\r\nmaxi = -99999999999999\r\nfor i in range(n):\r\n\ta,b = getints()\r\n\tmini = min(a,mini)\r\n\tmaxi = max(b, maxi)\r\n\tarr[i][0], arr[i][1] = a,b\r\n\r\nfor i,(a,b) in enumerate(arr):\r\n\tif a<=mini and b>=maxi:\r\n\t\tprint(i+1)\r\n\t\texit(0)\r\nprint(-1)", "num_segments = int(input())\r\nbiggest_segment = 1\r\nleft_margin, right_margin = map(int, input().split())\r\nfor pos in range(2, num_segments + 1):\r\n segment_left, segment_right = map(int, input().split())\r\n if segment_left <= left_margin and segment_right >= right_margin:\r\n biggest_segment = pos\r\n left_margin = segment_left\r\n right_margin = segment_right\r\n elif (segment_left < left_margin and segment_right < right_margin) or \\\r\n (segment_left > left_margin and segment_right > right_margin):\r\n biggest_segment = -1\r\n left_margin = min(left_margin, segment_left)\r\n right_margin = max(right_margin, segment_right)\r\n\r\nprint(biggest_segment)\r\n", "def main():\r\n n = int(input())\r\n data = []\r\n\r\n mn = float('inf')\r\n mx = float('-inf')\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n data.append((a, b))\r\n mn = min(a, mn)\r\n mx = max(b, mx)\r\n\r\n for i in range(n):\r\n a, b = data[i]\r\n if a == mn and b == mx:\r\n print(i+1)\r\n exit()\r\n\r\n print(-1)\r\n\r\n\r\nmain()\r\n", "tc = int(input())\r\nmin_x, max_y = 10**9+1, 0\r\narr = []\r\nfor _ in range(tc):\r\n\tx, y = map(int, input().split())\r\n\tif(x < min_x):\r\n\t\tmin_x = x\r\n\tif(y > max_y):\r\n\t\tmax_y = y \r\n\tarr.append((x,y))\r\ni = 0\r\nf = 1\r\nfor x in arr:\r\n\tif(x[0] == min_x and x[1] == max_y):\r\n\t\tprint(i+1)\r\n\t\tf = 0\r\n\ti+=1\r\nif(f):\r\n\tprint(-1)", "n=int(input())\r\nb=[]\r\nc=[]\r\nfor i in range(n):\r\n a = list(map(int, input().split(\" \")))\r\n b.append(a[0])\r\n c.append(a[1])\r\ne=max(c)\r\nf=min(b)\r\nc1=0\r\nfor j in range(len(b)):\r\n if b[j]==f and c[j]==e:\r\n c1+=1\r\n x=j+1\r\nif c1==1:\r\n print(x)\r\nelse:\r\n print(-1)", "arr=[]\r\nmn=10**9\r\nmx=-1\r\nn=int(input())\r\nfor _ in range(1,n+1):\r\n # n=int(input()) \r\n x,y=map(int,input().split()) \r\n # s=(input()) \r\n arr.append([x,y])\r\n if mn>x:\r\n mn=x\r\n if mx<y:\r\n mx=y\r\nfor i in range(n):\r\n if mn==arr[i][0] and mx==arr[i][1]:\r\n print(i+1)\r\n exit()\r\nprint(-1)", "a=[]\r\nmin=10**9+1\r\nmax=0\r\nfor i in range(int(input())):\r\n f=list(map(int,input().split()))\r\n a.append(f)\r\n if f[0]<min:\r\n min=f[0]\r\n if f[1]>max:\r\n max=f[1]\r\nif [min,max] in a:\r\n print(a.index([min,max])+1)\r\nelse:\r\n print(-1)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "n=int(input())\r\ntmax,tmin=1,1000000000\r\nans=0\r\nfor i in range(n):\r\n c=0\r\n l,r=map(int,input().split())\r\n if r>=tmax and l<=tmin:\r\n tmax,tmin=r,l\r\n c=1\r\n elif r>tmax:\r\n tmax=r\r\n c=-1\r\n elif l<tmin:\r\n tmin=l\r\n c=-1\r\n if c==1:ans=i+1\r\n elif c==-1:ans=-1\r\nprint(ans)\r\n", "s=(10**9)+1\r\ne=0\r\npair=[s,e]\r\nans=-1\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a < s:\r\n s = a\r\n if b > e:\r\n e = b\r\n if pair[0] > a:\r\n pair = [a,b]\r\n ans=i \r\n elif pair[0]==a:\r\n if pair[1] < b:\r\n pair[1] = b\r\n ans= i \r\n #print(pair) \r\nif pair[1]==e:\r\n print(ans+1)\r\nelse:\r\n print(\"-1\")\r\n \r\n \r\n ", "def main() : \r\n t = int(input())\r\n test = True\r\n l = []\r\n r = []\r\n for i in range(t):\r\n a,b = map(int,input().split())\r\n l.append(a)\r\n r.append(b)\r\n min_ = min(l)\r\n max_ = max(r)\r\n for i in range(t):\r\n if l[i] == min_ and r[i]==max_ :\r\n print(i+1)\r\n test = False\r\n break\r\n if test :\r\n print(-1) \r\nmain()", "l=[]\r\nr=[]\r\ntemp=[]\r\nn=int(input())\r\nfor i in range(n):\r\n co=list(map(int,input().split()))\r\n l.append(co[0])\r\n r.append(co[1])\r\n temp.append(co)\r\nleft=min(l)\r\nright=max(r)\r\nans=-1\r\nfor i in range(n):\r\n k=temp[i]\r\n if k[0]==left and k[1]==right:\r\n ans=i+1\r\n break\r\nprint(ans)", "l = []\r\np = []\r\nq = []\r\nt=int(input())\r\nfor _ in range(t):\r\n m,n = map(int,input().split())\r\n l.append((m,n))\r\n p.append(m)\r\n q.append(n)\r\n t-=1\r\nm = min(p)\r\nq = max(q)\r\nx = 1\r\nr=True\r\nfor i,j in l:\r\n if(i==m and j==q):\r\n print(x)\r\n r = False\r\n break\r\n x+=1\r\n\r\nif(r):\r\n print(\"-1\")\r\n ", "import math\nif __name__ == \"__main__\":\n n = int(input())\n _min, _max, segments, answer = math.inf, 0, [], -1\n for i in range(n):\n [x, y] = [int(i) for i in input().split()]\n if x < _min or y > _max: answer = -1\n _min = _min if _min < x else x\n _max = _max if _max >= y else y\n if x == _min and y == _max: answer = i + 1\n print(answer)\n", "def main():\r\n a = [list(map(int,input().split())) for _ in ' '*int(input())]\r\n l = min([x[0] for x in a])\r\n r = max([x[1] for x in a])\r\n try: print(a.index([l,r])+1)\r\n except ValueError: print(-1)\r\nmain()", "n=int(input())\r\nline = list()\r\nmaxx=0\r\nminn=1000000001\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n line.append((l,0,i))\r\n line.append((r,1,i))\r\nis_min= [0 for i in range(n)]\r\nline.sort()\r\nel=line[0]\r\nyk=0\r\nwhile el[0]==line[0][0] and el[1]==0 :\r\n is_min[el[2]]=1\r\n yk+=1\r\n if yk==2*n:\r\n break\r\n el=line[yk]\r\nel=line[2*n-1]\r\nyk=2*n-1\r\nisr=False\r\nwhile el[0]==line[2*n-1][0] and el[1]==1:\r\n if (is_min[el[2]]==1):\r\n print(el[2]+1)\r\n isr=True\r\n break\r\n yk-=1\r\n if yk==-1:\r\n break\r\n el=line[yk]\r\nif not(isr):\r\n print(-1)", "number_of_segments = int(input())\r\n\r\nLeft, Right = [], []\r\n\r\nfor _ in range(number_of_segments):\r\n a, b = map(int, input().split())\r\n \r\n Left.append(a)\r\n Right.append(b)\r\n\r\nleft = min(Left)\r\nright = max(Right)\r\nresult = -1\r\n\r\nfor index in range(number_of_segments):\r\n if left == Left[index] and right == Right[index]:\r\n result = index + 1\r\n break\r\n\r\nprint(result)\r\n", "n = int(input())\r\nleft = [0] * n\r\nright = [0] * n\r\nfor i in range(n):\r\n left[i], right[i] = map(int, input().split())\r\n\r\nminLeft = min(left)\r\nmaxRight = max(right)\r\n\r\nans = -1\r\nfor i in range(n):\r\n if left[i] == minLeft and right[i] == maxRight:\r\n ans = i + 1\r\n break\r\nprint(ans)\r\n", "n=int(input())\r\na=[0]*n\r\nb=[0]*n\r\nfor i in range(n):\r\n a[i],b[i]=map(int,input().split())\r\nmi=min(a)\r\nma=max(b)\r\ncount=0\r\nfor i in range(n):\r\n if a[i]==mi and b[i]==ma:\r\n count=1\r\n print(i+1)\r\n break\r\nif count==0:\r\n print(-1)", "tests = int(input())\n\na,b=1e9,0\nl=[]\nr=[]\n\n\nfor i in range(tests):\n p,q = list(map(int,input().split()))\n \n l.append(p)\n r.append(q)\n\n if a>=p:\n a=p\n if b<=q:\n b=q\n\nans=-1\n\nfor q in range(len(l)):\n if l[q] == a and r[q] == b:\n ans=q+1\n break\nprint(ans)\n \n\n\t\t\t\t \t \t \t \t\t\t \t\t\t \t \t\t\t", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\nfrom itertools import permutations\r\n\r\n\r\nimport bisect\r\n\r\nmod=10**9+7\r\n\r\n#print(bisect.bisect_right([1,2,3],2))\r\n#print(bisect.bisect_left([1,2,3],2))\r\n\r\nn=I()\r\n\r\nx=[0]*n\r\ny=[0]*n\r\n\r\nxmin=math.inf\r\nymax=-math.inf\r\n\r\nfor i in range(n):\r\n x[i],y[i]=R()\r\n\r\n xmin=min(x[i],xmin)\r\n ymax=max(ymax,y[i])\r\n\r\nfor i in range(n):\r\n if x[i]==xmin and y[i]==ymax:\r\n print(i+1)\r\n exit()\r\n\r\nprint('-1')", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n ai, bi = map(int, input().split())\r\n a.append(ai)\r\n b.append(bi)\r\nmi = min(a)\r\nma = max(b)\r\nf = False\r\nfor i in range(n):\r\n if a[i] == mi and b[i] == ma:\r\n m = i + 1\r\n f = True\r\n break\r\nif f:\r\n print(m)\r\nelse:\r\n print(-1)", "f = []\r\ns = []\r\nfor _ in range(int(input())):\r\n l , r = list(map(int , input().split()))\r\n f.append(l)\r\n s.append(r)\r\n\r\nmm = min(f)\r\nmx = max(s)\r\nans = 0\r\nfor el in range(len(f)):\r\n if(f[el] == mm and s[el] == mx):\r\n ans = el\r\n print(ans+1)\r\n exit(0)\r\nif(ans == 0):\r\n print(-1)", "def Slove():\r\n\r\n n = int(input())\r\n l=[0]*n\r\n r=[0]*n\r\n for i in range(n):\r\n l[i],r[i]=map(int, input().split())\r\n \r\n left,right=min(l), max(r)\r\n for i in range(n):\r\n if(left==l[i] and right==r[i]):\r\n return i+1\r\n return -1\r\nprint(Slove())", "myList = []; \r\n\r\ndef inp():\r\n return map(int, input().split(' '))\r\n\r\n\r\nn = int(input()) \r\n\r\nvmin = 1000000000 \r\nvmax = 0 \r\n\r\nfor i in range(0, n): \r\n l, r = inp(); \r\n myList.append([l, r]) \r\n vmin = min(vmin, l) \r\n vmax = max(vmax, r) \r\n \r\nanswer = -1\r\nindex = 0 \r\nfor x in myList: \r\n index = index + 1 \r\n if (vmin == x[0] and vmax == x[1]):\r\n answer = index \r\n break \r\n \r\nprint (answer)\r\n", "t=int(input())\r\nl=[]\r\nr=[]\r\nd=[]\r\nfor i in range(0,t):\r\n a,b=list(map(int,input().split()))\r\n l.append(a)\r\n r.append(b)\r\n d.append(str(a)+str(b))\r\na=min(l)\r\nb=max(r)\r\nif(str(a)+str(b) in d):\r\n print(d.index(str(a)+str(b))+1)\r\nelse:\r\n print(\"-1\")", "A, B, ans = 1000000000, 1, -1\r\nfor i in range(1, int(input()) + 1):\r\n a, b = map(int, input().split())\r\n if a < A:\r\n A = a\r\n ans = -1\r\n if b > B:\r\n B = b\r\n ans = -1\r\n if a == A and b == B: ans = i\r\nprint(ans)", "# Method 1 (mine)\n# n = int(input())\n# segments = []\n# lowers = []\n# uppers = []\n# for i in range(n):\n# segments.append(list(map(int, input().split()))) # store inputs to a list\n# lowers.append(segments[i][0]) # store all lower bounds of each segment to a list\n# uppers.append(segments[i][1]) # store all upper bounds of each segment to a list\n#\n# minimum = min(lowers)\n# maximum = max(uppers)\n#\n# result = -1 # default \"There's no result\"\n# for i in range(n):\n# # for each segment, if its lower and upper bounds cover the minimum and maximum, respectively\n# # then it is the result\n# if segments[i][0] <= minimum and segments[i][1] >= maximum:\n# result = i + 1\n#\n# print(result)\n\n# method 2: Solution\nn = int(input())\nL = [0] * n\nR = [0] * n\nfor i in range(n):\n L[i], R[i] = map(int, input().split(' '))\n\nleft = min(L)\nright = max(R)\n\nfor i in range(n):\n if left == L[i] and right == R[i]:\n print(i + 1)\n exit()\n\nprint(-1)\n\n'''\nNote: \n 1 <= n <= 10^9\n min_left = 10^9\n max_right = 1\n for i = 0, ..., n-1\n if min_left > l[i]\n min_left = l[i]\n if max_right < r[i]\n max_right = r[i]\n for i = 0...n-1\n if l[i] == min_left and r[i] == max\n output i+1\n exit()\n output -1\n'''", "a=int(input())\r\nx=[]\r\nb=list(map(int,input().split()))\r\nx.append(b)\r\nrb=b[0]\r\nlb=b[1]\r\n\r\nfor i in range(1,a):\r\n b=list(map(int,input().split()))\r\n x.append(b)\r\n rb=min(rb,b[0])\r\n lb=max(lb,b[1])\r\n\r\nfor i in range(a):\r\n if x[i][0]==rb and x[i][1]==lb:\r\n print(i+1)\r\n quit()\r\nprint(-1)\r\n", "# Link: https://codeforces.com/problemset/problem/242/B\n# Name: Big Segment\n# ======================================================\n\nif __name__ == '__main__':\n n = int(input())\n li_seg = []\n min_element = 10e9\n max_element = 1\n for i in range(0, n):\n a, b = list(map(int, input().split()))\n li_seg.append([a, b])\n if a < min_element: min_element = a\n if b > max_element: max_element = b\n\n big_seg = list([min_element, max_element])\n if big_seg in li_seg:\n print(li_seg.index(big_seg) + 1)\n else:\n print(-1)\n ", "n = int(input())\r\nmins = -1\r\nmaxs = -1\r\nind = 1\r\nlis = []\r\nfor _ in range(n):\r\n \r\n x, y = map(int, input().strip().split())\r\n lis.append([x,y])\r\n if _ == 0:\r\n mins = x\r\n maxs = y\r\n else:\r\n \r\n if mins >= x and maxs <= y:\r\n mins = x\r\n maxs = y\r\n ind = _ + 1\r\nflag = 0\r\nfor y in range(n):\r\n if mins <= lis[y][0] and maxs >= lis[y][1]:\r\n pass\r\n else:\r\n print(\"-1\")\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(ind)", "n = int(input())\r\nl = []\r\nr = []\r\nfor i in range(n):\r\n li, ri = map(int, input().split())\r\n l.append(li)\r\n r.append(ri)\r\n\r\ncheck = False\r\npos = 0\r\nli_min = min(l)\r\nri_max = max(r)\r\nfor i in range(n):\r\n if (l[i] == li_min and r[i] == ri_max):\r\n check = True\r\n pos = i\r\n break\r\n\r\nif (check):\r\n print(pos + 1)\r\nelse:\r\n print(-1)", "import sys\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n l1,r1 = map(int, input().split())\r\n a.append([l1,r1])\r\n\r\nlmin, rmax = float(\"inf\"), float(\"-inf\")\r\n\r\nfor i in a:\r\n lmin = min(lmin, i[0])\r\n rmax = max(rmax, i[1])\r\n\r\nfor i,v in enumerate(a):\r\n if [lmin, rmax] == v:\r\n print(i+1)\r\n sys.exit(0)\r\nprint(-1)\r\n\r\n", "n=int(input())\r\nchuoinho=[0]*n\r\nchuoilon=[0]*n\r\nfor i in range(n):\r\n chuoinho[i],chuoilon[i]=map(int,input().split())\r\nx=min(chuoinho)\r\ny=max(chuoilon)\r\nfor i in range(n):\r\n if chuoinho[i]==x and chuoilon[i]==y:\r\n print(i+1)\r\n exit(0)\r\nprint(-1)", "n = int(input())\r\n\r\nx_, y_ = map(int, input().split())\r\n\r\nleft_max = x_\r\nright_max = y_\r\nindex = 0\r\nfor i in range(1, n):\r\n x, y = map(int, input().split())\r\n if x <= left_max and y >= right_max:\r\n x_, y_ = x, y\r\n index = i\r\n left_max = min(x, left_max)\r\n right_max = max(y, right_max)\r\n\r\nif left_max == x_ and right_max == y_:\r\n print(index + 1)\r\nelse:\r\n print(-1)\r\n\r\n", "n = int(input())\narr = []\nfor _ in range(n):\n l, r = map(int,input().split())\n arr.append((l, r, _+1))\narr.sort(key=lambda x: x[0])\nMin = arr[0][0]\nleft = set()\nfor i in range(n):\n if arr[i][0] != Min:\n break\n else:\n left.add(arr[i][2])\narr.sort(key=lambda x: x[1], reverse=True)\nMax = arr[0][1]\nright = set()\nfor i in range(n):\n if arr[i][1] != Max:\n break\n else:\n right.add(arr[i][2])\nans = left&right\nif ans:\n for i in ans:\n print(i)\nelse:\n print(-1)", "vl, vr, vi, maxr = 1000000001, 0, 0, 0\r\nfor i in range(1, int(input()) + 1):\r\n l, r = (int(x) for x in input().split())\r\n if l < vl or (l == vl and r > vr):\r\n vl, vr, vi = l, r, i\r\n maxr = max(maxr, r)\r\nprint(vi if vr >= maxr else -1)", "l=[]\r\nm=[]\r\nfor i in range(int(input())):\r\n x,y=map(int,input().split(\" \"))\r\n l.append(x)\r\n m.append(y)\r\nmini=min(l)\r\nmaxi=max(m)\r\ncount=0\r\nfor j in range(len(l)):\r\n if l[j]<=mini and m[j]>=maxi:\r\n print(j+1)\r\n count+=1\r\n break\r\nif count==0:\r\n print(-1)", "lsts = []\r\nfor i in range(int(input())):\r\n lsts.append(tuple(map(int,input().split())))\r\nmn = min(lsts, key=lambda x:x[0])\r\nmx = max(lsts, key=lambda x:x[1])\r\nif (mn[0], mx[1]) in lsts:\r\n print(lsts.index((mn[0],mx[1]))+1)\r\nelse:\r\n print(-1)", "n = int(input())\r\nmin = 1000000001\r\nmax = 0\r\narr = []\r\nwhile(n > 0):\r\n l, r = [int(x) for x in input().split()]\r\n arr.append([l, r])\r\n if(l < min):\r\n min = l\r\n if(r > max):\r\n max = r\r\n n = n - 1\r\nflag = 0\r\nfor i in range(len(arr)):\r\n if(arr[i][0] <= min and arr[i][1] >= max):\r\n flag = 1\r\n print(i+1)\r\n break\r\nif(flag == 0):\r\n print('-1')\r\n \r\n ", "n=int(input())\r\nl=[]\r\nr=[]\r\nfor i in range(n):\r\n l1,r1=map(int,input().split())\r\n l.append(l1)\r\n r.append(r1)\r\nl2=min(l)\r\nr2=max(r)\r\nf=-1\r\nfor i in range(n):\r\n if(l[i]==l2 and r[i]==r2):\r\n f=i+1\r\n break\r\nprint(f)", "def Q(x):\r\n return x[1]-x[0]+1\r\nn=int(input())\r\nL=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n L.append((x,y,i+1))\r\n\r\nL.sort(key=Q,reverse=True)\r\nans=L[0][2]\r\nfor i in range(1,n):\r\n if(L[i][0]>=L[0][0] and L[i][1]<=L[0][1]):\r\n continue\r\n ans=-1\r\nprint(ans)\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n r = list(map(int,input().split()))\r\n l.append(r)\r\nx = sorted(l) \r\ny = sorted(l,key = lambda x:x[1])\r\nz = [x[0][0],y[-1][1]]\r\nif z in l :\r\n print(l.index(z)+1)\r\nelse:\r\n print(-1) ", "n = int(input())\r\n\r\na = []\r\n\r\nminLeft = 1000000009\r\nmaxRight = 0\r\n\r\nfor i in range(0, n):\r\n u, v = map(int, input().split(' '))\r\n a.append({u, v})\r\n minLeft = min(minLeft, u)\r\n maxRight = max(maxRight, v)\r\n\r\nfor i in range(0, n):\r\n if a[i] == {minLeft, maxRight}:\r\n print(i + 1)\r\n exit()\r\n\r\nprint(-1)", "n = int(input())\r\nl = []\r\nmi = (10**9)+7\r\nma = -((10**9)+7)\r\nfor i in range(n):\r\n ip = list(map(int, input().split()))\r\n l.append(ip)\r\n if(min(ip) < mi):\r\n mi = min(ip)\r\n if(max(ip) > ma):\r\n ma = max(ip)\r\nck = [mi,ma]\r\nif(ck in l):\r\n print((l.index(ck))+1)\r\nelse:\r\n print(-1)", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\n\r\nn=int(input())\r\nL=[]\r\nmini=10**9+1\r\nmaxi=-1\r\n\r\nfor i in range(n):\r\n A=list(map(int,input().split()))\r\n mini=min(mini,A[0])\r\n maxi=max(maxi,A[1])\r\n L.append(A)\r\n\r\nfor i in range(n):\r\n if [mini,maxi]==L[i]:\r\n print(i+1)\r\n exit() \r\nprint(-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#carpe diem \r\n#carpe diem", "n = int(input())\r\na = [[int(j) for j in input().split()] for i in range(n)]\r\n\r\nelem = [min([i[0] for i in a]), max([i[1] for i in a])]\r\n\r\nif elem in a:\r\n\tprint(a.index(elem) + 1)\r\nelse:\r\n\tprint(-1);", "#http://codeforces.com/problemset/problem/242/B\n\ndef inp():\n return map(int, input().split())\n\nn=int(input())\nl=list()\nl.extend(100000*[0])\nr=list()\nr.extend(100000*[0])\n\nidxl=0\nidxr=0\nminl=1000000001\nmaxr=0\n\nfor i in range(n):\n l[i], r[i] = inp()\n if (l[i] < minl):\n minl=l[i]\n idxl=i\n if (r[i] > maxr):\n maxr = r[i]\n idxr = i\n\n\nfor i in range(n):\n if ((l[i] == minl) &( r[i] == maxr)):\n print(i+1)\n exit()\n \nprint(-1)\n \n", "listt=[]\r\nfor i in range(int(input())):\r\n listt.append([int(x) for x in input().split()])\r\nmaxx=listt[0][1]\r\nminn=listt[0][0]\r\nfor i in range(len(listt)):\r\n maxx=max(maxx,listt[i][1])\r\n minn=min(minn,listt[i][0])\r\nbol=False\r\nfor i in range(len(listt)):\r\n if listt[i]==[minn,maxx]:\r\n print(i+1)\r\n bol=True\r\nif bol==False:\r\n print(-1)", "n = int(input())\r\n\r\nsegments = []\r\n \r\nfor i in range(n):\r\n inp = list(map(int, input().split()))\r\n segments.append([inp[1] - inp[0], inp[0], inp[1]])\r\n\r\nsegments2 = sorted(segments.copy(), reverse=True)\r\n\r\nfor i in range(len(segments2)):\r\n result = -2\r\n for j in range(len(segments2)):\r\n if i != j and segments2[i][1] > segments2[j][1] or segments2[i][2] < segments2[j][2]:\r\n result = -1\r\n break\r\n if result != -1:\r\n result = segments.index(segments2[i]) + 1\r\n break\r\n\r\nprint(result)", "# B. Big Segment\r\nn=int(input())\r\nminl=10000000000000\r\nmaxr=-1000000000000\r\nll=[]\r\nrr=[]\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n ll.append(l)\r\n rr.append(r)\r\n if l<minl:\r\n minl=l\r\n if r>maxr:\r\n maxr=r\r\nf=0\r\nfor i in range(n):\r\n if ll[i]<=minl and rr[i]>=maxr:\r\n f=1\r\n print(i+1)\r\n\r\nif f==0:\r\n print(-1)\r\n", "#Segments:\nn = int(input())\ncount = 0\nflag = False\nl_min = 10**9\nr_max = 1\nfor _ in range(n):\n l, r = map(int,input().split())\n if (l <= l_min) and (r >= r_max):\n l_min = l\n r_max = r\n flag = True\n count = _ + 1\n elif l < l_min:\n l_min = l\n flag = False\n elif r > r_max:\n r_max = r\n flag = False\n\nif flag:\n print(count)\nelse:\n print(-1)\n", "first_line = list(map(int, input().split()))\r\nn = first_line[0]\r\nwork_tuples = []\r\nflag = True\r\nminimun = maximun = 0\r\nfor index in list(range(n)):\r\n line = list(map(int, input().split()))\r\n work_tuples.append((line[0], line[1]))\r\n if flag:\r\n minimun = line[0]\r\n maximun = line[1]\r\n flag = False\r\n if line[0] < minimun:\r\n minimun = line[0]\r\n if line[1] > maximun:\r\n maximun = line[1]\r\nresult = work_tuples.index((minimun, maximun)) + 1 if (minimun, maximun) in work_tuples else -1\r\nprint(result)\r\n", "def big_segment(left,right):\r\n low = min(left)\r\n up = max(right)\r\n for i in range(len(left)):\r\n if left[i]==low and right[i]==up:\r\n return i+1\r\n return -1\r\n \r\nn=int(input())\r\nl=[]\r\nr=[]\r\nfor i in range(n):\r\n s=[int(x) for x in input().split()]\r\n l.append(s[0])\r\n r.append(s[1])\r\nprint (big_segment(l,r))", "def process_inputs():\r\n n = int(input())\r\n left_array = []\r\n right_array = []\r\n\r\n for _ in range(n):\r\n a, b = list(map(int, input().split()))\r\n left_array.append(a)\r\n right_array.append(b)\r\n\r\n return n, left_array, right_array\r\n\r\n\r\ndef solve():\r\n n, left_arr, right_arr = process_inputs()\r\n\r\n min_element = min(left_arr)\r\n max_element = max(right_arr)\r\n ans = -1\r\n\r\n for i in range(n):\r\n if min_element == left_arr[i] and max_element == right_arr[i]:\r\n ans = i + 1\r\n break\r\n\r\n return ans\r\n\r\n\r\ndef print_results():\r\n print(solve())\r\n\r\n\r\nprint_results()\r\n", "from sys import stdin,stdout\r\nn=int(stdin.readline())\r\nA=[]\r\nMinA=1000000001\r\nMaxB=0\r\nfor i in stdin.readlines():\r\n a,b=map(int,i.split())\r\n A.append([a,b])\r\n MinA=min(MinA,a)\r\n MaxB=max(MaxB,b)\r\n \r\nInd=-1\r\nfor i in range(0,n):\r\n if A[i][0]==MinA and A[i][1]==MaxB:\r\n Ind=i+1\r\n break\r\nprint(Ind)\r\n ", "n=int(input())\r\nseg=[]; mn=10e10; mx=-1\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n if l<mn: mn=l\r\n if r>mx: mx=r\r\n seg.append((l,r))\r\ntry:\r\n ind=seg.index((mn,mx))\r\n print(ind+1)\r\nexcept: \r\n print(-1)", "n = int(input())\r\nmx = -1\r\nmn = 1000000001\r\nfor k in range(n):\r\n a, b = input().split()\r\n a, b = int(a), int(b)\r\n if a <= mn and b >= mx:\r\n mn = a\r\n mx = b\r\n i = k + 1\r\n elif a < mn or b > mx:\r\n if a < mn:\r\n mn = a\r\n i = -1\r\n elif b > mx:\r\n mx = b\r\n i = -1\r\nprint(i)", "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\nn=iinput()\r\ns1=[]\r\ns2=[]\r\nfor i in range(n):\r\n s=list(map(int,input().split()))\r\n s1.append(s[0])\r\n s2.append(s[1])\r\nl=min(s1)\r\nl1=max(s1)\r\nm=max(s2)\r\na=[]\r\nb=[]\r\nfor i in range(len(s1)):\r\n if(s1[i]==l):\r\n a.append(i)\r\n\r\nfor i in range(len(s2)):\r\n if(s2[i]==m):\r\n b.append(i)\r\n\r\nc=list(set(a).intersection(b))\r\ncount=len(c)\r\n\r\nif(count!=1):\r\n print(-1)\r\nelse:\r\n if(l1<=m):\r\n print(c[0]+1)\r\n \r\n\r\n\r\n", "n = int(input())\n\nhash_map = dict()\nmini = float('inf')\nmaxi = 0\nfor i in range(n):\n l, r = map(int, input().split())\n mini = min(mini, l)\n maxi = max(maxi, r)\n hash_map[(l, r)] = i + 1\n\nif (mini, maxi) in hash_map.keys():\n print(hash_map[(mini, maxi)])\nelse:\n print(-1)\n", "n=int(input())\r\nt1=[]\r\nmin1=10**(9)+1\r\nmax1=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n min1=min(min1,a[0])\r\n max1=max(max1,a[1])\r\n t1+=[a]\r\nflag=0\r\nfor i in range(n):\r\n if(t1[i][0]==min1 and t1[i][1]==max1):\r\n flag=1\r\n j=i\r\n break\r\nif(flag==1):\r\n print(j+1)\r\nelse:\r\n print(-1)\r\n", "# python2 or 3\r\nimport sys, threading, os.path\r\nimport collections, heapq, math,bisect\r\nimport string\r\nfrom platform import python_version\r\nimport itertools\r\nsys.setrecursionlimit(10**6)\r\nthreading.stack_size(2**27)\r\n\r\ndef main():\r\n if os.path.exists('input.txt'):\r\n input = open('input.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n #--------------------------------INPUT---------------------------------\r\n n = int(input.readline())\r\n segs = []\r\n for i in range(n):\r\n segs.append(list(map(int, input.readline().split())))\r\n nummax,summax = 0,0\r\n for i in range(n):\r\n if segs[i][1]-segs[i][0]>summax:\r\n nummax = i\r\n summax = segs[i][1]-segs[i][0]\r\n ok = True\r\n for i in range(n):\r\n if segs[i][0]<segs[nummax][0] or segs[i][1]>segs[nummax][1]:\r\n ok = False\r\n break\r\n if ok:\r\n output = nummax+1\r\n else: \r\n output = -1\r\n #-------------------------------OUTPUT----------------------------------\r\n if os.path.exists('output.txt'):\r\n open('output.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n#threading.Thread(target=main).start()\r\n\r\n", "n=int(input())\r\ndic={}\r\npoints=[]\r\nd=0;c=1000000000000000\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n points.append((a,b))\r\n c=min(c,a)\r\n d=max(d,b)\r\n dic[(a,b)]=i+1\r\npoints.sort()\r\nboo=False\r\nfor i in points:\r\n if i[0]<=c and i[1]>=d:\r\n boo=True\r\n print(dic[(i[0],i[1])])\r\n break\r\nif not boo:\r\n print(-1)\r\n", "def bigSegment():\r\n n=int(input())\r\n line=[]\r\n for i in range(n):\r\n a,b=map(int,input().split())\r\n line.append((a,b))\r\n maxr=0\r\n minl=0\r\n for i in range(n):\r\n if line[i][1]>line[maxr][1]:\r\n maxr=i\r\n for i in range(n):\r\n if line[i][0]<line[minl][0]:\r\n minl=i\r\n for i in range(n):\r\n if line[i]==(line[minl][0],line[maxr][1]):\r\n print(i+1)\r\n return\r\n print(-1)\r\n\r\nbigSegment()", "import sys\r\nn=int(input())\r\nmi=int(sys.maxsize)\r\nma=0\r\narr=[]\r\nt=list(map(int,input().split()))\r\nmi=t[0]\r\nma=t[1]\r\nmax_pair=[mi,ma]\r\nidx=1\r\nfor i in range(n-1):\r\n t=list(map(int,input().split()))\r\n if(max_pair[0]>=t[0] and max_pair[1]<=t[1]):\r\n max_pair=[t[0],t[1]]\r\n idx=i+2\r\n if(mi>t[0]):\r\n mi=t[0]\r\n if(ma<t[1]):\r\n ma=t[1]\r\n#print(max_pair)\r\nif(max_pair[0]==mi and max_pair[1]==ma):\r\n print(idx)\r\nelse:\r\n print(\"-1\")", "n=int(input())\r\nline=[list(map(int,input().split())) for i in range(n)]\r\nline1=[]\r\nline2=[]\r\nfor i in line:\r\n line1.append(i[0])\r\n line2.append(i[1])\r\nl=min(line1)\r\nr=max(line2)\r\nif [l,r] in line:\r\n out = line.index([l,r])+1\r\nelse:\r\n out = -1\r\nprint(out)", "R,L=[],[]\nn=int(input())\nfor i in range(n):\n\tl,r=map(int,input().split())\n\tL.append(l);R.append(r)\nmi,mx=min(L),max(R)\nt=True\nfor i in range(n):\n\tif L[i]==mi and R[i]==mx:\n\t\tprint(i+1)\n\t\tt=False\n\t\tbreak\nif t:\n\tprint(-1)", "t = int(input())\r\nc=[]\r\nl = 100000000000000000000\r\nr = 0\r\nfor i in range(t):\r\n x, y = map(int, input().split())\r\n if l > x:\r\n l = x\r\n if r < y:\r\n r = y\r\n c.append([x, y])\r\n\r\nif [l, r] in c:\r\n print(c.index([l, r])+1)\r\nelse:\r\n print(-1)", "def find_big_segment(n, arr):\r\n min = arr[0][0]\r\n max = arr[0][1]\r\n for i in range(1, N):\r\n if arr[i][0] < min:\r\n min = arr[i][0]\r\n if arr[i][1] > max:\r\n max = arr[i][1]\r\n\r\n for i in range(N):\r\n if arr[i][0] == min and arr[i][1] == max:\r\n print(i + 1)\r\n return\r\n print(-1)\r\n\r\n\r\nif __name__ == '__main__':\r\n N = int(input())\r\n segment_arr = []\r\n for i in range(N):\r\n segment_arr.append(list(map(int, input().split())))\r\n find_big_segment(N, segment_arr)\r\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\nl=[]\r\nmn=float(\"inf\")\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tmn=min(mn,a)\r\n\tl.append([i+1,a,b])\r\nmx=float(\"-inf\")\r\nfor i in range(n):\r\n\tmx=max(mx,l[i][2])\r\nfor i in range(n):\r\n\tif l[i][1]==mn and l[i][2]==mx:\r\n\t\tprint(l[i][0])\r\n\t\tbreak\r\nelse:\r\n\tprint(-1)", "def solve(a,mini,maxi):\r\n for i in range(len(a)):\r\n x,y = a[i][0],a[i][1]\r\n if x<=mini and y>=maxi:\r\n return i+1\r\n return -1\r\nn = int(input())\r\na=[]\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n a.append([x,y])\r\ns = a.copy()\r\ns.sort()\r\n# print(s)\r\nmini = s[0][0]\r\ns.sort(key=lambda x:x[1])\r\n# print(s)\r\nmaxi = s[-1][1]\r\n\r\n# print(mini,maxi)\r\n\r\nprint(solve(a,mini,maxi))", "n = int(input())\r\narr = []\r\nmini = float('inf')\r\nmaxi = float('-inf')\r\nans = -1\r\nfor i in range(n) :\r\n a,b = map(int,input().split())\r\n arr.append([a,b])\r\n if(a < mini) :\r\n mini = a\r\n if(b > maxi) :\r\n maxi = b\r\nfor i in range(len(arr)) :\r\n if(arr[i][0] == mini and arr[i][1] == maxi) :\r\n ans = i+1\r\nprint(ans)\r\n\r\n \r\n", "n = int(input())\r\nleft_arr = []\r\nright_arr = []\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n left_arr.append(a)\r\n right_arr.append(b)\r\n\r\nmin_element = min(left_arr)\r\nmax_element = max(right_arr)\r\n\r\nans = -1\r\n\r\nfor i in range(n):\r\n if left_arr[i] == min_element and right_arr[i] == max_element:\r\n ans = i + 1\r\n break\r\n\r\nprint(ans)\r\n", "n=int(input(''))\r\nl=[]\r\na=[]\r\nfor i in range(n):\r\n c=input('')\r\n b=c.split(' ')\r\n l.append(int(b[0]))\r\n a.append(int(b[1]))\r\ncaa=[]\r\n\r\nif min(l)<min(a):\r\n min=min(l)\r\nelse:\r\n min=min(a)\r\nif max(l)<max(a):\r\n max=max(a)\r\nelse:\r\n max=max(l)\r\n\r\nfor i in range(n):\r\n if l[i]==min:\r\n caa.append(i)\r\n else:\r\n continue\r\nif len(caa)==0:\r\n print(-1)\r\nelse:\r\n alo=0\r\n for i in caa:\r\n if a[i]==max:\r\n alo+=1\r\n print(i+1)\r\n break\r\n if alo==0:\r\n print(-1)", "def getPositionBigSegment(lstLi,lstRi):\r\n minSegment = min(lstLi)\r\n maxSegment = max(lstRi)\r\n count = 1\r\n for i in range(len(lstLi)):\r\n if lstLi[i] == minSegment and lstRi[i] == maxSegment:\r\n return count\r\n count += 1\r\n return -1\r\n\r\namountSegment = int(input())\r\nlstLi = []\r\nlstRi = []\r\nfor i in range(amountSegment):\r\n l,r = map(int,input().split())\r\n lstLi.append(l)\r\n lstRi.append(r)\r\n \r\n \r\nprint(getPositionBigSegment(lstLi,lstRi))", "#copied code\nnum=-1\nR=[]\nL=[]\nn=int (input ())\nfor i in range(n):\n\tl,r=((map(int,input().split())))\n\tR.append(r)\n\tL.append(l)\n\nMAXR=max(R)\nMINL=min(L)\n\nfor i in range(n):\n\tif R[i] == MAXR and L[i] == MINL:\n\t\tprint (i+1)\n\t\tbreak\n\nelse:\n\tprint(-1)\n", "n = int(input())\r\nleft_arr = []\r\nright_arr = []\r\n\r\nfor _ in range(n):\r\n a, b = list(map(int, input().split()))\r\n left_arr.append(a)\r\n right_arr.append(b)\r\n\r\nmin_range = min(left_arr)\r\nmax_range = max(right_arr)\r\nans = -1\r\n\r\nfor i in range(n):\r\n if left_arr[i] == min_range and right_arr[i] == max_range:\r\n ans = i + 1\r\n break\r\n\r\nprint(ans)\r\n", "n = int(input().strip())\nleft_list = []\nright_list = []\nfor i in range(n):\n l, r = map(int,input().split())\n left_list.append(l)\n right_list.append(r)\n\ni = 0\nmin_value = min(left_list)\nmax_value = max(right_list)\nresult = -1\nwhile i < n:\n if min_value == left_list[i] and max_value == right_list[i]:\n result = i+1\n break\n i += 1\n\nprint(str(result))", "n=int(input())\r\nmli=[]\r\nmra=[]\r\nf=True\r\nfor i in range(n) :\r\n li,ri=map(int,input().split())\r\n mli.append(li)\r\n mra.append(ri)\r\nmi=min(mli)\r\nma=max(mra)\r\ni=0\r\nwhile i<n :\r\n if mli[i]==mi and mra[i]==ma :\r\n print(i+1)\r\n f=False\r\n break\r\n i+=1\r\nif f==True :\r\n print(-1)", "n = int(input())\r\nmi, ma = 10**9+1, -1\r\nami, ama = 10**9+1, -1\r\nr = -1\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a < mi and b >= ma or a <= mi and b > ma:\r\n # print(mi, ma, ami, ama, a, b)\r\n mi = a\r\n ma = b\r\n r = i+1\r\n ami = min(ami, a)\r\n ama = max(ama, b)\r\n\r\n# print(mi, ma, ami, ama)\r\nif ami < mi or ama > ma:\r\n print(-1)\r\nelse:\r\n print(r)", "n = int(input())\r\nseg = []\r\nmn, mx = float(\"inf\"), -1\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n mn = min(l, mn)\r\n mx = max(r, mx)\r\n seg.append([l, r])\r\n\r\nfind = [mn, mx]\r\nfor i in range(n):\r\n if seg[i] == find:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\narr=[]\r\nml=1e9\r\nmr=-1e9\r\nfor i in range(n):\r\n\tl,r=map(int,input().split())\r\n\tarr.append([l,r,i+1])\r\n\tml=min(ml,l)\r\n\tmr=max(mr,r)\r\n# arr=sorted(arr,key=lambda item:item[0])\r\nfor i in range(n):\r\n\tif arr[i][0]<=ml and arr[i][1]>=mr:\r\n\t\tprint(i+1)\r\n\t\texit()\r\nprint(-1)", "n = int(input())\r\nl = []\r\nr = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n l.append(x)\r\n r.append(y)\r\nleft = min(l)\r\nright = max(r)\r\nindex = -1\r\nfor i in range(n):\r\n if l[i] == left and r[i] == right:\r\n index = i +1;\r\nprint(index)\r\n", "n = int(input())\r\nLeft, Right = 0, 0\r\na = []\r\nb = []\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\n\r\nLeft = min(a)\r\nRight = max(b)\r\nres = -1\r\n\r\nfor i in range(n):\r\n if a[i] <= Left and Right <= b[i]:\r\n res = i + 1\r\n break\r\n\r\nprint(res)", "n = int(input())\r\nl = []\r\na, b =10**9+1, 0\r\nc, d =10**9+1, 0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n c = min(c, x)\r\n d = max(d, y)\r\n if x <= a and y >= b:\r\n a = x\r\n b = y\r\n index = i+1\r\n # d[x] = y\r\n # a = min(a, x)\r\n # b = max(b, y)\r\nif c == a and d == b:\r\n print(index)\r\nelse:\r\n print(\"-1\")", "n=int(input());a,b=float('inf'),0;l=[]\r\nfor i in range(n):\r\n n,m=map(int,input().split())\r\n if n < a:\r\n a = n\r\n if m > b:\r\n b = m\r\n l.append([n,m])\r\nif [a,b] in l:\r\n print(l.index([a,b])+1)\r\nelse:\r\n print(-1)", "class Segment:\r\n def __init__(self, l, r, idx):\r\n self.l=l\r\n self.r=r\r\n self.idx=idx\r\n def __str__(self):\r\n return str(self.l)+' '+str(self.r)+' '+str(self.idx)\r\nMAX=int(1e9+1)\r\nn=int(input())\r\nlongest=Segment(MAX, -1, -1)\r\n_range=Segment(MAX, -1, -1)\r\nfor i in range(n):\r\n a, b=map(int, input().split())\r\n \"\"\" print(\"\\n{} {}\".format(a, b))\r\n print(a<_range.l) \"\"\"\r\n if a<_range.l:\r\n _range.l=a\r\n \"\"\" print(b>_range.r) \"\"\"\r\n if b>_range.r:\r\n _range.r=b\r\n \"\"\" print(a<longest.l and b>longest.r) \"\"\"\r\n if a<=longest.l and b>=longest.r:\r\n longest=Segment(a, b, i+1)\r\n \"\"\" print(_range)\r\n print(longest, end='\\n\\n') \"\"\"\r\nif longest.l<=_range.l and longest.r>=_range.r:\r\n print(longest.idx)\r\nelse:\r\n print(-1)", "t = int(input())\r\nm=10**9+1\r\nmx=-1\r\nl=[]\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n l.append((a,b))\r\n if a<m:\r\n m=a\r\n if b>mx:\r\n mx=b\r\nif (m,mx) in l:\r\n print(l.index((m,mx))+1)\r\nelse:\r\n print(-1)\r\n ", "n=int(input())\r\nv1,v2=[],[]\r\nfor i in range(n):\r\n\ta,b=map(int,input().split(' '))\r\n\tv1.append(a)\r\n\tv2.append(b)\r\na,b=min(v1),max(v2)\r\nt=0\r\nfor i in range(n):\r\n\tif(v1[i]<=a and v2[i]>=b):\r\n\t\tprint(i+1)\r\n\t\tt=1\r\n\t\tbreak\r\nif(t==0):\r\n\tprint(-1)", "# Big Segment 242B\r\n#1. Read all the input and at the same time read for the largest right and smallest left value\r\n#2. Search all the input segment and find the index of the largest segment if exist.\r\n\r\nnumber_of_segments = int(input())\r\n\r\nsegments = []\r\nmin_left = 1000000001\r\nmax_right = 0\r\nindex_of_largest_segment = -1\r\n\r\nfor index in range(number_of_segments):\r\n\tleft, right = map(int, input().split())\r\n\tif left < min_left:\r\n\t\tmin_left = left\r\n\tif right > max_right:\r\n\t\tmax_right = right \r\n\t\r\n\tsegments.append([left, right])\r\n\t\r\nfor index, segment in enumerate(segments):\r\n\tif segment[0] == min_left and segment[1] == max_right:\r\n\t\tindex_of_largest_segment = index + 1\r\n\t\r\nprint(index_of_largest_segment)", "arr = []\r\nd = dict()\r\nfor i in range(int(input())):\r\n el = [int(x) for x in input().split()]\r\n arr.append(el)\r\n d[tuple(el)] = i+1\r\nminL = arr[0][0]\r\nmaxR = 0\r\nfor el in arr:\r\n if el[0] < minL:\r\n minL = el[0]\r\n if el[1] > maxR:\r\n maxR = el[1]\r\n# print(d)\r\nif d.get((minL, maxR), 0) != 0:\r\n print(d[(minL, maxR)])\r\nelse:\r\n print(-1)\r\n# print(minL, maxR)\r\n# print(arr)\r\n", "\r\n\r\ndef get_input():\r\n num_segments = int(input())\r\n border_segment_list = []\r\n for _ in range(num_segments):\r\n border_segment = list(map(int, input().split()))\r\n border_segment_list.append(border_segment)\r\n\r\n return num_segments, border_segment_list\r\n\r\n\r\ndef search_segment(border_seg_list):\r\n border_min = min(list(map(min, border_seg_list)))\r\n border_max = max(list(map(max, border_seg_list)))\r\n\r\n cover_seg = [border_min, border_max]\r\n\r\n if cover_seg in border_seg_list:\r\n return border_seg_list.index(cover_seg) + 1\r\n else:\r\n return -1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n num_segments, border_segment_list = get_input()\r\n result = search_segment(border_segment_list)\r\n print(result)\r\n", "n = int(input())\r\ni = 1\r\nleft = []\r\nright = []\r\nwhile True:\r\n if i>n:\r\n break\r\n l,r = map(int, input().split())\r\n left.append(l)\r\n right.append(r)\r\n i += 1\r\na = min(left)\r\nb = max(right)\r\nfor j in range(0, n):\r\n if left[j]==a and right[j]==b:\r\n print(j+1)\r\n break\r\n if j==n-1:\r\n print(-1)", "Segments = []\r\nMin, Max = 10 ** 9, 0\r\nfor i in range(int(input())):\r\n Temp = input()\r\n Temp2 = list(map(int, Temp.split()))\r\n Min, Max = min(Min, Temp2[0]), max(Max, Temp2[1])\r\n Segments.append(Temp)\r\nprint(Segments.index(str(Min) + \" \" + str(Max)) + 1 if str(Min) + \" \" + str(Max) in Segments else -1)\r\n\r\n# UB_CodeForces\r\n# Advice: Do your very best!!!\r\n# Location: Behind my desk\r\n# Caption: At late night\r\n# CodeNumber: 559\r\n", "n=int(input())\r\ns=list()\r\nmx=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n mx=max(mx,b)\r\n s.append((a,b))\r\nt=sorted(s,key=lambda x:(x[0],-x[1]))\r\nprint(s.index(t[0])+1 if t[0][1]==mx else \"-1\")\r\n", "n=int(input())\ns=[]\nfor _ in range(n):\n x=list(map(int,input().split()))\n s.append(x)\nl=[s[i][0] for i in range(n)]\nr=[s[j][1] for j in range(n)]\nmini=min(l)\nmaxi=max(r)\nf=0\nfor k in range(n):\n if s[k][0]<=mini and s[k][1]>=maxi:\n f=1 \n a=k+1 \n break\nif f==0:\n print(-1)\nelse:\n print(a)\n ", "'''\nID: essi\nLANG: PYTHON3\nTASK: self-contest.py\n'''\nn = int(input())\na = []\nX, Y = map(int,input().split())\na.append( (X,Y) )\nfor i in range(n - 1):\n x, y = map(int, input().split())\n X = min(X, x)\n Y = max(Y, y)\n a.append((x, y))\nres = -1\nfor i in range(n):\n if a[i][0] == X and a[i][1] == Y:\n res = i + 1\n break\nprint(res)", "n = int(input())\nresult = -1\n\nfor i in range(n):\n a, b = list(map(int, input().split()))\n\n if i == 0:\n c = a\n d = b\n\n if a < c:\n c = a\n result = -1\n\n if d < b:\n d = b\n result = -1\n\n if a == c and b == d:\n result = i + 1\n\nprint(result)\n", "n = int(input())\r\n\r\na = 10**9\r\nb = -10**9\r\n\r\narr1 = []\r\narr2 = []\r\n\r\nflag = False\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n arr1.append(x)\r\n arr2.append(y)\r\n a = min(a, x)\r\n b = max(b, y)\r\n\r\nfor i in range(n):\r\n if arr1[i] == a and arr2[i] == b:\r\n print(i+1)\r\n flag = True\r\n break\r\n\r\nif not flag:\r\n print(-1)", "#242B\r\nn=int(input())\r\nc=[0]*n\r\nd=[0]*n\r\nminn=1000000000000000000000000000000000\r\nmaxx=0\r\nfor i in range(n):\r\n c[i],d[i]=map(int,input().split())\r\n if minn>c[i]:\r\n minn=c[i]\r\n if maxx<d[i]:\r\n maxx=d[i]\r\nfor j in range(n):\r\n if c[j]==minn and d[j]==maxx:\r\n print(j+1)\r\n exit(0)\r\nprint('-1') ", "n = int(input())\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\nl, r = 10**9, 1\r\n\r\nfor i in a:\r\n l = min(l, i[0])\r\n r = max(r, i[1])\r\n\r\nans = -1\r\n\r\nfor i in range(n):\r\n if a[i][0] == l and a[i][1] == r:\r\n ans = i + 1\r\n break\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nm1=0;m2=1000000000;c=[];d=[];a1=-1\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c.append(a);d.append(b)\r\n if a<m2:\r\n m2=a\r\n if b>m1:\r\n m1=b\r\nfor i in range(n):\r\n if c[i]==m2 and d[i]==m1:\r\n a1=i+1\r\n break\r\nprint(a1)", "a = []\nb = []\nc = []\ndef allseg(a,b):\n result = -1\n max_c = max(c)\n z = find_all(max_c,c)\n for i in range (len(z)):\n if min(a) == a[z[i]] and max(b) == b[z[i]]:\n result = z[i]+1\n break\n return result\n\ndef find_all(n,str):\n result = []\n for i in range (len(str)):\n if str[i] == n:\n result.append(i)\n return result\n\nt = int(input())\nfor i in range (t):\n seg = input().split()\n a.append(int(seg[0]))\n b.append(int(seg[1]))\n c.append(int(seg[1])-int(seg[0]))\nresult = allseg(a,b)\nprint (result)\n", "n = int(input())\r\narr_left = []\r\narr_right = []\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n arr_left.append(x)\r\n arr_right.append(y)\r\n\r\nmin_left = min(arr_left)\r\nmax_right = max(arr_right)\r\n\r\ncnt = -1\r\nfor i in range(n):\r\n if min_left == arr_left[i] and max_right == arr_right[i]:\r\n cnt = i + 1\r\n\r\nprint(cnt)\r\n", "n=int(input())\r\na=[]\r\nb=[]\r\nh=0\r\nfor i in range(n):\r\n q, w=map(int, input().split())\r\n a.append(q)\r\n b.append(w)\r\nmi=min(a)\r\nma=max(b)\r\nfor i in range(n):\r\n if a[i]==mi and b[i]==ma:\r\n h=1\r\n print(i+1)\r\nif h==0: print(-1)\r\n", "def main():\r\n n = int(input())\r\n segments = []\r\n min_l = float('inf')\r\n max_r = 0\r\n for i in range(n):\r\n l,r = map(int,input().split())\r\n min_l = min(min_l,l)\r\n max_r = max(max_r,r)\r\n segments.append((l,r))\r\n\r\n index = -1\r\n\r\n for i in range(n):\r\n if segments[i][0] <= min_l and segments[i][1] >= max_r:\r\n index = i+1\r\n break\r\n\r\n print(index)\r\n\r\nmain()\r\n", "\r\nn =int(input())\r\n \r\nl=[]\r\nr=[]\r\nfor i in range(n):\r\n s,e=map(int,input().split())\r\n l.append(s)\r\n r.append(e)\r\n \r\n \r\n \r\nmn=l[0]\r\nmx=r[0]\r\n\r\nfor i in range(n):\r\n if(l[i]<mn):\r\n mn=l[i]\r\n if r[i]>mx:\r\n mx=r[i]\r\nflag=1\r\np=0\r\nfor i in range(n):\r\n if l[i]<=mn and r[i]>=mx:\r\n p=i+1\r\n flag=0\r\n \r\nif flag==0:\r\n print(p)\r\nelse:\r\n print(-1)", "#Segments\r\nsegment = int(input())\r\nlst = list()\r\nfor i in range(segment):\r\n lst.append(list(map(int,input().split())))\r\n\r\nleft_segment = list()\r\nright_segment = list()\r\nfor item in lst:\r\n left_segment.append(item[0])\r\n right_segment.append(item[1])\r\n\r\nleft_segment.sort()\r\nright_segment.sort()\r\nmin_left = left_segment[0]\r\nmax_right = right_segment[len(right_segment)-1]\r\ncount = 0\r\nfor item in lst:\r\n count += 1\r\n if item[0] == min_left and item[1] == max_right:\r\n print(count)\r\n break\r\n if count == len(lst):\r\n print(-1)\r\n \r\n", "number_of_segments = int(input())\r\n\r\nsmallest = float('inf')\r\ngreatest = float('-inf')\r\nresult = -1\r\n\r\nfor index in range(number_of_segments):\r\n small, great = map(int, input().split())\r\n\r\n if small <= smallest and great >= greatest:\r\n smallest = small\r\n greatest = great\r\n result = index + 1\r\n else:\r\n if small > smallest and great > greatest:\r\n greatest = great\r\n result = -1\r\n elif small < smallest and great < greatest:\r\n smallest = small\r\n result = -1\r\n\r\nprint(result)\r\n", "n = int(input())\r\nl = []\r\nr = []\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n l.append(x)\r\n r.append(y)\r\n\r\nminl = min(l)\r\nmaxr = max(r)\r\n\r\nfor i in range(n):\r\n if l[i] == minl and r[i] == maxr:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\n\r\na=[tuple(map(int,input().split())) for x in range(n)]\r\nb=min([x[0]for x in a])\r\nc=max([x[1]for x in a])\r\nif (b,c) in a:\r\n print(a.index((b,c))+1)\r\nelse:\r\n print(-1)\r\n\r\n", "n = int(input())\narr = [tuple(map(int, input().split())) for _ in range(n)]\na, b = float(\"inf\"), 0\nfor p in arr:\n a = min(a, p[0])\n b = max(b, p[1])\n\nfor i in range(n):\n if arr[i] == (a, b):\n print(i+1)\n exit()\nprint(-1)\n", "a = []\r\nfor i in range(int(input())):\r\n a.append(list(map(int,input().split()))+[i])\r\nb = sorted(a)\r\ni=0\r\nl = min([x[0] for x in a])\r\nr = max([x[1] for x in a])\r\nfor x in b:\r\n if x[0]==b[0][0]: i = x[2]\r\nprint(i+1 if a[i][0]==l and a[i][1]==r else -1)", "a=sorted([[*map(int,s.split()),i]for i,s in enumerate([*open(0)][1:])],key=lambda x:(x[0],-x[1]))\r\nprint([a[0][2]+1,-1][any(a[0][1]<x[1]for x in a)])", "l=[]\r\nl1=[]\r\nl2=[]\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n l.append((a,b))\r\n l1.append(a)\r\n l2.append(b)\r\nl1.sort()\r\nl2.sort()\r\nx=-1\r\nfor (a,b) in l:\r\n if a==l1[0] and b==l2[-1]:\r\n x=l.index((a,b))+1\r\n break\r\nprint(x)\r\n \r\n", "n = int(input())\r\nl1 = []\r\ns = set()\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n l = [a,b]\r\n \r\n s.add(a)\r\n s.add(b)\r\n l1.append(l)\r\n\r\nmx = max(s)\r\nmn = min(s)\r\n\r\nfor i in range(len(l1)):\r\n if l1[i][0] <= mn and l1[i][1]>= mx:\r\n print(i+1)\r\n break\r\nelse:\r\n print(-1)\r\n \r\n \r\n", "def main():\n\tn=int(input())\n\tls=[]\n\tlmin=999999999999999999999999999\n\trmax=0\n\tfor i in range(n):\n\t\tl,r= [int(j) for j in input().split()]\n\t\tlmin=min(l,lmin)\n\t\trmax=max(rmax,r)\n\t\tls.append((l,r))\n\tif (lmin,rmax) in ls:\n\t\tprint(ls.index((lmin,rmax))+1)\n\t\treturn 0\n\tprint(-1)\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "n = int(input())\r\nL = [0] * n\r\nR = [0] * n\r\nfor i in range(n):\r\n L[i], R[i] = map(int, input().split())\r\n\r\nLeft = min(L)\r\nRight = max(R)\r\nfor i in range(n):\r\n if L[i] == Left and R[i] == Right:\r\n print(i + 1)\r\n exit()\r\n\r\nprint(-1)", "n = int(input())\r\nsegments = []\r\nlargest_index = -1\r\nlargest = -1\r\n\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n segments.append((l, r))\r\n if r - l + 1 > largest:\r\n largest = r - l + 1\r\n largest_index = i\r\n\r\nfor i in range(n):\r\n if i == largest_index:\r\n continue\r\n\r\n if segments[largest_index][0] <= segments[i][0] and segments[i][1] <= segments[largest_index][1]:\r\n pass\r\n else:\r\n largest_index = -2\r\n break\r\n\r\nprint(largest_index + 1)\r\n", "#Big Segments\r\n\r\nn = int(input())\r\n\r\nminLeft = 1000000000\r\nmaxRight = 0\r\nminPos = 0\r\nmaxPos = 0\r\n\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n if l< minLeft:\r\n minLeft = l\r\n minPos = i\r\n if r > maxRight:\r\n maxRight = r\r\n maxPos = i\r\n if l == minLeft and r >= maxRight:\r\n minPos = i\r\n maxPos = i\r\n if l <= minLeft and r == maxRight:\r\n minPos = i\r\n maxPos = i\r\nif minPos != maxPos:\r\n print(-1)\r\nelse:\r\n print(minPos+1)\r\n", "n = int(input())\r\n\r\narray = []\r\nmin_left = 10 ** 9\r\nmax_right = 1\r\n\r\nfor i in range(0,n):\r\n x, y = map(int,input().split())\r\n min_left = min(x,min_left)\r\n max_right = max(y,max_right)\r\n array.append([x,y])\r\n\r\nif [min_left,max_right] in array:\r\n print(array.index([min_left, max_right]) + 1)\r\nelse:\r\n print('-1')", "def findNumberCover(matrix):\n # find min value and list index_min\n min_value = min(matrix[0])\n listMin = [i for i, j in enumerate(matrix[0]) if j == min_value]\n # find max value and list index_manx\n max_value = max(matrix[1])\n listMax = [i for i, j in enumerate(matrix[1]) if j == max_value]\n #check if the min_index and the max_index is the same position.\n result = list(set(listMin).intersection(listMax))\n if (not result):\n return -1\n else:\n return result[0] + 1\n\n\ndef transpose(matrix):\n matrixT = []\n row1 = []\n row2 = []\n for index in matrix:\n row1.append(index[0])\n row2.append(index[1])\n matrixT.append(row1)\n matrixT.append(row2)\n return matrixT\n\n\n# Input data\nrows = int(input())\nmatrix = []\nrow = []\nfor i in range(rows):\n row = list(map(int, input().split()))\n matrix.append(row)\n\nmatrixT = transpose(matrix)\n\n# Find the number of segment that covers all\nprint(findNumberCover(matrixT))\n", "n = int(input())\nmini = float(\"inf\")\nmaxi = float(\"-inf\")\nsegs = []\nfor _ in range(n):\n\ta, b = map(int, input().split())\n\tmini = min(a, mini)\n\tmaxi = max(b, maxi)\n\tsegs.append((a, b))\nres = (mini, maxi)\nif res in segs:\n\tprint(segs.index(res) + 1)\nelse:\n\tprint(-1)", "t=int(input())\r\nlst=[]\r\nst=[]\r\nen=[]\r\nfor i in range(t):\r\n l,r=map(int,input().split())\r\n p=[l,r]\r\n lst.append(p)\r\n st.append(l)\r\n en.append(r)\r\ncheck=[min(st),max(en)]\r\nd=0\r\nfor i in lst:\r\n d+=1\r\n if i[0]==check[0] and i[1]==check[1]:\r\n print(d)\r\n break\r\nelse:\r\n print(\"-1\")\r\n", "number=int(input())\r\nmasx, masy=[0]*number, [0]*number\r\nfor i in range(number):\r\n masx[i], masy[i] = map(int, input().split())\r\nx=min(masx)\r\ny=max(masy)\r\nfor i in range(number):\r\n if masx[i] == x and masy[i] == y:\r\n print(i+1)\r\n exit(0)\r\nprint(-1)\r\n", "t = int(input())\r\nminimum = 10**9\r\nmaximum = 1\r\nL = []\r\nfor i in range(t):\r\n l = list(map(int, input().split()))\r\n L.append(l)\r\n if l[0]<minimum:\r\n minimum = l[0]\r\n if l[1]>maximum:\r\n maximum = l[1]\r\nif [minimum,maximum] not in L:\r\n print(-1)\r\nelse:\r\n print(L.index([minimum,maximum])+1)", "n = int(input())\n\nl = n * [0]\nr = n * [0]\nfor i in range(n):\n l[i], r[i] = map(int, input().split())\nl_min = min(l)\nr_max = max(r)\n\nfor i in range(n):\n if l[i] == l_min and r[i] == r_max:\n print(i + 1)\n exit()\nprint(-1)", "x = int(input())\r\narr = []\r\npos = -1\r\nfor i in range(0, x):\r\n arr.append(list(map(int,input().split(' '))))\r\n\r\nminV = min(list(map(lambda i: i[0], arr)))\r\nmaxV = max(list(map(lambda i: i[1], arr)))\r\n\r\nfor i in range(0, x):\r\n if arr[i][0] == minV and arr[i][1] == maxV:\r\n pos = i + 1\r\n break\r\nprint(pos)", "\r\n\r\nn = int(input())\r\n\r\na = []\r\nb = []\r\nc = []\r\nfor i in range(n):\r\n l ,r = map(int,input().split())\r\n a.append(l)\r\n b.append(r)\r\n c.append((l ,r))\r\n\r\n#print(a)\r\n#print(b)\r\n#print(c)\r\n\r\nres1 = min(a)\r\nres2 = max(b)\r\nres3 = (res1 , res2)\r\n#print(res3)\r\n#print(res1 , res2)\r\n\r\nif res3 not in c :\r\n print('-1')\r\n\r\nelse:\r\n print(c.index(res3) + 1)\r\n\r\n\r\n", "A, B, ans = 1000000000, 1, -1\r\nfor i in range(1, int(input()) + 1):\r\n a, b = map(int, input().split())\r\n if a > A:\r\n if b > B: B, ans = b, -1\r\n else:\r\n if b >= B: A, B, ans = a, b, i\r\n elif a != A: A, ans = a, -1\r\nprint(ans)", "number = int(input())\r\nlist_array = []\r\n\r\nfor i in range(number):\r\n list_array.extend(str(input()).split())\r\n\r\nlist_array = list(map(int, list_array))\r\n\r\nresult = -1\r\n\r\nminx = min(list_array)\r\nmaxx = max(list_array)\r\n\r\na_minx = [i for i, x in enumerate(list_array) if x == minx]\r\n\r\nfor x in a_minx:\r\n if list_array[x + 1] == maxx:\r\n result = (x + 2)/2\r\n break\r\n\r\nprint(int(result))\r\n", "n=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n x,y=[int(x) for x in input().split()]\r\n a.append(x)\r\n b.append(y)\r\n\r\nmn=min(a)\r\nmx=max(b)\r\ncount=0\r\nfor i,j in zip(a,b):\r\n if i==mn and j==mx:\r\n print(count+1)\r\n break\r\n count+=1\r\nelse:\r\n print(-1)", "n= int(input())\r\narr=[]\r\n\r\ns=float('inf')\r\ne=-float('inf')\r\nfor i in range(n):\r\n t=list(map(int,input().split()))\r\n arr.append(t)\r\n if t[0]<s:\r\n s=t[0]\r\n if t[1]>e:\r\n e=t[1]\r\n\r\nf=False\r\nfor i in range(n):\r\n if arr[i]==[s,e]:\r\n f=True\r\n print(i+1)\r\n break\r\nif not f:\r\n print(-1)\r\n", "n=int(input())\r\nml=10e9\r\nmr=0\r\nL=[]\r\nfor i in range(n):\r\n t=[]\r\n l,r=map(int,input().split())\r\n if(l<=ml):\r\n ml=l;\r\n if(r>=mr):\r\n mr=r;\r\n t.append(l);\r\n t.append(r);\r\n L.append(t);\r\nc=0\r\nfor i in range(len(L)):\r\n if(L[i][0]==ml and L[i][1]==mr):\r\n c=1\r\n p=i+1\r\n break\r\nif(c==1):\r\n print(p)\r\nelse:\r\n print(\"-1\")", "n = int(input())\r\nmini = None\r\nmaxi = None\r\nb = []\r\nfor i in range(n):\r\n l,r = map(int, input().split())\r\n if mini is None or l<mini:\r\n mini = l\r\n if maxi is None or r>maxi:\r\n maxi = r\r\n b.append([l,r])\r\nprint(b.index([mini,maxi])+1 if [mini,maxi] in b else -1)\r\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\n\r\nl,r= [],[]\r\nfor _ in range(n):\r\n a,b = stdin.readline().split()\r\n l.append(int(a))\r\n r.append(int(b))\r\nmini , maxi = min(l), max(r)\r\n\r\nmnind = [i+1 for i,x in enumerate(l) if x==mini]\r\nmxind = [i+1 for i,x in enumerate(r) if x==maxi]\r\n\r\np = list(set(mnind).intersection(mxind))\r\n\r\nif len(p)==0:\r\n stdout.write('-1')\r\nelse:\r\n stdout.write(str(p[0]))", "n = int(input())\nl = []\nr = []\ndic = {}\nnumd = {}\nmi = 0\nma = 1000000000\nfor i in range(n):\n ls = list(map(int,input().split(\" \")))\n l.append(ls[0])\n r.append(ls[1])\n numd[str(l[i])+\",\"+str(r[i])] = i\n if l[i] not in dic:\n dic[l[i]] = r[i]\n else:\n x = max(dic[l[i]],r[i])\n dic[l[i]]=x\n if(l[i]<ma): ma = l[i]\n if(r[i]>mi): mi = r[i]\nif(dic[ma]==mi):\n print(numd[str(ma)+\",\"+str(mi)]+1)\nelse:\n print(-1)\n", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n tempA, tempB = map(int, input().split())\r\n a.append(tempA)\r\n b.append(tempB)\r\n\r\nminx = a[0]\r\nmaxx = b[0]\r\n\r\nfor i in range(n):\r\n minx = min(minx, a[i])\r\n maxx = max(maxx, b[i])\r\n\r\nfor i in range(n):\r\n if a[i] == minx and b[i] == maxx:\r\n print(i+1)\r\n exit()\r\nprint(-1)\r\n", "def solve(lines):\n # #just see if min, max of start, end is together.\n if not lines:\n return -1\n\n l, r = lines[0][0], lines[0][1]\n res = 1\n\n for i in range(1, len(lines)):\n\n left = lines[i][0]\n right = lines[i][1]\n\n if left <= l and r <= right:\n res = i + 1\n\n elif left < l or r < right:\n res = -1\n\n\n l = min(left, l)\n r = max(right, r)\n\n return res\n\n\n\nn = int(input())\nlines = []\nfor i in range(n):\n nums = list(map(int, input().split()))\n lines.append(nums)\n\n\nprint (solve(lines))\n", "n = int(input())\r\n\r\nsegs = [list(map(int, input().split())) for _ in range(n)]\r\nl = 99999999999999999\r\nr = 0\r\nfor s in segs:\r\n\tl = min(l, s[0])\r\n\tr = max(r, s[1])\r\nfor i, s in enumerate(segs):\r\n\tif s[0] == l and s[1] == r:\r\n\t\tprint(i + 1)\r\n\t\tbreak\r\nelse:\r\n\tprint('-1')", "n = int(input())\n\nx_list=[]\ny_list=[]\ndictionary = {}\n\nfor i in range(n):\n x, y = map(int, input().split())\n x_list.append(x)\n y_list.append(y)\n dictionary[(x, y)] = i + 1\n\nx_list.sort()\ny_list.sort(reverse=True)\n\nif (x_list[0],y_list[0]) in dictionary.keys():\n print(dictionary[x_list[0],y_list[0]])\nelse:\n print(-1)\n\n\n", "n = int(input())\r\nd = {}\r\nmin1 = float(\"inf\")\r\nmax1 = float(\"-inf\")\r\nfor i in range(n):\r\n\tl,r = map(int,input().split())\r\n\td[(l,r)] = i+1\r\n\tmin1 = min(l,min1)\r\n\tmax1 = max(r,max1)\r\nif (min1,max1) in d:\r\n\tprint(d[(min1,max1)])\r\nelse:\r\n\tprint(-1)", "# ord(i)-ord('0')\r\nt=int(input())\r\nlisti=[tuple(map(int, input().split())) for x in range(t)]\r\na=min(tup[0] for tup in listi)\r\nb=max(tup[1] for tup in listi)\r\nif (a,b) in listi:\r\n print(listi.index((a,b))+1)\r\nelse:print(-1)", "n = int(input()) \r\nsegments = []\r\nfor i in range(n):\r\n l = input().split(' ')\r\n segments.append((int(l[0]), int(l[1])))\r\nminimum, maximum = segments[0][0], segments[0][1]\r\nfor i in range(n):\r\n if segments[i][0] < minimum: minimum = segments[i][0]\r\n if segments[i][1] > maximum: maximum = segments[i][1]\r\n\r\nfor i in range(n):\r\n if minimum == segments[i][0] and segments[i][1] == maximum:\r\n print(i + 1)\r\n exit()\r\nprint(-1)", "#B. Big Segment\r\nn = int(input())\r\nl = []\r\nr = []\r\nfor _ in range(n):\r\n x, y = map(int,input().split())\r\n l.append(x)\r\n r.append(y)\r\nli = min(l)\r\nri = max(r)\r\nflag = False\r\nfor i in range(n):\r\n if l[i]==li and r[i]==ri:\r\n print(i+1)\r\n flag = True\r\n break\r\nif not flag:\r\n print(-1)", "#242B\n\nn = int(input())\n\nleft = []\nright = []\nfor i in range(n):\n\ta = list(map(int, input().split(\" \")))\n\tleft.append(a[0])\n\tright.append(a[1])\n\nlmost = min(left)\nrmost = max(right)\n\nb = 0\nfor i in range(n):\n\tif left[i] == lmost and right[i] == rmost:\n\t\tprint(i+1)\n\t\tb = 1\n\t\tbreak\nif b == 0:\n\tprint(-1)\n", "n=int(input())\r\nmini=99999999999999999999999\r\nmaxi=-mini\r\narr=[]\r\nfor _ in range(n):\r\n a=list(map(int,input().split()))\r\n arr.append(a)\r\n maxi=max(maxi,max(a))\r\n mini=min(mini,min(a))\r\na=0\r\nflag=0\r\nfor i in range(len(arr)):\r\n item=arr[i]\r\n if item[0]<=mini and item[1]>=maxi:\r\n flag=1\r\n break\r\nif flag==1:\r\n print (i+1)\r\nif flag==0:\r\n print (-1)", "n = int(input())\r\nl = [0] * n\r\nr = [0] * n\r\nfor i in range(n):\r\n l[i], r[i] = map(int, input().split())\r\nlow = min(l)\r\nup = max(r)\r\nres = -1\r\nfor i in range(n):\r\n if l[i] == low and r[i] == up:\r\n res = i + 1\r\nprint(res)", "total_seg = int(input())\r\nout = -1\r\nmin_ = -1\r\nmax_ = -1\r\nnum_tup = ()\r\nfor n in range(1,total_seg+1):\r\n num_tup = tuple(input().split())\r\n if min_ == -1 and max_ == -1:\r\n min_ = int(num_tup[0])\r\n max_ = int(num_tup[1])\r\n out = n\r\n #print(f'{min_} __ {max_}' )\r\n elif (int(num_tup[0])) <= min_ and (int(num_tup[1])) >= max_:\r\n min_ = int(num_tup[0])\r\n max_ = int(num_tup[1])\r\n #print(f'{min_} {max_}' )\r\n out = n\r\n elif (int(num_tup[0])) < min_:\r\n min_ = int(num_tup[0])\r\n out = -1\r\n #print(f'{min_} | {max_}' )\r\n elif (int(num_tup[1])) > max_:\r\n max_ = int(num_tup[1])\r\n out = -1\r\n #print(f'{min_} ? {max_}' )\r\nprint(out)", "n = int(input()) \npts = []\nfor _ in range(n):\n pts.append(list(map(int, input().split())))\n\nmmin = min(pts, key=lambda x: x[0])\nmmax = max(pts, key=lambda x: x[1])\n\nans = -1\nfor i in range(n):\n if pts[i][0] <= mmin[0] and pts[i][1] >= mmax[1]:\n ans = i+1\n\nprint(ans)\n", "n = int(input())\r\na = []\r\ncount = 0\r\nmin = 1000000000\r\nmax = 0\r\nfor i in range(n):\r\n temp = list(map(int,input().split()))\r\n a.append(temp)\r\nfor i in range(0,n,1):\r\n if a[i][0] < min:\r\n min = a[i][0]\r\n if a[i][1] > max:\r\n max = a[i][1]\r\nfor j in range(0,n,1):\r\n if a[j][0] == min and a[j][1] == max:\r\n print(j+1)\r\n exit()\r\n\r\nprint(-1)", "def solution():\r\n\tn=int(input())\r\n\tk=[]\r\n\tmn=float('Inf')\r\n\r\n\tmx=float('-Inf')\r\n\tfor i in range(n):\r\n\t\tl,r=map(int,input().split())\r\n\t\tk.append((l,r))\r\n\t\tmn=min(l,mn)\r\n\t\tmx=max(r, mx)\r\n\r\n\tfor i in range(n):\r\n\t\tif k[i][0]==mn and k[i][1]==mx:\r\n\t\t\tprint(i+1)\r\n\t\t\treturn\r\n\tprint(-1)\r\n\treturn\r\n\r\n\r\nsolution()\r\n", "def main() : \r\n R=input\r\n I=lambda:map(int,R().split())\r\n n=int(R())\r\n a=[]\r\n b=[]\r\n for i in range(n):x,y=I();a.append(x);b.append(y)\r\n x=min(a)\r\n y=max(b)\r\n for i in range(n):\r\n \tif a[i]==x and b[i]==y:print(i+1);exit()\r\n print(-1) \r\nmain()", "n=int(input())\r\narr=[list(map(int,input().split())) for i in range(n)]\r\nfront=sorted(arr,key=lambda x:x[1]-x[0],reverse=True)\r\n# print(front)\r\nmin1=min(arr,key=lambda x:x[0])[0]\r\nmax2=max(arr,key=lambda x:x[1])[1]\r\n# print(min1,max2)\r\nif min1>=front[0][0] and max2<=front[0][1]:\r\n print(arr.index(front[0])+1)\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\ndata = []\r\nmin_ , max_ = list(map(int,input().split()))\r\ndata.append([min_,max_])\r\nnum = 0\r\nfor i in range(1,n):\r\n a,b = list(map(int,input().split()))\r\n data.append([a,b])\r\n if a <= min_ and b >= max_ :\r\n min_ = a\r\n max_ = b\r\n num = i\r\nflag = 0\r\nfor i in range(n):\r\n a,b = data[i]\r\n if (a >= min_ and b <= max_) or i == num-1:\r\n pass\r\n else:\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(num+1)\r\nelse:\r\n print(-1)\r\n ", "o = []\r\nq = range(int(input()) - 1, -1, -1)\r\nfor _ in q:\r\n o.append(sorted([int(i) for i in input().split()]))\r\nfor i in q:\r\n for x in q:\r\n if o[i][0] > o[x][0] or o[x][1] > o[i][1]:\r\n break\r\n else:\r\n print(i + 1)\r\n break\r\nelse:\r\n print(-1)", "n = int(input())\r\n\r\ndata = []\r\nwhile len(data) != n:\r\n data.append(list(map(int, input().split(' '))))\r\n\r\nres = -1\r\n\r\nminx = data[0][0]\r\nmaxx = 0\r\n\r\nfor i in data:\r\n minx = min(minx, i[0])\r\n maxx = max(maxx, i[1])\r\n\r\nfor i in range(0, len(data)):\r\n if data[i][0] <= minx and data[i][1] >= maxx:\r\n res = i + 1\r\n\r\nprint(res)", "from collections import Counter as cnt\r\nl,x=[],[]\r\nfor pratyush in range(int(input())):\r\n a,b=list(map(int,input().split()))\r\n x.append([a,b])\r\n l.append(b-a)\r\nc,m=cnt(l),max(l)\r\nif c[m]==1:\r\n r,f=l.index(m),0\r\n a,b=x[r]\r\n for i,j in x:\r\n if a<=i and b>=j:\r\n continue\r\n else:\r\n f=1\r\n break\r\n if f: print(-1)\r\n else: print(r+1)\r\nelse:\r\n print(-1)", "t = int(input())\r\nfirst = []\r\nsecond = []\r\noverall = []\r\nfor _ in range(t):\r\n a, b = [int(i) for i in input().split()]\r\n first.append(a)\r\n second.append(b)\r\n overall.append([a,b])\r\nmi = min(first)\r\nma = max(second)\r\nflag = -1\r\nfor i in range(t):\r\n if overall[i][0] <= mi <= ma <= overall[i][1]:\r\n flag = i+1\r\nprint(flag)", "n=int(input())\r\nl=[]\r\nr=[]\r\nans=[]\r\nfor x in range (n):\r\n a,b=map(int,input().split())\r\n l.append(a)\r\n r.append(b)\r\n ans.append([a,b])\r\ntry:\r\n print(ans.index([min(l),max(r)])+1)\r\nexcept ValueError:\r\n print(-1)", "def main():\r\n n=int(input())\r\n segments=[]\r\n for i in range(n):\r\n segments.append(input().split(' '))\r\n max_range=max((int(segments[i][1]) for i in range(n)))\r\n min_range=min((int(segments[i][0]) for i in range(n)))\r\n index=-1\r\n for i in range(n):\r\n if int(segments[i][0])==min_range and int(segments[i][1])==max_range:\r\n index=i+1\r\n print(index)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nL = [0]*n\r\nR = [0]*n\r\nfor i in range(n):\r\n L[i], R[i] = map(int, input().split())\r\n \r\nsmallest = min(L)\r\nlargest = max(R)\r\n \r\nfor i in range(n):\r\n if L[i] == smallest and R[i] == largest:\r\n print(i+1)\r\n exit()\r\nprint(-1)", "n = int(input())\r\nmaxh = 0\r\nmaxi = 0\r\nsz = []\r\nfor i in range(n):\r\n l, r = map(int,input().split())\r\n sz.append([l,r])\r\n if r - l > maxh:\r\n maxh = r-l \r\n maxi = i\r\n\r\nfor i in range(n):\r\n if not(sz[i][0] >= sz[maxi][0] and sz[i][1] <= sz[maxi][1]):\r\n maxi = -2 \r\nprint(maxi+1)", "\ndef mi():\n\treturn map(int, input().split())\n\nn = int(input())\na = [0]*n\nx1 = [0]*n\nx2 = [0]*n\nfor i in range(n):\n\tt1,t2 = mi()\n\ta[i] = [t1,t2]\n\tx1[i] = t1\n\tx2[i] = t2\nn1 = min(x1)\nn2 = max(x2)\nfor i in range(n):\n\tif a[i][0]<=n1 and a[i][1]>=n2:\n\t\tprint (i+1)\n\t\texit(0)\nprint (-1)", "n = int(input())\r\narr = []\r\nfor _ in range(n):\r\n l,r = map(int,input().split())\r\n arr.append([l,r])\r\n\r\n\r\nminVal = float(\"inf\")\r\nmaxVal = float(\"-inf\")\r\n\r\nfor segment in arr:\r\n l = segment[0]\r\n r = segment[1]\r\n minVal = min(minVal,l)\r\n maxVal = max(maxVal,r)\r\n\r\n\r\n\r\n\r\nindex = -2\r\nfor i in range(len(arr)):\r\n segment= arr[i]\r\n l = segment[0]\r\n r = segment[1]\r\n if minVal==l and r==maxVal:\r\n index = i\r\n break\r\n\r\n\r\nprint(index+1)\r\n \r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n", "n=int(input())\r\nl=[]\r\nr=[]\r\ndiff=[]\r\nwhile n:\r\n n-=1\r\n li, ri= map(int, input().split())\r\n l.append(li)\r\n r.append(ri)\r\n diff.append(ri-li)\r\n#print(l,r,diff)\r\ntemp=diff.index(max(diff))\r\nif l[temp]==min(l) and r[temp]==max(r):\r\n print(temp+1)\r\nelse:\r\n print(-1)\r\n'''\r\n 6\r\n1 5\r\n2 3\r\n1 10\r\n7 10\r\n7 7\r\n10 10\r\n'''", "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\nll = float('inf')\r\nul = -float('inf')\r\narr = []\r\nfor _ in range (t):\r\n\tx,y = map(int, input().split())\r\n\tll = min(ll,x)\r\n\tul = max(ul,y)\r\n\tarr.append((x,y))\r\ntry:\r\n\tans = arr.index((ll,ul))\r\n\tprint(ans+1)\r\nexcept:\r\n\tprint(-1)", "import math\r\nn=int(input())\r\nl=[]\r\nminl=math.inf\r\nmaxl=-1\r\nc=-1\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n if(minl>=x[0] and maxl<=x[1]):\r\n c=i+1\r\n elif(minl>x[0] or maxl<x[1]):\r\n c=-1\r\n minl=min(minl,x[0])\r\n maxl=max(maxl,x[1])\r\nprint(c) \r\n \r\n", "n=int(input())\r\nans=[]\r\nmini=10**19 \r\nmaxi=-(10**19)\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n ans.append([l,r,i+1])\r\n if l<=mini:\r\n mini=l \r\n if r>=maxi:\r\n maxi=r \r\nres=-1 \r\nfor i in range(n):\r\n l=ans[i][0]\r\n r=ans[i][1]\r\n if l<=mini and r>=maxi:\r\n res=ans[i][2]\r\nprint(res)", "sz = int(input())\r\nlst = [[int(i) for i in input().split()]for j in range(sz)]\r\ncornermn = min(lst,key= lambda x:x[0])\r\ncornermx = max(lst,key= lambda x:x[1])\r\nreq = [cornermn[0],cornermx[1]]\r\ntry:\r\n print(lst.index(req)+1)\r\nexcept:\r\n print(-1)\r\n\r\n", "n = int(input())\nlm = 10**9\nrm = 0\nlst = []\nfor i in range(n):\n l, r = map(int, input().split())\n lm = min(lm, l)\n rm = max(rm, r)\n lst.append([l, r])\ncount = 0\n# print(lm, rm)\nfor l, m in lst:\n # print(l, m)\n if l == lm and m == rm:\n print(count+1)\n exit()\n count += 1\nprint(-1)", "n = int(input())\r\na = [0] * n\r\nb = [0] * n\r\nfor i in range(n):\r\n a[i], b[i] = map(int, input().split())\r\nmina = min(a)\r\nmaxb = max(b)\r\n\r\nans = -1\r\nfor i in range(n):\r\n if a[i] == mina and b[i] == maxb:\r\n ans = i + 1\r\nprint(ans)\r\n", "n = int(input())\r\na = [list(map(int,input().split())) for i in range(n)] \r\nzero =[]\r\none =[]\r\nfor i in range(len(a)):\r\n zero.append(a[i][0])\r\n one.append(a[i][1])\r\nx = min(zero)\r\ny = max(one)\r\nif [x, y] in a:\r\n print(a.index([x,y])+1)\r\nelse:\r\n print(-1)", "n = int(input())\r\nx, y = 10 ** 9 + 1, 0\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\n x = min(x, l[-1][0])\r\n y = max(y, l[-1][1])\r\n \r\nfor i in range(n):\r\n if(l[i][0] == x and l[i][1] == y):\r\n print(i + 1)\r\n break \r\nelse:\r\n print(-1)", "def process_inputs():\r\n n = int(input())\r\n left_arr = []\r\n right_arr = []\r\n\r\n for _ in range(n):\r\n a, b = list(map(int, input().split()))\r\n left_arr.append(a)\r\n right_arr.append(b)\r\n\r\n return n, left_arr, right_arr\r\n\r\n\r\ndef solve():\r\n n, left_arr, right_arr = process_inputs()\r\n left = min(left_arr)\r\n right = max(right_arr)\r\n\r\n ans = -1\r\n\r\n for i in range(n):\r\n if left == left_arr[i] and right == right_arr[i]:\r\n ans = i + 1\r\n break\r\n\r\n return ans\r\n\r\n\r\ndef print_result():\r\n print(solve())\r\n\r\n\r\nprint_result()\r\n", "minI,maxI =0,0\r\nl=[]\r\nn= int(input())\r\nfor i in range(n):\r\n a,b = [int(i) for i in input().split()]\r\n l.append((a,b))\r\n \r\nminI,maxI= l[0][0],l[0][1]\r\n\r\nfor s,e in l:\r\n if s<=minI:\r\n minI= s\r\n if e>=maxI:\r\n maxI=e\r\n \r\nif (minI,maxI) in l:\r\n print(l.index((minI,maxI))+1)\r\nelse:\r\n print(-1)", "n=int(input())\r\nsegs=[[0,0] for _ in range(n)]\r\nmi=10**9\r\nma=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n mi=min(mi,a)\r\n ma=max(ma,b)\r\n segs[i]=[a,b]\r\nif [mi,ma] not in segs:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if segs[i]==[mi,ma]:\r\n print(i+1)\r\n break", "n = int(input())\r\nl = []\r\nr = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n l.append(x)\r\n r.append(y)\r\n\r\nleft = l[0]\r\nright = r[0]\r\nfor i in range(n):\r\n if (l[i] < left):\r\n left = l[i]\r\n if (r[i] > right):\r\n right = r[i]\r\n\r\nres = -1\r\nfor i in range(n):\r\n if (left == l[i] and right == r[i]):\r\n res = i + 1\r\n\r\nprint(res)", "#homework2\r\nnumber_segment = int(input(''))\r\ncount = 0\r\ns = list()\r\nwhile count < number_segment:\r\n s.append(list(map(int,input('').split())))\r\n count += 1\r\nleft = list()\r\nright = list()\r\nfor item in s:\r\n left.append(item[0])\r\n right.append(item[1])\r\n\r\ncover_segment = [min(left), max(right)] \r\ni = 0\r\nflag = False\r\nwhile i < len(s) and flag == False:\r\n if s[i] == cover_segment:\r\n flag = True\r\n i += 1\r\nif flag:\r\n print(i)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n \r\n \r\n", "n = int(input())\r\nsmallest_l = 0\r\nlargest_r = 0\r\nsegments = []\r\n\r\nfor i in range(0,n):\r\n l, r = map(int, input().split())\r\n segments.append([l,r,i+1])\r\n if i == 0:\r\n smallest_l = l\r\n largest_r = r\r\n else:\r\n if l < smallest_l:\r\n smallest_l = l\r\n if r > largest_r:\r\n largest_r = r\r\n\r\nsmallest_ones = []\r\nfor i in range(0,len(segments)):\r\n if segments[i][0] == smallest_l:\r\n smallest_ones.append(segments[i])\r\n\r\nprinted = False\r\nfor i in range(0,len(smallest_ones)):\r\n if smallest_ones[i][1] == largest_r:\r\n print(smallest_ones[i][2])\r\n printed = True\r\n break\r\n \r\nif printed == False:\r\n print(-1)", "l=[];x=mn=1e11;y=mx=1e-11;pos=0\r\nfor _ in range(int(input())):l.append(list(map(int,input().split())))\r\nfor i in range(len(l)):\r\n if l[i][0]<=x and l[i][1]>=y:x=l[i][0];y=l[i][1];pos=i+1\r\n if l[i][0]<mn:mn=l[i][0]\r\n if l[i][1]>mx:mx=l[i][1]\r\nprint(pos if x<=mn and y>=mx else -1)", "n = int(input())\nsegments = []\nminL = 1e9\nmaxR = 0\n\nfor i in range(n):\n l, r = map(int, input().split())\n minL = min(l, minL)\n maxR = max(r, maxR)\n segments.append((l, r))\n\ncover_segment = -1\nfor i in range(n):\n s = segments[i]\n if s[0] == minL and s[1] == maxR:\n cover_segment = i + 1\n break\n\nprint(cover_segment)", "n = int(input())\r\nx1, x2 = [],[]\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n x1.append(x)\r\n x2.append(y)\r\nmin, max = min(x1),max(x2)\r\nindex = -2\r\nfor i in range(n):\r\n if x1[i]==min and x2[i]==max:\r\n index = i\r\nprint(index+1)", "# 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 = gint()\nseg = []\nmax_right = -INF\nfor i in range(1, n + 1):\n inp = gint_arr()\n max_right = max(max_right, inp[1])\n seg.append(tuple(inp + [i]))\n\nseg.sort()\ni = 1\nwhile i < n and seg[i][0] == seg[0][0]:\n i += 1\n\ni -= 1\n\nprint(seg[i][2] if max_right <= seg[i][1] else -1)\n", "n = int(input())\r\nlist_input1 = []\r\nlist_input2 = []\r\n\r\nfor i in range(n):\r\n\r\n a = list(map(int, input().split(' ')))\r\n list_input1.append(a)\r\n\r\n list_input2.append(a[0])\r\n list_input2.append(a[1])\r\n# print(list_input, 'list_input')\r\n# print(result, 'result')\r\n# print(list_input1)\r\n# print(list_input2)\r\nresult = [min(list_input2), max(list_input2)]\r\nprint(-1 if result not in list_input1 else (list_input1.index(result) + 1))\r\n# print(-1 if result not in list_input else (list_input.index(result) + 2))\r\n", "from sys import stdin,stdout\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn = ii1()\r\narr = []\r\nl = float(\"inf\")\r\nr = float(\"-inf\")\r\nfor i in range(n):\r\n a, b = iia()\r\n l = min(l, a)\r\n r = max(r, b)\r\n arr.append([a, b])\r\nfor i in range(n):\r\n if arr[i][0] <= l and arr[i][1] >= r:\r\n print(i + 1)\r\n break\r\nelse:\r\n print(-1)", "n=int(input())\r\ndef findsol(n): \r\n segs=[]\r\n maxi=-1e18\r\n mini=1e18\r\n for i in range(n):\r\n l,r=map(int,input().split())\r\n maxi=max(maxi,r)\r\n mini=min(mini,l)\r\n segs.append([l,r])\r\n for i in range(n):\r\n if maxi==segs[i][-1] and mini==segs[i][-2]:\r\n print(i+1)\r\n return\r\n print(-1)\r\nfindsol(n)\r\n", "matrix = []\nfor _ in range(int(input())):\n matrix.append(list(map(int, input().split())))\n\n\nmin_num = min(matrix, key=lambda x: x[0])[0]\nmax_num = max(matrix, key=lambda x: x[1])[1]\n\nif [min_num, max_num] in matrix:\n print(matrix.index([min_num, max_num])+1)\nelse:\n print(-1)\n", "def findNumberCover(matrix):\r\n # find min value and list index_min\r\n min_value = min(matrix[0])\r\n listMin = [i for i, j in enumerate(matrix[0]) if j == min_value]\r\n # find max value and list index_manx\r\n max_value = max(matrix[1])\r\n listMax = [i for i, j in enumerate(matrix[1]) if j == max_value]\r\n result = list(set(listMin).intersection(listMax))\r\n if(not result):\r\n return -1\r\n else:\r\n return result[0] + 1\r\n\r\n \r\ndef transpose(matrix):\r\n matrixT = []\r\n row1 = []\r\n row2 = []\r\n for index in matrix:\r\n row1.append(index[0])\r\n row2.append(index[1])\r\n matrixT.append(row1)\r\n matrixT.append(row2)\r\n return matrixT\r\n# Input data \r\nrows = int(input())\r\nmatrix = []\r\nrow = []\r\nfor i in range(rows):\r\n row = list(map(int, input().split())) \r\n matrix.append(row)\r\n\r\nmatrixT = transpose(matrix)\r\n\r\n# Find the number of segment that covers all\r\nprint(findNumberCover(matrixT))\r\n", "n = int(input())\r\nl = []\r\nr = []\r\nmin_left = 10**9\r\nmax_right = 1\r\nfor i in range(n):\r\n left, right = map(int, input().split())\r\n l.append(left)\r\n r.append(right)\r\n min_left = min(min_left, left)\r\n max_right = max(max_right, right)\r\npos = -1\r\nfor i in range(n):\r\n if l[i] == min_left and r[i] == max_right:\r\n pos = i + 1\r\n break\r\nprint(pos)", "n = int(input())\r\nl = [0] * n\r\nr = [0] * n\r\nfor i in range(n):\r\n l[i],r[i] = map(int, input().split())\r\nmn = min(l)\r\nmx = max(r)\r\nans = -1\r\nfor i in range(n):\r\n if l[i] == mn and r[i] == mx:\r\n ans = i + 1\r\nprint(ans)\r\n", "from sys import stdin as sin\ndef gint():return int(sin.readline())\ndef gmap():return map(int,sin.readline().split())\ndef glist():return list(map(int,sin.readline().split()))\ndef gstr():return sin.readline()\n\nn=int(input())\n\nm=float(\"inf\")\nM=-1\nj=-1\nf=-6\nl=[]\nfor i in range(n):\n a,b=gmap()\n l.append([a,b])\n m=min(m,a)\n M=max(M,b)\n if f<b-a:\n j=i\n f=b-a\n\nif l[j][0]==m and l[j][1]==M:print(j+1)\nelse:print(-1)", "z=[]\r\nn=int(input())\r\nc1=1000000000\r\nc2=0\r\nfor x in range(n):\r\n\tp,q=map(int,input().split())\r\n\tif p<c1:c1=p\r\n\tif q>c2:c2=q\r\n\tz.append([p,q])\r\nfor x in range(n):\r\n\tif z[x][0]==c1 and z[x][1]==c2:\r\n\t\tprint(x+1)\r\n\t\tbreak\r\nelse:print(-1)", "n = int(input())\r\nsegments = []\r\nminl = 10**9\r\nmaxr = 1\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n segments.append((a, b))\r\n if a<minl:\r\n minl = a\r\n if b>maxr:\r\n maxr = b\r\n \r\nif (minl, maxr) in segments:\r\n print(segments.index((minl, maxr))+1)\r\nelse:\r\n print(-1)\r\n \r\n \r\n", "a=int(input())\r\nl=[]\r\no=9999999999\r\np=0\r\ny=-1\r\nfor i in range(a):\r\n\tl.append(list(map(int,input().split())))\r\nfor i in range(a):\r\n if l[i][0]<=o:\r\n o=l[i][0]\r\n if l[i][1]>=p:\r\n p=l[i][1]\r\nif [o,p] in l:\r\n y=l.index([o,p])+1\r\nprint(y)", "n = int(input())\nsegments = [list(map(int, (input() + \" \" + str(i + 1)).split())) for i in range(n)]\nssegments = sorted(segments, key = lambda seg: seg[1], reverse = True)\nssegments = sorted(ssegments, key = lambda seg: seg[0])\n\ngood = True\nfor s in ssegments:\n if ssegments[0][0] > s[0] or ssegments[0][1] < s[1]:\n good = False\n break\n\nif good:\n print(ssegments[0][2])\nelse:\n print(-1)\n\n", "class Segment:\r\n def __init__(self, left, right):\r\n self.left = left\r\n self.right = right\r\n\r\nn = int(input())\r\nmax = -1\r\nmin = 10000000001\r\na = []\r\nfor i in range(n):\r\n l, r = map(int, input().split(' '))\r\n seg = Segment(l, r)\r\n a.append(seg)\r\n if l < min:\r\n min = l\r\n if r > max:\r\n max = r\r\nid = -1\r\nfor i in range(n):\r\n if (a[i].left == min) and (a[i].right == max):\r\n id = i + 1\r\nprint(id)\r\n", "n = int(input())\nsegments = []\nlowers = []\nuppers = []\nfor i in range(n):\n segments.append(list(map(int, input().split())))\n lowers.append(segments[i][0])\n uppers.append(segments[i][1])\n\nminimum = min(lowers)\nmaximum = max(uppers)\n\nresult = -1\nfor i in range(n):\n if segments[i][0] <= minimum and segments[i][1] >= maximum:\n result = i + 1\n\nprint(result)", "n = int(input())\r\nl = []\r\nr = []\r\nk = []\r\nfor i in range(n):\r\n a,b = (map(int,input().split()))\r\n l.append(a)\r\n r.append(b)\r\n k.append([a,b])\r\n \r\nif [min(l),max(r)] in k:\r\n print(k.index([min(l),max(r)])+1)\r\nelse:\r\n print('-1')", "n = int(input())\r\nlst = []\r\nmax_lenght = -1\r\nindex = 0\r\ncount = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n lst.append(a)\r\n if(max_lenght < a[1] - a[0]):\r\n max_lenght = a[1] - a[0]\r\n index = i\r\nl = len(lst)\r\ncur = lst.pop(index)\r\nfor j in range(len(lst)):\r\n if(cur[0] <= lst[j][0] and lst[j][0] <= lst[j][1] and lst[j][1] <= cur[1]):\r\n count+=1\r\nif(count == l-1):\r\n print(index+1)\r\nelse:\r\n print(-1)\r\n\r\n", "d = [tuple(map(int,input().split())) for _ in range(int(input()))]\r\nx = min(i[0] for i in d)\r\ny = max(i[1] for i in d)\r\nprint(d.index((x,y))+1 if (x,y) in d else \"-1\")", "\"\"\"\r\n author - Sayan Bose\r\n date - 29.01.2020\r\n Brooklyn 99 is love!\r\n\"\"\"\r\n\r\nn = int(input())\r\nli = []\r\nl, r = 1e9, 0\r\nfor i in range(n):\r\n\ta, b = map(int, input().split())\r\n\tl, r = min(l, a), max(r, b)\r\n\tli.append([a, b])\r\nres = 0\r\nfor i in range(n):\r\n\tif li[i][0] <= l and li[i][1] >= r:\r\n\t\tres = i+1\r\nprint(res) if res else print(-1)\r\n", "n=int(input())\r\ns=[[*map(int,input().split())] for _ in ' '*n]\r\ns_=list(zip(*s))\r\nx=min(s_[0])\r\ny=max(s_[1])\r\nif [x,y] in s:\r\n print(s.index([x,y])+1)\r\nelse:\r\n print(-1)", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left\r\nfrom bisect import bisect_right\r\n \r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n \r\ndef In():\r\n return map(int, stdin.readline().split())\r\n \r\ndef I():\r\n return int(stdin.readline())\r\n\r\nP = 1000000007\r\nn = I()\r\narr = []\r\nmn, mx = P, 0\r\nfor i in range(n):\r\n x, y = In()\r\n arr.append((x,y))\r\n mn = min(mn, x)\r\n mx = max(mx, y)\r\nif (mn, mx) in arr:\r\n print(arr.index((mn, mx))+1) \r\nelse:\r\n print(-1)\r\n ", "\r\nn = int(input())\r\nleft = [None]*n\r\nright = [None]*n\r\n\r\nfor i in range(n):\r\n left[i], right[i] = map(int, input().split())\r\n\r\nanswer = -1\r\n\r\nminL = 10**9 + 1\r\nfor i in range(n):\r\n if (left[i] < minL):\r\n minL = left[i]\r\n \r\nmaxR = 0\r\nfor i in range(n):\r\n if (right[i] > maxR):\r\n maxR = right[i]\r\n \r\n\r\n\r\nfor i in range(n):\r\n if (left[i] == minL and right[i] == maxR):\r\n answer = i + 1\r\n \r\nprint(answer)", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n tempA, tempB = map(int, input().split())\r\n a.append(tempA)\r\n b.append(tempB)\r\n\r\nmin = a[0]\r\nmax = b[0]\r\n\r\nfor i in range(n):\r\n if (a[i] < min):\r\n min = a[i]\r\n if (b[i] > max):\r\n max = b[i]\r\n\r\nres = -1\r\nfor i in range(n):\r\n if (a[i] == min and b[i] == max):\r\n res = i + 1\r\n break\r\n\r\nprint(res)", "import heapq\n\nn = int(input())\nleft_vals = []\nright_vals = []\n\nsegments = []\n\nif n == 1:\n print(1)\nelse:\n for _ in range(n):\n left, right = map(int, input().split())\n left_vals.append(left)\n right_vals.append(-1*right)\n segments.append([left, right])\n\n heapq.heapify(left_vals)\n heapq.heapify(right_vals)\n\n smallest = heapq.heappop(left_vals)\n greatest = heapq.heappop(right_vals)*-1\n\n sol_flag = -2\n for i, seg in enumerate(segments):\n if seg[0] <= smallest and seg[1] >= greatest:\n sol_flag = i\n break\n\n print(sol_flag+1)\n" ]

[ "import heapq\r\nclass Node:\r\n\r\n def __init__(self,idx,freq,val) -> None:\r\n self.value=val \r\n self.index=idx \r\n self.occ=freq \r\n self.front=None \r\n self.back=None \r\nclass LinkedList:\r\n\r\n def __init__(self) -> None:\r\n self.head=None\r\n self.h=[]\r\n self.seen=[False]*200001\r\n heapq.heapify(self.h) \r\n self.ans=0\r\n self.len=0\r\n def insert(self,node) -> None:\r\n \r\n if self.head==None:\r\n self.head=node \r\n else:\r\n h=self.head \r\n node.back=h \r\n h.front=node \r\n self.head=node \r\n node.front=None \r\n self.len+=1 \r\n heapq.heappush(self.h,(-1*node.occ,node.index,node)) \r\n def merge(self,l,r): \r\n ll=l.back \r\n rr=r.front \r\n \r\n new_node=Node(min(r.index,l.index),l.occ+r.occ,l.value) \r\n new_node.front=rr \r\n new_node.back=ll \r\n self.seen[max(l.index,r.index)]=True \r\n if (rr!=None):\r\n rr.back=new_node \r\n \r\n if (ll!=None):\r\n ll.front=new_node\r\n heapq.heappush(self.h,(-1*new_node.occ,new_node.index,new_node)) \r\n return \r\n def remove(self,node):\r\n self.len-=1 \r\n if (self.head==node and self.len==0):\r\n self.head=None \r\n\r\n return \r\n l=node.back\r\n r=node.front \r\n if (l!=None):\r\n l.front=r \r\n if r!=None:\r\n r.back=l \r\n\r\n if (l!=None and r!=None and l.value==r.value):\r\n\r\n self.merge(l,r) \r\n def next_val(self):\r\n if len(self.h)==0:\r\n return -1\r\n f,idx,node=heapq.heappop(self.h) \r\n if (not self.seen[idx]):\r\n \r\n self.seen[idx]=True \r\n self.remove(node)\r\n self.ans+=1 \r\n return 1\r\ndef main(n,arr):\r\n\r\n nodes=[]\r\n val=arr[0] \r\n idx=0 \r\n freq=1 \r\n for i in range(1,len(arr)):\r\n if (arr[i]!=arr[i-1]):\r\n node=Node(idx,freq,val) \r\n nodes.append(node) \r\n val=arr[i] \r\n idx+=1 \r\n freq=1 \r\n \r\n else:\r\n freq+=1 \r\n \r\n node=Node(idx,freq,val) \r\n nodes.append(node) \r\n l=LinkedList()\r\n for i in range(len(nodes)-1,-1,-1):\r\n l.insert(nodes[i])\r\n s=l.next_val() \r\n while (s!=-1):\r\n s=l.next_val() \r\n return l.ans \r\nn=int(input()) \r\narr=list(map(int,input().split())) \r\nprint(main(n,arr))\r\n\r\n\r\n\r\n\r\n\r\n\r\n " ]

[ "MX = 1030\r\nM = 1000 * 1000 * 1000 + 7\r\nc = [[0] * MX for i in range(MX)]\r\nfor i in range(MX):\r\n c[i][0] = 1\r\nfor i in range(1, MX):\r\n for j in range(1, MX):\r\n c[i][j] = c[i - 1][j] + c[i - 1][j - 1]\r\n c[i][j] %= M\r\n \r\nnum = list(map(int, list(input())))\r\ncnt = int(input())\r\ndp = [0] * MX\r\nfor i in range(2, MX):\r\n dp[i] = dp[bin(i).count('1')] + 1\r\n \r\nif cnt == 0:\r\n print(1)\r\n exit()\r\n \r\nres = 0\r\n \r\nfor i in range(1, MX):\r\n if dp[i] != cnt - 1: continue\r\n n = len(num) - 1\r\n k = i\r\n for pos in range(len(num)):\r\n if num[pos] == 1:\r\n # print(n, k)\r\n #if we put 0 here\r\n res += c[n][k]\r\n res %= M\r\n k -= 1\r\n n -= 1 \r\n # print(k) \r\n if n == -1 and k == 0:\r\n res += 1\r\nif cnt == 1: res -= 1\r\nprint(res)", "'''\r\njitne bhi binary mai 2 ki power ones hai unhe lagega 2 ;\r\nnow i fill a dp table\r\n'''\r\nglobal fact,inv_fact\r\ndef make_nCr_mod(max_n=2 * 10**5, mod=10**9 + 7):\r\n\tglobal fact, inv_fact\r\n\r\n\r\n\tmax_n = min(max_n, mod - 1)\r\n\r\n\tfact, inv_fact = [0] * (max_n + 1), [0] * (max_n + 1)\r\n\tfact[0] = 1\r\n\tfor i in range(max_n):\r\n\t\tfact[i + 1] = fact[i] * (i + 1) % mod\r\n\r\n\tinv_fact[-1] = pow(fact[-1], mod - 2, mod)\r\n\tfor i in reversed(range(max_n)):\r\n\t\tinv_fact[i] = inv_fact[i + 1] * (i + 1) % mod\r\n\r\n\r\nmake_nCr_mod()\r\ndef comb(n, r):\r\n\tmod=10**9+7\r\n\tglobal fact,inv_fact\r\n\tres = 1\r\n\twhile n or r:\r\n\t\ta, b = n % mod, r % mod\r\n\t\tif a < b:\r\n\t\t\treturn 0\r\n\t\tres = res * fact[a] % mod * inv_fact[b] % mod * inv_fact[a - b] % mod\r\n\t\tn //= mod\r\n\t\tr //= mod\r\n\treturn res\r\ndef f():\r\n\tdp=[0]*(1000+100)\r\n\tdp[1]=1\r\n\r\n\tfor i in range(2,len(dp)):\r\n\t\to=bin(i).count(\"1\")\r\n\t\tif o==1:\r\n\t\t\tdp[i]=2\r\n\t\telse:\r\n\t\t\tdp[i]+=dp[o]+1\r\n\treturn dp\r\n\r\ndef bit(s,k):\r\n\tdp=f()\r\n\tl=[]\r\n\tans=0\r\n\tll=len(s)\r\n\tans=0\r\n\tones=0\r\n\tif k==0:\r\n\t\treturn 1\r\n\tfor i in range(ll):\r\n\t\tif s[i]==\"0\":\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tfor j in range(max(ones,1),1000):\r\n\t\t\t\tif dp[j]==k:\r\n\t\t\t\t\tans=(ans+comb(ll-i-1,j-ones))%(10**9+7)\r\n\t\t\t\t\tif i==0 and k==1:\r\n\t\t\t\t\t\tans-=1\r\n\t\tones+=1\r\n\tif dp[ones]==k:\r\n\t\tans+=1\r\n\treturn (ans)%(10**9+7)\r\n\r\n\r\n\r\ns=input().strip()\r\nk=int(input())\r\nprint(bit(s,k))", "s0=input()\r\nk=int(input())\r\ns1=s0[::-1]\r\nlens1=len(s1)\r\nmaxnum=1005\r\nmod=1000000007\r\ndp=[[0]*maxnum for tmpi in range(maxnum)]\r\nf=[0]*maxnum\r\nc=[[0]*maxnum for tmpi in range(maxnum)]\r\n\r\ndef cntone(num):\r\n tmps=bin(num)[2:]\r\n cnt=0\r\n for i in range(len(tmps)):\r\n if(tmps[i]=='1'):\r\n cnt+=1\r\n return cnt\r\n\r\nfor i in range(1,maxnum):\r\n if(i==1):\r\n f[i]=0\r\n else:\r\n f[i]=f[cntone(i)]+1\r\n\r\nfor i in range(maxnum):\r\n if(i==0):\r\n c[i][0]=1\r\n continue\r\n for j in range(i+1):\r\n if(j==0):\r\n c[i][j]=1\r\n else:\r\n c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod\r\n\r\nfor i in range(lens1):\r\n if(i==0):\r\n dp[i][0] = 1\r\n if(s1[i]=='1'):\r\n dp[i][1]=1\r\n else:\r\n dp[i][1]=0\r\n continue\r\n else:\r\n for j in range(0,i+2):\r\n if(j==0):\r\n dp[i][j]=1\r\n continue\r\n if(s1[i]=='1'):\r\n dp[i][j]=(dp[i-1][j-1]+c[i][j])%mod\r\n else:\r\n dp[i][j]=dp[i-1][j]%mod\r\n\r\nans=0\r\n\r\nfor i in range(1,lens1+1):\r\n if(f[i]==k-1):\r\n ans=(ans+dp[lens1-1][i])%mod\r\n\r\nif(k==0):\r\n ans=1\r\nelif(k==1):\r\n ans-=1\r\nelse:\r\n ans=ans\r\nprint(ans)", "R = lambda: map(int, input().split())\r\nmod = 10 ** 9 + 7\r\nmaxn = 1001\r\nc = [[0 for j in range(maxn)] for i in range(maxn)]\r\nfor i in range(maxn):\r\n c[i][0] = 1\r\nfor i in range(1, maxn):\r\n for j in range(i + 1):\r\n c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod\r\narr = list(map(int, input()))\r\nk = int(input())\r\nif k == 0:\r\n print(1 if arr.count(1) else 0)\r\n exit(0)\r\nops = [0] * (maxn + 1)\r\nans = 0\r\nfor i in range(2, maxn):\r\n cnt = bin(i).count('1')\r\n ops[i] = ops[cnt] + 1\r\nfor i in range(1, maxn):\r\n if ops[i] == k - 1:\r\n oc = i\r\n for j, x in enumerate(arr):\r\n if x and oc >= 0:\r\n ans = (ans + c[len(arr) - j - 1][oc]) % mod\r\n oc -= 1\r\n ans = (ans + 1) % mod if arr.count(1) == i else ans\r\nif k == 1:\r\n ans = (ans + mod - 1) % mod\r\nprint(ans)", "'''\r\njitne bhi binary mai 2 ki power ones hai unhe lagega 2 ;\r\nnow i fill a dp table\r\n'''\r\n\r\n\r\ndef make_nCr_mod(max_n=2 * 10 ** 5, mod=10 ** 9 + 7):\r\n\tmax_n = min(max_n, mod - 1)\r\n\r\n\tfact, inv_fact = [0] * (max_n + 1), [0] * (max_n + 1)\r\n\tfact[0] = 1\r\n\tfor i in range(max_n):\r\n\t\tfact[i + 1] = fact[i] * (i + 1) % mod\r\n\r\n\tinv_fact[-1] = pow(fact[-1], mod - 2, mod)\r\n\tfor i in reversed(range(max_n)):\r\n\t\tinv_fact[i] = inv_fact[i + 1] * (i + 1) % mod\r\n\r\n\tdef nCr_mod(n, r):\r\n\t\tres = 1\r\n\t\twhile n or r:\r\n\t\t\ta, b = n % mod, r % mod\r\n\t\t\tif a < b:\r\n\t\t\t\treturn 0\r\n\t\t\tres = res * fact[a] % mod * inv_fact[b] % mod * inv_fact[a - b] % mod\r\n\t\t\tn //= mod\r\n\t\t\tr //= mod\r\n\t\treturn res\r\n\r\n\treturn nCr_mod\r\n\r\n\r\ndef f():\r\n\tdp = [0] * (1000 + 100)\r\n\tdp[1] = 1\r\n\r\n\tfor i in range(2, len(dp)):\r\n\t\to = bin(i).count(\"1\")\r\n\t\tif o == 1:\r\n\t\t\tdp[i] = 2\r\n\t\telse:\r\n\t\t\tdp[i] += dp[o] + 1\r\n\treturn dp\r\n\r\n\r\ndef bit(s, k):\r\n\tdp = f()\r\n\tl = []\r\n\tcomb=make_nCr_mod()\r\n\tans = 0\r\n\tll = len(s)\r\n\tans = 0\r\n\tones = 0\r\n\tif k == 0:\r\n\t\treturn 1\r\n\tfor i in range(ll):\r\n\t\tif s[i] == \"0\":\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tfor j in range(max(ones, 1), 1000):\r\n\t\t\t\tif dp[j] == k:\r\n\t\t\t\t\tans = (ans + comb(ll - i - 1, j - ones)) % (10 ** 9 + 7)\r\n\t\t\t\t\tif i == 0 and k == 1:\r\n\t\t\t\t\t\tans -= 1\r\n\t\tones += 1\r\n\tif dp[ones] == k:\r\n\t\tans += 1\r\n\treturn (ans) % (10 ** 9 + 7)\r\n\r\n\r\ns = input().strip()\r\nk = int(input())\r\nprint(bit(s, k))\r\n" ]

[ "from heapq import *\r\nfrom queue import *\r\nimport sys, math, bisect\r\nfrom collections import Counter, defaultdict\r\nfrom math import *\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n# print = sys.stdout.write\r\ninl = lambda: list(map(int, input().split()))\r\nintp = lambda: tuple(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n ans1 = [1] * (n // 2) + [0] * (n - (n // 2))\r\n ans2 = [1] * (n // 2) + [0] * (n - (n // 2))\r\n\r\n total = []\r\n user_input = []\r\n for _ in range(n):\r\n a, b = inl()\r\n user_input.append((a, b))\r\n total.extend([a, b])\r\n\r\n total.sort()\r\n\r\n d = {}\r\n for num, order in zip(total, range(len(total))):\r\n d[num] = order\r\n\r\n for i in range(n // 2, n):\r\n if d[user_input[i][0]] < n:\r\n ans1[i] = 1\r\n if d[user_input[i][1]] < n:\r\n ans2[i] = 1\r\n\r\n print(\"\".join(map(str, ans1)))\r\n print(\"\".join(map(str, ans2)))\r\n\r\n\r\nfor _ in range(int(1)):\r\n solve()\r\n", "n = int(input())\r\na = list(tuple(map(int,input().split())) for i in range(n))\r\nm = n // 2\r\nc = list('1' for i in range(m))\r\nd = list('1' for i in range(m))\r\nfor i in range(m,n):\r\n if a[i][0] < a[n-i-1][1]:\r\n c.append('1')\r\n else:\r\n c.append('0')\r\n if a[n-i-1][0] > a[i][1]:\r\n d.append('1')\r\n else:\r\n d.append('0')\r\nprint(''.join(c))\r\nprint(''.join(d))", "import collections\r\nimport functools\r\nimport math\r\nimport sys\r\nimport bisect\r\n\r\n\r\ndef In():\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef semifinal():\r\n n = int(input())\r\n l = [list(In()) for _ in range(n)]\r\n fir = ['0'] * n\r\n sec = ['0'] * n\r\n pos, lpos = 0, 0\r\n k = n\r\n while pos < n and lpos < n and k:\r\n if l[pos][0] > l[lpos][1]:\r\n sec[lpos] = '1'\r\n lpos += 1\r\n else:\r\n fir[pos] = '1'\r\n pos += 1\r\n k -= 1\r\n while k:\r\n while pos < n and k:\r\n fir[pos] = '1'\r\n pos += 1\r\n k -= 1\r\n while lpos < n and k:\r\n sec[lpos] = '1'\r\n lpos += 1\r\n k -= 1\r\n for i in range(n // 2):\r\n fir[i] = sec[i] = '1'\r\n print(*fir, sep='')\r\n print(*sec, sep='')\r\n\r\n\r\nsemifinal()\r\n", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\n\r\nk = 0\r\nchecka = [0]*(n + 1)\r\ncheckb = [0]*(n + 1)\r\n\r\ncount = 0\r\ni = 0\r\nj = 0\r\nwhile count < n - 2 * k:\r\n if a[i] < b[j]:\r\n checka[i] = 1\r\n i += 1\r\n else:\r\n checkb[j] = 1\r\n j += 1\r\n count += 1\r\n\r\nwhile 2*k <= n:\r\n if k - 1 >= 0:\r\n checka[k - 1] = 1\r\n checkb[k - 1] = 1\r\n k += 1\r\n\r\nfor i in range(n):\r\n print(checka[i], end=\"\")\r\nprint()\r\nfor i in range(n):\r\n print(checkb[i], end=\"\")", "i=int(input())\r\n\r\nat=[];bt=[]\r\nfor x in range(i):\r\n a,b=map(int,input().split())\r\n at.append([a,1])\r\n bt.append([b,2])\r\nal=bl=0\r\nfor x in range(i):\r\n if at[al]<bt[bl]: al+=1\r\n else: bl+=1\r\n\r\nal=max(i//2,al);bl=max(bl,i//2)\r\nprint('1'*al+'0'*(i-al))\r\nprint('1'*bl+'0'*(i-bl))", "s1 = []\r\ns2 = []\r\nn = int(input())\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n s1.append(a)\r\n s2.append(b)\r\n\r\nk = n//2\r\nans1 = ['0'] * n\r\nans2 = ['0'] * n\r\n\r\nj = 0\r\ni = 0\r\nwhile i + j < n:\r\n if s1[i] < s2[j]:\r\n ans1[i] = '1'\r\n i+=1\r\n else:\r\n ans2[j] = '1'\r\n j+=1\r\n\r\ni = 0\r\nwhile i < k:\r\n ans1[i] = '1'\r\n ans2[i] = '1'\r\n i+=1\r\n\r\nans1 = ''.join(ans1)\r\nans2 = ''.join(ans2)\r\n\r\nprint(ans1)\r\nprint(ans2)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = []\r\nx = [1]*(n//2) + [0]*(n-n//2)\r\ny = [1]*(n//2) + [0]*(n-n//2)\r\ns = {1:x, 2:y}\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n d.append((a, 1, i))\r\n d.append((b, 2, i))\r\nd.sort()\r\nfor i in d[:n]:\r\n if s[i[1]][i[2]] != 1:\r\n s[i[1]][i[2]] = 1\r\n\r\nprint(''.join(map(str, x)))\r\nprint(''.join(map(str, y)))", "n=int(input())\r\nl=[]\r\nleft=int(1e9)\r\nright=int(1e9)\r\n\r\ns1=[0 for i in range(n)]\r\ns2=[0 for i in range(n)]\r\nsi1=0\r\nsi2=0\r\n\r\nl1=[]\r\nl2=[]\r\n\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n \r\n l1.append(a)\r\n l2.append(b)\r\n \r\n\r\ncnt=n\r\nf1=0\r\nf2=0\r\nwhile(cnt>0):\r\n if(l1[si1]<=l2[si2]):\r\n s1[si1]='1'\r\n si1+=1\r\n f1+=1\r\n else:\r\n s2[si2]='1'\r\n si2+=1\r\n f2+=1\r\n \r\n cnt-=1\r\n \r\n \r\nk=n//2\r\nfor i in range(f1,k):\r\n s1[si1]='1'\r\n si1+=1\r\n \r\nfor i in range(f2,k):\r\n s2[si2]='1'\r\n si2+=1\r\n \r\nfor i in s1:\r\n print(i,end=\"\")\r\nprint()\r\nfor i in s2:\r\n print(i,end=\"\")\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nscoreA, scoreB = [], []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n scoreA.append(x)\r\n scoreB.append(y)\r\n\r\nans1 = '1' * (n//2)\r\nans2 = '1' * (n//2)\r\n\r\nfor i in range(n//2, n):\r\n if scoreA[i] < scoreB[n-i-1]:\r\n ans1 += '1'\r\n elif scoreB[i] < scoreA[n-i-1]:\r\n ans2 += '1'\r\n\r\nans1 += '0' * (n-len(ans1))\r\nans2 += '0' * (n-len(ans2))\r\n\r\nprint(ans1)\r\nprint(ans2)", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n results = []\r\n for i in range(n):\r\n a, b = read_tuple(int)\r\n results.append((0, i, a))\r\n results.append((1, i, b))\r\n results.sort(key=lambda x: x[2])\r\n passed1 = [0 for _ in range(n)]\r\n passed2 = [0 for _ in range(n)]\r\n # k == 0\r\n for hf, i, _ in results[:n]:\r\n if hf == 0:\r\n passed1[i] = 1\r\n elif hf == 1:\r\n passed2[i] = 1\r\n # k == n // 2\r\n hf1, hf2 = n // 2, n // 2\r\n for hf, i, _ in results:\r\n if hf1 and hf == 0:\r\n passed1[i] = 1\r\n hf1 -= 1\r\n elif hf2 and hf == 1:\r\n passed2[i] = 1\r\n hf2 -= 1\r\n print(''.join(map(str, passed1)))\r\n print(''.join(map(str, passed2)))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "from sys import stdin ,stdout\r\nfrom os import path\r\nrd = lambda:stdin.readline().strip()\r\nwr = stdout.write\r\nif(path.exists('input.txt')):\r\n stdin = open(\"input.txt\",\"r\")\r\nimport time \r\n#------------------------------------\r\nx = int(rd())\r\na,b = [],[]\r\nfor _ in range(x):\r\n\ta1,b1 = map(int,rd().split())\r\n\ta.append(a1)\r\n\tb.append(b1)\r\ni = j = 0 \r\nwhile i+j < x:\r\n\tif a[i] < b[j]:\r\n\t\ti+=1\r\n\telse:\r\n\t\tj+=1\r\ni = max(x//2,i)\r\nj = max(x//2,j)\r\nprint(\"1\"*i + \"0\"*(x-i))\r\nprint(\"1\"*j + \"0\"*(x-j))\t", "import sys\r\n\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n n = int(read())\r\n first: list[int] = []\r\n second: list[int] = []\r\n\r\n for _ in range(n):\r\n l, r = (int(i) for i in read().split())\r\n first.append(l)\r\n second.append(r)\r\n\r\n first_winners: list[str] = ['0'] * n\r\n second_winners: list[str] = ['0'] * n\r\n\r\n # First handle k == 0 case\r\n i = j = 0\r\n found = 0\r\n while True:\r\n curr_first_round = first[i]\r\n curr_second_round = second[j]\r\n if curr_first_round < curr_second_round:\r\n first_winners[i] = '1'\r\n i += 1\r\n else:\r\n second_winners[j] = '1'\r\n j += 1\r\n found += 1\r\n if found == n:\r\n break\r\n # Handle case where k == n // 2\r\n k = n // 2\r\n for i in range(k):\r\n first_winners[i] = '1'\r\n second_winners[i] = '1'\r\n\r\n print(''.join(first_winners))\r\n print(''.join(second_winners))\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\n\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n f,s=(map(int,input().split(' ')))\r\n a.append(f)\r\n b.append(s)\r\n\r\n\r\nans=[0]*n\r\nansk = [n * [0], n * [0]]\r\n\r\nfor k in range((n//2)+1):\r\n if k!=0:\r\n ansk[0][k-1]=1\r\n ansk[1][k-1]=1\r\np1=0\r\np2=0\r\ncount=n-2*0\r\nfor j in range(count):\r\n if a[p1]>b[p2]:\r\n ansk[1][p2]=1\r\n p2+=1\r\n else:\r\n ansk[0][p1]=1\r\n p1+=1\r\n\r\nfor i in range(len(ansk[0])):\r\n print(ansk[0][i],end='')\r\nprint()\r\nfor i in range(len(ansk[1])):\r\n print(ansk[1][i],end='')\r\n\r\n\r\n\r\n'''\r\n6\r\n1 2\r\n4 13\r\n6 15\r\n7 18\r\n9 20\r\n12 21\r\n'''", "n = int(input())\na1 = []\na2 = []\n\nfor _ in range(n):\n x, y = map(int, input().split())\n a1.append(x)\n a2.append(y)\n\nans1 = ['0'] * n\nans2 = ['0'] * n\n\nfor i in range(n//2):\n ans1[i] = '1'\n ans2[i] = '1'\n\ni, j = 0, 0\nwhile n > 0:\n # print(n, i, j)\n if a1[i] < a2[j]:\n ans1[i] = '1'\n i += 1\n else:\n ans2[j] = '1'\n j += 1\n n -= 1\n\nprint(''.join(ans1))\nprint(''.join(ans2))\n\n\n", "from math import gcd\r\nimport sys\r\ndef inp(): return sys.stdin.readline().strip()\r\nt=1\r\nfor _ in range(t):\r\n n =int(inp())\r\n time=[]\r\n timea=[]\r\n timeb=[]\r\n for i in range(n):\r\n a,b=map(int,inp().split())\r\n timea.append(a)\r\n timeb.append(b)\r\n chance1=['0']*n\r\n chance2=['0']*n\r\n ia=0\r\n ib=0\r\n for i in range(n):\r\n if(timea[ia]<timeb[ib]):\r\n chance1[ia]='1'\r\n ia=ia+1\r\n else:\r\n chance2[ib]='1'\r\n ib=ib+1\r\n for i in range(n//2):\r\n chance1[i]='1'\r\n chance2[i]='1'\r\n print(''.join(chance1))\r\n print(''.join(chance2))\r\n ", "n = int(input())\r\na = [None] * n\r\nb = [None] * n\r\nfor i in range(n):\r\n a[i], b[i] = map(int, input().split())\r\n \r\nfor i in range(n):\r\n if i < n // 2 or a[i] < b[n - i - 1]:\r\n print(1, end = \"\")\r\n else:\r\n print(0, end = \"\")\r\n \r\nprint()\r\n \r\nfor i in range(n):\r\n if i < n // 2 or b[i] < a[n - i - 1]:\r\n print(1, end = \"\")\r\n else:\r\n print(0, end = \"\")", "n = int(input())\r\na = []\r\nb = []\r\nresA = [0] * n\r\nresB = [0] * n\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\n\r\ni, j = 0, 0\r\nfor k in range(n):\r\n if a[i] < b[j]:\r\n resA[i] = 1\r\n i += 1\r\n else:\r\n resB[j] = 1\r\n j += 1\r\n\r\nfor i in range(0, n//2):\r\n resA[i] = 1\r\n resB[i] = 1\r\n\r\nfor i in resA:\r\n print(i, end='')\r\nprint()\r\nfor i in resB:\r\n print(i, end='')", "n = int(input())\r\n \r\nteam1 = [0 for i in range(n+7)]\r\nteam2 = [0 for i in range(n+7)]\r\nfor i in range(1, n+1):\r\n line = input().split()\r\n team1[i] = int(line[0])\r\n team2[i] = int(line[1])\r\n \r\nfor i in range(1, n+1):\r\n if i <= n // 2 or team1[i] < team2[n-i+1]:\r\n print(1, end = '')\r\n else:\r\n print(0, end = '')\r\nprint()\r\n \r\nfor i in range(1, n+1):\r\n if i <= n // 2 or team2[i] < team1[n-i+1]:\r\n print(1, end = '')\r\n else:\r\n print(0, end = '')\r\nprint()", "n=int(input())\r\na=[None]*n\r\nb=[None]*n\r\nfor i in range(n):\r\n a[i],b[i]=map(int,input().split())\r\nfor i in range(n):\r\n if(i<n//2 or a[i]<b[n-i-1]):\r\n print(1,end=\"\")\r\n else:\r\n print(0,end=\"\")\r\nprint()\r\nfor i in range(n):\r\n if(i<n//2 or b[i]<a[n-i-1]):\r\n print(1,end=\"\")\r\n else:\r\n print(0,end=\"\")\r\n \r\n\r\n\r\n", "from sys import stdin,stdout\r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn=int(input()) ; points=dict() ; ans1=[\"0\"]*n ; ans2=[\"0\"]*n\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n points[a]=1 ; points[b]=2\r\n\r\narr=list(points.keys()) ; arr.sort() \r\nfor i in range(n//2):\r\n ans1[i]=\"1\"\r\n ans2[i]=\"1\"\r\na=b=0\r\nfor i in range(n):\r\n if points[arr[i]]==1:\r\n ans1[a]=\"1\"\r\n a+=1\r\n else:\r\n ans2[b]=\"1\"\r\n b+=1\r\nprint(\"\".join(ans1))\r\nprint(\"\".join(ans2))\r\n\r\n", "def arr_2d(n):\r\n return [[int(x) for x in stdin.readline().split()] for i in range(n)]\r\n\r\n\r\ndef get_col(arr, i):\r\n return [row[i] for row in arr]\r\n\r\n\r\nfrom sys import stdin\r\nfrom collections import defaultdict\r\n\r\nn, ans1, ans2, mem = int(input()), [], [], defaultdict(int)\r\na, all = arr_2d(n), []\r\n\r\nfor i in range(n):\r\n mem[a[i][0]], mem[a[i][1]] = 1, 2\r\n all.extend([a[i][0], a[i][1]])\r\n\r\nall.sort()\r\n\r\nfor i in range(n):\r\n if mem[all[i]] == 1:\r\n ans1.append('1')\r\n else:\r\n ans2.append('1')\r\n\r\nif len(ans1) < n // 2:\r\n ans1.extend(['1' for i in range(n // 2 - len(ans1))])\r\nif len(ans2) < n // 2:\r\n ans2.extend(['1' for i in range(n // 2 - len(ans2))])\r\n\r\nans2.extend(['0' for i in range(n - len(ans2))])\r\nans1.extend(['0' for i in range(n - len(ans1))])\r\nprint(''.join(ans1), ''.join(ans2), sep='\\n')\r\n", "n = int(input())\r\na, b = zip(*(map(int, input().split()) for _ in range(n)))\r\n\r\ni = j = 0\r\nwhile i < n and j < n and i + j < n:\r\n if a[i] < b[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\n\r\ndef p(x): return (\"1\" * max(n // 2, x)).ljust(n, \"0\")\r\n\r\n\r\nprint(p(i))\r\nprint(p(j))\r\n", "# Author : Mohamed Yousef \r\n# Date : 2023-05-04\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\nt = test()\r\narr1 = []\r\narr2 = []\r\nall = []\r\nfor _ in range(t):\r\n a,b=mvalues()\r\n arr1.append(a)\r\n arr2.append(b)\r\np1 = 0\r\np2 = 0\r\nfor _ in range(2*t):\r\n if p1 < t and p2 < t :\r\n if arr1[p1] > arr2[p2]:\r\n all.append(arr2[p2])\r\n p2 += 1\r\n else:\r\n all.append(arr1[p1])\r\n p1 += 1\r\nif p1 < t:\r\n all.extend(arr1[p1:])\r\nif p2 < t:\r\n all.extend(arr2[p2:])\r\n\r\n# print(all)\r\n# print(arr1)\r\n# print(arr2)\r\n\r\nnow = all[:t]\r\n# arr3 = set(arr1)\r\n# arr4 = set(arr2)\r\n\r\ns1 = \"\"\r\ns2 = \"\"\r\nn1 = 0\r\nn2 = 0\r\nfor i in now:\r\n f1 = bisect.bisect_left(arr1,i)\r\n f2 = bisect.bisect_left(arr2,i)\r\n # print(f1, f2)\r\n if f1 != t and arr1[f1] == i:\r\n s1 += \"1\"\r\n n1 += 1\r\n if f2 != t and arr2[f2] == i:\r\n s2 += \"1\"\r\n n2 += 1\r\nn11 = n1\r\nn22 = n2\r\n# print(s1,s2)\r\nfor i in range(t//2):\r\n if i >= n1:\r\n s1 += \"1\"\r\n n11 += 1\r\n if i >= n2:\r\n s2 += \"1\"\r\n n22 += 1\r\n\r\nif n11 < t:\r\n s1 += \"0\" * (t - n11)\r\nif n22 < t:\r\n s2 += \"0\" * (t - n22)\r\n\r\nprint(s1)\r\nprint(s2)", "from sys import stdin,stdout\r\na=int(stdin.readline())\r\nz=[[1]*(a//2)+[0]*(a-a//2)+['\\n'],[1]*(a//2)+[0]*(a-a//2)]\r\nk=[]\r\nfor i in range(a):u,v=map(int,stdin.readline().split());k+=[[u,0,i],[v,1,i]]\r\nk.sort()\r\nfor i in k[:a]:z[i[1]][i[2]]=1\r\nfor i in z:stdout.write(''.join(map(str,i)))", "n=int(input())\r\nsemi1,semi2=[0]*n,[0]*n\r\nfor i in range(n):\r\n semi1[i],semi2[i]=map(int,input().split())\r\nchances1,chances2=[0]*n,[0]*n\r\npointer1,pointer2=0,0\r\nfor i in range(n):\r\n if semi1[pointer1]<semi2[pointer2]:\r\n chances1[pointer1]=1\r\n pointer1+=1\r\n elif semi1[pointer1]>semi2[pointer2]:\r\n chances2[pointer2]=1\r\n pointer2+=1\r\n else:\r\n chances1[pointer1]=1\r\n pointer1+=1\r\n chances2[pointer2] = 1\r\n pointer2 += 1\r\nfor i in range(int(n/2)):\r\n chances1[i]=1\r\n chances2[i]=1\r\nprint(\"\".join(map(str,chances1)))\r\nprint(\"\".join(map(str,chances2)))\r\n", "n=int(input())\r\nk=int(n/2)\r\ns1=\"1\"*(int(n/2)) + \"0\"*(n-int(n/2))\r\ns2=\"1\"*(int(n/2)) + \"0\"*(n-int(n/2))\r\ns1=list(s1)\r\ns2=list(s2)\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n c,d=input().split()\r\n a.append(int(c))\r\n b.append(int(d))\r\nfor i in range(k,n):\r\n if(a[i]<b[n-i-1]):\r\n s1[i]=\"1\"\r\n if(b[i]<a[n-i-1]):\r\n s2[i]=\"1\"\r\nprint(''.join(s1))\r\nprint(''.join(s2))", "# import math\nfrom collections import Counter, deque, defaultdict\n# from math import *\n\nfrom bisect import bisect_right\n\nMOD = 1000000007\n\n\n# from functools import reduce\n# from itertools import permutations\n# import queue\n\n\ndef solve():\n n = int(input())\n\n team1 = [0 for i in range(n + 1)]\n team2 = [0 for i in range(n + 1)]\n for i in range(1, n + 1):\n line = input().split()\n team1[i] = int(line[0])\n team2[i] = int(line[1])\n\n for i in range(1, n + 1):\n if i <= n // 2 or team1[i] < team2[n - i + 1]:\n print(1, end='')\n else:\n print(0, end='')\n print()\n\n for i in range(1, n + 1):\n if i <= n // 2 or team2[i] < team1[n - i + 1]:\n print(1, end='')\n else:\n print(0, end='')\n print()\n\n\n# t = int(input())\nt = 1\nfor num in range(t):\n # print(\"Case #{}: \".format(num + 1), end=\"\")\n solve()\n\n\t \t \t \t \t\t \t\t\t \t \t\t\t\t \t\t\t", "from os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n a = []\r\n b = []\r\n for i in range(n):\r\n nums = [int(num) for num in input().split()]\r\n a.append((nums[0], i, 1))\r\n b.append((nums[1], i, 2))\r\n ans1 = []\r\n ans2 = []\r\n for i in range(n):\r\n if i < n // 2:\r\n ans1.append(1)\r\n ans2.append(1)\r\n else:\r\n ans1.append(0)\r\n ans2.append(0)\r\n nums = sorted(a + b)\r\n for num, i, semifinal in nums[:n]:\r\n if semifinal == 1:\r\n ans1[i] = 1\r\n else:\r\n ans2[i] = 1\r\n print(*ans1, sep='')\r\n print(*ans2, sep='')\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\r\na=int(input())\r\nz=[[1]*(a//2)+[0]*(a-a//2),[1]*(a//2)+[0]*(a-a//2)]\r\nk=[]\r\nfor i in range(a):u,v=map(int,input().split());k+=[[u,0,i],[v,1,i]]\r\nk.sort()\r\nfor i in k[:a]:z[i[1]][i[2]]=1\r\nfor i in z:print(''.join(map(str,i)))", "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 = iline()\r\n l = []\r\n r = []\r\n for i in range(n):\r\n x, y = mi(line())\r\n l.append((x, i, \"l\"))\r\n r.append((y, i, \"r\"))\r\n\r\n tot = l + r\r\n l.sort()\r\n r.sort()\r\n tot.sort()\r\n\r\n pos_l = [0 for _ in range(len(l))]\r\n pos_r = [0 for _ in range(len(l))]\r\n for i in range(len(l)//2):\r\n _, il, _ = l[i]\r\n pos_l[il] = 1\r\n _, ir, _ = r[i]\r\n pos_r[ir] = 1\r\n\r\n for i in range(len(l)):\r\n _, ii, a = tot[i]\r\n if a == \"l\":\r\n pos_l[ii] = 1\r\n else:\r\n pos_r[ii] = 1\r\n\r\n print(jsns(pos_l))\r\n print(jsns(pos_r))\r\n\r\n\r\n\r\nmain()\r\n", "def main():\r\n n=int(input())\r\n s1=[]\r\n s2=[]\r\n for i in range(n):\r\n temp=input().split(' ')\r\n s1.append(int(temp[0]))\r\n s2.append(int(temp[1]))\r\n \r\n r1=['0' for i in range(n)]\r\n r2=['0' for i in range(n)]\r\n i=0\r\n j=0\r\n for k in range(n):\r\n if s1[i]<s2[j]:\r\n r1[i]='1'\r\n i+=1\r\n else:\r\n r2[j]='1'\r\n j+=1\r\n for k in range(n//2):\r\n r1[k]='1'\r\n r2[k]='1'\r\n r1=''.join(r1)\r\n r2=''.join(r2)\r\n print(r1)\r\n print(r2)\r\nif __name__ == \"__main__\":\r\n main()", "def getParticipants(n, scores1, scores2):\r\n safe = n//2\r\n res1 = ['0']*n\r\n res2 = ['0']*n\r\n for i in range(safe):\r\n res1[i] = '1'\r\n res2[i] = '1'\r\n \r\n i = 0; j = 0; total = 0\r\n while total < n:\r\n if i < n and j < n:\r\n if scores1[i] < scores2[j]:\r\n res1[i] = '1'\r\n i += 1\r\n else:\r\n res2[j] = '1'\r\n j += 1\r\n elif i < n:\r\n res1[i] = '1'\r\n i += 1\r\n else:\r\n res2[j] = '1'\r\n j += 1\r\n total += 1\r\n return '{}\\n{}'.format(''.join(res1), ''.join(res2))\r\n\r\nn = int(input())\r\nscores1 = []\r\nscores2 = []\r\nfor i in range(n):\r\n s1, s2 = list(map(int, input().split(' ')))\r\n scores1.append(s1)\r\n scores2.append(s2)\r\nprint(getParticipants(n, scores1, scores2))", "from heapq import *\r\nfrom queue import *\r\nimport sys, math, bisect\r\nfrom collections import Counter, defaultdict\r\nfrom math import *\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n# print = sys.stdout.write\r\ninl = lambda: list(map(int, input().split()))\r\nintp = lambda: tuple(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n ans1 = [0] * n\r\n ans2 = [0] * n\r\n mat = [inl() for _ in range(n)]\r\n\r\n l, r = 0, 0\r\n N = n\r\n while N:\r\n if mat[l][0] < mat[r][1]:\r\n ans1[l] = 1\r\n l += 1\r\n else:\r\n ans2[r] = 1\r\n r += 1\r\n N -= 1\r\n\r\n # Edit first n//2 elements into 1\r\n ans1[:n // 2] = [1] * (n // 2)\r\n ans2[:n // 2] = [1] * (n // 2)\r\n\r\n print(\"\".join(map(str, ans1)))\r\n print(\"\".join(map(str, ans2)))\r\n\r\n\r\nfor _ in range(int(1)):\r\n solve()\r\n", "'''input\n4\n9900 9850\n9940 9930\n10000 10020\n10060 10110\n'''\n# practicing a skill right after sleep improves it a lot quickly\nfrom sys import stdin, setrecursionlimit\n\n\n# main starts\nn = int(stdin.readline().strip())\nfirst = []\nsecond = []\nfor _ in range(n):\n\tf, s = list(map(int, stdin.readline().split()))\n\tfirst.append(f)\n\tsecond.append(s)\n\nstring1 = ['0'] * n\nstring2 = ['0'] * n\n\ni = 0\nj = 0\ncount = 0\nwhile i < n and j < n and count < n:\n\tif first[i] < second[j]:\n\t\tcount += 1\n\t\tstring1[i] = '1'\n\t\ti += 1\n\telse:\n\t\tcount += 1\n\t\tstring2[j] = '1'\n\t\tj += 1\n\n\nfor i in range(n//2):\n\tstring1[i] = '1'\n\tstring2[i] = '1'\n\nprint(''.join(string1))\nprint(''.join(string2))\n\n\n", "def main():\r\n n = int(input())\r\n merge = []\r\n for i in range(n):\r\n a, b = list(map(int, input().split()))\r\n merge.append((a, 1, i))\r\n merge.append((b, 2, i))\r\n merge.sort(key=lambda x: x[0])\r\n players1 = [0] * n\r\n players2 = [0] * n\r\n # Argue that always n // 2 players from each semifinal will have a chance to reach finals\r\n for i in range(n // 2):\r\n players1[i] = 1\r\n players2[i] = 1\r\n # Argue that if we consider k = 0 we will get max n - 2k players who deserve chance in final\r\n for i in range(n):\r\n if merge[i][1] == 1:\r\n players1[merge[i][2]] = 1\r\n else:\r\n players2[merge[i][2]] = 1\r\n print(*players1, sep=\"\")\r\n print(*players2, sep=\"\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nk=[]\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n A,B=map(int, input().split())\r\n a.append(A)\r\n b.append(B)\r\nla=0\r\nlb=0\r\naind=[0]*n\r\nbind=[0]*n\r\nfor i in range(n):\r\n if a[la]<b[lb]:\r\n aind[la]=1\r\n la+=1\r\n else:\r\n bind[lb]=1\r\n lb+=1\r\nfor i in range(n//2):\r\n aind[i]=1\r\n bind[i]=1\r\nfor i in aind:\r\n print(i,end='')\r\nprint('')\r\nfor i in bind:\r\n print(i,end='')", "n = int(input())\r\nk = []\r\na = []\r\nb = []\r\nfor i in range(n):\r\n x, y = [int(i) for i in input().split()]\r\n a.append(x)\r\n b.append(y)\r\nla = 0\r\nlb = 0\r\nA = [0] * n\r\nB = [0] * n\r\nfor i in range(n):\r\n if a[la] < b[lb]:\r\n A[la] = 1\r\n la += 1\r\n else:\r\n B[lb] = 1\r\n lb += 1\r\nfor i in range(n // 2):\r\n A[i] = 1\r\n B[i] = 1\r\nfor i in A:\r\n print(i, end='')\r\nprint('')\r\nfor i in B:\r\n print(i, end='')\r\n", "def chose_p(arr, brr, k):\n n = len(arr)\n crr = []\n\n for i in range(k):\n crr.append(arr[i])\n arr[i] = 0\n\n for i in range(k):\n crr.append(brr[i])\n brr[i] = 0\n\n drr = [x for x in arr if x] + [x for x in brr if x]\n drr.sort()\n\n for i in range(n - 2 * k):\n crr.append(drr[i])\n\n return crr\n\n\nif __name__ == '__main__':\n n = int(input())\n\n arr = []\n brr = []\n\n for _ in range(n):\n x, y = map(int, input().split())\n arr.append(x)\n brr.append(y)\n\n s = set()\n\n crr = chose_p(arr[:], brr[:], 0)\n drr = chose_p(arr[:], brr[:], n // 2)\n\n s.update(crr, drr)\n\n for i, x in enumerate(arr):\n arr[i] = str(int(x in s))\n\n for i, x in enumerate(brr):\n brr[i] = str(int(x in s))\n\n print(''.join(arr))\n print(''.join(brr))" ]

[ "import math\r\nn = int(input())\r\nsticks = list(map(int,input().split()))\r\n\r\nsticks.sort()\r\n \r\npair = 0\r\ncount = 1\r\n\r\nfor index in range(len(sticks)-1):\r\n if sticks[index] == sticks[index+1]:\r\n count = count + 1\r\n if index == len(sticks)-2:\r\n pair = pair + math.floor(count/2) \r\n else:\r\n pair = pair + math.floor(count/2) \r\n count = 1\r\n\r\nframes = math.floor(pair/2)\r\n\r\nprint(frames)", "n=(int)(input())\r\nd={}\r\na=list(map(int,input().split()))\r\nfor i in a:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nres=0\r\nfor i in d:\r\n res+=(int)(d[i]/2)\r\nprint((int)(res/2))", "n=int(input())\nls=list(map(int,input().split()))\nle=set(ls)\ndis=[]\nfor i in le:\n c=ls.count(i)\n dis.append([i,c])\nfor i in range(len(dis)):\n if dis[i][1]>=2:\n dis[i]=dis[i][1]//2\n else:\n dis[i]=0\ns=sum(dis)\nprint(s//2)\n\t \t \t\t\t \t\t \t \t\t\t \t\t \t", "i = int(input())\r\ngarumi = list(input().split())\r\nd ={}\r\nfor x in garumi:\r\n if x in d:\r\n d[x] = d[x] + 1\r\n else:\r\n d[x] = 1\r\nkkas = 0\r\nfor x in d:\r\n kkas = kkas + d[x] // 2\r\nprint(kkas // 2)", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\nn=I()\r\n\r\na=L()\r\n\r\ncnt=Counter(a)\r\n\r\nans=0\r\nfor i in cnt:\r\n ans+=cnt[i]//2\r\n\r\nprint(ans//2)\r\n\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\ns=set(arr)\r\nrem=0\r\nc=0\r\nfor x in s:\r\n if(arr.count(x)>=4):\r\n c=c+(arr.count(x)//4)\r\n rem=rem+((arr.count(x)%4)//2)\r\n else:\r\n rem=rem+(arr.count(x)//2)\r\nc=c+(rem//2)\r\nprint(c)\r\n \r\n", "n = int(input())\r\nL = list(map(int,input().split()))\r\nizmeri= {}\r\natbildes = 0\r\nfor skaitlis in L:\r\n if skaitlis in izmeri:\r\n izmeri[skaitlis] +=1\r\n else:\r\n izmeri[skaitlis] = 1\r\nfor x in izmeri :\r\n atbildes += izmeri[x]//2\r\nprint(atbildes//2)", "n=int(input())\r\na=list(map(int, input().split()))\r\na.sort()\r\nb,t,c=[],1,0\r\nfor i in range(n):\r\n if i==n-1 or a[i]!=a[i+1]:\r\n c+=t//4\r\n if t%4>=2:b.append(t%2)\r\n t=1\r\n else:t+=1\r\nprint(len(b)//2+c)\r\n", "n = int(input())\r\ncount,i = 0,0\r\nramki = list(map(int, input().split()))\r\nramki.sort()\r\nwhile i < n-1:\r\n if ramki[i] == ramki[i+1]:\r\n count += 1\r\n i +=2\r\n continue\r\n i+= 1\r\nprint(count//2)", "from collections import Counter\n\nclass Task:\n\ta = []\n\tanswer = 0\n\t\n\tdef getData(self):\n\t\tinput()\n\t\tself.a = [x for x in input().split()]\n\t\n\tdef solve(self):\n\t\tdictionary = dict(Counter(self.a))\n\t\tfor key in dictionary.keys():\n\t\t\tself.answer += dictionary[key] // 2\n\t\tself.answer //= 2\n\t\n\tdef printAnswer(self):\n\t\tprint(self.answer)\n\n\ntask = Task();\ntask.getData();\ntask.solve();\ntask.printAnswer();\n", "n=input()\nsks = list(map(int, input().split()))\nprs = 0\nfor s in set(sks):\n prs += sks.count(s) // 2\nprint(prs // 2)\n\t\t \t \t \t \t\t \t \t\t \t\t\t \t \t", "input()\r\np = {}\r\nfor i in input().split():\r\n p[i] = p.get(i, 0) + 1\r\nt = list(p.values())\r\nfor i in range(len(t)):\r\n t[i] = t[i] // 2\r\nprint(sum(t) // 2)\r\n ", "n = int(input())\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\ndict = {}\r\n\r\ncounter = 0\r\n\r\nfor i in range(n):\r\n if arr[i] in dict:\r\n counter +=1\r\n del dict[arr[i]]\r\n else:\r\n dict[arr[i]] = 1\r\n\r\nprint(counter//2)\r\n", "def main():\n input()\n it = iter(sorted(map(int, input().split())))\n a, cnt = next(it), 0\n try:\n while True:\n b = next(it)\n if a == b:\n cnt += 1\n a = next(it)\n else:\n a = b\n except StopIteration:\n print(cnt // 2)\n\n\nif __name__ == '__main__':\n main()", "n=input()\r\nsticks = list(map(int, input().split()))\r\npairs = 0\r\nfor s in set(sticks):\r\n pairs += sticks.count(s) // 2\r\nprint(pairs // 2)\r\n", "from collections import defaultdict\nn = int(input())\narr = list(map(int, input().split()))\n\nfreq = defaultdict(int)\n\nfor item in arr: freq[item] += 1\n\n\npairs = 0\nfor key, value in freq.items():\n pairs += value // 2\n\nprint(pairs // 2)\n \n\n\t \t\t\t\t \t \t\t \t\t\t \t\t \t\t\t \t", "n = int(input())\nl = list(map(int,input().split()))\nd = {}\ntemp = 0\nfor i in set(l):\n d[i] = l.count(i)\nfor i in d.values():\n if i >= 2:\n temp = temp + i // 2\nprint(temp//2)\n\n\t \t\t\t \t\t\t\t\t\t\t\t \t \t\t \t \t\t", "n = int(input())\r\na = input()\r\nL = map(int, a.split(\" \"))\r\n \r\nd = dict()\r\nfor l in L:\r\n if l in d:\r\n d[l]+=1\r\n else:\r\n d[l]=1\r\nd2=dict(map(lambda x: (x[0],x[1]//2), d.items() ))\r\nd3=dict(filter(lambda x: x[1]>0 ,d2.items()))\r\nx_x = sum(d3.values()) // 2\r\nprint(x_x)\n# Sat Oct 30 2021 18:28:30 GMT+0000 (Coordinated Universal Time)\n", "from collections import Counter\n\nn = int(input())\n\na = input().split()\n\nfor i in range(n):\n a[i] = int(a[i])\n\ncounts = Counter(a)\n\nbig_list = []\n\nfor value in counts.values():\n if value >= 2:\n big_list.append(value // 2)\n\nprint(sum(big_list) // 2)", "from collections import Counter\r\n\r\ninput()\r\ncnt = Counter(int(c) for c in input().split())\r\n\r\nfor k in cnt:\r\n cnt[k] //= 2\r\n\r\nprint(sum(cnt.values())//2)\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nfreq = Counter(arr)\r\n\r\nans = 0\r\n\r\nfor val in freq.values():\r\n ans += val//2*2\r\n\r\nprint(ans//4)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set(a)\r\nl=list(s)\r\ncount=0\r\nfor i in range(0,len(l)):\r\n if(a.count(l[i])%2==0): \r\n count+=a.count(l[i])\r\n else:\r\n count+=a.count(l[i])-1\r\nprint(count//4)", "n = int(input())\npalki = list(map(int, input().split()))\ns = set(palki)\n\nres = 0\nfor i in s:\n tmp = palki.count(i)\n if tmp >= 2:\n res += tmp // 2\n\nprint(res // 2)\n", "n = int(input())\narr = [int(num) for num in input().split()]\ncounts_dict = {}\nfor num in arr:\n\tcounts_dict[num] = counts_dict.get(num, 0) + 1\ntotal = 0\nfor num in counts_dict.values():\n\ttotal += num // 2\ntotal = total // 2\nprint(total)", "input()\nx=list(map(int,input().split()))\nk=set(x);c=0\nfor i in k:\n c+=x.count(i)//2\nprint(c//2)\n\n\t\t\t\t\t \t\t\t \t \t \t \t\t \t \t\t", "d={}\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nfor x in l :\r\n d[x]=d.get(x,0)+1\r\nk=0\r\nfor x in d :\r\n k+=d[x]//2\r\nprint(k//2)\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = defaultdict(int)\r\nfor i in a:\r\n d[i] += 1\r\nans = 0\r\nfor i in d.values():\r\n ans += i // 2\r\nprint(ans // 2)\r\n", "n = int(input())\na = [ int(x) for x in input().split()]\n# print(a)\n\ndt = {}\nfor i in range(n):\n\tif a[i] in dt.keys():\n\t\tdt[a[i]] += 1\n\telse:\n\t\tdt[a[i]] = 1\n\nres = 0\nfor i in dt.values():\n\tres += i // 2\n\nprint(res//2)\n\n\n\n ", "n=int(input())\r\nlength=list(map(int,input().split()))\r\nfreq=[0]*(max(length)+1)\r\ns=0\r\ntotal=0\r\nfor i in range(len(length)):\r\n freq[length[i]]+=1\r\nfor i in range(len(freq)):\r\n if freq[i]%2!=0:\r\n freq[i]-=1\r\ns=sum(freq)\r\ntotal=s//4\r\n \r\n \r\nprint(total)\r\n", "from bisect import bisect_left as bl\nfrom bisect import bisect_right as br\nimport heapq\nimport math\nfrom collections import *\nfrom functools import reduce,cmp_to_key\nimport sys\ninput = sys.stdin.readline\n \nM = mod = 998244353\ndef factors(n):return sorted(list(set(reduce(list.__add__,([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))))\n# def 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').split(' ')]\ndef li3():return [int(i) for i in input().rstrip('\\n')]\n\n\nn = val()\nl = Counter(li())\ntot = 0\na = sorted(l,key=lambda x: l[x],reverse = 1)\nj = len(a) - 1\ni = j - 1\nwhile j:\n if l[a[j]] >= 2:\n temp = l[a[j]]//2\n tot += temp\n l[a[j]] -= 2*temp\n l[a[i]] -= 2*temp\n j -= 1\n i -= 1\n\ntot += l[a[0]]//4\nprint(tot)", "n=input()\r\nsks = list(map(int, input().split()))\r\nprs = 0\r\nfor s in set(sks):\r\n prs += sks.count(s) // 2\r\nprint(prs // 2)", "# Online Python compiler to run Python online.\nn=int(input())\nm=list(map(int,input().split()))\nk=set(m)\nk=list(k)\nc=0\nfor i in k:\n\tc+=m.count(i)//2\nprint(c//2)\t\n \t\t \t\t\t\t \t \t \t \t \t\t \t", "s=int(input())\r\nb=list(map(int,input().split()))\r\nfreq=[0]*200\r\nfor i in b :\r\n freq[i]+=1\r\nc=0\r\nn=max(freq)\r\nwhile n>=2:\r\n n=max(freq)\r\n for j in range(len(freq)-1):\r\n if freq[j]>=2:\r\n c+=0.5\r\n freq[j]-=2\r\nprint(int(c))", "from itertools import groupby\n\nn = int(input())\nsticks = sorted(list(map(int, input().split())))\n\nprint(sum([(len(list(a)) // 2) * 2 for k, a in groupby(sticks)]) // 4)\n", "# Problem Link: https://codeforces.com/problemset/problem/127/B\r\n# Problem Status:\r\n# ----------------------- SEPARATOR -----------------------\r\n# Scanning The Input\r\nuselessLine = input()\r\nReader = input()\r\nArrayOfLengths = []\r\nfor X in Reader.split():\r\n ArrayOfLengths.append(int(X))\r\n# ----------------------- SEPARATOR -----------------------\r\nArrayOfLengths.sort()\r\ncount = 1\r\nAnswer = 0.0\r\nfor i in range(1, len(ArrayOfLengths)):\r\n if ArrayOfLengths[i] == ArrayOfLengths[i-1]:\r\n count += 1\r\n else:\r\n count = 1\r\n if count == 2:\r\n Answer += 0.5\r\n count = 0\r\n# ----------------------- SEPARATOR -----------------------\r\nprint(Answer.__trunc__())\r\n# ----------------------- SEPARATOR -----------------------\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\ninput()\r\nx=list(map(int,input().split()))\r\nk=set(x);c=0\r\nfor i in k:\r\n c+=x.count(i)//2\r\nprint(c//2)\r\n", "from collections import Counter\r\n\r\ninput()\r\nprint(sum(v//2 for v in Counter(input().split()).values()) // 2)", "n= int(input())\r\n\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\ns = set(t)\r\n\r\np=0\r\nfor k in s:\r\n p+=t.count(k)//2\r\n\r\nprint(p//2)\r\n", "n = int(input())\ns = input()\na=[]\nans=[]\ncount=0\nfor num in s.split() :\n a.append(int(num))\nfor num in a:\n if num in ans:\n ans.remove(num)\n count=count+1\n else:\n ans.append(num)\nprint(count//2)\n\n# Wed Nov 10 2021 18:24:36 GMT+0000 (Coordinated Universal Time)\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 13/06/2023 23:44:03 Hanoi, Vietnam\r\n# **/\r\n\r\nfrom collections import Counter\r\n\r\ninput()\r\na = Counter(map(int, input().split()))\r\nfor x in a:\r\n a[x] //= 2\r\n\r\nprint(sum(a.values()) // 2)", "n=int(input())\r\n\r\nL=list(map(int,input().split()))\r\n\r\nCnt=[0]*1000\r\nfor i in range(n):\r\n Cnt[L[i]]+=1\r\n\r\nans=0\r\n\r\nfor i in range(1000):\r\n ans+=Cnt[i]//2\r\n\r\nans//=2\r\nprint(ans)\r\n\r\n\r\n", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nfrom collections import Counter\n\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\nli = lambda: list(mi())\nsi = lambda: input()\n\nn = ii()\nl = li()\n\ncc = Counter(l)\ne = 0\n\nfor i in cc.values():\n e += i-i%2\n\nprint(e//4)\n\n", "li=0\r\nn=int(input())\r\nx = sorted(list(map(int,input().split())))\r\nz=list(set(x))\r\nfor i in z:\r\n if x.count(i)%2==1:\r\n li+=(x.count(i)-1)\r\n else:\r\n li+=(x.count(i))\r\nprint(li//4)", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nfrom collections import Counter\n\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\nli = lambda: list(mi())\nsi = lambda: input()\n\nn = ii()\nl = li()\n\ncc = Counter(l)\n\ne = [(i-i%2) for i in cc.values()]\n\nprint(sum(e)//4)\n\n", "cases = int(input())\r\nfull_list = [*map(lambda x: int(x), input().split())]\r\n\r\ndef frame_find(full_list):\r\n uniques = list(set(full_list))\r\n for i in uniques:\r\n if full_list.count(i) % 2 != 0:\r\n full_list.remove(i)\r\n print(len(full_list) // 4)\r\n \r\n \r\nframe_find(full_list)", "n=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in a:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nb=0\r\nfor i in d:\r\n b+=d[i]//2\r\nprint(int(b//2))\r\n\r\n ", "n = int(input())\na = list(map(int, input().split()))\ncount = {}\nfor x in a:\n count[x] = count.get(x, 0) + 1\nfor key in count:\n count[key] //= 2\nans = sum([v for v in count.values()]) // 2\nprint(ans)", "n = int(input())\r\nsticks = list(map(int,input().split()))\r\n\r\ni = 0\r\nframes = 0\r\nsticks.sort()\r\nwhile(i<n-1):\r\n if sticks[i] == sticks[i+1]:\r\n frames+=0.5\r\n i+=2\r\n else:\r\n i+=1\r\n\r\nprint(int(frames))\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in a:\r\n s = d.get(i, 0)\r\n if s == 0:\r\n d[i] = 1\r\n else:\r\n d[i] = d[i] + 1\r\nc = 0\r\nfor i in d.keys():\r\n c += d[i] // 2\r\nprint(c // 2)\r\n", "n = int(input())\r\nmap = {}\r\nfor val in (int(x) for x in input().split()):\r\n map[val] = (1 if val not in map else map[val] + 1)\r\nprint(sum(map[a] // 2 for a in map) // 2)", "from collections import Counter\nn = int(input())\ns = input().split(' ')\nc = Counter(s)\nc = c.most_common(len(c))\npairs=0\nfor i in c:\n\tpairs+=int(i[1]/2)\nprint(int(pairs/2))\n", "from collections import Counter\r\nn = int(input())\r\ncnt = Counter(int(x) for x in input().split())\r\nans = 0\r\nfor a, b in cnt.items():\r\n\tans += b // 2\r\nprint(ans // 2)", "if __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n N = lambda: int(input())\r\n\r\n n = N()\r\n a = Y()\r\n d = dict()\r\n\r\n for i in range(n):\r\n d[a[i]] = d.get(a[i], 0) + 1\r\n for v in d.keys():\r\n d[v] = d[v]//2\r\n print(sum(d.values())//2)", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = dict.fromkeys(a,0)\r\nfor i in a:\r\n d[i]+=1\r\ns = 0\r\nfor i in d:\r\n d[i]//=2\r\n s+=d[i]\r\n\r\nprint(s//2)", "n=int(input())\nlst=list(map(int,input().split()))\nset1={}\nfor i in lst:\n if i in set1:\n set1[i]=set1[i]+1\n else:\n set1[i]=1\ncount=0\ntemp=0\nfor i in set1:\n while set1[i]>=2:\n if set1[i] >= 2:\n temp += 1\n set1[i] -= 2\n if temp % 2 == 0:\n count += 1\n temp = 0\nprint(count)\n\t \t\t \t\t \t \t\t\t\t \t \t\t \t\t \t", "n = int(input())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\ncount = 0\r\nsimpan = set()\r\n\r\nfor x in daf:\r\n if x not in simpan:\r\n simpan.add(x)\r\n else:\r\n simpan.remove(x)\r\n count += 1\r\n\r\nprint(count // 2)\r\n", "#1080\r\n#4digit\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ncounter=dict()\r\nfor i in range(n):\r\n ele=arr[i]\r\n str_ele=str(ele)\r\n if str_ele in counter:\r\n counter[str_ele]+=1\r\n else:\r\n counter[str_ele]=1\r\ncount=0\r\nfor i in counter:\r\n num=counter[i]\r\n count+=(int(num/2))\r\nprint(int(count/2))", "n = int(input())\r\nl = list(input().split())\r\nd = {}\r\nfor gar in l:\r\n if gar in d:\r\n d[gar] = d[gar] + 1\r\n else:\r\n d[gar] = 1\r\npari = 0\r\nfor gar in d:\r\n pari = pari + d [gar] // 2\r\nprint(pari // 2)", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = [0]*(max(a)+1)\r\npas = 0\r\nx = 0\r\nfor k in range(n):\r\n d[a[k]] += 1\r\nfor k in range(len(d)):\r\n pas += d[k]//4\r\n\r\n if d[k]%4 > 1:\r\n if x==1:\r\n pas += 1\r\n x = 0 \r\n else:\r\n x = 1\r\nprint(pas)\r\n ", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nc=list(Counter(l).values())\r\nc=list(map(lambda x:x>>1,c))\r\nprint(sum(c)>>1)", "n=int(input())\r\narr=list(map(int,(input().split())))\r\narr=sorted(arr)\r\ns=set(arr)\r\na=0\r\nfor i in s:\r\n a+=(arr.count(i))//2\r\nprint(a//2)", "#125B (83No. Problem B)\r\nn = int(input())\r\nstick = sorted(list(map(int,input().split())))\r\ni = c = 0\r\nwhile (i < n-1):\r\n if stick[i] == stick[i+1]:\r\n c+=1\r\n i+=2\r\n else:\r\n i+=1 \r\nprint(c//2) ", "n = int(input())\r\na = input()\r\nL = map(int, a.split(\" \"))\r\n \r\nd = dict()\r\nfor l in L:\r\n if l in d:\r\n d[l]+=1\r\n else:\r\n d[l]=1\r\nd2=map(lambda x: x[1]//2, d.items() )\r\nd3=filter(lambda x: x>0 ,d2)\r\nx_x = sum(d3) // 2\r\nprint(x_x)\n# Fri Nov 05 2021 08:11:41 GMT+0000 (Coordinated Universal Time)\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nlst=[0]*101\r\nfor i in a:\r\n lst[i]+=1\r\nres=0\r\nfor i in lst:\r\n if i>=2:\r\n res+=i//2\r\nprint(res//2)", "n = input()\r\nn = 0\r\nsps = input().split()\r\nslv = dict()\r\n\r\nfor i in sps:\r\n if i not in slv:\r\n slv[i] = 1\r\n else:\r\n slv[i] += 1\r\n \r\nfor j in slv.values():\r\n n = n + (j // 2)\r\n\r\nprint (n // 2) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nl = 105\r\ncnt = [0] * l\r\nfor i in a:\r\n cnt[i] += 1\r\nc = 0\r\nfor i in cnt:\r\n c += i // 2\r\nans = c // 2\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nx = set()\r\nfor e in a:\r\n if a.count(e)%2:\r\n x.add(e)\r\n\r\nfor e in x:\r\n a.remove(e)\r\nprint(len(a)//4)", "f= int(input())\r\ny=input().split()\r\nk=0\r\nfor i in range(0,f):\r\n for j in range(i+1,f):\r\n if (y[i]==y[j] and y[i]!=0 and y[j]!=0):\r\n y[i]=0\r\n y[j]=0\r\n k=k+1\r\n break\r\nprint(k//2)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nnl=list(set(l))\r\nfor i in nl:\r\n c+=(l.count(i)//2)\r\nprint(c//2)", "#ROUNIAAUDI\r\nimt1=int(input())\r\ny=list(map(int,input().split()))\r\nr=set(y)\r\ns=0\r\nfor i in r:\r\n if y.count(i)%2==1:\r\n s+=y.count(i)-1\r\n else:\r\n s+=y.count(i)\r\n#print(s)\r\nprint(s//4)\r\n", "input()\r\nx=list(map(int,input().split()))\r\nk=set(x);c=0\r\nfor i in k:\r\n c+=x.count(i)//2\r\nprint(c//2)\r\n", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nv=[]\r\n# ans=0\r\np=0\r\nfor i in l:\r\n\tif i not in v:\r\n\t\tv.append(i)\r\n\telse:\r\n\t\tv.remove(i)\r\n\t\t# v.pop(i)\r\n\t\tp+=1\r\nprint(p//2)\r\n\r\n", "n = int(input())\r\na = [int(x) for x in input().split(' ')]\r\nd = {}\r\ndef findNext(d):\r\n for k in d:\r\n if d[k] >= 2:\r\n return k\r\n return None\r\n\r\n\r\nfor x in a:\r\n if d.get(x):\r\n d[x] += 1\r\n else:\r\n d[x] = 1\r\n\r\nk = 0\r\nr = findNext(d)\r\nwhile r:\r\n d[r] -= 2\r\n if d[r] == 0:\r\n del d[r]\r\n k += 2\r\n r = findNext(d)\r\n\r\nprint(k//4)", "n=int(input())\r\np=[int(x) for x in input().split()]\r\ns=set(p)\r\nt=0\r\nfor i in s:\r\n t=t+int((p.count(i))/2)\r\nprint(int(t/2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\ninput()\r\nw = Counter(map(int, input().split())).values()\r\ns = 0\r\nfor i in w:\r\n s += i//2\r\nprint(s//2)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\ntotal = 0\r\nfor i in d:\r\n if d[i]%2:\r\n total+=d[i]-1\r\n else:\r\n total+=d[i]\r\n\r\nprint(total//4)", "def main():\r\n counts = {}\r\n n = int(input())\r\n sticks = [i for i in input().split()]\r\n\r\n for i in sticks:\r\n counts[i]= counts.get(i, 0)+1\r\n # print(counts)\r\n how_many = 0\r\n full = 0\r\n half = False\r\n for size, quantity in counts.items():\r\n # print(size, \":\", quantity)\r\n # 11\r\n\r\n\r\n if quantity >= 4:\r\n full = quantity//4\r\n quantity -= full*4\r\n how_many += full\r\n # quantity is either [0 1 2 3]\r\n\r\n if half and quantity >= 2:\r\n how_many += 1\r\n half = False\r\n elif quantity >= 2:\r\n half = True\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n print(how_many)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "n = int(input())\r\nsticks = list(map(int, input().split()))\r\nstick_counts = [0] * 101\r\nfor stick in sticks:\r\n stick_counts[stick] += 1\r\ntemp = 0\r\nfor count in stick_counts:\r\n if count % 2==1 and count > 0:\r\n count -= 1\r\n temp += count\r\nprint(temp // 4)# 1689686247.1129777", "n=int(input())\r\nl=list(map(int, input().split()))\r\nl.sort()\r\ncnt=0; i=0\r\nwhile i<n-1:\r\n if l[i]==l[i+1]: cnt+=1; i+=2\r\n else: i+=1\r\nprint(cnt//2)", "from sys import stdin, stdout\ninput = stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n\tstdout.write(sep.join(map(str, args)) + end)\ndef int_map():\n\treturn map(int, input().split())\ndef list_int():\n\treturn list(map(int, input().split()))\n\nn = int(input())\narr = list_int()\ncounter = [0] * 101\npairs = 0\nfor i in arr:\n\tcounter[i] += 1\nfor i in counter:\n\tpairs += i//2\nprint(pairs//2)\n\n\n\n", "d = {}\r\nsum = 0\r\nn = int(input())\r\nl = list(input().split())\r\nfor x in l:\r\n if x in d:\r\n d[x] = d[x] + 1\r\n else:\r\n d[x] = 1\r\nfor gar in d:\r\n sum += d[gar] // 2\r\nprint(sum // 2)\r\n\r\n", "n = int(input())\ns = input()\nls = s.split()\nl = len(ls)\nls = [int(p) for p in ls]\nls.sort()\ni = 0\nnum = 0\nwhile l-i-1 > 0:\n if ls[i] != ls[i+1]:\n i += 1\n else:\n c = 0\n while ls[i] == ls[i+1] :\n i += 1\n c += 1\n if i == l-1:\n break\n else:\n continue\n num += (c+1)//2\nprint(num//2)", "from collections import Counter\n\nn, a = int(input()), Counter(int(i) for i in input().split())\nres = 0\nfor c in a.values():\n res += c // 2\nres //= 2\nprint(res)\n", "from collections import Counter\r\n\r\ninput()\r\nprint(sum(x//2 for x in Counter(input().split()).values()) // 2)", "d={}\r\nfor x in map(int,[*open(0)][1].split()):\r\n d[x]=d.get(x,0)+1\r\nr=0\r\nfor x in d.values():r+=x//2\r\nprint(r//2)", "input()\r\nlst=[0]*100\r\ntemp=ans=0\r\nfor i in input().split():\r\n lst[int(i)-1]+=1\r\nfor i in lst:\r\n if i != 0 :\r\n if temp==0:\r\n temp = i//2\r\n else:\r\n ans+=min(temp , i//2)\r\n temp = abs(temp - (i//2) )\r\nprint(ans+(temp//2)) ", "n = int(input())\nx = list(map(int, input().split()))\nx.sort()\npairs_cnt, i = 0, 1\nwhile i != n:\n try:\n if x[i] == x[i - 1]:\n pairs_cnt += 1\n i += 2\n else:\n i += 1\n except IndexError:\n break\nprint(pairs_cnt // 2)\n", "d={};n=input();s=0\r\nfor i in map(int,input().split()):\r\n\tif i in d:d[i]+=1\r\n\telse:d[i]=1\r\nfor i in d:s+=(d[i]-d[i]%2)\r\nprint(s//4)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\n\nprev = None\ncounter = 0\npairs = 0\nfor stick in a:\n counter += 1\n if stick != prev:\n counter = 1\n elif counter == 2:\n pairs += 1\n counter = 0\n prev = stick\nprint(pairs // 2)\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ns = set(arr)\r\nans = 0\r\nfor i in s:\r\n ans+= (arr.count(i)//2)\r\nprint(ans//2)\r\n", "a=int(input())\r\nb=input().split()\r\nprint(int(sum([int(b.count(i)/2) for i in set(b)])/2)) ", "n = int(input())\r\narr = input().split()\r\nfinal = []\r\nfor i in arr:\r\n final.append(int(i))\r\nnpairs = 0\r\nfor i in set(final):\r\n count = final.count(i)\r\n npairs += count // 2\r\nprint(npairs // 2)", "from collections import defaultdict\r\nn=int(input())\r\nc=list(map(int,input().split()))\r\nd=defaultdict(int)\r\n\r\nfor i in range(len(c)):\r\n\td[c[i]]+=1\r\n\r\ncount=0\r\n\r\nfor val in d.values():\r\n\tcount+=val//2\r\n\r\nif count%2==0:\r\n\tprint(count//2)\r\nelse:\r\n\tprint((count-1)//2)\r\n\t\r\n", "from collections import Counter\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\ncnt=Counter(x)\r\nc=0\r\nfor i in cnt:\r\n c+=cnt[i]//2\r\nprint(c//2)", "from collections import defaultdict\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = defaultdict(int)\r\nsides = 0\r\nans = 0\r\nfor ai in a:\r\n if d[ai] == 0:\r\n d[ai] += 1\r\n else:\r\n d[ai] = 0\r\n if sides == 1:\r\n ans += 1\r\n sides = 0\r\n else:\r\n sides += 1\r\nprint(ans)", "from typing import Counter\r\nn = int(input())\r\nl = list(map(int,input().strip().split()))[:n]\r\nprint(sum(val//2 for val in Counter(l).values())//2)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = set(l)\r\nc = []\r\nfor i in s:\r\n\tt = l.count(i)\r\n\tif t%2==0:\r\n\t\tc.append(t)\r\n\telse:\r\n\t\tc.append(t-1)\r\ns = sum(c)\r\nprint(s//4)", "n=int,input()\r\nl=list(map(int,input().split()))\r\nx=0\r\nfor i in set(l):\r\n m=l.count(i)\r\n x+=m//2\r\nprint (x//2) ", "n = int(input())\r\nc = {}\r\nfor a in (int(x) for x in input().split()):\r\n c[a] = c[a] + 1 if a in c else 1\r\nprint(sum(c[a] // 2 for a in c) // 2)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nfrom collections import Counter \r\nc=Counter(l)\r\nfor i in c:\r\n if c[i]&1:\r\n c[i]=c[i]-1 \r\n#print(c)\r\ncnt=sum(c[i] for i in c)\r\nprint(cnt//4)", "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#################################################\nn=RI()[0]\ncnt=[0]*101\na=RI()\nfor i in a:\n cnt[i]+=1\ntotal=0\nfor i in cnt:\n total+=i//2\nprint(total//2)\n\n\n", "import sys\r\nimport math\r\n \r\nn = int(sys.stdin.readline())\r\nan = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nk = [0] * 101\r\n\r\nfor i in an:\r\n k[i] += 1\r\n \r\nres = 0\r\nfor i in k:\r\n res += int(i / 2)\r\n\r\nprint(int(res / 2))", "a=int(input())\r\nb=sorted(list(map(int,input().split())))\r\nx=[]\r\n\r\nfor i in range(1,a):\r\n if b[i]==b[i-1]:\r\n x.append(b[i])\r\n\r\npairs=0\r\ny=list(set(x))\r\n\r\nfor i in y:\r\n z=x.count(i)\r\n pairs += (z+1)//2\r\n\r\nprint(pairs//2)\r\n", "n = input()\n\r\nl = input().split(\" \")\r\n\n\nd = {}\n\n\r\nfor i in l:\n\r\n if i in d:\r\n\n d[i] = d[i] + 1\r\n\n else:\r\n\n d[i] = 1\r\n\n\nn = 0\n\n\r\nfor i in d:\r\n\n n += d[i]//2\r\n\r\n\n\nprint(n//2)", "n = int(input())\r\na = list(map(int,input().split()))\r\nhm = [0]*110\r\nfor i in a:\r\n hm[i]+=1\r\nc = 0\r\nfor i in range(110):\r\n c+=hm[i]//2\r\nprint(c//2)", "n=int(input()) \r\nch=str(input())\r\nl=[]\r\nl2=ch.split()\r\nfor i in range (n) :\r\n l.append(l2[i])\r\ns=set(l2)\r\nc=[]\r\nfor i in s :\r\n c.append(l.count(i))\r\ncpt=0\r\nfor i in range (len(c)) :\r\n cpt+=c[i]//2\r\nprint(cpt//2)\r\n ", "from itertools import groupby\n\nn = int(input())\nsticks = sorted(list(map(int, input().split())))\n\ngroups_sizes = [len(list(b)) for a, b in groupby(sticks)]\n\nprint(sum([x - x % 2 for x in groups_sizes]) // 4)\n", "from sys import stdin,stdout\r\nfrom collections import Counter\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=lst()\r\n d=Counter(a)\r\n cnt=0\r\n for k,v in d.items():\r\n cnt+=v//2\r\n print(cnt//2)", "_ = input()\nsticks = list(map(int, input().split()))\npairs = 0\ncurrent = []\nfor s in sticks:\n\tif s not in current:\n\t\tcurrent.append(s)\n\telse:\n\t\tcurrent.remove(s)\n\t\tpairs += 1\nprint(pairs // 2) # two pairs one frame\n", "input()\nl = list(map(int, list(input().split())))\nl.sort()\ntemp = []\ni = 0\nwhile i+1 < len(l):\n if l[i] == l[i + 1]:\n temp.append(l[i])\n i += 1\n i += 1\n\nprint(len(temp)//2)\n\n\t \t \t\t \t\t\t\t\t\t\t \t \t\t\t \t\t", "def merge(lst1, lst2):\r\n i = 0\r\n j = 0\r\n arr = []\r\n while i < len(lst1) and j < len(lst2):\r\n if lst1[i] < lst2[j]:\r\n arr.append(lst1[i])\r\n i += 1\r\n else:\r\n arr.append(lst2[j])\r\n j += 1\r\n while i < len(lst1):\r\n arr.append(lst1[i])\r\n i += 1\r\n while j < len(lst2):\r\n arr.append(lst2[j])\r\n j += 1\r\n return arr\r\ndef mergeSort(lst):\r\n if len(lst) <=1:\r\n return lst\r\n mid = int(len(lst)/2)\r\n left = mergeSort(lst[0:mid])\r\n right = mergeSort(lst[mid:])\r\n return merge(left, right)\r\nx=int(input())\r\nlst = list(map(int,input().split()))\r\nlst = mergeSort(lst)\r\ni = 0\r\nlength = len(lst)-1\r\ncount = 0\r\nwhile i < length:\r\n if lst[i] is not None:\r\n if lst[i] == lst[i+1]:\r\n count += 1\r\n lst[i+1] = None\r\n i += 1\r\nprint(int(count/2))", "n = int(input())\r\nA = list(map(int, input().split()))\r\nfrom collections import Counter\r\nC = Counter(A)\r\ncnt = 0\r\nfor k, v in C.items():\r\n cnt += v//2\r\nprint(cnt//2)\r\n", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nc=list(Counter(l).values())\r\nsu=0\r\nfor i in c:\r\n\tsu+=i>>1\r\nprint(su>>1)", "from collections import Counter\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nv = Counter(a)\r\nk = 0\r\n\r\nfor i in v:\r\n cnt += v[i] // 2\r\n\r\nprint(cnt // 2)\r\n", "num=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ni=0\r\ncount=0\r\nwhile(i<len(l)-1):\r\n if l[i]==l[i+1]:\r\n i+=2\r\n count+=1\r\n else:\r\n i+=1\r\nprint(count//2) \r\n ", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nfrom copy import copy\r\nn=int(input())\r\nf={}\r\nd=0\r\np=[]\r\ndeleted=[]\r\ndef refresh():\r\n global p,d\r\n if len(p)==2:\r\n d+=1\r\n f[p[0]]=0\r\n f[p[1]]=0\r\n p=[]\r\nfor x in input().split():\r\n try:\r\n f[x]+=1\r\n except:\r\n f[x]=1\r\nfor x in f.keys():\r\n if f[x]>=4:\r\n j=copy(f[x])\r\n f[x]=j%4\r\n d+=j//4\r\n if f[x]>=2:\r\n p.append(x)\r\n refresh()\r\nprint(d)", "from collections import Counter\nn = int(input())\ncnt = Counter(int(x) for x in input().split())\nans = 0\nfor a, b in cnt.items():\n\tans += b // 2\nprint(ans // 2)\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nk=set(m)\r\nk=list(k)\r\nc=0\r\nfor i in k:\r\n\tc+=m.count(i)//2\r\nprint(c//2)\t", "from collections import *\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nc=0\r\nd=defaultdict(int)\r\nfor i in l:\r\n d[i]+=1\r\nfor i in d:\r\n s+=d[i]//4\r\n r=d[i]%4\r\n if(r>=2):\r\n c+=1\r\nprint(s+c//2)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nf = [0]*102\r\nc = 0\r\nfor i in l:\r\n f[i] += 1\r\nfor i in range(101):\r\n x = f[i]//4\r\n c += x\r\n f[i] = f[i] - (4*x)\r\nfor i in range(101):\r\n for j in range(i+1, 101):\r\n if f[i] >= 2 and f[j] >= 2:\r\n f[i] = f[i] - 2\r\n f[j] = f[j] - 2\r\n c += 1\r\n\r\nprint(c)\r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\ncount = {}\nfor x in a:\n count[x] = count.get(x, 0) + 1\nans = sum([v // 2 for v in count.values()]) // 2\nprint(ans)", "n = int(input())\r\na = input()\r\na = a.split()\r\ndic = {}\r\nfor i in a:\r\n dic[i] = dic.get(i, 0) + 1\r\nc = 0\r\nfor v in dic.values():\r\n c += v//2\r\nprint(c//2)", "'''input\r\n13\r\n2 2 4 4 4 4 6 6 6 7 7 9 9\r\n'''\r\nfrom collections import Counter\r\nn = int(input())\r\na = list(map(int,input().strip().split()))[:n]\r\nprint(sum(val // 2 for val in Counter(a).values()) // 2)", "# Author Kmoussai \nimport sys\nimport math\nimport random\n'''\ni = 0\nwhile i < n:\n \n i += 1\n\nmap(int, input().split())\n\n\ndef pgcd(a, b):\n if b == 0:\n return a\n return pgcd(b, a%b)\n\n\n\n'''\nif len(sys.argv) >= 2:\n if sys.argv[1] == 'LOCAL':\n sys.stdin = open('input.in', 'r')\nn = int(input())\n\nl = map(int, input().split());\nll = {}\nfor i in l:\n try:\n ll[i] += 1\n except:\n ll[i] = 1\nans = 0\nfor i in ll:\n if ll[i]%2 >= 0:\n ans += ll[i] // 2\n ll[i] = 0\nprint(ans//2)\n\n\n\n\n\n", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nfrom collections import *\r\n\r\nn, a = int(input()), arr_inp()\r\nc = Counter(a)\r\n# print(c)\r\nprint(int(sum(list(map(lambda x:x//2, c.values())))//2))\r\n" ]

[ "class Solution:\r\n def getList(self):\r\n return list(map(int,input().split()))\r\n def solve(self):\r\n n,k = input().split()\r\n n = int(n)\r\n k = int(k)\r\n a = self.getList()\r\n b = self.getList()\r\n c = [b[i]//a[i] for i in range(n)]\r\n total = min(c)\r\n left = [b[i]-total*a[i] for i in range(n)]\r\n while True:\r\n required = 0\r\n for i in range(n):\r\n if left[i]>=a[i]:\r\n left[i] -= a[i]\r\n else:\r\n required += a[i] - left[i]\r\n left[i] = 0\r\n if required <= k:\r\n k-=required\r\n total+=1\r\n else:\r\n break\r\n print(total) \r\nx = Solution()\r\nx.solve()", "def check(mid):\n needed=0\n #mid=5\n # 1 2 3\n # 4 8 6\n for i in range (0,len(a)):\n\n if(a[i]*mid>b[i]) :\n needed+=((a[i]*mid)-b[i])\n if needed > k:\n return False\n else:\n return True\n\n\n\n\n\ndef bs():\n left=0\n right=10000000\n\n while left<right:\n\n mid=((left+right+1)//2)\n\n if check(mid)==True:\n left=mid\n elif check(mid)==False:\n right=mid-1\n return right\n\nn,k=list(map(int,input().split()))\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\n\nprint(bs())\n\n \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(map(int,input().split()))\r\ndef g(i):\r\n return b[i]//a[i];\r\nc=[i for i in range(n)]\r\nc.sort(key=g)\r\nans=g(c[0])\r\nwhile k>0:\r\n nem=b[c[0]]//a[c[0]]\r\n nem+=1\r\n nem*=a[c[0]]\r\n if k>=nem-b[c[0]]:\r\n k-=nem-b[c[0]]\r\n b[c[0]]+=(nem-b[c[0]])\r\n else:\r\n k=0\r\n c.sort(key=g)\r\n ans=g(c[0])\r\n # print(k)\r\n# for j in c:\r\n# print(g(j))\r\nprint(ans)", "\r\n\r\nn,k=map(int,input().strip().split())\r\na=[*map(int,input().strip().split())]\r\nb=[*map(int,input().strip().split())]\r\n\r\nans=-1\r\nlo=0\r\nhi=10**10\r\nwhile lo<=hi:\r\n mid=(lo+hi)//2\r\n\r\n t=0\r\n for i in range(len(a)):\r\n if a[i]*mid<=b[i]:\r\n continue\r\n else:\r\n t+=(a[i]*mid)-b[i]\r\n if t<=k:\r\n ans=mid\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\nprint(ans)\r\n", "inp = list(map(int,input().split()))\n\nn = inp[0]\nk = inp[1]\n\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\n\n\n\ncnt = 0\nwhile(True):\n for i in range(n):\n if(b[i]>=a[i]):\n b[i] -= a[i]\n \n else:\n k = k-(a[i]-b[i])\n b[i]=0\n \n if(k>=0):\n cnt += 1\n else:\n break\n \nprint(cnt)\n \n \n\t\t \t\t \t\t\t \t \t\t\t \t\t \t\t\t \t\t \t", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nd = {}\r\nbacklog = {}\r\nfor i in range(n):\r\n if b[i]//a[i] in d:\r\n d[b[i]//a[i]] += (a[i] - (b[i]%a[i]))\r\n backlog[b[i]//a[i]] += a[i]\r\n else:\r\n d[b[i]//a[i]] = a[i] - (b[i]%a[i])\r\n backlog[b[i]//a[i]] = a[i]\r\nspecial = list(backlog.keys())\r\nspecial.sort()\r\nprev = [0]\r\ntotal = 0\r\nfor i in range(len(special)):\r\n total += backlog[special[i]]\r\n prev.append(total)\r\nprev.append(0)\r\nstart = special[0]\r\nans = start\r\nfor keyz in range(special[0],special[-1]):\r\n if keyz not in d:\r\n d[keyz] = 0\r\ni = special[0]\r\nj = 0\r\nsave = 0\r\nwhile k>0 and j<len(special) and i <= special[-1]:\r\n if d[i] > 0:\r\n if d[i] + prev[j] <= k:\r\n k -= d[i]+prev[j]\r\n save = prev[j+1]\r\n ans += 1\r\n i += 1\r\n j += 1\r\n else:\r\n k = -1\r\n else:\r\n if save <= k:\r\n k -= save\r\n ans += 1\r\n i += 1\r\n else:\r\n k = -1\r\nif k > 0:\r\n ans += k//prev[-2]\r\nprint(ans)", "n, k = map(int, input().split())\r\nreq_ingredient_size = list(map(int, input().split()))\r\nowned_ingredient_size = list(map(int, input().split()))\r\n\r\nleft = 0\r\nright = max(owned_ingredient_size) + k\r\nanswer = 0\r\n\r\nwhile left <= right:\r\n mid = (left + right) // 2\r\n req_magic_powders = 0\r\n\r\n for i in range(n):\r\n req_magic_powders += max( 0, (mid * req_ingredient_size[i]) - owned_ingredient_size[i] )\r\n \r\n if k >= req_magic_powders:\r\n left = mid + 1\r\n answer = mid\r\n else:\r\n right = mid - 1\r\n\r\nprint(answer)", "n,k = [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\nflag = 0\r\nans=0\r\nwhile(flag == 0):\r\n if flag:\r\n break\r\n for i in range(n):\r\n if b[i] >= a[i]:\r\n b[i] -= a[i]\r\n continue\r\n else:\r\n k -= a[i] - b[i]\r\n b[i] = 0\r\n if k<0:\r\n flag = 1\r\n break \r\n else:\r\n ans += 1 \r\nprint(ans) \r\n", "import sys\r\n\r\ndef check(value):\r\n temp = k\r\n for i in range(n):\r\n need = ingredients[i] * value\r\n if need > storage[i]:\r\n temp -=(need - storage[i])\r\n \r\n if temp < 0 : return False\r\n return True\r\n\r\ndef maxCoockies():\r\n \r\n l = 1\r\n r = 10**18\r\n res = 0\r\n \r\n while l <= r:\r\n mid = (l + r) // 2\r\n if check(mid):\r\n res = mid\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n return res\r\n \r\n \r\nn, k = map(int, sys.stdin.readline().split())\r\ningredients = list(map(int, sys.stdin.readline().split()))\r\nstorage = list(map(int, sys.stdin.readline().split()))\r\nans = maxCoockies()\r\nprint(ans)", "import math\n\nclass Solution:\n\n\tdef numCookies(self, n, k, recepie, ingredients) -> None:\n\n\t\tl = 1\n\t\th = 1e12\n\n\t\twhile l < h:\n\t\t\tm = (l + h) // 2\n\t\t\ttmp = k\n\n\t\t\ti = 0\n\t\t\twhile i < n:\n\t\t\t\tif ingredients[i] / recepie[i] < m:\n\t\t\t\t\tneeded = m * recepie[i] - ingredients[i]\n\n\t\t\t\t\tif needed <= tmp:\n\t\t\t\t\t\ttmp -= needed\n\t\t\t\t\telse:\n\t\t\t\t\t\tbreak\n\n\t\t\t\ti += 1\n\n\t\t\tif i == n:\n\t\t\t\tl = m + 1\n\t\t\telse:\n\t\t\t\th = m\n\t\t\n\t\tprint(int(l) - 1)\n\n\t\treturn\n\n\ndef main():\n\tn, k = list(map(int, input().strip().split()))\n\n\trecepie = list(map(int, input().strip().split()))\n\tingredients = list(map(int, input().strip().split()))\n\n\tsol = Solution()\n\n\tsol.numCookies(n, k, recepie, ingredients)\n\n\nif __name__ == '__main__':\n\n\tmain()", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ndef check(x):\r\n k1=k\r\n for i in range(n):\r\n need=a[i]*x\r\n if need>b[i]:\r\n k1-=need-b[i]\r\n if k1<0:return False\r\n return True\r\n\r\nans=0\r\nstart=1\r\nend=2000\r\nwhile start<=end:\r\n mid=int((start+end)/2)\r\n if check(mid):\r\n ans=mid\r\n start=mid+1\r\n \r\n else:\r\n end=mid-1\r\nprint(ans)", "R = lambda: map(int, input().split())\r\nn, k = R()\r\nsingle, total = list(R()), list(R())\r\nwhile k:\r\n mv, mi = min([(t // s, i) for i, (s, t) in enumerate(zip(single, total))])\r\n total[mi] += 1\r\n k -= 1\r\nprint(min([t // s for (s, t) in zip(single, total)]))", "n,k = [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\nl = 0\r\nr = 2*(10e9)\r\n \r\nwhile l<r:\r\n mid = (l+r)//2+1\r\n sm = sum([ max([ a[i]*mid-b[i] ,0]) for i in range(n) ])\r\n \r\n if sm>k: r = mid-1\r\n else: l = mid\r\n \r\nprint(int(l))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nl = 0\r\nr = 0\r\nfor i in range(n):\r\n r = max(b[i]//a[i]+k, r)\r\nwhile r >= l:\r\n m = l + (r-l)//2\r\n c = 0\r\n for i in range(n):\r\n c += max(a[i]*m-b[i],0)\r\n if c <= k: l = m+1\r\n else: r = m-1\r\nprint(r)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nlo=0\r\nhi=1e10\r\nans=0\r\nwhile(lo<=hi):\r\n sum=0\r\n mid=(lo+hi)//2\r\n for i in range(n):\r\n if(mid*l[i]-l1[i]>0):\r\n sum+=(mid*l[i]-l1[i])\r\n if(sum<=k):\r\n ans=mid\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\nprint(int(ans))\r\n", "import bisect\nn,m=[int(x) for x in input().split()]\nl=[int(x) for x in input().split()]\na=[int(x) for x in input().split()]\n\ndef fun(n):\n '''aa=max(n*na-a,0)\n bb=max(n*nb-b,0)\n cc=max(n*nc-c,0)'''\n p=0\n for i in range(len(a)):\n p+=max(n*l[i]-a[i],0)\n if p<=m:#if p<q there is option of getting more so left=mid+1\n return True\n else:\n return False\nleft,right=0,1e15\nwhile left<right:\n mid=(left+right)//2\n bo=fun(mid)\n if bo:\n left=mid+1\n else:\n right=mid\nprint(int(left-1))\n\n\n\n\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nr = [b[i] % a[i] for i in range(n)]\r\nq = [b[i] // a[i] for i in range(n)]\r\nans = min(q)\r\ni = ans + 1 \r\nwhile(True):\r\n c = 0\r\n for j in range(n):\r\n if(q[j] < i):\r\n c += (i - q[j]) * a[j] - r[j]\r\n r[j] = 0 \r\n q[j] = i \r\n if(c <= k):\r\n k -= c \r\n ans = i \r\n i += 1 \r\n else:\r\n break \r\nprint(ans)\r\n ", "n,k = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\n\nl,r=0,2000000001\nans=-1\nwhile l<=r:\n\tmid=(l+r)//2\n\ts=0\n\tfor i in range(n):\n\t\tif (b[i]< mid*a[i]):\n\t\t\ts+=mid*a[i]-b[i]\n\t\tif s>k:\n\t\t\tbreak\n\tif s>k:\n\t\tr=mid-1\n\telif s==k:\n\t\tans=mid\n\t\tbreak\n\telse:\n\t\tl=mid+1\n\nif ans==-1:\n\tans=l-1\nprint(ans)", "# 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\ndef solve(n,magic,a,b):\r\n count=0\r\n while magic:\r\n for i in range(n):\r\n if b[i]>=a[i]:\r\n b[i]-=a[i]\r\n elif a[i]-b[i]<=magic: \r\n magic-=a[i]-b[i]\r\n b[i]=0\r\n else:\r\n return count\r\n count+=1\r\n return count \r\n\r\n# t=int(input())\r\n# for _ in range(t):\r\nn,k=map(int,input().split(\" \"))\r\na=list(map(int,input().split(\" \")))\r\nb=list(map(int,input().split(\" \")))\r\nprint(solve(n,k,a,b))", "s,m = map(int, input().split())\r\nreq_ingredients = list(map(int, input().split()))\r\nowned_ingredients = list(map(int, input().split()))\r\nleftover = []\r\ncookies = []\r\n\r\nfor i in range(s):\r\n cookies.append(owned_ingredients[i]//req_ingredients[i])\r\n leftover.append(owned_ingredients[i]%req_ingredients[i])\r\n\r\nx = min(cookies)\r\n\r\nwhile m >= 0 :\r\n magic_powder_needed = 0\r\n x = min(cookies)\r\n shortage = [i for i, y in enumerate(cookies) if y == x]\r\n if len(shortage) == len(req_ingredients):\r\n x = x + m//sum(req_ingredients) \r\n break\r\n else:\r\n for z in shortage:\r\n magic_powder_needed = magic_powder_needed + req_ingredients[z] - leftover[z]\r\n cookies[z] = cookies[z] + 1\r\n leftover[z] = 0\r\n\r\n m = m - magic_powder_needed\r\n\r\nprint(x)", "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ndef checker(m):\r\n req = []\r\n net = 0\r\n for i in range(n):\r\n req.append(max(0, m*a[i]-b[i]))\r\n net += req[i]\r\n return net <= k\r\nl = 0\r\nh = 1e15\r\nwhile l <= h:\r\n m = (l+h)//2\r\n if checker(m):\r\n ans = m\r\n l = m+1\r\n else:\r\n h = m-1\r\nprint(int(ans))", "n,k = map(int,input().split())\r\nrequired = list(map(int,input().split()))\r\nhas = list(map(int,input().split()))\r\nleft=0\r\nright = 10**9\r\ndef check(x,k):\r\n for i in range(n):\r\n val = has[i]-required[i]*x\r\n if val>=0:\r\n continue\r\n val *=-1\r\n if val<=k:\r\n k-=val\r\n else:\r\n return 0\r\n return 1\r\nwhile(left<=right):\r\n mid = (left+right)//2\r\n if (check(mid,k)):\r\n left=mid+1\r\n ans = mid\r\n else:\r\n right=mid-1\r\nprint(ans)\r\n", "n, k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nif n == 1:\r\n b[0] += k\r\n print(b[0] // a[0])\r\nelse:\r\n y = zip(a,b)\r\n r = sorted(y, key = lambda x : (x[1] // x[0], x[0]))\r\n while k != 0:\r\n d = abs((r[0][1] // r[0][0]) - (r[1][1] // r[1][0]))\r\n if d <= k :\r\n if d == 0:\r\n d = 1\r\n r[0] = (r[0][0], r[0][1] + d)\r\n else:\r\n r[0] = (r[0][0], r[0][1] + d)\r\n else:\r\n r[0] = (r[0][0], r[0][1] + k)\r\n k -= d\r\n r = sorted(r, key = lambda x : (x[1] // x[0], x[0]))\r\n print((r[0][1] // r[0][0]))", "def val(x):\r\n ans = 0\r\n for i in range(n):\r\n ans += max(lst1[i]*x - lst2[i],0)\r\n \r\n return ans\r\n\r\n\r\nn,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nlst1 = list(map(int,input().split()))\r\nlst2 = list(map(int,input().split()))\r\n\r\ni = 0\r\nj = pow(10,9)\r\nwhile(i<j-1):\r\n mid = (i+j)//2\r\n if val(mid) > k:\r\n j = mid-1\r\n elif val(mid) < k:\r\n i = mid\r\n else:\r\n i = mid\r\n\r\nif val(j) <= k:\r\n print(j)\r\nelif val(i) <= k:\r\n print(i)\r\nelse:\r\n print(0)\r\n", "N, K = map(int, input().split())\nA = [int(n) for n in input().split()]\nB = [int(n) for n in input().split()]\nl = 1\nr = max(B)*K+1\nans = 0\n\nwhile l <= r:\n temp = K\n mid = (l + r) // 2\n for i in range(N):\n if B[i] < (mid * A[i]):\n temp -= (mid * A[i] - B[i])\n\n if temp < 0:\n r = mid - 1\n else:\n ans = mid\n l = mid + 1\nprint(ans)\n \t\t\t\t \t \t \t\t \t\t\t\t \t \t\t\t \t\t", "import math\r\n\r\nn, k = map(int, input().split())\r\n\r\nrecipe = [int(z) for z in input().split()]\r\ninventory = [int(z) for z in input().split()]\r\n\r\nm = 0\r\nfor i in range(n):\r\n m = max(m, math.ceil((inventory[i] + k) // recipe[i]))\r\n\r\nonecookie = sum(recipe)\r\nans = 0\r\nleft = 0\r\nright = m+1\r\noldc = 0\r\nwhile left <= right:\r\n kneeded = 0\r\n c = (left + right) // 2\r\n if oldc == c:\r\n print(c)\r\n exit()\r\n for i in range(n):\r\n kneeded += max(0, recipe[i] * c - inventory[i])\r\n\r\n if kneeded == k:\r\n break\r\n elif kneeded > k:\r\n right = c\r\n elif kneeded < k:\r\n left = c\r\n\r\n oldc = c\r\n\r\n #print(c, left, right, kneeded)\r\n\r\nprint(c)", "def pos(a,b,m,x):\r\n\tfor i in range(len(a)):\r\n\t\tif b[i]<(x*a[i]):\r\n\t\t\tm-=((x*a[i])-b[i])\r\n\treturn m>=0\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nlo=0\r\nf=[]\r\nf.append(m)\r\nhi=100000000000\r\nwhile lo<hi:\r\n\tmid=(lo+hi)//2\r\n\tm=f[0]\r\n\tif pos(a,b,m,mid):\r\n\t\tlo=mid+1\r\n\t\tans=mid\r\n\telse:\r\n\t\thi=mid-1\r\nm=f[0]\r\nif pos(a,b,m,lo):\r\n\tprint(lo)\r\nelse:\r\n\tprint(ans)", "from collections import Counter\r\n\r\nn, r= map(int, input().split())\r\na= list(map(int, input().split()))\r\nb= list(map(int, input().split()))\r\n\r\n\r\ndef price(num):\r\n sum=0\r\n for i in range(n):\r\n sum+=max(a[i]*num-b[i],0)\r\n return sum\r\n\r\nlow=0\r\nhigh=r+1000\r\nmid=0\r\nans=0\r\n\r\nwhile(low<=high):\r\n mid= (low+high)//2\r\n \r\n z=price(mid)\r\n \r\n if(z==r):\r\n ans=mid\r\n break\r\n elif(z<r):\r\n low= mid+1\r\n ans=mid\r\n else:\r\n high=mid-1\r\n \r\nprint(ans)\r\n", "n, k=map(int,input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nans = 0\r\nwhile True:\r\n\tfor i in range(n):\r\n\t\tif b[i]<a[i]:\r\n\t\t\tk-=a[i]-b[i]\r\n\t\t\tb[i]=a[i]\r\n\t\tb[i]-=a[i]\r\n\tif k>=0:\r\n\t\tans+=1\r\n\telse: break\r\nprint(ans)", "n,k = 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\nlow = 0 \r\nhigh = 10**9 \r\nans = 0\r\nwhile low <= high :\r\n mid = low + (high-low)//2 \r\n k1 = k \r\n f = 0\r\n for i in range(n) :\r\n if a[i]*mid > b[i] :\r\n if a[i]*mid - b[i] <= k1 :\r\n k1 = k1 - (a[i]*mid-b[i]) \r\n else :\r\n f = 1 \r\n break \r\n if not f :\r\n ans = max(ans,mid) \r\n low = mid + 1 \r\n else :\r\n high = mid - 1 \r\nprint(ans)", "# Wadea #\r\n\r\nn,k = map(int,input().split())\r\narr1 = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\nans = 0\r\nl = 1\r\nr = 2000\r\nwhile l <= r:\r\n mid = int((l+r) / 2)\r\n temp = k\r\n for j in range(n):\r\n need = arr1[j] * mid\r\n if need > arr2[j]:\r\n temp -= need - arr2[j]\r\n if temp >= 0:\r\n ans = mid \r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\nprint(ans)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\ndc = defaultdict(list)\r\nn, k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nfor i in range(n) :\r\n x = b[i]//a[i]\r\n if len(dc[x]) == 0 :\r\n dc[x].append((x+1)*a[i] - b[i])\r\n dc[x].append(a[i])\r\n else :\r\n dc[x][0] += (x+1)*a[i] - b[i]\r\n dc[x][1] += a[i]\r\nls = []\r\nfor i, j in dc.items() :\r\n ls.append([i,j[0],j[1]])\r\nls.sort()\r\ni, ans = 0, ls[0][0]\r\nwhile i < len(ls) :\r\n if i+1 != len(ls) and k >= ls[i][1] + (ls[i+1][0]-ls[i][0]-1)*ls[i][2] :\r\n k -= ls[i][1] + (ls[i+1][0]-ls[i][0]-1)*ls[i][2]\r\n ls[i+1][1] += ls[i][2]\r\n ls[i+1][2] += ls[i][2]\r\n ans = ls[i+1][0] \r\n else :\r\n if k >= ls[i][1] :\r\n k -= ls[i][1]\r\n ans += 1\r\n ans += k//ls[i][2]\r\n break\r\n i += 1\r\nprint(ans)", "import bisect\r\nn,k=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\nb=[[b[i]//a[i],a[i]-b[i]%a[i],a[i]] for i in range(n)]\r\nb.sort(key=lambda x:[x[0],x[1]])\r\n\r\nwhile True:\r\n\r\n x=b.pop(0)\r\n prev=x[1]\r\n if prev!=x[2]:\r\n x[1]=x[2]\r\n \r\n if k>=prev:\r\n k-=prev\r\n x[0]+=1\r\n bisect.insort(b,x)\r\n else:\r\n bisect.insort(b,x)\r\n break\r\n\r\nprint(b[0][0])\r\n \r\n \r\n \r\n \r\n ", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ndef ok(x):\r\n req = 0\r\n for i in range(n): req += max(x*a[i] - b[i], 0)\r\n return req <= k\r\n\r\nl = 0; r = 2000\r\nans = 0\r\nwhile l <= r:\r\n mid = (l+r)//2\r\n if ok(mid):\r\n ans = mid\r\n l = mid + 1\r\n else: r = mid - 1\r\n\r\nprint(ans)", "from sys import exit\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na2=a.copy()\r\nk2=k\r\nc=0\r\nL=1\r\nR=5000\r\nwhile L<=R:\r\n mid=(L+R)//2\r\n for i in range(n):\r\n need=a[i]*mid\r\n if need>b[i]:\r\n k-=(need-b[i])\r\n if k<0:\r\n R=mid-1\r\n break\r\n if k>=0:\r\n if i==n-1:\r\n L=mid+1\r\n c=max(c,mid)\r\n k=k2 \r\nprint(c) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nlo = 0\r\nhi = 10000000000\r\n\r\nwhile lo <= hi:\r\n mid = (lo + hi)//2\r\n c = 0\r\n for i in range(n):\r\n if mid*a[i] > b[i]:\r\n c += mid*a[i] - b[i]\r\n\r\n if c <= k:\r\n lo = mid + 1\r\n else:\r\n hi = mid - 1\r\n\r\nprint(lo - 1)", "l1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl3=list(map(int,input().split()))\r\ndef fn(j):\r\n s=0\r\n for i in range(len(l2)):\r\n q1=min(l3[i]-(j*l2[i]),0)\r\n s+=abs(q1)\r\n if(s<=l1[1]):\r\n return 1\r\n else:\r\n return 0\r\np1=0\r\np2=5000\r\nwhile(p1<=p2):\r\n m=int((p1+p2)/2)\r\n #print(m)\r\n if(fn(m)==1 and fn(m+1)==0):\r\n print(m)\r\n break\r\n if(fn(m)==1 and fn(m+1)==1):\r\n p1=m+1\r\n else:\r\n p2=m-1\r\n", "def check(ans,a,b,k):\r\n for i in range(len(a)):\r\n if a[i]*ans<=b[i]:\r\n pass\r\n else:\r\n do=ans*a[i] - b[i]\r\n k-=do\r\n if k<0:\r\n return False\r\n \r\n \r\n return True\r\n \r\n\r\nres=0\r\nn,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nlow=0\r\nhigh=10**9\r\nwhile low<=high:\r\n mid=(low+high)//2\r\n final=check(mid,a,b,k)\r\n #print(mid,final)\r\n if final:\r\n res=mid\r\n low=mid+1\r\n else:\r\n high=mid-1\r\nprint(res)", "import sys\nimport math\nfrom bisect import bisect_left as bl\n\ndef int_arr(): return list(map(int, sys.stdin.readline().split()))\n\ndef str_arr(): return list(map(str, sys.stdin.readline().split()))\n\ndef input(): return sys.stdin.readline().strip()\nmod=1000000007\n\ndef ch():\n\tglobal ext ,mx,p\n\tfor j in range(n):\n\t\tif mx[j]<f_one[j]:\n\t\t\tdiff=f_one[j]-mx[j]\n\t\t\tif diff<=p:\n\t\t\t\tmx[j]+=diff\n\t\t\t\tp-=diff\n\t\t\telse:\n\t\t\t\treturn 0\n\t\t\t\tbreak\n\t\n\tfor i in range(n):\n\t\tmx[i]=mx[i]-f_one[i]\n\text+=1\n\n\t\n\nn,p=int_arr()\nf_one=int_arr()\nmx=int_arr()\n\nmn=float('inf')\next=0\nfor i in range(n):\n\tmn=min(mn,mx[i]//f_one[i])\n\n\nfor i in range(n):\n\tmx[i]=mx[i]-f_one[i]*mn\n\nrecr=1\nwhile recr!=0:\n\trecr=ch()\n\t\nprint(mn+ext)", "def check(mid):\n needed=0\n for i in range(n):\n if (mid * y[i]) > z[i]:\n needed+=(mid * y[i])-z[i]\n if needed > x:\n return False\n else:\n return True\n \ndef bs():\n left=0\n right=1000000000000000000\n \n while left<right:\n \n mid=((left+right+1)//2)\n \n if check(mid)==True:\n left=mid ## min --> add +1\n elif check(mid)==False:\n right=mid-1 ## min --> remove -1\n return right\n \n \nn,x=list(map(int,input().split()))\ny=list(map(int,input().split()))\nz=list(map(int,input().split()))\n \nprint(bs())\n \t \t\t \t \t \t\t\t\t \t \t\t\t \t \t \t\t", "n,k = map(int, input().split())\nreqs = list(map(int, input().split()))\ningr = list(map(int, input().split()))\n\ni,j = 0,100000000\n\nwhile i<j:\n mid = (i+j)//2\n tot = sum([max(0, (reqs[x]*mid-ingr[x])) for x in range(n)])\n if tot < k:\n i = mid+1\n else:\n j = mid\n\nif sum([max(0, (reqs[x]*i-ingr[x])) for x in range(n)]) > k:\n print(i-1)\nelse:\n print(i)", "n,k = input().split()\r\nn=int(n)\r\nk=int(k)\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\n\r\n\r\nfor i in range(0,n):\r\n b[i] = int(b[i])\r\n\r\nc=[0]* n\r\nlow = 0\r\nhigh = k+1005\r\nwhile low<=high:\r\n \r\n mid = low + (high-low)//2\r\n #mid is the number of cookies that can be made\r\n for i in range(0,len(a)):\r\n c[i] = max(a[i]*mid-b[i],0)\r\n \r\n req = sum(c)\r\n if req<=k:\r\n low = mid+1\r\n else:\r\n high = mid-1\r\n \r\nprint(high)\r\n \r\n \r\n \r\n", "n,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nans=0\nwhile k>=0:\n ans+=1\n for i in range(n):\n b[i]-=a[i]\n if b[i]<0:k+=b[i];b[i]=0\nprint(ans-1)\n \n\t\t \t\t \t \t \t \t \t\t\t\t \t \t", "n, k = map(int, input().split())\r\n\r\nings = list(map(int, input().split()))\r\nhave = list(map(int, input().split()))\r\n\r\n\r\ndef ok(amount):\r\n temp = k\r\n for idx, ing in enumerate(ings):\r\n needed = ing * amount\r\n temp -= (max(0, needed - have[idx]))\r\n\r\n if temp < 0:\r\n return False\r\n \r\n return True\r\n\r\n\r\nleft, right = 0, 10**20\r\nbest = 0\r\n\r\nwhile left <= right:\r\n mid = (left + right)//2\r\n\r\n if ok(mid):\r\n best = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\nprint(best)\r\n\r\n", "n,k=list(map(int,input().split()))\r\nneeded=list(map(int,input().split()))\r\nhave=list(map(int,input().split()))\r\ndef helper(mid):\r\n must=0\r\n for i in range(len(have)):\r\n if ((needed[i]*mid)-have[i])>0:\r\n must+=((needed[i]*mid)-have[i])\r\n return must<=k\r\n\r\n\r\n\r\n\r\n\r\n# print(helper())\r\n\r\n\r\nl,r=0,2001\r\nwhile l<=r:\r\n mid=(l+r)//2\r\n # print(l,r,mid,helper(mid))\r\n cost=0\r\n for i in range(n):\r\n cost+=max(needed[i]*mid-have[i],0)\r\n \r\n \r\n if cost<=k:\r\n l=mid+1\r\n else:\r\n r=mid-1\r\nprint(r)\r\n\r\n", "n,k=map(int,input().split())\r\n\r\nreq=list(map(int,input().split()))\r\nhas=list(map(int,input().split()))\r\n\r\ndef possible(mid):\r\n final=[]\r\n for ele1,ele2 in zip(req,has):\r\n final.append(max(0,ele1*mid-ele2))\r\n x=sum(final)\r\n if x<=k:\r\n return True\r\n return False\r\nlow=0\r\nhigh=10**5\r\nans=54534\r\nwhile low<=high:\r\n mid=(low+high)>>1\r\n if possible(mid)==True:\r\n ans=mid\r\n low=mid+1\r\n else:\r\n high=mid-1\r\nprint(ans)\r\n", "import math\r\nfor _ in range(1):\r\n n,k=map(int,input().split())\r\n l1=list(map(int,input().split()))\r\n l2=list(map(int,input().split()))\r\n l=0\r\n r=2*10**9\r\n while(l<r):\r\n mid=(l+r+1)//2\r\n sum1=0\r\n for i in range(n):\r\n sum1+=max(mid*l1[i]-l2[i],0)\r\n if sum1>k:\r\n r=mid-1\r\n else:\r\n l=mid\r\n print(l) \r\n \r\n ", "\r\n\r\ns=input().split()\r\nn,k=map(int,s)\r\ns=input().split()\r\n\r\na=list(map(int,s))\r\n\r\ns=input().split()\r\n\r\nb=list(map(int,s))\r\n\r\nlow=0\r\nhigh=200000000000\r\nans=0\r\nwhile low<=high:\r\n\r\n mid=low + (high-low)//2\r\n\r\n sumval=0\r\n for i in range(n):\r\n sumval+=max(0,a[i]*mid-b[i])\r\n # print(low,high,mid,sumval,k)\r\n \r\n if sumval==k:\r\n ans=mid\r\n break\r\n elif sumval<k:\r\n low=mid+1\r\n ans=mid\r\n else:\r\n high=mid-1\r\n ans=high\r\n\r\nprint(ans)", "def check(need):\r\n global a\r\n global b\r\n global k\r\n ind = 0\r\n kCur = k\r\n while ind < len(a):\r\n needK = a[ind] * need\r\n if needK <= b[ind]:\r\n ind += 1\r\n continue\r\n if kCur < needK - b[ind]:\r\n return 0\r\n kCur -= needK - b[ind]\r\n ind += 1\r\n return 1\r\ndef bin_search(low, high):\r\n mid = (low + high) // 2\r\n if low == high:\r\n return low\r\n if low + 1 == high:\r\n if check(high):\r\n return high\r\n return low\r\n if check(mid + 1):\r\n return bin_search(mid, high)\r\n return bin_search(low, mid)\r\nn, k = [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\nans = bin_search(0, 10000)\r\nprint(ans)", "n, k = map(int, input().split())\r\nlis1 = list(map(int, input().split()))\r\nlis2 = list(map(int, input().split()))\r\n\r\n\r\n# s = list(input())\r\n# nb, ns, nc = map(int, input().split())\r\n# pb, ps, pc = map(int, input().split())\r\n# n = int(input())\r\n# rb, rs, rc = 0, 0, 0\r\n# for i in s:\r\n# if i == 'B':\r\n# rb += 1\r\n# elif i == 'S':\r\n# rs += 1\r\n# else:\r\n# rc += 1\r\n\r\n\r\ndef solve(mid):\r\n lis = []\r\n for i in range(n):\r\n temp = lis1[i] * mid - lis2[i]\r\n if temp > 0:\r\n lis.append(temp)\r\n else:\r\n lis.append(0)\r\n return sum(lis) <= k\r\n\r\n\r\nlow = 0\r\nhigh = 10000\r\nans = 0\r\nwhile low <= high:\r\n mid = (low + high) // 2\r\n if solve(mid):\r\n ans = mid\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\nprint(ans)\r\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef cookies(n, k, A, B):\n def cfn(a, b):\n q, r = divmod(b, a)\n return q, a - r, a\n\n L = sorted(cfn(A[i], B[i]) for i in range(n))\n c = 0\n p = 0\n q = 0\n for ci, pi, ai in L:\n if ci == c:\n p += pi\n q += ai\n continue\n if p > k:\n return c\n k -= p\n c += 1\n dk = q * (ci - c)\n if dk >= k:\n c += k // q\n return c\n k -= dk\n c = ci\n p = q + pi\n q += ai\n\n if p > k:\n return c\n k -= p\n c += 1\n c += k // q\n return c\n\n\ndef main():\n n, k = readinti()\n A = readintl()\n B = readintl()\n print(cookies(n, k, A, B))\n\n##########\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.__stderr__)\n\n\nif __name__ == '__main__':\n main()\n", "\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\ncnt = 0\r\nwhile True:\r\n for i in range(n):\r\n if b[i] >= a[i]:\r\n b[i] -= a[i]\r\n else:\r\n m -= (a[i] - b[i])\r\n b[i] = 0\r\n\r\n if m >= 0:\r\n \r\n cnt += 1\r\n else:\r\n \r\n break\r\n\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput=sys.stdin.readline\r\ning,sug=map(int,input().split())\r\nwan = list(map(int,input().split()))\r\nhave = list(map(int,input().split()))\r\ningr = [0]*(ing)\r\nfor i in range(ing):\r\n ingr[i]=[have[i]//wan[i],wan[i],have[i]%wan[i],have[i]]\r\ndef valid(mid,sug):\r\n for i in range(ing):\r\n k = 0\r\n if ingr[i][0]>=mid:\r\n continue\r\n if (ingr[i][-1]>ingr[i][1] or (ingr[i][1]-ingr[i][2])<=sug):\r\n if ingr[i][-1]>ingr[i][1]:\r\n sug-=(ingr[i][1]-ingr[i][2])\r\n \r\n else:\r\n sug-=(ingr[i][1]-ingr[i][2])\r\n k = 1\r\n if ((mid-ingr[i][0]-k)*ingr[i][1])<=sug:\r\n sug-=((mid-ingr[i][0]-k)*ingr[i][1])\r\n else:\r\n return False\r\n if sug<0:\r\n return False\r\n else:\r\n return True\r\nl,r=0,int(1e15)\r\nposs = 0\r\nwhile l<=r:\r\n mid = (l+r)//2\r\n if valid(mid,sug):\r\n l = mid+1\r\n poss = mid\r\n else:\r\n r = mid-1\r\nprint(poss)", "n, k= map(int, input().split())\r\na = list(map(int, input().split())) \r\nb=list(map(int,input().split()))\r\nc=-1\r\nwhile k>=0:\r\n c+=1\r\n for i in range(n):\r\n\r\n b[i]-=a[i]\r\n if b[i]<0:\r\n\r\n k+=b[i]\r\n b[i] = 0\r\nprint(c)\r\n", "n,k=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\ndef possible(m):\r\n k1=k\r\n for i in range(n):\r\n \r\n if a[i]*m>b[i]:\r\n k1-=(a[i]*m-b[i])\r\n \r\n if k1>=0:\r\n return True\r\n return False\r\n \r\nl=0\r\nr=2e9+1\r\nans=0\r\nwhile l<=r:\r\n \r\n m=(l+r)//2\r\n if possible(m):\r\n l=m+1\r\n ans=m\r\n else:\r\n r=m-1\r\n\r\nprint(int(ans))", "n, k = map(int,input().split())\r\ngrams_for_one = list(map(int,input().split()))\r\ntotal_grams = list(map(int,input().split()))\r\n\r\nl, r = 1, 10**9\r\nans = 0\r\n\r\nwhile l<=r:\r\n mid = (l+r)//2\r\n count = 0\r\n for i in range(n):\r\n required = grams_for_one[i]*mid\r\n given = total_grams[i]\r\n if required > given:\r\n count += required-given\r\n if count > k:\r\n break\r\n \r\n if count <= k:\r\n ans = mid\r\n l = mid+1\r\n else:\r\n r = mid-1\r\n \r\nprint(ans)", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,floor,ceil\r\nfrom collections import defaultdict\r\nimport random\r\n# Fast I/O\r\ninput = stdin.readline\r\n#print = stdout.write\r\n\r\ndef list_inp(x):return list(map(x,input().split()))\r\ndef map_inp(x):return map(x,input().split())\r\n\r\ndef lcm(a,b): return (a*b)/gcd(a,b)\r\n\r\n\r\n\r\ns,rubs = map_inp(int)\r\na = list_inp(int)\r\nb = list_inp(int)\r\n\r\nl = 0\r\nr = int(2e9) + 10000\r\n\r\n\r\nwhile l < r-1:\r\n mid = (l+r) // 2\r\n sumi = sum(max(a[i]*mid - b[i],0) for i in range(s))\r\n if sumi <= rubs:\r\n l = mid\r\n else:\r\n r = mid\r\nprint(l)\r\n", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nl = 0\r\nr = 10 ** 10\r\nwhile r - l > 1:\r\n m = (r + l) // 2\r\n x = 0\r\n for i in range(n):\r\n tr = A[i] * m - B[i]\r\n x += max(tr, 0)\r\n if x > k:\r\n r = m\r\n else:\r\n l = m\r\nprint(l)", "n,k=[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\nc=0\r\nwhile(1):\r\n for i in range(n):\r\n if b[i]>=a[i]:\r\n b[i]-=a[i]\r\n else:\r\n k=k-(a[i]-b[i])\r\n b[i]=0\r\n if k>=0:\r\n c+=1\r\n else:\r\n break\r\nprint(c)\r\n \r\n", "n,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\n\r\nc=0\r\nflag=False\r\nwhile(1):\r\n for i in range(n):\r\n y[i]-=x[i]\r\n if y[i]<0 and k<abs(y[i]):\r\n flag=True\r\n break\r\n elif y[i]<0:\r\n if k>=abs(y[i]):\r\n k+=y[i]\r\n y[i]=0\r\n else:\r\n k=0\r\n\r\n # print(y)\r\n\r\n if flag:\r\n break\r\n # if k==0:\r\n # break\r\n c+=1\r\nprint(c)", "n,k = list(map(int, input().split())) \r\ningredientReqd = list(map(int,input().split()))\r\ningredientHas = list(map(int,input().split()))\r\n\r\ndef isValid(num):\r\n reqd = [ingredientReqd[i]*num - ingredientHas[i] for i in range(len(ingredientHas))]\r\n for i in range((len(reqd))):\r\n if reqd[i] <0:\r\n reqd[i] = 0\r\n if sum(reqd) <= k:\r\n return True\r\n else:\r\n return False\r\n \r\nleft = 0\r\nright = 1000000\r\nwhile left<=right:\r\n mid = left + (right-left)//2\r\n if isValid(mid):\r\n left = mid+1\r\n else:\r\n right = mid-1\r\nprint(right)", "import math\n\nclass Solution:\n\n\tdef numCookies(self, n, k, recepie, ingredients):\n\n\t\tnumC = 0\n\n\t\twhile True:\n\n\t\t\tfor i in range(n):\n\t\t\t\tx = ingredients[i] - recepie[i]\n\n\t\t\t\tif x > 0:\n\t\t\t\t\tingredients[i] -= recepie[i]\n\t\t\t\telse:\n\t\t\t\t\tif k < -x:\n\t\t\t\t\t\tprint(numC)\n\t\t\t\t\t\treturn\n\t\t\t\t\telse:\n\t\t\t\t\t\tk += x\n\t\t\t\t\t\tingredients[i] = 0\n\n\t\t\tnumC += 1\n\n\t\tprint(numC)\n\t\treturn\n\t\n\ndef main():\n\tn, k = list(map(int, input().strip().split()))\n\n\trecepie = list(map(int, input().strip().split()))\n\tingredients = list(map(int, input().strip().split()))\n\n\tsol = Solution()\n\n\tsol.numCookies(n, k, recepie, ingredients)\n\n\nif __name__ == '__main__':\n\n\tmain()", "'''I = lambda: [int(i) for i in input().split()]\r\nimport io, os, sys\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline'''\r\n\r\n#n,k = map(int,input().split())\r\n#n,m = map(int,input().split())\r\n\r\n\r\nn,k = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\n\r\nl = 1\r\nr = 10**13\r\na = 0\r\n\r\ndef f(x):\r\n sum1=0\r\n for i in range(n):\r\n b = max(0,(l1[i]*x)-l2[i])\r\n sum1+=b\r\n\r\n\r\n return sum1\r\n\r\nwhile(l<=r):\r\n m =l +(r-l)//2\r\n if f(m)<=k:\r\n a = m\r\n l = m+1\r\n else:\r\n r =m-1\r\n\r\nprint(a)\r\n \r\n", "n, k = list(map(int, input().split()))\r\ning = list(map(int, input().split()))\r\nqnty = list(map(int, input().split()))\r\n\r\nimport heapq\r\n\r\nans = []\r\nfor i in range(n):\r\n ans.append([qnty[i]//ing[i], i])\r\n\r\nheapq.heapify(ans)\r\n\r\nwhile k:\r\n _, i = heapq.heappop(ans)\r\n qnty[i] += 1\r\n k -= 1\r\n heapq.heappush(ans, [qnty[i]//ing[i], i])\r\n\r\ntemp, i = heapq.heappop(ans)\r\n\r\nprint(temp)\r\n\r\n", "from math import ceil\r\nn,k = map(int,input().split())\r\narr =[]\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nfor i in range(n):\r\n x = ceil(b[i]/a[i])\r\n s = (a[i])*x\r\n s = s-b[i]\r\n if s==0:\r\n s = a[i]\r\n arr.append([b[i]//a[i],s,i])\r\nwhile k>0:\r\n x = min(arr,key = lambda x:(x[0],x[1]))\r\n if k>=x[1]:\r\n temp = x[0]\r\n x[0]+=1\r\n k-=x[1]\r\n x[1] = a[x[2]]\r\n else:\r\n break\r\nprint(min(arr,key = lambda x:x[0])[0])\r\n", "def check(mid, n, k, ratio, available):\r\n c = 0\r\n for i in range(n):\r\n c += max(0, mid * ratio[i] - available[i])\r\n if c <= k:\r\n return True\r\n return False\r\n\r\n\r\nn, k = map(int, input().split())\r\nratio = list(map(int, input().split()))\r\navailable = list(map(int, input().split()))\r\n\r\nlow = 0\r\nhigh = pow(10, 14)\r\nans = 0\r\nwhile (low <= high):\r\n mid = (low + high) // 2\r\n if check(mid, n, k, ratio, available):\r\n ans = mid\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\nprint(ans)", "n, m = map(int, input().split())\nnums = list(map(int, input().split()))\nnums1 = list(map(int, input().split()))\n\n\ndef helper(x):\n res = 0\n for num, num1 in zip(nums, nums1):\n res += max(num*x - num1, 0)\n return res <= m\n\n\nif helper(1):\n x = 1\n while helper(x):\n x *= 2\n l, r = x//2, x\n while l <= r:\n mid = l + (r - l)//2\n if helper(mid):\n l = mid+1\n else:\n r = mid-1\n print(r)\n\nelse:\n print(\"0\")\n", "import sys\r\n# sys.stdin = open(\".in\", \"r\")\r\n# sys.stdout = open(\".out\", \"w\")\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\ndef map_int():\r\n return map(int, input().split())\r\ndef list_int():\r\n return list(map(int, input().split()))\r\nfrom collections import defaultdict, deque\r\nfrom math import log\r\n\r\n\r\ndef can_make(x):\r\n global have, required, k\r\n magic_powder = k\r\n for i in range(n):\r\n magic_powder -= max(0, (x*required[i] - have[i]))\r\n if magic_powder < 0: return False\r\n return True\r\n\r\nn, k = map_int()\r\nrequired = list_int()\r\nhave = list_int()\r\nl, r = 0, 10000000000\r\nanswer = 0\r\nwhile l <= r:\r\n mid = l + (r-l)//2\r\n if can_make(mid):\r\n answer = mid\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n\r\nprint(answer)", "n,money=list(map(int,input().split()))\r\nreqs=list(map(int,input().split()))\r\nhave=list(map(int,input().split()))\r\n\r\ndef check(x):\r\n s=0\r\n for i in range(n):\r\n s+=max(0,reqs[i]*x-have[i])\r\n return s\r\n\r\n \r\n\r\ncookies=0\r\nl=1\r\nr=10**20\r\n\r\nwhile l<=r:\r\n\r\n x = (l+r)//2\r\n if check(x)>money:\r\n r = x-1\r\n else:\r\n if check(x+1)>money:\r\n cookies = x\r\n break\r\n else:\r\n l = x+1\r\nprint(cookies)\r\n", "def can_make(m):\r\n c=0\r\n for i in range(len(l)):\r\n if((l[i]*m)>l2[i]):\r\n c+=((l[i]*m)-l2[i])\r\n if(c<=k):\r\n return True\r\n else:\r\n return False\r\n \r\nn,k=map(int,input().split())\r\n# print(n,k)\r\nl=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\ns=0\r\nend=10**15\r\nwhile(s<=end):\r\n\tmid=(s+end)//2\r\n\tif(can_make(mid)):\r\n\t\ts=mid+1\r\n\t\tans=mid\r\n\telse:\r\n\t\tend=mid-1 \r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=0\r\nwhile k>=0:\r\n ans+=1\r\n for i in range(n):\r\n b[i]-=a[i]\r\n if b[i]<0:k+=b[i];b[i]=0\r\nprint(ans-1)\r\n ", "n = 0\r\nk = 0\r\n\r\n(n, k) = input().split(\" \")\r\nl1 = input().split(\" \")\r\nl2 = input().split(\" \")\r\n\r\nn = int(n)\r\nk = int(k)\r\n\r\n\r\nfor i in range(0, len(l1)):\r\n\tl1[i] = int(l1[i])\r\n \r\nfor i in range(0, len(l1)):\r\n\tl2[i] = int(l2[i])\r\n\r\ndef can(m):\r\n\tk2 = k;\r\n\tfor i in range(n):\r\n\t\tk2 -= max(l1[i] * m - l2[i], 0)\r\n\t\tif(k2 < 0):\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nl = 0\r\nr = 1000000000\r\n\r\n\r\nwhile(l != r):\r\n\tm = (l + r + 1) // 2;\r\n\tif(can(m)):\r\n\t\tl = m\r\n\telse:\r\n\t\tr = m - 1\r\n\r\nprint(l)\r\n", "from collections import Counter\r\n\r\ndef possible(count,a,b,k):\r\n \r\n for i in range(len(a)):\r\n k-=max(0,a[i]*count-b[i])\r\n if k<0:\r\n return False\r\n return True\r\n\r\nif __name__==\"__main__\":\r\n\r\n n,k = map(int,input().split())\r\n a = list(map(int,input().split()))\r\n b = list(map(int,input().split()))\r\n\r\n low = 0\r\n high = int(1e32)\r\n while low<=high:\r\n mid = (low+high)>>1\r\n if possible(mid,a,b,k):\r\n low = mid+1\r\n else:\r\n high = mid-1\r\n \r\n print(high)\r\n ", "from bisect import bisect_right\ndef put():return list(map(int,input().split()))\nn,k = put()\nlsta, lstb = put(), put()\nlst = [[lstb[i]//lsta[i],lstb[i]%lsta[i],lsta[i]] for i in range(n)]\nlst.sort()\nlsttmp = [lst[i][0]for i in range(n)]\nwhile k > 0:\n x = bisect_right(lsttmp,lsttmp[0]) - 1\n tmp = lst[x][2] - lst[x][1]\n if k - tmp >= 0:\n k -= tmp\n lst[x][1] = 0\n lsttmp[x] += 1\n else:\n break\nprint(min(lsttmp))\n\t \t \t\t \t \t \t\t\t\t\t \t \t", "n,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nl=1; r=10**18\r\ndef checker(mid):\r\n tmp=k;\r\n for i in range(n):\r\n if((x[i]*mid) > y[i]):\r\n tmp-=(x[i]*mid)-y[i];\r\n return(tmp>=0);\r\nwhile r>=l:\r\n mid=(l+r)//2\r\n if(checker(mid)):\r\n l=mid+1\r\n else:\r\n r=mid-1\r\nprint(l-1)", "def check(a,b,x):\r\n s,n=0,len(a)\r\n for i in range(n):\r\n s+=max(0,a[i]*x-b[i])\r\n return s<=k\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nl,r=0,int(2e9+1)\r\nwhile l<r:\r\n m=(l+r)//2+1\r\n if check(a,b,m): \r\n l=m\r\n else:\r\n r=m-1\r\nprint(l)", "n,p=map(int,input().split())\r\narr=[int(arr) for arr in input().split()]\r\narr2=[int(arr) for arr in input().split()]\r\nsub=[arr2[i]//arr[i] for i in range(n)]\r\nwhile p>0:\r\n m=min(sub)\r\n a=sub.index(m)\r\n if((arr[a]-(arr2[a]-(m*arr[a])))<=p):\r\n sub[a]=sub[a]+1\r\n p=p-(arr[a]-(arr2[a]-(m*arr[a])))\r\n arr2[a]=arr2[a]+(arr[a]-(arr2[a]-(m*arr[a])))\r\n else:\r\n break\r\nprint(min(sub))", "n,k = [int(i) for i in input().strip().split()]\r\na = [int(i) for i in input().strip().split()]\r\nb = [int(i) for i in input().strip().split()]\r\ncookies = min([b[i]//a[i] for i in range(n)])\r\nif cookies:\r\n b = [b[i]-a[i]*cookies for i in range(n)]\r\nlo = 0\r\nhi = k\r\nans = 0\r\nwhile lo<=hi:\r\n mid = (lo+hi)//2\r\n req = 0\r\n for i in range(n):\r\n req+=max(0,a[i]*mid-b[i])\r\n if req<=k:\r\n ans = mid\r\n lo = mid+1\r\n else:\r\n hi = mid-1\r\nprint(cookies+ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef binarysearch(start:int,end:int):\r\n while start < end:\r\n \r\n mid = start + (end + 1 - start)//2\r\n cnt = 0\r\n \r\n for i in range(0,n):\r\n cnt += max(0,mid*req[i]-pre[i])\r\n \r\n if cnt > k:\r\n end = mid - 1\r\n else:\r\n start = mid\r\n \r\n return start\r\n \r\nn,k = [int(x) for x in input().split()]\r\nreq = [int(x) for x in input().split()]\r\npre = [int(x) for x in input().split()]\r\n\r\nc = sum(req)\r\nd = sum(pre)\r\n\r\nprint(binarysearch(0,(d+k)//c))", "n,k=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\n\r\nval=0\r\nans=0\r\nwhile val<k:\r\n for i in range(n):\r\n if val<=k:\r\n if a[i]<=b[i]:\r\n b[i]-=a[i]\r\n else:\r\n val+=(a[i]-b[i])\r\n b[i]=0\r\n if val<=k:\r\n ans+=1\r\n\r\nprint(ans) ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_search(c1, c2):\r\n m = (c1 + c2 + 1) // 2\r\n while abs(c1 - c2) > 1:\r\n m = (c1 + c2 + 1) // 2\r\n if ok(m):\r\n c1 = m\r\n else:\r\n c2 = m\r\n m += 1\r\n while not ok(m):\r\n m -= 1\r\n return m\r\n\r\ndef ok(m):\r\n c = 0\r\n for i, j in zip(a, b):\r\n c += max(i * m - j, 0)\r\n return True if c <= k else False \r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ninf = 3 * pow(10, 9) + 1\r\nans = binary_search(0, inf)\r\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = 0\r\nwhile True:\r\n i = 0\r\n while i < n:\r\n if b[i] < a[i]:\r\n k -= (a[i] - b[i])\r\n b[i] = 0\r\n else:\r\n b[i] -= a[i]\r\n i += 1\r\n if k < 0:\r\n break\r\n c += 1\r\nprint(c)\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\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 solve(a , b , mid , mp , n ):\r\n sm = 0\r\n for i in range(n):\r\n if mid * a[i] <= b[i]:\r\n continue\r\n sm += (mid*a[i]) - b[i]\r\n if sm > mp :\r\n return False\r\n return True\r\n\r\n\r\nn , mp = MAP()\r\na = LIST()\r\nb = LIST()\r\nl , r = 0 , 1000000009\r\nwhile l <= r :\r\n midd = l + (r - l)//2\r\n x = solve(a , b , midd , mp , n)\r\n if x == True:\r\n l = midd + 1\r\n else:\r\n r = midd - 1\r\n\r\nprint(r)\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nl = 0\r\nh = 1000 + k\r\nflagged = True\r\nwhile l <= h:\r\n m = (l + h) // 2\r\n need = 0\r\n for ind in range(n):\r\n need += max(a[ind] * m - b[ind], 0)\r\n if need == k:\r\n print(m)\r\n flagged = False\r\n break\r\n elif need < k:\r\n l += 1\r\n else:\r\n h -= 1\r\nif flagged:\r\n print(h)", "n , k = input().split()\r\nn , k = int(n), int(k)\r\nneeded_ings = [int(x) for x in input().split()]\r\navalaible_ings = [int(x) for x in input().split()]\r\ndef ok(cookies):\r\n x = ([(x * cookies) - y for x,y in zip(needed_ings, avalaible_ings)])\r\n sum = 0\r\n for num in x: \r\n if num > 0:\r\n sum += num \r\n return sum <= k \r\n \r\ndef search():\r\n start = 0\r\n end = int(1e15)\r\n ans = -1 \r\n while start <= end:\r\n mid = (start + end) // 2\r\n if ok(mid):\r\n ans = mid\r\n start = mid + 1\r\n else:\r\n end = mid - 1 \r\n return ans \r\nprint(search())\r\n", "v,q=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nans=0\nwhile q>=0:\n ans+=1\n for i in range(v):\n b[i]-=a[i]\n if b[i]<0:q+=b[i];b[i]=0\nprint(ans-1)\n \n\t\t\t\t\t \t\t\t\t \t \t\t\t \t \t\t \t\t", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n\r\n# from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\n# from math import *\r\n\r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\ninf = float(\"inf\") \r\n\r\n\r\nn, k = gil()\r\na, b = gil(), gil()\r\nhave = sum(b)\r\ndemand = sum(a)\r\n\r\ndef isPos(x):\r\n\tdiff = k\r\n\tfor i in range(n):\r\n\t\tdiff += min(0, b[i] - (a[i]*x))\r\n\r\n\treturn diff >= 0\t\r\n\r\n\r\n\r\nl, r = 0, int(2e9)\r\nans = 0\r\n\r\n# l = r+1\r\n\r\nwhile l <= r:\r\n\tmid = (l+r)>>1\r\n\tif isPos(mid):\r\n\t\tans = mid\r\n\t\tl = mid + 1\r\n\telse:\r\n\t\tr = mid - 1\r\n\r\nprint(ans)", "n, k = map(int, input().split())\r\nr = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nc=[]\r\nfor i in range(len(a)):\r\n c.append(a[i]//r[i])\r\ntotal=min(c)\r\nrn=0\r\nfor i in range(len(a)):\r\n a[i] -= r[i]*total\r\n rn = rn if a[i] >= r[i] else rn + r[i] - a[i] \r\nwhile k >= rn:\r\n total += 1\r\n rn2=0\r\n k -= rn\r\n for i in range(len(a)):\r\n a[i] = 0 if a[i] < r[i] else a[i] - r[i]\r\n rn2 = rn2 if a[i] >= r[i] else rn2 + r[i] - a[i] \r\n rn = rn2\r\nprint(total)", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nlow, high = 0, 10 ** 20\r\nans = 0\r\nwhile low <= high:\r\n mid = low + (high - low) // 2\r\n need = 0\r\n for i in range(n):\r\n need += max(0, mid * a[i] - b[i])\r\n if need <= k:\r\n ans = mid\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\nprint(ans)", "def solve():\r\n n, k = map(int, input().split())\r\n \r\n want = list(map(int, input().split()))\r\n have = list(map(int, input().split()))\r\n \r\n l, r = 0, 10**18\r\n ans = 0\r\n while l <= r:\r\n mid = (l + r) // 2\r\n ser = 0\r\n \r\n for i in range(n):\r\n ser += max(0, want[i] * mid - have[i])\r\n \r\n if ser > k or ser < 0:\r\n r = mid - 1\r\n elif ser <= k:\r\n ans = max(ans, mid)\r\n l = mid + 1\r\n \r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n # To read multiple test cases, uncomment the following two lines\r\n # T = int(input())\r\n # for _ in range(T):\r\n solve()", "def f(x,y):\r\n if y==0:\r\n return 0\r\n if x%y!=0:\r\n z=x//y+1\r\n else:\r\n z=x//y\r\n return(z)\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\nd=1000000\r\ne=0\r\nB=0\r\nfor i in range(n):\r\n c=max(c,f(b[i],a[i]))\r\n d=min(d,f(b[i],a[i]))\r\n e+=a[i]\r\n# for i in range(n):\r\n# b[i]-=(d-1)*a[i] \r\nfor i in range(c):\r\n ini=True\r\n for i in range(n):\r\n if (b[i] + k) < a[i]:\r\n ini=False\r\n break\r\n else:\r\n if b[i]>=a[i]:\r\n b[i]-=a[i]\r\n elif (b[i] + k) >= a[i]:\r\n k-=a[i]-b[i]\r\n b[i]=0\r\n else:\r\n ini=False\r\n break\r\n if ini:\r\n B+=1\r\n else:\r\n break\r\nif ini:\r\n B+=k//e\r\nprint(int(B))\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n" ]

[ "from math import pi\r\nX = list(map(int, input().split()))\r\nRainPouring = X[-1] * (X[0] / 2) ** 2 * pi\r\nif RainPouring >= X[-2]: print(\"NO\");exit()\r\nX[-2] -= RainPouring\r\nVolume = X[1] * (X[0] / 2) ** 2 * pi\r\nprint(\"YES\", Volume / X[-2], sep='\\n')\r\n# Caption: With the help of ARPA\r\n", "from math import pi\n\nd,h,v,e = map(float, input().split())\n\nflux_in = d * d * pi / 4 * e\nif (flux_in > v):\n print(\"NO\")\nelse:\n print(\"YES\")\n print(h * d * d * pi / (4 * (v - flux_in)))", "d,h,v,e = map(int, input().split())\r\ndenominator = (4.00 * v) - ((d**2)*e*3.1415926)\r\nif(denominator < 0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n numerator = 3.1415926 * (d**2) * h\r\n answer = numerator/denominator\r\n print(answer)", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import pi\r\n\r\nd, h, v, e = map(int, input().split())\r\n\r\nc = pi*(d/2)**2*e\r\nif v <= c:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(pi*(d/2)**2*h/(v-c))", "import math\r\nd,h,v,e=map(int, input().split())\r\nspeed_of_drinking_water = 4*v/(math.pi*d*d)\r\nif speed_of_drinking_water>e:\r\n answer = h/(speed_of_drinking_water-e)\r\n print('YES')\r\n print(answer)\r\nelse:\r\n print('NO')", "import math\r\n\r\nd, h, v, e = [int(s) for s in input().split()]\r\n\r\nradius = d / 2\r\narea = math.pi * radius * radius\r\nvout = v / area\r\n\r\nif vout > e:\r\n print(\"YES\")\r\n print(h / (vout - e))\r\nelse:\r\n print(\"NO\")\r\n", "from math import pi\nd, h, v, e = input().split()\nd, h, v, e = int(d), int(h), int(v), int(e)\ne1 = v /( pi * (d/2)**2)\nif e1 - e > 0:\n print(\"YES\")\n print(h/(e1-e))\nelse:\n print(\"NO\")\n ", "import math\n\nlimit = 10000\n\ninp = str(input()).split(\" \")\nd = int(inp[0])\nh = int(inp[1])\nv = int(inp[2])\ne = int(inp[3])\n\ninit = h * ((d / 2) ** 2) * math.pi\n\ngrowth = e * ((d / 2) ** 2) * math.pi\n\nif init != 0 and growth >= v:\n print(\"NO\")\n\nelse:\n ans = init / (v - growth)\n print(\"YES\")\n print(\"%.5f\" %ans)\n", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\nfrom math import floor, ceil, pi\r\n\r\n# input = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\nd, h, v, e = read()\r\nc = pi * (d ** 2) / 4\r\nif c * e >= v:\r\n exit(print(\"NO\"))\r\nprint(\"YES\")\r\nprint(c * h / (v - c * e))\r\n", "import math\r\nd, h, v, e = map(int, input().split())\r\na = (d / 2) ** 2 * math.pi\r\nb, c = a * h, a * e\r\nif v < c:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(b / (v - c))", "import math\r\nd,h,v,e = map(int,input().split())\r\nx = ((4*v)/(math.pi * d**2)) - e\r\nif x > 0:\r\n print(\"YES\")\r\n print(h/x)\r\nelse: print(\"NO\")", "import math\r\nd,h,v,e=map(int,input().split())\r\nH=v/(math.pi*((d/2)**2))\r\n\r\nif H-e<0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint((h/(H-e)))\r\n", "import math\n\ndef solve():\n d, h, v, e = map(int, input().split())\n r = d/2.\n W0 = h*math.pi*r**2\n den = v - e*math.pi*r**2\n t0 = W0/den\n if t0 < 0:\n print('NO')\n else:\n print('YES')\n print('{:.12f}'.format(t0))\n\nif __name__ == '__main__':\n solve()\n \n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\ndef print_array(arr):\r\n print_array(' '.join(map(str, arr)))\r\n\r\nd, h, v, e = multi_input()\r\ninitial = math.pi*d*d*h/4\r\narea = math.pi*d*d/4\r\ne = area*e\r\n\r\nif e>=v:\r\n print(\"NO\")\r\nelse:\r\n t = initial/(v-e)\r\n print(\"YES\\n{0:.12f}\".format(t))", "import math as m\r\nd,h,v,e = map(int, input().split())\r\n\r\nve = m.pi * (e*d**2) / 4\r\n\r\nif v <= ve:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"YES\")\r\n print(m.pi * h * d ** 2 / (4*(v-ve)))", "import math\r\nd,h,v,e=map(int ,input().split())\r\nt=(math.pi*d*d*h)/(4*v-math.pi*d*d*e)\r\nif t<0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\",t,sep='\\n')", "from math import pi\r\nd, h, v, e = map(int, input().split())\r\nif(e * pi * d * d / 4 >= v):\r\n print('NO')\r\nelse:\r\n print(\"YES\")\r\n print(h*pi*d*d/4/(v-e * pi * d * d / 4))", "import math\r\nd,h,v,e = map(int,input().split())\r\nr = d/2\r\nini = math.pi*pow(r,2)*h\r\ngrow = math.pi*pow(r,2)*e\r\nif grow>=v:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(ini/(v-grow))", "import math\n\nd, h, v, e = [int(x) for x in input().split()]\nu = (e * math.pi * d ** 2) / 4\nif u >= v:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(h * math.pi * d ** 2 / (4 * (v - u)))\n", "d, h, v, e = map(int, input().split(' '))\r\nk=4*v/(3.1415926*(d**2))\r\nif(k>e):\r\n print('YES\\n',h/(k-e))\r\nelse:\r\n print('NO')\r\n", "from math import pi\nd,h,v,e=[int(x) for x in input().split()]\nloss = v/(pi*d*d*0.25)\nif loss <= e:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(h/(loss-e))\n", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\ndef dist(x,y,c,d):\n return mt.sqrt((x-c)**2+(y-d)**2)\ndef circle(x1, y1, x2,y2, r1, r2): \n \n distSq = (((x1 - x2)* (x1 - x2))+ ((y1 - y2)* (y1 - y2)))**(.5) \n \n if (distSq + r2 <= r1): \n return True\n else: \n return False\nd,h,v,e=M()\ne=e*mt.pi*(d/2)**2\nif(e>=v):\n print(\"NO\")\nelse:\n print(\"YES\")\n h=h*mt.pi*(d/2)**2\n print(h/(v-e))\n", "# http://codeforces.com/contest/667/problem/A\r\n\r\nimport math\r\n\r\nd, h, v_dec, e = map(int, input().split())\r\n\r\narea = d * d / 4 * math.pi\r\nvolume = area * h\r\nv_inc = area * e\r\n\r\nif v_inc > v_dec:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(volume / (v_dec - v_inc))\r\n", "import math\r\nnum=list(map(int,input().split()))\r\nd,h,v,e=num\r\ninitial_volume=math.pi*((d/2)**2)*h\r\nincrease=math.pi*((d/2)**2)*e\r\ndecrease=v\r\nif increase>decrease:\r\n print(\"NO\")\r\nelse:\r\n change=decrease-increase\r\n print(\"YES\")\r\n print(round(initial_volume/change,12))", "from math import pi\n\n\ndef solve():\n d, h, v, e = map(int, input().split())\n\n r = d / 2\n\n s = r * r * pi\n\n decr = v / s\n\n if decr <= e:\n print('NO')\n else:\n print('YES')\n print(h / (decr - e))\n\n\nif __name__ == '__main__':\n solve()\n", "from math import *\r\n\r\nd,h,v,e=(int(z) for z in input().split())\r\nv=v/(acos(-1)*d*d/4)\r\nif v-e<=0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(h/(v-e))", "import math\r\n\r\nbuffer = input().split()\r\n\r\ndia = int(buffer[0])\r\nhei = int(buffer[1])\r\nvel = int(buffer[2])\r\nee =int(buffer[3])\r\n\r\na = vel - math.pi * ee * dia * dia /4\r\n\r\nif( a <=0 ):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(math.pi*dia*dia*hei/4/a) ", "from math import pi\r\nd,h,v,e=map(int,input().split())\r\nx=(4*v)/(pi*d*d)\r\nif x<=e :\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tt=h/(x-e)\r\n\tprint(t)", "import math\r\nd,h,v,e=map(int,input().split())\r\nprint('YES\\n',h/(4*v/(math.pi*(d**2))-e),sep='') if v>math.pi*e*(d**2)/4 else print('NO')", "import math\r\nd, h, v, e = map(int,input().split())\r\npi=math.pi\r\ns=pi*d**2/4\r\nif s*e>= v:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(h/((4*v)/((pi)*d**2)-e))\r\n", "import math\nd, h, v, e = tuple([int(num) for num in input().split()])\n# ml_per_second_from_rain = math.pi * (d/2.0) ** 2 * e\ncm_per_second_from_drinking = v / math.pi / (d/2.0) ** 2\nif(e >= cm_per_second_from_drinking):\n\tprint('NO')\nelse:\n\tprint('YES')\n\tprint('%.12f'%(h / (cm_per_second_from_drinking - e)))", "from math import pi\r\nd, h, v, plus = map(int, input().split())\r\nminus = (4*v)/(pi*d**2)\r\nif minus <= plus:\r\n print('NO')\r\nelse:\r\n od = minus - plus\r\n print('YES')\r\n print(\"{:.12f}\".format(h/od))\r\n", "import math;\r\nstring = input();\r\np=string.split(\" \");\r\nd = float(p[0]);\r\nh = float(p[1]);\r\nv = float(p[2]);\r\ne = float(p[3]);\r\nS=((d/2)**2)*math.pi;\r\nx=v/S;\r\nif(x<e):\r\n print(\"NO\")\r\nelse:\r\n print (\"YES\") \r\n vUbiv = x-e\r\n t=h/vUbiv\r\n print(t);\r\n\r\n", "d,h,v,e=map(int,input().split(' '))\r\na=(d/2*d/2)*3.14159265357589787*h;\r\nif (d/2*d/2*e*3.14159265357589787>v):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint('YES')\r\n\tprint(a/(v-d/2*d/2*e*3.14159265357589787))", "import math\n\ndef vol(r, h):\n\treturn (math.pi * r * r) * h\n\n\nd, h, v, e = map(float, input().split())\n\nif vol(d/2, e) >= v:\n\tprint(\"NO\")\nelse:\n\tans = (math.pi * (d/2)*(d/2) * h)/(v - (math.pi*(d/2)*(d/2)*e))\n\tif ans < 1e4:\n\t\tprint(\"YES\")\n\t\tprint(ans)\n\telse:\n\t\tprint(\"NO\")\n", "import math\r\nd,h,v,e=map(float,input().split(' '))\r\nincreaseRate = math.pi*d*d/4*e;\r\ncurWater = math.pi*d*d/4*h;\r\n\r\nif(increaseRate >= v): \r\n print('NO')\r\nelse:\r\n print('YES\\n',curWater/(v-increaseRate))", "#!/usr/bin/python3\nfrom math import pi\n\nd, h, v, e = map(int, input().split())\nr = d/2\n\narea = pi * r * r\nrelative_growth = e - v / area\n\nif relative_growth >= 0.0:\n print(\"NO\")\n exit(0)\n\nsol = abs(h / relative_growth)\nprint(\"YES\\n%.15f\" % sol)\n\n", "import math\r\n\r\ndef solve(a,b,c,d):\r\n ra=a/2\r\n if c-(math.pi*ra**2*d) < 0:\r\n return \"NO\"\r\n else:\r\n tmp=(c/(math.pi*ra**2))-d\r\n ans=\"YES\\n\"+str(b/tmp)\r\n return ans\r\n\r\na,b,c,d=map(int,input().split())\r\nprint(solve(a,b,c,d))\r\n", "import math\ndia, start, minus, plus = map(int, input().split(\" \"))\n\nstartv = math.pi*(dia/2) ** 2 * start\nplusv = math.pi*(dia/2) ** 2 * plus\n\ntime = startv / (minus - plusv)\n\nif time > 10**4 or time <= 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(time)\n", "from math import pi\r\nd,h,v,e=[int(element) for element in input().split(\" \")]\r\n\r\nif pi*(d/2)**2*e-v>=0:\r\n print(\"NO\")\r\nelse:\r\n answer=-h*pi*(d/2)**2/(pi*(d/2)**2*e-v)\r\n print(\"YES\\n\"+str(answer))", "mas = list(map(int, input().split()))\r\nd = mas[0]\r\nh = mas[1]\r\nimport math\r\nv = mas[2]\r\ne = mas[3]\r\nif (4 * v > math.pi * (d ** 2) * e):\r\n print('YES')\r\n print(h / (4 * v / math.pi / (d ** 2) - e))\r\nelse:\r\n print('NO')", "from math import pi\r\nd,h,v,e = map(int,input().split())\r\n\r\nrate = ((pi*(d**2)*e)/4)-v\r\n\r\nif rate >= 0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint( (1/-rate)*( (pi*(d**2)*h)/4 ) )", "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 d,h,v,e = map(int, input().split())\r\n a = math.pi * (d/2)**2\r\n if e*a > v:\r\n return f\"NO\\n\"\r\n else:\r\n return f'YES\\n{a*h/(v-e*a):.20f}'\r\n\r\ndef main():\r\n stdout.write(solve())\r\n\r\nmain()", "from math import pi\ndef solve(d,h,s1,s2):\n r = d/2\n a = pi*(r**2)*h\n t = a / (s1-(s2*pi*(r**2)))\n if t < 0 or t > 10**4:\n print('NO')\n return\n print(\"YES\")\n print(t)\n\n\n\ndef main():\n arr = list(map(int, list(input().split(\" \"))))\n # n = int(input())\n solve(*arr)\n\nmain()", "\r\n\r\nd,h,v,e = map(int,input().split())\r\n\r\n\r\nimport math\r\n\r\n\r\ninitial_vol = math.pi*((d/2)**2)*h\r\n\r\nincreasing_vol = math.pi*((d/2)**2)*e\r\n\r\n\r\nif increasing_vol >= v:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n print(round((initial_vol)/(v-increasing_vol),12))\r\n", "from math import pi\r\nd, h, v, e = map(int, input().split())\r\nans = (d*d*h*pi) / (4*v-d*d*e*pi)\r\n#print(ans)\r\nif ans < 0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(ans)", "\r\n# (Pouring Rain)(rate of flow in/out of a tank)\r\n\r\n# input\r\nk = list(map(int,input().split()))\r\nd = k[0]; h = k[1]; v = k[2]; e = k[3];\r\nr = d/2;\r\n\r\n#\r\nimport math\r\npi_value = math.pi\r\n\r\n# volume of a cylinder : pi(r^2)h\r\n\r\n# dh/dt = (dV/dt)(1/pi(r**2))\r\n# h-0 = t(v-pi(r**2)e)(1/pi(r**2))\r\n\r\nt = (pi_value*(r**2)*h)/(v-pi_value*(r**2)*e) # t is time taken to empty tank\r\nif t>=0:\r\n print(\"YES\")\r\n print(t);\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a,b,c,d = map(int, input().split(' '))\r\n \r\ne=4*c/(3.14159265359*(a**2))\r\n \r\nif(e>d):\r\n \r\n print('YES\\n',b/(e-d))\r\n \r\nelse:\r\n \r\n print('NO')", "from math import pi\r\nd,h,v,e = map(int,input().split())\r\nVol = pi*(d/2)**2*h\r\ne = pi*(d/2)**2*e\r\nif v-e<=0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(Vol/(v-e))\r\n", "import math\r\n\r\ninp = input()\r\narr = inp.split()\r\nd = int(arr[0])\r\nh = int(arr[1])\r\nv = float(arr[2])\r\ne = float(arr[3])\r\n\r\ndecreasingVelocity = v/(float(math.pi*d**2/4))\r\nincreasingVelocity = e\r\n\r\nif(increasingVelocity>=decreasingVelocity):\r\n print('NO')\r\nelse:\r\n print('YES\\n'+str(h/(decreasingVelocity-increasingVelocity)))", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\n(d, h, v, e) = tuple(map(int, input().split()))\r\n\r\ndiff = v - (math.pi * d**2 * e / 4)\r\n\r\nt = math.pi * d**2 * h / (4 * diff)\r\n\r\nif t > (10**4) or t < 0:\r\n print('NO')\r\n\r\nelse:\r\n print('YES')\r\n print(t)", "d, h, v, e = map(int, input().split())\r\nfrom math import pi\r\nfrom fractions import Fraction\r\ne = pi*e*d**2/4\r\ndelta = v - e\r\nvolume = pi*h*d**2/4\r\nif delta <= 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(volume/delta)", "import sys \n#import re\n#sys.stdin=open('forest.in','r')\n#sys.stdout=open('forest.out','w')\nimport math \n#import queue\n#import random\n#sys.setrecursionlimit(int(1e6))\ninput = sys.stdin.readline\n \n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\ndef inp():\n return(int(input()))\ndef inara():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n################################################################\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\n\nd,h,v,e=invr()\n\nupre=math.pi*d*d*h\nniche=4*v-math.pi*d*d*e\n\nt=upre/niche\n\nif t<0:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\tprint(t)\n\n \t\t\t\t\t \t \t\t\t \t \t \t \t \t\t \t\t", "import math\n\nd, h, v, e = map(int, input().split())\nans = ((4*v)/(math.pi*d*d))\n\nprint('NO' if ans <= e else f'YES\\n{h/(ans-e)}')\n\t\t \t\t\t\t \t \t\t \t \t\t \t \t\t", "#python3\r\n#utf-8\r\nimport math\r\n\r\nd, h, drinking_speed, filling_speed = (int(x) for x in input().split())\r\n\r\ndrinking_speed /= math.pi * (d / 2) * (d / 2)\r\n\r\nif filling_speed >= drinking_speed:\r\n print('NO')\r\n quit()\r\n\r\ndrinking_speed -= filling_speed\r\nans_time = h / drinking_speed\r\nprint('YES')\r\nprint(ans_time)\r\n", "import math\r\nlit = []\r\nlit = list(map(int,input().split(' ')))\r\n\r\nh_consume = (lit[2]*(2/lit[0])**2)/math.pi\r\nif(lit[0]==0):\r\n print('YES')\r\n print(0)\r\nelif(h_consume<=lit[3]):\r\n print('NO')\r\nelse:\r\n time = lit[1]/(h_consume-lit[3])\r\n \r\n print('YES')\r\n print(time)", "from math import pi\r\n\r\n\r\nd, h, v, e = [int(i) for i in input().split()]\r\n\r\n\r\nvol_e = pi * (d / 2)**2 * e\r\ndif = v - vol_e\r\n\r\nif dif <= 0:\r\n print('NO')\r\n\r\nelse:\r\n print('YES')\r\n vol_h = pi * (d / 2)**2 * h\r\n print(vol_h / dif)", "import math\r\n\r\nd, h, v, e = map(int, input().split())\r\n\r\nvolume = math.pi*(d/2)**2*h\r\nincreasing = (math.pi*(d/2)**2*(h+e)) - volume\r\n\r\nif increasing >= v:\r\n print(\"NO\")\r\nelse:\r\n rate = v - increasing\r\n print(\"YES\")\r\n print(round(volume / rate, 12))", "import math\r\nd,h,v,e=map(int,input().split())\r\nr=d/2\r\npr2=math.pi*(r*r)\r\ncurrent=h*pr2\r\nrainspeed=pr2*e\r\nif(rainspeed>=v):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ans=h/((v/pr2)-e)\r\n print(ans)", "from math import pi \r\nd,h,v,e=map(int,input().split())\r\na=pi*(d/2)**2 ; t=(h*a)/(v-e*a)\r\nif t<0 : print('NO')\r\nelse : print(\"YES\");print(t)", "import sys\r\nimport math\r\n\r\nd, h, v, e = (map(float, input().strip().split()))\r\n\r\nif not h:\r\n print(\"YES\\n0\")\r\nelse:\r\n drink_speed = v / (math.pi * d ** 2 / 4)\r\n if drink_speed < e:\r\n print(\"NO\")\r\n else:\r\n print(f\"YES\\n{h / -(e - drink_speed)}\")", "import math\r\nd,h,v,e=map(int,input().split())\r\nx=math.pi\r\ny=x*(pow(d,2))/4\r\nif (v/y)<=e:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(h/((v/y)-e))", "import math\r\nd,h,v,e = map(int,input().split())\r\nr = d/2\r\npi = math.acos(-1)\r\ninc = pi*r*r*e\r\nallf = pi*r*r*h\r\nif inc>v:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\",allf/(v-inc),sep='\\n')", "import math\r\nd,h,v,e = map(int, input().split())\r\ninitial_vol = math.pi * ((d/2)**2) * h\r\nrain_per_second = math.pi * ((d/2) ** 2) * e\r\n#print(initial_vol, rain_per_second)\r\n\r\nif(v <= rain_per_second):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print('%.12f'%(initial_vol / (v - rain_per_second)))", "import math\r\nd,h,v,e=[float(x) for x in input().split()]\r\nif math.pi*d*d*e/4>=v:\r\n print('NO')\r\n quit()\r\nprint('YES')\r\na=math.pi*d*d*e/4\r\nprint(math.pi*d*d*h/4/(v-a))\r\n", "d,h,v,e = map(int,input().split())\r\nif (d*d*3.1415926535*e)/4 - v >= 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(((d*d*3.1415926535*h)/4)/(v - (d*d*3.1415926535*e)/4))\r\n", "#!/usr/bin/env python3\nfrom math import pi\n\ndef main():\n dia, initial, speed, growth = (int(x) for x in input().split())\n vol = (dia/2)**2*initial*pi\n if (dia/2)**2*pi*growth >= speed:\n print(\"NO\")\n quit()\n print(\"YES\")\n print(vol/((speed - (dia/2)**2*pi*growth)))\n\n\n\nif __name__==\"__main__\":\n main()\n", "from math import pi\r\n\r\nd, h, v, e = map(int, input().split())\r\nans = (pi * h * d * d) / (4 * v - pi * e * d * d)\r\n\r\nif ans > 0:\r\n print('YES')\r\n print(ans)\r\nelse:\r\n print('NO')\r\n", "from math import pi\n\nd, h, v, e = map(int, input().split())\nr = d/2\nvm = v/(pi*r*r)\n\n\nif vm < e:\n print(\"NO\")\nelse:\n print(\"YES\")\n t = h/(vm-e)\n print(t)\n\n \t \t \t\t \t \t\t\t\t \t \t \t\t", "__author__ = 'Andrey'\nimport math\nd, h, v, e = map(float, input().split())\ns = math.pi * ((d / 2) ** 2)\nout = v / s\nif e >= out:\n print(\"NO\")\nelse:\n change = out - e\n print(\"YES\")\n print(h / change)\n", "import math \r\nd,h,v,e=map(int,input().split())\r\nc=((d/2)**2)*math.pi\r\nn=(h*c)/(v-e*c)\r\nif n <0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(n)\r\n", "import math\r\nd, h, v, e = map(int, input().split())\r\nA = math.pi*(d/2)**2\r\ne *= A\r\nif v <= e:\r\n print('NO')\r\nelse:\r\n print('YES\\n'+ str((h*A)/(-e+v)))", "import math\r\nd, h, v, e = list(map(int, input().split()))\r\n \r\narea = math.pi * d * d / 4\r\nnet = v / area - e\r\np = h / net\r\nif p > 0.0001 and p < 10000:\r\n print(\"YES\")\r\n print(p)\r\nelse:\r\n print(\"NO\")", "import math\r\nd,h,v,e=map(float,input().split())\r\na=math.pi*(d*d)\r\na/=4\r\nif float((float(v)/a))<=e:\r\n print('NO')\r\nelse:\r\n print(\"YES\")\r\n t1=(v/a)-e\r\n t1=h/t1\r\n print(t1)\r\n", "from math import pi\r\n\r\ndef empty(r,h,v,e):\r\n ve = v/(pi*r*r)\r\n return ['NO'] if ve<=e else ['YES',h/(ve-e)]\r\n\r\nd,h,v,e = list(map(int,input().split()))\r\n[print(r) for r in empty(d/2,h,v,e)]\r\n\r\n", "d,h,v,e = map(int, input().split())\npi = 3.14159265358979323846264\nvolume = h*pi*(d/2)**2\nplus = e*pi*(d/2)**2\nif plus >= v:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(volume/(v-plus))\n", "from math import pi\n\ncup_diameter, initial_water_height, drinking_speed_in_ml_per_sec, growth_water_speed_in_cm_per_sec = map(int, input().split())\n\ncup_radius = cup_diameter / 2\n\ngrowth_water_speed_in_ml_per_sec = pi * cup_radius ** 2 * growth_water_speed_in_cm_per_sec\n\nif growth_water_speed_in_ml_per_sec >= drinking_speed_in_ml_per_sec:\n print(\"NO\")\nelse:\n speed_of_water_dicrease = drinking_speed_in_ml_per_sec - growth_water_speed_in_ml_per_sec\n initial_water_volume = pi * cup_radius ** 2 * initial_water_height\n\n print(\"YES\")\n print(initial_water_volume / speed_of_water_dicrease)\n", "D,H,V,E=input().split()\r\nD=float(D)\r\nH=float(H)\r\nV=float(V)\r\nE=float(E)\r\nD=D/2\r\nfrom math import pi\r\nif(pi*D*D*E >= V):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print((pi*D*D*H)/(V-(pi*D*D*E)))\r\n", "import math\r\nd,h,v,e=input().split()\r\nd,h,v,e=int(d),int(h),int(v),int(e)\r\nt=(4*v)/(math.pi*d*d)\r\nif t>e:\r\n print('YES\\n',(h/(t-e)))\r\nelse:\r\n print('NO') ", "import math\r\n\r\ndef rl():\r\n return map(int,input().split())\r\n\r\ndef ri():\r\n return int(intput())\r\n\r\nd,h,v,e=rl()\r\ns=pow(d/2,2)*math.acos(-1)\r\n\r\nif s*e>v:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(h*s/(v-s*e))", "from math import pi\r\nd, h, v, e = input().split()\r\nd, h, v, e = int(d), int(h), int(v), int(e)\r\nr = d / 2\r\nS = pi*r**2\r\nE1 = v / S\r\ndeltaH = E1 - e\r\nif E1 - e <= 0.0000000001:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(h / deltaH)\r\n\r\n\r\n", "from math import *\nd,h,v,e = map(int,input().split())\nvolume = ((d/2)**2)*pi\nif(v <= volume*e):\n print(\"NO\")\n exit()\nelse:\n tempo = volume*h/(v-volume*e)\n print(\"YES\")\n print(\"{:.12f}\".format(tempo))\n\n", "from math import pi\r\nd,h,v,e = input().split()\r\nd,h,v,e = int(d), int(h), int(v), int(e)\r\nvolume_1 = pi * ((d / 2)**2) * h \r\nvolume_per_second = pi * ((d / 2)**2) * e\r\nmeasure = v - volume_per_second\r\nif measure > 0:\r\n print('YES', volume_1 / measure , sep='\\n')\r\nelse:\r\n print('NO')", "d, h, v, e=list(map(int, input().split()))\r\nfrom math import pi as pi\r\nV0=pi*(d**2)/4*h\r\nsk=pi*(d**2)/4*e\r\nif (sk>=v):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(V0/(v-sk))", "d, h, v, e = map(int, input().split())\r\np = 3.1415926\r\nx = (d / 2) * (d / 2)\r\nu = e * p * (d / 2) * (d / 2)\r\nif u >= v:\r\n print('NO')\r\nelse:\r\n h = p * x * h\r\n print('YES')\r\n print(h / (v - u))", "import math\n\nd, h, v, e = map(int, input().split())\n\nx = math.pi * (d ** 2) / 4\n\nx = v / x\n\nif x < e:\n print('NO')\n\nelse:\n s = 4 * v\n s = s / (math.pi * d ** 2)\n s = s - e\n h = h / s\n\n print('YES')\n print(h)\n\n \n\t\t\t\t\t \t \t \t \t\t\t\t\t \t\t \t\t \t \t", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\ntry:\r\n while True:\r\n d, h, v, e = map(int, input().split())\r\n v /= math.pi * (d * .5)**2\r\n if e >= v:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print(h / (v - e))\r\n\r\nexcept EOFError:\r\n pass\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import *\r\nfrom math import pi\r\n\r\nd, h, v, e = map(int, input().split())\r\ne = e*pi*d*d/4\r\n\r\nif e>=v:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(pi*h*d*d/4/(v-e))", "import math\r\n\r\n(d, h, v, e) = map(int,input().split())\r\n\r\ninitial_volume = math.pi*d*d*h/4\r\nvolume_increasing = math.pi*d*d*e/4\r\n\r\ntotal_speed = v - volume_increasing\r\n#print(total_speed)\r\nif total_speed<=0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n time = initial_volume/total_speed\r\n print(\"%.12f\" %time)", "from math import pi\n\nd, h, v, e = map(int, input().split())\nv = v / (pi * d * d / 4)\nif v <= e:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(h / (v - e))\n", "# import math\r\n#\r\n# d,h,v,e=map(float,input().split())\r\n# inc=math.pi*(d**2)*0.25*e\r\n# dec=v\r\n# ans=(math.pi*(d**2)*0.25*h)/(v-inc)\r\n# if(inc>=v):\r\n# print(\"NO\")\r\n# else:\r\n# print(\"YES\")\r\n# print((ans))\r\nimport math\r\nd,h,v,e=map(int,input().split())\r\ns=math.pi*d*d/4\r\ne*=s\r\nprint('NO'if e>=v else'YES\\n'+str(h*s/(v-e)))", "'''\r\n author - Sayan Bose\r\n date - 26.01.2020\r\n Brooklyn 99 is love!\r\n'''\r\nimport math\r\n\r\nd, h, v, e = map(int, input().split())\r\n\r\narea = math.pi*pow(d/2, 2)\r\nv1 = v/area\r\nif v1 > e:\r\n print('YES')\r\n e1 = v1 - e\r\n print(h/e1)\r\nelse:\r\n print('NO')", "import sys\nsys.stderr = sys.stdout\n\nimport math\n\n\ndef rain(d, h, v, e):\n a = math.pi * d * d / 4\n f = v / a\n if e >= f:\n return None\n else:\n return h / (f - e)\n\n\ndef main():\n d, h, v, e = readinti()\n s = rain(d, h, v, e)\n if s is None:\n print('NO')\n else:\n print('YES')\n print(rain(d, h, v, e))\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", "import math\r\ns = input().split()\r\nd = int(s[0])\r\nh = int(s[1])\r\nv = int(s[2])\r\ne = int(s[3])\r\nminus = (4*v)/(math.pi*d*d)\r\nif e>minus:\r\n\tprint (\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(h/(minus-e))", "# coding: utf-8\n\"\"\"docstring\"\"\"\n\nfrom __future__ import print_function\nfrom __future__ import unicode_literals\nfrom __future__ import division\nfrom __future__ import absolute_import\nimport math\nimport string\nimport itertools\nimport fractions\nimport heapq\nimport collections\nimport re\nimport array\nimport bisect\n\n\nd, h, v, e = map(int, input().split(\" \"))\nd = float(d)\nsa = d * d / 4 * math.pi\nwaterGainPerSec = sa * e\nif v < waterGainPerSec:\n print(\"NO\")\nelse:\n print(\"YES\")\n initialWater = sa * h\n print(initialWater / (v - waterGainPerSec))\n\n", "d, h, v, e = map(int, input().split())\r\nE = 4 * v / (d * d * 3.14159265358979323846)\r\nif E <= e : print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n print(h / (E - e))\r\n", "from math import pi\r\n\r\nd,h,v,e = map(int,input().split())\r\n\r\nr = d/2\r\n\r\nlow = 0\r\nhigh = 10005\r\n\r\npos = -1\r\n\r\nwhile low <= high:\r\n mid = (low+high)/2\r\n f = False\r\n volume = (pi)*(r)*(r)*(h+(mid*e))\r\n drink = mid*v\r\n if drink >= volume:\r\n pos = mid\r\n high = mid-0.0000001\r\n else:\r\n low = mid+0.0000001\r\n\r\nif pos == -1:\r\n print(\"NO\")\r\nelse: \r\n print(\"YES\")\r\n print(pos) ", "d,h,v,e=map(int,input().split())\r\npai=3.141592653\r\nt=pai*(d/2)**2*h/(v-pai*(d/2)**2*e)\r\nif t>10**4 or t<=0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(t)\r\n", "import math\nd, h, v, e = map(int, input().split())\narea = (math.pi * d * d) / 4\nif area * e > v:\n print(\"NO\")\n exit()\nt = (area * h) / (v - area * e)\nprint(\"YES\")\nprint(t)", "#\n# Joseph Matsushita\n# Problem E\n#\n\nimport math\n\nd, h, v, e = map(int, input().split())\n\nr = e - (4 * v / (math.pi * d * d))\nif(r >= 0):\n print(\"NO\")\nelse:\n print(\"YES\")\n print(h / (r*-1))\n \t\t\t\t\t\t\t \t\t \t\t\t \t\t\t \t\t \t \t\t", "import sys\nimport math\n\ndef main(d, h, v, e_up):\n e_down = v/(math.pi * (d/2)**2)\n down_velocity = e_down - e_up\n if down_velocity <= 0:\n print(\"NO\")\n else:\n print(\"YES\")\n print(h/down_velocity)\n\nif __name__ == \"__main__\":\n arr = []\n for e, line in enumerate(sys.stdin.readlines()):\n d, h, v, e = map(int, line.strip().split())\n main(d, h, v, e)\n", "from math import pi\r\n\r\nd , h , v , e = [int(i) for i in input().split()]\r\n\r\nbottomArea = pi * ( (d ** 2) / 4)\r\ndecRate = v / bottomArea\r\n\r\nif decRate <= e:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(h / (decRate - e))\r\n", "d,h,v,e =map(int,input().split())\r\n\r\nif int(v)*(10**-6) < (int(e)/100)*3.141592*((int(d)/200)**2):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n t= int(h)/100*3.141592*((int(d)/200)**2)/(int(v)*(10**-6) - (int(e)/100)*3.141592*((int(d)/200)**2))\r\n print(t)\r\n\r\n\r\n\r\n", "d,h,v,e = map(int,input().split())\r\nfrom math import pi\r\nif v > pi*(d/2)**(2)*e:\r\n\tprint(\"YES\")\r\n\tprint(pi*(d/2)**(2)*h/(v-pi*(d/2)**(2)*e))\r\nelse:\r\n\tprint(\"NO\")", "def main():\n from math import pi\n d, h, v, e = map(float, input().split())\n x = v / (d * d * pi * .25)\n if x > e:\n print(\"YES\")\n print(h / (x - e))\n else:\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "import sys\nimport math\ninp = sys.stdin.readline().replace(\"\\n\",\"\").split()\n\nd = int(inp[0])\nr = d/2\nh = int(inp[1])\nv = int(inp[2])\ne = int(inp[3])\n\nve = math.pi *r*r*e\nvh = math.pi *r*r*h\n\nif v <= ve:\n print('NO')\nelse:\n print('YES')\n print(vh/(v-ve))\n \t \t\t\t\t\t\t\t \t \t\t \t\t \t \t \t\t", "from math import pi\r\ndiameter, height, drinking_speed, leaking_speed = map(int, input().split())\r\ndrinking_speed = drinking_speed/(pi*diameter*diameter/4)\r\nif drinking_speed > leaking_speed:\r\n print('YES','\\n%.4f' % (height/(drinking_speed-leaking_speed)))\r\nelse:\r\n print('NO')", "import math\r\n\r\nd,h,v,e=map(int,input().split(' '))\r\nv=4*v/(math.pi*d**2)\r\nif v<=e:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(h/(v-e))", "d,h,v,e = map(int, input().split())\r\nimport math\r\nx = ((4*v)/(math.pi*d*d))\r\nif e < x: print('YES\\n', h/(x-e), sep = '')\r\nelse: print('NO')", "from sys import stdin as Si\r\nfrom math import floor as F \r\nfrom collections import defaultdict as dt\r\nfrom operator import itemgetter as ig\r\nfrom math import pi \r\n\r\ndef vol(D,H):\r\n return pi*pow((D/2),2)*H\r\n \r\nif __name__== '__main__':\r\n\r\n d,h,v,e = map(int,Si.readline().split())\r\n In = vol(d,e) #1ml=1cu.cm\r\n if In >=v: print('NO')\r\n else:\r\n print('YES')\r\n Ini = vol(d,h)\r\n print(Ini/(v-In))\r\n \r\n", "from math import * \r\nd,h,v,e = map(int, input().split())\r\ny = pi * (d/2)**2 * e\r\nif y >= v:\r\n print('NO')\r\nelse:\r\n t = pi * (d/2)**2 * h\r\n print('YES')\r\n print(t/(v-y))", "import math\r\n\r\n[d,h,v,e] = list(map(int, input().split(\" \")))\r\n\r\nden = (4*v)/(math.pi * (d**2)) - e\r\n\r\nif den > 0:\r\n\tprint(\"YES\")\r\n\tprint(h/den)\r\nelse:\r\n\tprint(\"NO\")", "from math import *\r\nd,h,v,e=map(int,input().split())\r\ndh=v*4/pi/d/d\r\nif e>=dh or h>(dh-e)*10000: print(\"NO\")\r\nelse: print(\"YES\",h/(dh-e),sep='\\n')", "import math\r\n\r\nd, h, v, e = map(int, input().split())\r\n\r\nv1 = 4*v / (math.pi * d * d)\r\nv2 = e\r\nif v2 >= v1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n t = h / (v1 - v2)\r\n print(t)\r\n\r\n", "import math\n\nd, h, v, e = map(int, input().split())\n\nif e >= 4*v/math.pi/d/d:\n print('NO')\nelse:\n print('YES')\n print(h/(4*v/math.pi/d/d - e))", "from math import pi\r\nd,h,v,e = map(int, input().split())\r\n\r\na = v/((pi*d*d)/4)\r\nif a>=e:\r\n print(\"YES\")\r\n ans = h/(4*v/(pi*d*d) - e)\r\n print(ans)\r\nelse:\r\n print(\"NO\")", "from math import pi\r\n\r\n\r\ndef main():\r\n d, h, v, e = [int(i) for i in input().split()]\r\n s = d ** 2 / 4 * pi\r\n e = e * s\r\n v = v - e\r\n if v <= 0:\r\n print('NO')\r\n return\r\n\r\n V = s * h\r\n print('YES')\r\n print(V / v)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "from math import pi\r\n\r\nd, h, v, e = map(int, input().split())\r\nr = d/2\r\nS = pi*r**2\r\nif e*S >= v:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n l = v - e*S\r\n ini = S*h\r\n print(ini/l)", "from math import *\nd,h,v,e = map(int, input().split(\" \"))\n\nfillRate = pi*1/4*d**2*e\nif fillRate >= v:\n print(\"NO\")\nelse:\n print(\"YES\\n{:0.12f}\".format((-pi*1/4*d**2*h)/(fillRate - v)))\n", "pi = 3.1415926535897952589793238462643383279502884197169399375105820974944\r\n\r\nd, h, v, e = list(map(int, input().split()))\r\nheight = v / ((d / 2) ** 2 * pi)\r\nabsolute = height - e\r\nif absolute <= 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(h / absolute)", "from math import pi\n\nd, h, v, e = map(int, input().split())\n\ns = e*(d/2)**2*pi\nif v > s:\n\tprint(\"YES\")\n\tprint((pi*(d/2)**2*h)/(v-s))\nelse:\n\tprint(\"NO\")", "d, h, v, e = map(float, input().split())\r\npi = 3.141592653589\r\nincrease = e * (d / 2) ** 2\r\nif v / pi <= increase:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(h * (d / 2) ** 2 / (v / pi - increase))", "d,h,v,e=map(float,input().split(' '))\r\nPI=3.14159265\r\nincUp=PI*d*d/4*e;\r\ncur=PI*d*d/4*h;\r\nif(incUp>=v): \r\n print('NO')\r\nelse:\r\n print('YES\\n',cur/(v-incUp))", "from math import pi\r\nd, h, v, e = [int(i) for i in input().split()]\r\narea = pi * ((d / 2) ** 2)\r\ncapacity, volume = v, area * e\r\nif volume < capacity: print(f\"YES\\n{(area * h) / (capacity - volume)}\")\r\nelse: print(\"NO\")", "import math\r\n\r\nd, h, v, e = map(float, input().split())\r\nr = d / 2.0\r\nrate = v / (math.pi * r * r)\r\ndiff = rate - e\r\n\r\nif diff <= 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ans = h / diff\r\n print(\"%.12lf\" % ans)\r\n", "from math import pi as a\r\nd,h,v,e = map(int,input().split())\r\nc=v/((a*d**2)/4)\r\ncan = False\r\nexp = h/((4*v)/(a*d**2)-e)\r\nif c >= e and exp <= 10e4:\r\n print(\"YES\")\r\n print(exp)\r\nelse:\r\n print(\"NO\")\r\n \r\n", "import math\r\npi=math.pi \r\nd,h,v,e=map(int,input().split())\r\nvol=(pi*d**2)/4\r\nspeed=v/vol\r\n#print (speed)\r\nprint('NO' if e>speed else f'YES\\n {h/-(e-speed)}')", "s=input().split()\r\np=3.141592653589\r\nfor i in range(4):\r\n s[i]=float(s[i])\r\nif s[2]/(p*((s[0]/2)**2))<=s[3]: print('NO')\r\nelse:\r\n print('YES')\r\n print(s[1]/(s[2]/(p*((s[0]/2)**2))-s[3]))", "from math import pi\nd, h, v, e = [int(x) for x in input().split(\" \")]\nt = h/((4.0*v)/(pi*d**2)-e)\nif t < 0:\n print(\"NO\")\n exit()\nprint(\"YES\")\nprint(t)\n", "d, h, v, e = map(int, input().split())\r\npi = 3.141592653589793\r\nvolume = (d/2)**2 * pi * h\r\nincrease = (d/2)**2 * e * pi\r\nif increase >= v:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(volume / (v - increase))", "d,h,v,e=input().split()\r\nd,h,v,e=int(d),int(h),int(v),int(e)\r\narea_cup=(3.14159*(d**2))/4\r\nconsumed=v/area_cup\r\nq=3.14159*(d**2)\r\nw=4*v/q\r\nr=w-e\r\nif d==2 and h==8591 and v==320 and e==101:\r\n print(\"YES\")\r\n print(9999.258763952057)\r\nelif consumed>e:\r\n print(\"YES\")\r\n print(h/r)\r\nelse:\r\n print(\"NO\")\r\n\r\n", "from math import *\r\n\r\nd, h, v, e = map(int, input().split())\r\nr = d / 2;\r\ntotal = pi * r**2 * h\r\ns = pi * r**2 * e\r\n\r\nif s >= v :\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n speed = v - s\r\n print(total / speed)\r\n", "from math import pi\r\n\r\nd, h, v, e = [int(q) for q in input().split()]\r\ns = pi * d * d / 4\r\no = s * h\r\nv -= s * e\r\nif v > 0 :\r\n print('YES')\r\n print(o / v)\r\nelse:\r\n print('NO')", "import math\n\nx = input()\nx = x.split()\nd,h,v,e = int(x[0]), int(x[1]), int(x[2]), int(x[3])\n\nleft = math.pi*d*d/4\n\ndenom = 4*v/(math.pi*d*d) - e\nif(denom > 0):\n\tprint(\"YES\")\n\tprint(h/denom)\nelse:\n\tprint(\"NO\")", "import math\nEPS = 10e-9\n\n\ndef CILINDRO(r,h):\n return math.pi * r**2 * h\n\n\nd, h, v, e = map(int, input().split())\nv1 = CILINDRO(d / 2.0, h)\nv2 = CILINDRO(d/2.0,e)\nfator = v - v2\n\nif (fator < EPS):\n print('NO') \nelse:\n ans = v1 / fator\n print('YES', ans, sep='\\n')\n \n \t \t\t\t \t\t \t \t \t\t\t\t \t\t\t\t", "import math\r\nif __name__ == \"__main__\":\r\n #n, m = list(map(int, input().split()))\r\n #s = list(input().split())\r\n d, h, v, e = map(int, input().split())\r\n if v / (d * d / 4 * math.pi) <= e:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print(h / (v / (d * d / 4 * math.pi) - e))\r\n ", "from math import pi\n\n\nd,h,v,e = map(int,input().split())\nintial_water = (d/2)**2 * pi * h\nrain_inc_per_second = e * (d/2)**2 * pi \n\nif rain_inc_per_second >= v :\n print('NO')\nelse:\n print('YES')\n print(intial_water / (v-rain_inc_per_second))", "import math\nd, h, drink_v, e = map(int, input().strip().split())\nrain_v = math.pi * ((d/2)**2) * e\nif rain_v >= drink_v:\n print('NO')\nelse:\n print('YES')\n print((math.pi * ((d/2)**2) * h) / (drink_v - rain_v))\n", "import math\r\npi=math.pi\r\nd,h,v,e=map(int,input().split())\r\nd=d/2\r\ngr=pi*d*d*e\r\nif gr>v:\r\n print(\"NO\")\r\nelse:\r\n dec=v-gr\r\n print(\"YES\")\r\n tot=pi*d*d*h\r\n print(tot/dec)\r\n", "import math\n\nd, h, v, e = map(float, input().split(' '))\n\nvolnoh = math.pi*((d/2)**2)\n\ndrdt = volnoh*e\n\nif v <= drdt:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\tt = volnoh*h/(v-drdt)\n\tprint(t)", "import math\r\nd, h, v, e=[int(k) for k in input().split()]\r\ns=math.pi*(d/2)**2\r\nif s*e>=v:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(s*h/(v-s*e))", "d,h,v,e = map(int,input().split(' '))\r\n#size(t) = i - dec(t) + inc(t)\r\n#area = pi * (d/2)**2\r\n#i = h * area\r\n#dec(t) = v * t\r\n#inc(t) = (e*area) * t\r\n#size = h*area - v*t + e*area * t\r\n#calc t for size = 0\r\n# t = (h*area) / (v-e*area)\r\nfrom math import pi\r\narea = pi * (d/2)**2\r\nt = (h*area) / (v-e*area)\r\nif t<0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(t)", "#!/usr/bin/env python3\nfrom math import pi\nif __name__ == \"__main__\":\n d, h, v, e = map(int, input().split())\n time = pi*h*d**2/(4*(-pi*e*d**2/4 + v))\n if v <= pi*e*d**2/4:\n print(\"NO\")\n else:\n print(\"YES\")\n print(time)\n", "import sys\nimport os\nimport math\nfrom sys import stdin, stderr, stdout, exit\n\nd, h, v, e = list(map(int, stdin.readline().split()))\n\nv = 4*v/math.pi/d/d\n\nif(v < e):\n\tstdout.write('NO')\n\texit(0)\n\nstdout.write('YES\\n')\nstdout.write(str(h/(v-e)))\n", "a=list(map(int,input().split()))\r\nd = a[0]\r\nh = a[1]\r\nv = a[2]\r\ne = a[3]\r\npi = 3.1415926535\r\nif v<pi*d*d*e/4:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\\n\")\r\n time = (pi*d*d*h)/(4*v-pi*d*d*e)\r\n print(time)\r\n ", "import math\n\nl = input().split()\nd, h, v, e = int(l[0]), int(l[1]), int(l[2]), int(l[3])\n\nspeed = v / (math.pi * (d/2.0) ** 2)\nif speed <= e:\n print(\"NO\")\nelse:\n ans = h / (speed - e)\n if ans > 10 ** 4:\n print(\"NO\")\n else:\n print(\"YES\")\n print(ans)", "import math\n\nd12, h12, v, e1 = map(float, input().split())\nr = d12 / 2.0\nrate = v / (math.pi * r * r)\nd2 = rate - e1\n\nif d2 <= 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n ans = h12 / d2\n print(\"%.12lf\" % ans)\n\n\t \t\t\t\t\t \t \t\t\t \t \t \t", "d, h, v, e = input().split()\nd, h, v, e = int(d), int(h), int(v), int(e)\nPI = 3.14159265359\nr = d / 2\ndecrease = v / (PI * r * r)\ndiff = decrease - e\nif diff <= 0:\n print(\"NO\")\nelse:\n res = h / diff\n if res > 10000:\n print(\"NO\")\n else:\n print(\"YES\")\n print(h / diff)\n", "import math\r\n\r\ndef f():\r\n d, h, v1, e = map(int, input().split())\r\n s = math.pi * (d / 2)**2\r\n v2 = s * e\r\n if v2 > v1:\r\n print('NO')\r\n return\r\n value = s * h\r\n a = value / (v1 - v2)\r\n if a > 10000 or a < 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\n print(a)\r\n\r\nf()\r\n", "import cmath\r\na = cmath.pi\r\nd, h, v, e = [int(x) for x in input().split()]\r\nobj = (d/2)**2*a*h\r\nps = v - (d/2)**2*a*e\r\nif ps < 0 or obj/ps > 10000:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(obj/ps)", "import math\ninputItems = tuple(map(int,input().split()))\n\nmultiplier = (math.pi * inputItems[0] * inputItems[0])/4\n\nvolPresent = multiplier * inputItems[1]\n\nvolRateRain = inputItems[3] * multiplier\n\nvolRateDrink = inputItems[2]\n\nif volRateRain>=volRateDrink:\n print(\"NO\")\n\n\nelse:\n finishRate = volRateDrink - volRateRain\n timeTaken = volPresent/finishRate\n print(\"YES\")\n print(timeTaken)\n\n", "d, h, v, e = map(int, input().split())\r\nfrom math import pi\r\nv /= pi * d ** 2 / 4\r\nif v < e: print('NO')\r\nelse:\r\n ans = h / (v - e)\r\n print('YES')\r\n print(ans)\r\n", "import math\r\nd, h, v, e = map(int, input().split())\r\n\r\nda = d*d/4*math.pi\r\nch = v / da\r\nif ch>e:\r\n\tprint('YES',h/(ch-e),sep=\"\\n\")\r\nelse:\r\n\tprint('NO')\r\n\t", "import math\r\nd, h, v, e = [int(i) for i in input().split()]\r\nt = e*d**2*math.pi/4\r\nif t >= v:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(d**2*math.pi/4*h/(v-t))\r\n", "import math\nd, h, v, e = list(map(int, input().split()))\n\narea = math.pi * d * d / 4\nnet = v / area - e\nt = h / net\nif t > 0.0001 and t < 10000:\n print(\"YES\")\n print(t)\nelse:\n print(\"NO\")\n", "from math import pi\r\n\r\nd, h, v, e = map(int, input().split(' '))\r\nv = (4 * v) / (pi * d * d)\r\nif e >= v:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(h / (v - e))", "from math import pi\r\n\r\nd, h, v, e = map(int, input().split())\r\ns = (d / 2) ** 2\r\ns *= pi\r\ne = s * e\r\n\r\nif e >= v:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n V = s * h\r\n print(V / (v - e))\r\n", "import math\r\nd, h, v, e = map(int, input().split())\r\n#space = math.pi * (d * d) * h / 4\r\neps = 10 ** -4\r\nl = -1\r\nr = 10 ** 4\r\nres = -1\r\n\r\n\r\ndef space(t):\r\n return math.pi * (d * d) / 4 * (h + e * t) - v * t\r\nif (e * math.pi * (d * d) / 4 > v):\r\n print('NO')\r\nelse:\r\n while abs(space(res)) >= eps:\r\n res = (l + r) / 2\r\n if space(res) < 0 :\r\n r = res\r\n else:\r\n l = res \r\n #print(res)\r\n print('YES')\r\n print(res)\r\n", "from math import *\r\n\r\nd, h, v, e = map(int, input().split())\r\n\r\ncurV = h * (d / 2) ** 2 * pi\r\nwatS = e * (d / 2) ** 2 * pi\r\n\r\nif watS >= v:\r\n print(\"NO\")\r\n \r\nelse:\r\n print(\"YES\")\r\n print(curV / (v - watS))", "import math\r\nd, h, v, e = map(int, input().split())\r\ns = math.pi * (d / 2) ** 2\r\nif e * s >= v:\r\n\tprint('NO')\r\nelse:\r\n\tans = h * s / (v - e * s)\r\n\tprint(\"YES\\n%s\" % ans)", "import math\r\npi = math.pi\r\n\r\nd, h, v, e = input().split(' ')\r\nd = int(d)\r\nh = int(h)\r\nv = int(v)\r\ne = int(e)\r\n\r\narea = (d ** 2) / 4 * pi\r\n\r\ndecrease = v / area\r\n\r\nif decrease > e:\r\n\tprint(\"YES\\n\" + str(h/(decrease - e)))\r\nelse:\r\n\tprint(\"NO\")", "import math\n\nd, h, v, e = map(int, input().split())\nS = math.pi * (d ** 2) / 4\nq = v / S\n\nif e > q:\n print('NO')\nelse:\n print('YES', h / (q - e), sep='\\n')\n", "from math import pi\n\nd,h,v,e = list(map(int, input().split()))\n\nr = d/2\nhr = v/(pi*r*r)\n\nif hr > e:\n print('YES')\n ans = h/(hr-e)\n print(ans)\nelse:\n print('NO')\n", "from math import pi\r\nimport sys\r\n\r\n\r\nif sys.version_info[0] == 2:\r\n input = raw_input\r\n\r\n\r\ndef rlist(t):\r\n return map(t, input().split())\r\n\r\n\r\ndef read_int_list():\r\n return rlist(int)\r\n\r\n\r\ndef write_list(lst, divider=\" \"):\r\n print(divider.join(map(str, lst)))\r\n\r\n\r\ndef main():\r\n d, h, v, e = read_int_list()\r\n denom = (4*v/pi/d**2-e)\r\n print(\"NO\" if denom <= 0 else \"YES\\n{}\".format(h/denom))\r\n\r\nmain()", "from math import pi\nd, h, v, e = map(int, input().split())\n\nr = d/2\nsquare_bottom = pi*(r**2)\nchange_sec = v/square_bottom - e # change to bottom\nfinish_time = h/change_sec\nif change_sec <= 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(finish_time)\n", "p=3.14159265959\r\na=input()\r\nl=a.split(\" \")\r\nl1=[]\r\nfor i in l:\r\n l1.append(int(i)) \r\nd=l1[0]\r\nh=l1[1]\r\nv=l1[2]\r\ne=l1[3]\r\nincrease=p*(d**2)/4*e\r\nif(increase>v):\r\n print(\"NO\")\r\nelse:\r\n t=(p*(d**2)*h/4)/(v-(p*(d**2)*e/4))\r\n print(\"YES\")\r\n print(t)\r\n", "import math\r\n\r\n\r\ndef main_function():\r\n d, h, v, e = [int(i) for i in input().split(\" \")]\r\n cross_section = (math.pi * d ** 2) / 4\r\n v = v / cross_section\r\n if v > e:\r\n print(\"YES\")\r\n print(h / (v - e))\r\n else:\r\n print(\"NO\")\r\n\r\nmain_function()\r\n", "import math\nstr=input('').split(' ');\nd=int(str[0]);\nh=int(str[1]);\nv=int(str[2]);\ne=int(str[3]);\ntmp=d*d/4*math.pi\nif tmp*e<v:\n\tprint('YES')\n\tprint(tmp*h/(v-tmp*e))\nelse:\n\tprint('NO')", "import math\r\nd, h, v, e = [int(x) for x in input().split()]\r\ncylinder_area = math.pi * ((d / 2) ** 2)\r\ncurrent_water_volume = cylinder_area * h\r\nincrease_per_second = cylinder_area * e\r\ndecrease_per_second = v\r\neffective_decrease = decrease_per_second - increase_per_second\r\nif effective_decrease < 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n number_of_seconds = current_water_volume / effective_decrease\r\n print(number_of_seconds)\r\n", "d, h, v, e = map(int, input().split())\n\nimport math\nhv = v / (d * d * math.pi / 4)\n\nif hv <= e:\n print(\"NO\")\nelse:\n import math\n print(\"YES\")\n print(h / (hv - e))\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\nimport math\r\n\r\npi = math.acos(-1.0)\r\n\r\n[d, h, v, e] = list(map(int, input().split()))\r\n\r\nt = pi*(d*0.5)**2*h/(v-pi*(d*0.5)**2*e)\r\nif t < 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(t)", "d,h,v,e = map(int, input().split())\r\nimport math\r\nx = 4*v/(math.pi*d*d)\r\nprint(f'YES\\n{h/(x-e)}' if e < x else 'NO')\r\n", "import math\r\nd, h, v, e = map(int, input().split())\r\nA = math.pi * (d / 2) ** 2\r\nif v <= A * e:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print((A * h) / (v - A * e))", "import math\r\n\r\nd, h, v, e = map(int, input().split())\r\n\r\nd /= 100\r\nh /= 100\r\ne /= 100\r\n\r\ns = math.pi * d ** 2 / 4\r\nu = 0.000001 * v / s\r\ny = e - u\r\n\r\nif y > 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(- h / y)\r\n", "import math\r\nd,h,v,e = map(int, input().split())\r\ndrink_s = (4*v)/(math.pi * (d**2))\r\nif drink_s > e:\r\n print(\"YES\")\r\n result = (h / (drink_s - e))\r\n print(round(result,12))\r\nelse:\r\n print(\"NO\")", "d, h, v, e = map(int, input().split())\r\npi = 3.141592653589793\r\nvolume = (d/2)**2 * pi * h\r\ne *= (d/2)**2 * pi\r\nif e >= v:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(volume / (v - e))", "# http://codeforces.com/contest/667/problem/A\nimport math\n\nd, h, v, e = [int(n) for n in input().split()]\na = math.pi * ((d/2) ** 2)\n\nrate = v - (e*a)\nif rate > 0:\n\tprint(\"YES\")\n\tprint((h*a)/rate)\nelse:\n\tprint(\"NO\")", "import math\r\nd,h,v,e=map(int,input().split())\r\nif v/d**2*1/math.pi*4<=e:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(h/(v/d**2*1/math.pi*4-e))", "from math import pi\nd, h, v, e = map(int, input().split())\n\nsp_in = pi*((d/2)**2)*e\n\nif v > sp_in:\n print(\"YES\")\n print(pi*((d/2)**2)*h/(v-sp_in))\nelse:\n print(\"NO\")\n\n \t\t \t \t \t \t \t \t\t\t\t\t \t \t", "from math import pi\r\nd, h, v, e = map(int, input().split())\r\nr = d / 2\r\nvolume = pi * r ** 2 * h\r\ncnt = 0\r\nfill = e * pi * r ** 2\r\nif v < fill:\r\n\tprint(\"NO\")\r\n\texit()\r\nprint(\"YES\")\r\nvolume = pi * r ** 2 * h\r\nup = fill - v\r\nprint(abs(volume / up))", "d, h, v, e = input().split()\nd = int(d) # diametro\nh = int(h) # altura da agua\nv = int(v) # beber\ne = int(e) # chuva\n\nve = 3.141592653 * (d/2)**2 * e\nv1 = 3.141592653 * (d/2)**2 * h\n\nif ve >= v:\n print('NO')\nelse:\n print('YES')\n print(v1/(v-ve))\n\n\n\t \t \t \t\t \t \t \t \t \t\t \t\t\t", "from math import pi\r\n\r\nd, h, v, e = map(int, input().split())\r\ndh = v / (pi * d ** 2 / 4) - e\r\nprint(\"NO\" if dh <= 0 else \"YES\\n\" + str(h / dh))\r\n", "from math import pi\r\n\r\nd, h, v, e = map(int, input().split())\r\nt = h / (4*v/(pi*d*d) - e)\r\n\r\nif t > 0:\r\n print('YES', t, sep='\\n')\r\nelse:\r\n print('NO')", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(d, h, v, e):\r\n area = (d / 2) ** 2 * math.pi\r\n vol = area * h\r\n dec = v\r\n inc = area * e\r\n if inc >= dec:\r\n return None\r\n return vol / (dec - inc)\r\n\r\ndef main():\r\n d, h, v, e = map(int, input().split())\r\n ans = solve(d, h, v, e)\r\n if ans:\r\n print('YES')\r\n print('%.9f' % ans)\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#667A\r\nfrom math import pi\r\n[d,h,v,e] = list(map(float,input().split()))\r\nvh = 4*v/(pi*d**2)\r\nif vh < e:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(h/(vh-e))", "d,h,v,e=input().split()\r\nd,h,v,e=[int(d),int(h),int(v),int(e)]\r\n\r\nif( v < (0.78539816475*d*d *e)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n time=(0.78539816475*d*d *h)/(v-(0.78539816475*d*d *e))\r\n print(time)\r\n", "from math import pi\n\nentrada = input()\nentrada = entrada.split(' ')\n\nd = int(entrada[0])\nh = int(entrada[1])\nv = int(entrada[2])\nencher = int(entrada[3])\n\narea = (pi*d*d)/4\nbeber = v/area\ntempo = h/(beber - encher)\n\nif beber <= encher:\n print('NO')\nelse:\n print('YES')\n print(tempo)\n\n \t\t\t\t \t \t\t \t \t\t\t", "'''\r\nCreated on Apr 29, 2016\r\nGmail : [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\nimport math\r\nimport cmath\r\npi = math.acos(-1)\r\n#pi = 22/7\r\nd, h, v, e = map(float,input().split())\r\n#if v<e:\r\n #print(\"NO\")\r\n#else:\r\n#r = float(d/2\r\nr = (v)/(pi*(d/2)**2)\r\n # print(in_vol)\r\n #drk = 1/(pi*(r**2)*h)#v/in_vol\r\n#ans = in_vol - e \r\nif (r>e):\r\n print(\"YES\")\r\n print((h)/(r - e))\r\nelse:\r\n #ans1 =(h)*(1/ans)\r\n print(\"NO\")\r\n #print(ans1) \r\n ", "import math\r\n\r\n\r\ndef main():\r\n diameter, height, speed, increment = map(int, input().split())\r\n decrement = speed / (math.pi / 4 * (diameter ** 2))\r\n if decrement < increment:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n print(height / (decrement - increment))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from math import *\r\nd, h, v, e = map(int, input().split())\r\nif e * pi * (d / 2.0)**2 < v:\r\n print(\"YES\")\r\n print(h * pi * (d / 2.0)**2 / (v - e * pi * (d / 2.0)**2 ))\r\nelse:\r\n print(\"NO\")", "from math import pi\r\nd , h, v ,e = map(int , input().split()) \r\nvolume = ((d**2 / 4 ) * pi) \r\nconsumed_per_seconde = v / volume \r\nif consumed_per_seconde > e : \r\n print(\"YES\")\r\n print(h / (4*v/ (pi *d**2 ) - e))\r\nelse : \r\n print(\"NO\")", "d, h, v, e = map(int, input().split())\nfrom math import pi\n\nt = (pi*d*d*h) / (4*v-pi*d*d*e)\nif t < 0:\n\tprint ('NO')\n\texit()\nprint ('YES')\nprint (round(t, 10))\n", "import math\r\nd,h,v,e=map(int,input().split())\r\ns=math.pi*d*d/4\r\ne*=s\r\nprint('NO'if e>=v else'YES\\n'+str(h*s/(v-e)))", "import math\r\nd,h,v,e=map(int,input().split())\r\na=v-(math.pi*d*d*e/4)\r\nif(a<=0):\r\n print(\"NO\")\r\n exit()\r\nb=math.pi*d*d*h/4\r\nprint(\"YES\")\r\nprint(b/a)", "from math import pi\n\nd,h,v,e = [int(i) for i in input().split()]\nv = v / (pi * (d/2)**2)\nif v <= e:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(h / (v-e))\n\t\t\t\t\t \t \t \t\t\t\t\t\t\t\t\t\t\t \t \t\t", "d,h,v,e=map(float,input().split())\r\npi=3.1415926535897932384626433832\r\nif((pi*d*d*e)/4>=v):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tans=(pi*d*d*h)/4\r\n\tans=ans/(v-(pi*d*d*e)/4)\r\n\tprint(ans)", "import math\r\n\r\nd, h, v, e = map(int, input().split())\r\n\r\ndrink_s = (4 * v) / (math.pi * (d**2))\r\n\r\nif drink_s > e:\r\n print(\"YES\")\r\n result = (h / (drink_s - e))\r\n print(round(result, 12))\r\nelse:\r\n print(\"NO\")", "import math\r\n(d,h,v,e) = tuple([int(p) for p in input().strip('\\n').split(' ')])\r\nincreaseByRain = math.pi * (d/2) * (d/2) * e\r\ntotalRate = v - increaseByRain\r\nif totalRate <= 0:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\tcurrentVol = math.pi * (d/2) * (d/2) * h\r\n\tprint(str(currentVol/totalRate))", "d,h,v,e = map(int, input().split())\r\ns = 3.14159265354/4*d*d \r\nif s*e-v >= 0.0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(h/(v/s-e))\r\n \r\n ", "import math\n\n\ndef first():\n inp = input().split(\" \")\n d = float(inp[0])\n h = float(inp[1])\n v = float(inp[2])\n e = float(inp[3])\n h_y = v/(math.pi*(d/2)**2)\n if(h_y > e):\n print(\"YES\")\n print(h/(h_y - e))\n else:\n print(\"NO\")\n\n\nfirst()", "d,h,v,e = map(int,input().split(' '))\r\nPI = 3.1415926\r\nS = (d/2)*(d/2)*PI\r\nV = h*S\r\nV2 = e*S\r\nif(V2 >= v):\r\n print(\"NO\")\r\n exit\r\nelse:\r\n print(\"YES\")\r\n print(abs(V/(V2-v)))\r\n", "import math\r\nd, h, v, e = map(int, input().split(' '))\r\nif v <= math.pi * e * (d / 2) * (d / 2):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print((math.pi * h * (d / 2) * (d / 2)) / (v - math.pi * e * (d / 2) * (d / 2)))\r\n", "d, h, v, e = map(int, input().split())\r\n\r\nfrom math import pi\r\nS = pi * (d / 2) * (d / 2)\r\ne = S * e\r\n\r\nif v <= e:\r\n print('NO')\r\nelse:\r\n v -= e\r\n V = S * h\r\n print('YES')\r\n print(V / v)\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 26 13:14:58 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 68 - CF667-DIV2A\r\n\"\"\"\r\nimport math\r\n\r\ndiam , height, volDrink, levFill = map(int,input().split())\r\nvolFill = math.pi*((diam/2)**2)*levFill\r\ninitVol = math.pi*((diam/2)**2)*height\r\n\r\nif volFill >= volDrink:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(initVol/(volDrink-volFill))", "from math import pi\r\nd, h, v, e = map(int, input().split())\r\nt = pi*h*d*d/4\r\ne = pi*e*d*d/4\r\nif e > v:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(t/(v-e))", "import math\n\nd, h, v, e = map(int, input().split())\n\nvh1 = math.pi*(d/2)**2\ndv = v-e*vh1\nprint ( \"NO\" if v <= e*vh1 else f\"YES\\n{vh1*h/dv:.12f}\")\n\n\n \t\t\t \t \t\t \t \t\t\t \t \t \t \t\t", "from math import *\r\n\r\nd, h, v, e = map(int, input().split(' '))\r\n\r\nif v/((d/2)**2 * pi) <= e:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(h/(v/((d/2)**2 * pi) - e))", "import math\r\nd, h, v, e = map(int, input().split())\r\nif math.pi*d*d*e/4 >= v:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print((math.pi*d*d*h/4)/(v - math.pi*d*d*e/4))\r\n", "import math\r\n\r\nd, h, v, e = map(int, input().split())\r\n\r\nrain = math.acos(-1.0) * d * d * e * 0.25\r\nif(rain < v):\r\n print('YES')\r\n v0 = math.acos(-1.0) * d * d * h * 0.25\r\n w = v - rain\r\n print(v0 / w)\r\nelse:\r\n print('NO')", "import sys\nimport math\nimport itertools as it\nimport operator as op\nimport fractions as fr\n\n\nd,h,v,e = map(int, sys.stdin.readline().split())\n\ns = math.pi * d * d / 4\n\nv /= s\n\nif v <= e:\n print('NO')\nelse:\n print('YES')\n print(h/(v-e))\n\n", "import math\nd, h, v, e = map(int, input().split())\nif e >= v / (math.pi * (d / 2) ** 2):\n print('NO')\nelse:\n print('YES', h / (v / (math.pi * (d / 2) ** 2) - e), sep='\\n')\n", "import math\r\n\r\nd, h, v, e = list( map(int, input().split()) )\r\nr = d/2\r\nVi = math.pi * ( r**2 ) * h\r\nVin = math.pi * ( r**2 ) * e\r\nVout = v\r\ndelV = Vout - Vin\r\n\r\nif Vin > Vout:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print( (Vi / delV) )\r\n", "from math import pi\r\nd,h,v,e = list(map(int, input().split()))\r\na = (d**2 / 4)*pi*h\r\nve = (d**2 / 4)*pi*e\r\nif (v > ve):\r\n print(\"YES\")\r\n print(a / (v - ve))\r\nelse:\r\n print(\"NO\")", "from math import pi\nd, h, v, e = map(int, input().split())\ncmvol = pi*(d/2)**2\ninit = h*cmvol\ndecr = v\nincr = e*cmvol\nif incr - decr >= 0.000000001:\n print(\"NO\")\nelse:\n print(\"YES\")\n print(init/(decr-incr))\n\n", "from math import *\r\nd,h,v,e=map(int,input().split())\r\nif v-pi*(d/2)*(d/2)*e<=0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ans=(pi*(d/2)*(d/2)*h)/(v-pi*(d/2)*(d/2)*e)\r\n print(\"{:.16f}\".format(ans))", "from __future__ import division\r\nfrom math import pi\r\n\r\n\r\ndef rlist(t):\r\n return map(t, input().split())\r\n\r\n\r\ndef read_int_list():\r\n return rlist(int)\r\n\r\n\r\ndef write_list(lst, divider=\" \"):\r\n print(divider.join(map(str, lst)))\r\n\r\n\r\ndef main():\r\n d, h, v, e = read_int_list()\r\n try:\r\n ans = h / (4*v/pi/d**2-e)\r\n except ZeroDivisionError:\r\n return print(\"NO\")\r\n print(\"NO\" if ans < 0 else \"YES\\n{}\".format(ans))\r\n\r\nmain()\r\n" ]

[ "from math import sqrt\r\nn=int(input())\r\nm=1\r\nwhile True:\r\n x=(n*m)+1\r\n flag=0\r\n for _ in range(2,int(sqrt(x))+1):\r\n if x%_==0:\r\n flag=1\r\n break\r\n if flag==1:\r\n print(m)\r\n break \r\n m+=1 \r\n ", "n = int(input())\r\n\r\ndef jn(n):\r\n\ti = 2\r\n\twhile i*i <=n and n%i !=0:\r\n\t\ti+=1\r\n\treturn (i*i>n)\r\n\r\nm = 1\r\n\r\nwhile True:\r\n\tif jn((n*m+1)):\r\n\t\tm+=1\r\n\telse:\r\n\t\tprint(m)\r\n\t\tbreak\r\n\r\n", "def isPrime(num): \n if num == 1: return False\n for i in range(2, num):\n if num % i == 0: \n return False\n return True\n\nn = int(input())\n\nfor i in range(1, 1001): \n comp = (n*i)+1\n if not isPrime(comp): \n print(i)\n break\n", "import bisect\r\nimport collections\r\nimport math\r\n\r\n\r\nn = int(input())\r\n#p = [int(x)-1 for x in input().split()]\r\nif n == 1:\r\n print(5)\r\nelse:\r\n primes = [0]*(2+10**6)\r\n for i in range(2, len(primes)):\r\n if primes[i]:\r\n continue\r\n j = 2*i\r\n while j < len(primes):\r\n primes[j] = 1\r\n j += i\r\n\r\n for i in range(1, 1+10**3):\r\n if primes[n*i+1]:\r\n print(i)\r\n break\r\n", "\r\nfrom math import sqrt\r\nn = int(input())\r\n\r\ndef solve( n ) :\r\n i = 1 \r\n def isPrime(n) :\r\n if n <= 2 : return True \r\n \r\n for i in range(2 , int(sqrt(n)) + 1) :\r\n if n % i == 0 :\r\n return False\r\n return True\r\n while isPrime(n * i + 1) :\r\n i += 1\r\n return i \r\n\r\nprint(solve( n ))", "n = int(input())\r\nm = 1\r\nflag = False\r\n\r\nwhile m:\r\n output = n*m + 1\r\n for i in range(2, output):\r\n if (output%i) == 0:\r\n print(m)\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n else:\r\n m += 1", "from math import sqrt\r\nn = int(input())\r\n\r\nif n==1:\r\n print(3)\r\nelif n%2 != 0:\r\n print(1)\r\nelse:\r\n j = 1\r\n cnt =0\r\n while(j<6):\r\n num = n*j +1\r\n \r\n for i in range(2, int(sqrt(num)) + 1):\r\n if num % i == 0:\r\n cnt = 1\r\n break\r\n if cnt == 1:\r\n print(j)\r\n break\r\n j+=1 \r\n \r\n ", "n=int(input())\r\nm=1\r\np=0\r\nif n%2!=0 and n>1:\r\n\tprint(n)\r\nelif n%2!=0 and n==1:\r\n\tprint(3)\r\nelif n==2:\r\n\tprint(4)\r\nelif n%2==0 and n>2:\r\n\tif (n*(n-2))+1==(n-1)*(n-1):\r\n\t\tprint(n-2)", "a = int(input())\r\nif a%2==1:\r\n print(3)\r\nelse:\r\n print(min(a+2,999))", "import sys\r\nfrom itertools import count\r\n\r\ndef main():\r\n is_prime = lambda x: all(x%i for i in range(2, int(x**.5)+1))\r\n n = int(sys.stdin.read().strip())\r\n return next(i for i in count(1) if not is_prime(n*i + 1))\r\n \r\nprint(main())\r\n", "n = int(input())\ndef prime(x):\n counter = 0\n for i in range(2,x):\n if x%i == 0:\n counter += 1\n break\n if counter == 0:\n return 1\n else:\n return 0\nm = 1\nwhile prime(m*n+1) == 1:\n m += 1\nprint(m)", "n = int(input())\n\ndef prime(n):\n\n if n < 2:\n return True\n\n for i in range(2, n):\n\n if n % i == 0:\n return False\n\n return True\n\ni = 1\nans = 1\nwhile True:\n num = (i * n) + 1\n\n if not prime(num):\n ans = i\n break\n i += 1\n\nprint(i)\n\t \t\t \t\t\t \t\t \t \t\t\t \t\t\t \t \t", "encontrado = False\nn = int(input())\ni = 1\nm = 1\n\n\"\"\"\nWell known algorithm got from chat gpt\n\"\"\"\n\n\ndef isPrime(n):\n if n <= 1:\n return False\n if n <= 3:\n return True\n if n % 2 == 0 or n % 3 == 0:\n return False\n i = 5\n while i * i <= n:\n if n % i == 0 or n % (i + 2) == 0:\n return False\n i += 6\n return True\n\n\nwhile not encontrado:\n if not isPrime(n * i + 1):\n encontrado = True\n m = i\n i += 1\n\nprint(m)\n\n \t \t \t\t\t\t\t\t\t\t\t \t \t\t\t\t \t \t\t \t\t", "n = int(input())\r\nprint(min(n+2, 999))\r\n", "n = int(input())\r\nfor i in range(1, 1001):\r\n s = n * i + 1\r\n for j in range(2, s):\r\n if s % j == 0:\r\n print(i)\r\n exit()", "import math\n\ndef isprime(a):\n for i in range(2, int(math.sqrt(a)) + 1):\n if a % i == 0:\n return False\n return True\n\nn = int(input())\n\nfor i in range(1, 1001):\n if i != n:\n if not isprime(i * n + 1):\n print(i)\n exit(0)\n\n \t \t\t \t \t \t \t \t\t \t\t\t\t \t", "def isprime(n):\n if n > 1:\n for i in range(2, int(n/2)+1):\n if (n % i) == 0:\n return False\n else:\n return True\n return True\n\na = int(input())\n\naux = 1\nwhile(True):\n x = a*aux+1\n if not isprime(x):\n print(aux)\n break\n\n aux += 1\n \t\t\t\t \t \t\t \t \t\t \t \t\t \t\t\t\t\t\t", "n = int(input())\r\nif n==1 or n==2:\r\n print(7)\r\nelse:\r\n print(n-2)", "nums = list(range(2, int(1e6)+1))\r\nprime_nums = []\r\nfor i in range(len(nums)//2):\r\n if nums[i] != -1:\r\n prime_nums.append(nums[i])\r\n for k in range(i, len(nums), nums[i]):\r\n nums[k] = -1\r\nfor i in range(len(nums)//2, len(nums)):\r\n if nums[i] != -1:\r\n prime_nums.append(nums[i])\r\n\r\nn = int(input())\r\nfor m in range(1, int(1e3)+1):\r\n if n*m+1 not in prime_nums:\r\n print(m)\r\n break\r\n", "t = int(input())\r\n\r\nif t > 3:\r\n print(t - 2) \r\n\r\nelse:\r\n print(t + 2)", "n = int(input())\n\nm = 1\nwhile True:\n aux = n*m + 1\n\n i = 2\n while True:\n if aux % i == 0:\n break\n i += 1\n\n if i == aux:\n m += 1\n else:\n print(m)\n break\n\n \t\t \t \t\t\t\t \t\t \t \t\t \t\t \t\t\t", "a = int(input())\r\nif a<=2:\r\n print(7)\r\nelse:\r\n print(a-2)", "c = [True] * 1000000\nfor i in range(2, 1000000):\n for j in range(i + i, 1000000, i):\n c[j] = False\nn = int(input())\nfor m in range(1, 1001):\n if c[n * m + 1] == False:\n print(m)\n break", "import math\r\n\r\ndef isPrime(n):\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\nif __name__ == '__main__':\r\n n = int(input())\r\n m = 1\r\n while True:\r\n if isPrime(n * m + 1) == False:\r\n break\r\n m += 1\r\n print(m)", "def is_prime(a):\n '''\n Retorna se o número é primo ou não.\n '''\n for d in range(2, a):\n if (a % d == 0):\n # não é primo.\n return 0\n \n # é primo\n return 1\n\nn = int(input())\n\nm = 1\n\nwhile True:\n a = n * m + 1\n if (not is_prime(a)):\n print(m)\n break\n else:\n m += 1\n \t \t\t\t\t\t\t \t\t\t \t\t \t \t", "def main():\r\n n = int(input())\r\n if n == 1:\r\n return 3\r\n if n == 2:\r\n return 4\r\n if n % 2 == 1:\r\n return 1\r\n i = 3\r\n while i < n:\r\n s = i**2 - 1\r\n if s/n == s//n:\r\n return s//n\r\n i+=2\r\n\r\n\r\n# for _ in range(int(input())):\r\nprint(main())", "n = int(input())\r\n\r\ndef isPrime(num):\r\n for i in range(2, num):\r\n if num%i == 0:\r\n return False\r\n return True\r\n\r\nfor m in range(1, 1001):\r\n if not isPrime(n*m + 1):\r\n print(m)\r\n break", "# #✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧\r\n# ◕ █ █ █ █ /████\\ ██\\ █ /██\\ ██ ██\\ █ ◕\r\n# ◕ █ █ █ █ █\\ \\█ █\\█\\ █ /█/\\█\\ █\\█\\ █ ◕\r\n# ◕ █\\ /█ █ █ █ █ \\█\\ █ /█/ \\█\\ ██ █ \\█\\ █ ◕\r\n# ◕ █████ █ █ \\████\\ █ \\█\\ █ █/ \\█ ██ █ \\█\\ █ ◕\r\n# ◕ █/ \\█ █ █ \\█ █ \\█\\ █ ████████ ██ █ \\█\\ █ ◕\r\n# ◕ █ █ █\\ /█ █\\ /█ █ \\█\\█ █ █ ██ █ \\█\\█ ◕\r\n# ◕ █ █ \\██████/ \\████/ █ \\██ █ █ ██ █ \\██ ◕\r\n#✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧\r\ndef prime(n):\r\n x = n\r\n n = int(n**0.5)\r\n flag = False\r\n for i in range(2,n+1):\r\n if x%i == 0:\r\n flag = True\r\n if flag:\r\n return False\r\n else:\r\n return True\r\nn = int(input())\r\nx = 1\r\nwhile prime((n*x)+1):\r\n x+=1\r\nprint(x)", "n = int(input())\r\nprint(n + 2 if n < 999 else n - 2)", "n = int(input())\n\n\ndef main():\n for m in range(1, 1000):\n sum = (n * m) + 1\n for i in range(2, int(sum / 2) + 1):\n if sum % i == 0:\n print(m)\n return\n\n\nmain()\n", "a= int(input())\r\ni=1\r\nwhile i>0:\r\n b= (a*i)+1\r\n for j in range(2,b):\r\n if b%j==0:\r\n b=0\r\n print(i)\r\n break\r\n i+=1\r\n if b==0:\r\n break", "def is_prime(n:int) -> bool:\n if (n > 1):\n for i in range(2, int(n ** (1/2)) + 1):\n if (n % i == 0):\n return False\n\n return True\n\n return False\n\ndef polandball_and_hypothesis(n: int) -> int:\n m = 1\n\n while (is_prime(n*m + 1)):\n m += 1 \n\n return m\n\n# Input\n\nn = int(input())\nprint(polandball_and_hypothesis(n))\n\n## Reference\n## https://github.com/ErickSaito/Algorithms-Data-Structures/tree/master/IsPrime\n\n\t \t\t \t \t\t\t \t\t \t\t\t\t\t", "def funcao(n):\n m = 1\n while m <= 1000:\n numero = n * m + 1\n for e in range(2, numero):\n if( numero % e == 0):\n return m\n m += 1\n\nprint(funcao(int(input())))\n\t\t \t\t \t \t\t \t \t\t \t\t\t\t \t\t", "n = int(input())\nif n ==1:\n print(5)\nelif n==2:\n print(4)\nelse:\n print(n-2)", "f=int(input())\r\nif f==1:\r\n print(3)\r\nelif f==2:\r\n print(4)\r\nelse:\r\n print(f-2)", "n = int(input())\nprint(n-2 + (n <= 2) * 4)\n", "n = int(input())\r\na = 0\r\nb = False\r\nwhile not b:\r\n a += 1\r\n c = a * n + 1\r\n for i in range(2, int(c ** 0.5) + 1):\r\n if c % i == 0:\r\n b = True\r\n print(a)\r\n break", "n = int(input())\n\nf = 0\nfor m in range(1, 1001):\n for i in range(2,1001):\n if (n*m + 1) %i == 0 and i < n*m + 1:\n print(m)\n f = 1\n break\n if i >= n*m + 1:\n break\n if f:\n break\n\n \t\t\t\t \t \t\t\t\t\t \t \t \t \t", "import math\r\n\r\nn=int(input())\r\nm=1\r\n\r\n\r\ndef prime(n: int):\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nif not prime(n*m+1):\r\n print(m)\r\nelse:\r\n while prime(n*m+1):\r\n m+=1\r\n print(m)", "n = int(input())\r\ndef findSimple(n):\r\n i = 2\r\n while i * i <= n and n % i !=0:\r\n i+=1\r\n return (i * i > n) \r\n\r\nm = 1\r\n\r\nwhile True:\r\n if findSimple((n * m) + 1):\r\n m += 1\r\n else:\r\n print(m)\r\n break", "def isPrime(n) : \r\n \r\n if (n <= 1) : \r\n return False\r\n if (n <= 3) : \r\n return True\r\n \r\n if (n % 2 == 0 or n % 3 == 0) : \r\n return False\r\n \r\n i = 5\r\n while(i * i <= n) : \r\n if (n % i == 0 or n % (i + 2) == 0) : \r\n return False\r\n i = i + 2\r\n \r\n return True\r\n\r\nn = int(input())\r\n\r\nfor i in range(1, 1001):\r\n if not isPrime(n*i+1):\r\n print(i)\r\n exit()\r\n\r\n ", "n = int(input())\r\nm = 0\r\nif n == 1:\r\n m = 3\r\nelif n == 2:\r\n m = 7\r\nelse:\r\n m = n - 2\r\nprint(m)", "n=int(input())\r\nm=0\r\na=0\r\nk=0\r\nwhile a == 0:\r\n m=m+1\r\n b=m*n+1\r\n for i in range(2, b // 3):\r\n if (b % i == 0):\r\n k = k+1\r\n if (k <= 0):\r\n a=0\r\n else:\r\n print(m)\r\n break\r\n", "n = int(input())\r\nprint(n - 2) if n > 3 else print(n + 2)\r\n", "def is_prime(x):\n if x <= 1:\n return False\n if x <= 3:\n return True\n if x % 2 == 0 or x % 3 == 0:\n return False\n i = 5\n while i * i <= x:\n if x % i == 0 or x % (i + 2) == 0:\n return False\n i += 6\n return True\n\n\nnumber = int(input())\n\nfor i in range(1, 1000):\n if not is_prime(number*i + 1):\n print(i)\n break\n \t\t \t\t \t\t\t \t\t \t\t\t\t", "n = int(input())\r\nm = 0\r\n\r\n\r\nif(n < 3):\r\n m = 7\r\nelse:\r\n m = n-2\r\n\r\nprint(m)", "n = int(input())\nmax_number = 999\nans = min(n + 2, max_number)\nprint(ans)\n\t\t\t \t\t\t \t \t\t\t \t \t\t\t\t \t \t", "\ndef main():\n\tn=int(input())\n\tif(n>2):\n\t\tprint(n-2)\n\telse:\n\t\tprint(n+2)\n\nif __name__ == '__main__':\n\tmain()", "import math\n\nn = int(input())\n\n\ndef ehprimo(m):\n for l in range(2, int(math.sqrt(m)) + 1):\n if m % l == 0:\n return False\n\n return True\n\nif n == 1:\n print(3)\nelif n % 2 != 0:\n print(1)\nelse:\n for m in range(1001):\n if not ehprimo(m*n + 1):\n print(m)\n break\n \n\n\n \t\t \t\t \t\t \t\t\t\t\t \t\t \t\t", "def e_primo(n):\n for div in range(2,n):\n if (n % div == 0):\n return False\n return True\n\n\nn = int(input())\nfor m in range(1,1000):\n if e_primo(n*m +1) == False:\n print(m)\n break\n\t \t\t\t \t\t \t \t\t \t \t\t\t \t", "\r\nn = int(input())\r\nif n==1 :\r\n print(3)\r\nelif n%2 and n!=1:\r\n \r\n print(1)\r\n \r\nelif n==2 :\r\n \r\n print(4)\r\n \r\nelif n%2==0 :\r\n \r\n print(n-2)\r\n \r\n\r\n \r\n ", "n=int(input())\r\nif(n%2==1 and n!=1):\r\n print(n)\r\nelif(n==1):\r\n print(3)\r\nelif(n==2):\r\n print(4)\r\nelif(n==6):\r\n print(4)\r\nelif(n==210):\r\n print(4)\r\nelif(n==330):\r\n print(5)\r\nelif(n==18):\r\n print(3)\r\nelif(n==24):\r\n print(1)\r\nelse:\r\n s=n%3\r\n if(s==0):print(4)\r\n else:print(n//2)", "def primecheck(n)->bool:\n if n==0 or n==1 :\n return False\n for i in range(2,int(n)):\n if n%i==0:\n return False\n return True\n\n\n\ndef f(n):\n for i in range(1,1000):\n if primecheck(i*n+1):\n continue\n else:\n return i\n\nn= int(input())\nprint(f(n))\n\t \t\t\t \t \t\t \t \t \t\t", "\r\n\r\n\r\n\r\ndef get_num(n):\r\n max_val = n * 1000 + 1\r\n is_prime = [True] * max_val\r\n\r\n for i in range(2, max_val):\r\n if not is_prime[i]:\r\n continue\r\n for j in range(i * i, max_val, i):\r\n is_prime[j] = False\r\n\r\n for m in range(1, 1001):\r\n if not is_prime[n * m + 1]:\r\n return m\r\n\r\n return -1\r\n\r\nprint(get_num(int(input())))\r\n", "from math import sqrt\r\n\r\ndef isPrime(n):\r\n \r\n i = 2\r\n while i < sqrt(n):\r\n \r\n if n % i == 0:\r\n return False\r\n \r\n i += 1\r\n \r\n return True\r\n\r\nn = int(input())\r\n# such m that n*m+1 is not a prime number\r\nfor m in range(1, 1001):\r\n if not isPrime(n*m+1):\r\n print(m)\r\n break\r\n", "n = int(input())\r\nk = 1\r\nflag=1\r\nm = n\r\nwhile flag:\r\n m = m*k+1\r\n for i in range(2,m):\r\n if m%i==0:\r\n print(k)\r\n flag= 0\r\n break\r\n k+=1\r\n m = n\r\n \r\n\r\n\r\n \r\n", "def _input(): return list(map(int, input().split()))\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n if n == 1: return 3\r\n if n == 2: return 4\r\n return n - 2\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n", "n = int(input())\r\nprint(min(n+2, 999))\r\n# WE'LL MAKE SURE n*m+1 YIELDS AN EVEN NUMBER,\r\n# MEANS, n*m SHOULD YIELD AN ODD NUMBER\r\n# MEANS NO MATTER WHAT n IS, m SHOULD HAVE A POSITIVE DIFF OF 2\r\n# WHY 999? BECAUSE n SHOULD BE <1000", "def is_prime(n):\n divisors = 0\n if n == 2:\n return True\n for i in range(1, int(n**1/2) + 1):\n if n % i == 0:\n divisors += 1\n\n if divisors > 1:\n return False\n\n return True\n\ndef solution(n):\n for m in range(1, 1001):\n if not is_prime(n * m + 1):\n return m\n\nn = int(input())\n\nprint(solution(n))", "def prime(n):\r\n for i in range(2, n):\r\n if (n % i == 0):\r\n return False\r\n else:\r\n return True\r\nn = int(input())\r\nm = 1\r\nfor i in range(1000):\r\n if (prime((n*m)+1) == False):\r\n print(m)\r\n break\r\n else:\r\n m += 1", "def IsPrime(number):\n # if number is equal to or less than 1, return False\n if number <= 1:\n return False\n\n for x in range(2, number):\n # if number is divisible by x, return False\n if not number % x:\n return False\n return True\n\nn = int(input())\n\nfor m in range(int(10e3)):\n if not IsPrime((n*(m+1))+1):\n print(m+1)\n break\n \t\t\t\t\t\t \t \t\t\t \t\t \t\t \t \t\t\t", "import math\n\ndef is_prime(n):\n for i in range(2, n):\n if n%i == 0:\n return False\n return True\n\ndef main():\n n = int(input())\n for m in range(1, 1000):\n if is_prime(n*m + 1) == False:\n print(m)\n return\n \n\nmain()\n\n \t\t\t \t \t \t \t \t\t \t \t \t", "from math import sqrt\r\nn = int(input())\r\nfor m in range(1,10**3+1):\r\n rep = False\r\n for k in range(2,m*n):\r\n #print(m,k)\r\n if not (m*n+1)%k: rep = True\r\n if rep: print(m);quit()\r\nprint(\"Pas trouvé\")", "n=int(input());print([3,4,n-2][(n>1)+(n>2)])", "\r\ndef is_prime(number):\r\n for i in range(2, number//2 + 1):\r\n if number % i == 0:\r\n return 0\r\n return 1\r\n\r\nn = int(input())\r\ni = 1\r\nwhile is_prime(i*n + 1):\r\n i = i + 1\r\n\r\nprint(i)\r\n", "from math import sqrt\r\nn = int(input())\r\nif n == 1:\r\n print(5)\r\nelif n & 1 != 0:\r\n print(1)\r\nelse:\r\n if n == 2:\r\n print(4)\r\n else:\r\n i = 1\r\n while 1:\r\n a = (n * i) + 1\r\n if a % (int(sqrt(a))) == 0:\r\n break\r\n i += 1\r\n print(i)", "n = int(input())\r\nm = 1\r\nc = 0\r\nwhile(1):\r\n num = n * m + 1\r\n for x in range(2, num):\r\n if(num % x == 0):\r\n c = 1\r\n break\r\n if(c == 1):\r\n print(m)\r\n break\r\n m += 1", "a = int(input())\r\nfor i in range(1,1000+1):\r\n m = (a * i)+1\r\n f = m**0.5\r\n f1 = 0\r\n for j in range(1,int(f)+1):\r\n if m % j == 0:\r\n f1 += 1\r\n if f1== 2:\r\n print(i)\r\n break", "entrada = int(input())\nprimo = True\nmult = 0\nwhile primo :\n mult += 1\n valor = (entrada * mult) + 1\n for i in range (2, int(valor**(1/2)+1)):\n if valor % i == 0:\n primo = False\nprint(mult)\n\t \t\t \t \t \t \t \t \t\t", "n=int(input())\r\nprint(7 if n<3 else n-2)\r\n", "num = int(input())\n\ndef is_prime(n):\n for i in range(2, n):\n if n%i == 0:\n return False\n \n return True\n\ncont = 1\n\nwhile(True):\n if(is_prime(cont*num + 1)):\n cont += 1\n else:\n print (cont)\n break\n\t \t\t\t \t\t \t\t \t\t \t\t\t\t \t", "from math import sqrt\r\n\r\ndef isPrime(n):\r\n for i in range(2, int(sqrt(n)) + 1):\r\n if n % i == 0:\r\n return True\r\n \r\n return False\r\n\r\n\r\nn = int(input())\r\n\r\nif n == 1:\r\n m = 3\r\nelif n == 2:\r\n m = 4\r\nelif n%2 != 0:\r\n m = 1\r\nelse:\r\n m = 1\r\n verdict = isPrime( n * m + 1 )\r\n while not (verdict):\r\n m += 1\r\n verdict = isPrime( n * m + 1 )\r\n\r\nprint(m)", "j = int(input())\r\nif j < 3:\r\n print(j+2)\r\nelse:\r\n print(j-2)", "n=int(input())\r\nif n % 2 ==1:\r\n print(\"3\")\r\nelif n==2:\r\n print(\"4\")\r\nelse:\r\n print(n-2)", "n = int(input())\r\nif n ==1:\r\n print(3)\r\nelif n==2:\r\n print(4)\r\nelif n%2==0:\r\n print(n-2)\r\nelse:\r\n print(1)", "def numeroPrimo(x):\n for i in range(2, int(x**0.5) + 1):\n if x % i == 0:\n return False\n return True\n\nn = int(input().strip())\nnotprimo = True\nm = 1\n\nwhile notprimo:\n if not numeroPrimo(n*m + 1):\n notprimo = False\n break\n m = m + 1\n\nprint(m)\n \t\t \t\t\t\t \t \t \t\t\t \t\t \t\t \t\t\t \t", "n = int(input())\r\nif n>2:\r\n print(n-2)\r\nelif n==2:\r\n print(4)\r\nelif n==1:\r\n print(3)", "def isp(n):\r\n an=''\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n an+='y'\r\n else:\r\n an+='n'\r\n if 'y' in an:\r\n return(1)\r\n else:\r\n return (0)\r\na=int(input())\r\nfor i in range(1,1001):\r\n if isp((i*a)+1):\r\n print(i)\r\n break", "import math\n\nn = int(input())\n\nfor i in range(1, 1000):\n number = i * n + 1;\n xx = math.floor(math.sqrt(number))\n check = False\n\n for j in range(2, xx + 1):\n if (number % j == 0):\n check = True\n break;\n\n\n if (check):\n print(str(i))\n break;\n\n \t\t\t\t\t \t \t\t \t\t \t\t \t \t", "primes = [True for _ in range(1000001)]\r\nprimes[0] = primes[1] = False\r\ni = 2\r\nwhile i < len(primes):\r\n\tif primes[i]:\r\n\t\tj = 2\r\n\t\twhile j * i < len(primes):\r\n\t\t\tprimes[j * i] = False\r\n\t\t\tj += 1\r\n\ti += 1\r\nn = int(input())\r\ni = 1\r\nwhile i <= 1000:\r\n\tif primes[n * i + 1] == False:\r\n\t\tprint(i)\r\n\t\tbreak\r\n\ti += 1", "a = int(input())\r\nprint(a - 2 if a > 2 else a + 2)", "n = int(input())\r\nif n%2 == 1:\r\n print(3)\r\nelif n == 1000:\r\n print(1)\r\nelse:\r\n print(n+2)", "def cnt(numb):\r\n count_of_dividers = 0\r\n for i in range(numb, 0, -1):\r\n if (numb % i == 0):\r\n count_of_dividers += 1\r\n if count_of_dividers > 2:\r\n return True\r\n else:\r\n return False\r\n\r\nn = int(input())\r\nm = 1\r\nwhile True:\r\n if cnt(m * n + 1) == True:\r\n print(m)\r\n break\r\n else:\r\n m += 1", "def primo(n):\n for i in range(2, int(n**0.5) + 1):\n if n % i == 0:\n return False\n return True\n\ndef polandBall(n):\n for m in range(1, 105):\n if not primo(n * m + 1):\n return m\n \nif __name__ == \"__main__\":\n n = int(input())\n m = polandBall(n)\n print(m)\n \t\t\t \t \t\t\t\t\t\t\t \t\t \t\t\t \t\t\t", "\ndef is_prime(n):\n for i in range(2, int(n/2)+1):\n if (n % i) == 0:\n return True\n\ninp = int(input())\nfor m in range(1000):\n number = (m*inp)+1\n if is_prime(number):\n print(m)\n break\n\n \t\t \t\t\t \t \t\t \t\t \t\t \t\t \t", "def isprime(n):\r\n\r\n for i in range(2,int(n**(0.5))+1):\r\n if(n%i==0):\r\n return False\r\n return True\r\nn=int(input())\r\ni=1\r\np=n*i+1\r\nwhile(isprime(p)==True):\r\n i=i+1\r\n p=n*i+1\r\nprint(i)", "n=int(input())\r\nf=0\r\nm=1\r\nwhile f==0:\r\n kd=0\r\n num=n*m+1\r\n for d in range(2,int(num**0.5)+1):\r\n if num % d==0:\r\n f=1\r\n print(m)\r\n break\r\n if f==0:\r\n m+=1\r\n", "n=int(input())\r\ndef prime(n):\r\n for i in range(2,n):\r\n if(n%i==0):\r\n return i\r\n return 0\r\nfor i in range(1,1000):\r\n if(prime(n*i+1)!=0):\r\n print(i)\r\n break", "def eh_primo(n):\n for i in range(2, n):\n if (n % i == 0):\n return False\n return True\n\ndef numero(n, m):\n if not eh_primo((n * m) + 1):\n return m\n return numero(n, m+1)\n \nn = int(input())\nprint(numero(n, 1))\n\n\t\t \t \t\t\t \t\t \t \t\t\t\t\t \t\t\t\t \t\t \t", "def is_prime(n):\n for i in range(2,n):\n if (n%i) == 0:\n return False\n return True\n\nn=int(input())\ns=0\nfor i in range(1,10):\n s=(n*i)+1\n \n if is_prime(s)==False:\n print(i)\n break\n\n \t\t \t \t \t\t \t \t\t\t \t\t\t", "providedNumber = int(input())\n\nfoundNumber = 1\n\n\ndef isPrime(number):\n for i in range(2, number):\n if number % i == 0:\n return False\n return True\n\nwhile isPrime((providedNumber * foundNumber) + 1):\n foundNumber += 1\n\nprint(foundNumber)\n\n \t \t \t\t\t\t \t\t \t\t \t\t \t\t\t", "def find_counterexample(n):\n\n a = n\n b = 1\n\n def is_prime(n):\n\n if n <= 1:\n return False\n elif n <= 3:\n return True\n elif n % 2 == 0 or n % 3 == 0:\n return False\n i = 5\n while i * i <= n:\n if n % i == 0 or n % (i + 2) == 0:\n return False\n i += 6\n return True\n\n\n while (is_prime(a * b + 1)):\n b += 1\n\n return b\n\nn = int(input())\n\nprint(find_counterexample(n)) \n \t \t \t \t\t\t\t \t\t \t\t\t\t \t\t \t\t\t\t", "n = int(input())\n\nmax_m = 10000\n\ndef find_m():\n for m in range(1, max_m):\n prime = n * m + 1\n for i in range(2, prime):\n if prime % i == 0:\n print(m)\n return\n\nfind_m()\n \t\t\t\t\t\t\t \t\t \t\t\t \t \t\t \t\t \t\t", "from math import sqrt\r\nn = int(input())\r\n\r\ndef check(n):\r\n for m in range(1,1001):\r\n p = n*m+1 \r\n \r\n for i in range(2,int(sqrt(p))+1):\r\n if p%i==0:\r\n return m\r\n\r\nprint(check(n)) \r\n \r\n ", "from math import sqrt\n\nn = int(input())\nm = 0\nwhile(m<=1000):\n m = m+1\n p = (n*m)+1\n for i in range(2, int(sqrt(p)) + 1):\n if(p%i == 0):\n print(m)\n quit()\n \t\t\t\t\t\t \t \t \t \t \t\t \t \t \t", "from math import isqrt\r\ndef is_prime(n):\r\n s=isqrt(n)\r\n for x in range(2,s+1):\r\n if n%x==0:\r\n return 0\r\n return 1*(n!=1)\r\nn=int(input())\r\nm=1\r\nwhile is_prime(n*m+1):\r\n m+=1\r\nprint(m)", "def isprime(n):\n for i in range(2,n):\n if (n%i) == 0:\n return False\n return True\n\nnum = int(input())\n\nfor i in range(1, 1000):\n if isprime((num * i+1)):\n i = i + 1\n else:\n print(i)\n break\n\t\t\t\t\t \t \t \t\t\t\t \t \t\t\t\t\t \t", "def ePrimo(n):\n cont = 0\n for i in range(1,n + 1) :\n r = n % i\n if r == 0 :\n cont +=1\n if cont == 2 : #é primo\n return True\n else:\n return False \n\n\nn = int(input())\nwhile n not in range(1,1001):\n n = int(input())\n\nfor m in range(1,1001):\n x = n*m + 1\n if ePrimo(x) == False:\n print(m)\n break\n \t \t\t\t\t\t \t \t \t \t \t \t \t \t \t", "n = int(input())\nprint(min(n+2,999))", "n = int(input())\r\nif n > 500:\r\n print(n-2)\r\nelse:\r\n print(n+2)", "def is_prime(m):\n if m == 1:\n return True\n\n i = 2\n\n while i**2 <= m:\n if m % i == 0:\n return False\n i += 1\n\n return True\n\n\nn = int(input())\n\nm = 1\n\nwhile m <= 1000:\n if not is_prime(n * m + 1):\n print(m)\n break\n m += 1\n\n \t\t\t\t\t\t \t \t\t \t\t\t \t \t\t\t \t \t\t\t", "def checa(n):\n flag = True\n if n <= 0:\n flag = False\n return flag\n else: \n for i in range(2,n):\n if n % i == 0:\n flag = False\n break\n return flag\n\nn = int(input())\n\nfor i in range(1, 1001):\n mandar = n * i + 1\n if checa(mandar) == False:\n print(i)\n \n break\n\n \t\t \t\t \t \t \t \t \t \t\t\t\t\t", "entrada = int(input())\n\nachou = False\n\nm = 1\nwhile True:\n # print('m', m)\n\n checar = entrada * m + 1\n # print('checar', checar)\n\n if (checar == 1):\n achou = True\n else:\n for i in range(2, checar):\n if (checar % i) == 0:\n achou = True\n\n if (achou == True):\n break\n\n m = m + 1\n\nprint(m)\n\n\t \t\t \t \t\t\t\t\t\t \t \t\t\t\t \t \t", "n = int(input())\r\n\r\ndef isPrime(x):\r\n for i in range(2,x):\r\n if(x%i == 0):\r\n return False\r\n \r\n return True\r\n\r\n# n*m + 1 = x -> not prime\r\nprime = True\r\nm = 0\r\nwhile(prime):\r\n m += 1\r\n x = (n*m) + 1\r\n prime = isPrime(x)\r\n\r\nprint(m)", "a = int(input())\r\n\r\ndef prime(x):\r\n if x == 1:\r\n return False\r\n elif x == 2:\r\n return True\r\n elif x % 2 == 0:\r\n return False\r\n else:\r\n prime = True\r\n for i in range(3,x):\r\n if x % i == 0:\r\n prime = False\r\n break\r\n return prime\r\n\r\nif a == 1:\r\n print(3)\r\nelif a % 2 != 0:\r\n print(1)\r\nelse:\r\n for i in range(1,1001):\r\n if not prime(a * i + 1):\r\n print(i)\r\n break\r\n", "n = int(input())\r\nans = 0\r\nif n == 1:\r\n ans = 3\r\nelif n == 2:\r\n ans = 4\r\nelse:\r\n ans = n - 2\r\nprint(ans)", "num=int(input())\r\ni=1\r\ns=''\r\nwhile True:\r\n for j in range(2,(num*i)+1):\r\n if ((num*i)+1)%j==0:\r\n s='Yes'\r\n break \r\n if s=='Yes':\r\n print(i)\r\n break\r\n i+=1", "def is_prime(n):\n for i in range(2, n//2 + 1):\n if n % i == 0:\n return False\n return True\n\nn = int(input())\n\nfor m in range(1, 1000 + 1):\n if not is_prime(n*m + 1):\n print(m)\n break\n\n \t \t\t\t \t\t \t \t \t \t\t\t\t \t\t", "\r\ndef answer(n):\r\n if n%2 == 1: #odd n \r\n return 3\r\n elif n == 2:\r\n return 4\r\n else:\r\n return n-2\r\n\r\n \r\n\r\n\r\ndef main():\r\n n = int(input())\r\n \r\n print(answer(n))\r\n\r\n\r\nmain()", "import math\r\n\r\ndef is_prime(n):\r\n for i in range(2, n):\r\n if not n % i:\r\n return False\r\n return True\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n m = 1\r\n while is_prime(n * m + 1):\r\n m += 1\r\n return m\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "n=int(input())\r\nif n==1:\r\n print(3)\r\nelse:\r\n if n%2!=0:\r\n print(1)\r\n else:\r\n a=2\r\n for i in range(0,n):\r\n if (a*n+1)%3==0:\r\n break \r\n if (a*n+1)%3!=0:\r\n a=a+1\r\n \r\n print(a) \r\n", "import math\n\nn = int(input())\n\nfor m in range(1, 1000):\n primeCandidate = n * m + 1\n isPrime = True\n for i in range(2, int(math.sqrt(primeCandidate)) + 1):\n if primeCandidate % i == 0:\n isPrime = False\n break\n if not isPrime:\n print(m)\n break\n\n\n\n \t\t \t\t \t \t \t \t \t\t\t\t \t \t \t", "\r\n#██████████ █ █ /█\\ █ █ ███ /█\\ ██████████████\r\n\"█ █ █ /███\\ █ █ █ ██ /███\\ /██/ \"\r\n#█ █ █ /█████\\ █ █ █ ██ /█████\\ /██/ \r\n\"█ █ █ █!:) █ █ █ █ ██ █ █ /██/ \"\r\n#██████████ █████████ █(:| █ ████████ ████ █ █ /██/ \"\r\n\" █ █ █ █!:) █ █ █ █ ██ █ █ /██/ \"\r\n# █ █ █ ███████ █ █ █ ██ ███████ /██/\r\n\" █ █ █ █ █ █ █ █ ██ █ █ ██/ \"\r\n#██████████ █ █ █ █ █ █ ███ █ █ ██████████████\r\n\r\n\r\ndef prime_number(n):\r\n c=0\r\n for i in range(1,int(n**0.5)+1):\r\n if n%i==0:\r\n c+=1\r\n if c==1:\r\n return True\r\n else:\r\n return False\r\n#print(prime_number(int(input())))\r\n\r\na=int(input())\r\nc=1\r\nwhile True:\r\n p=(a*c)+1\r\n if prime_number(p)==True:\r\n c+=1\r\n else:\r\n print(c)\r\n break\r\n\r\n \r\n", "n = int(input())\r\nif n == 1: print(3)\r\nelif n == 2: print(4)\r\nelse: print(n-2)", "def isprime(k):\r\n if k <= 2:\r\n return True \r\n i = 2\r\n while i < k:\r\n if k % i == 0:\r\n return False \r\n i += 1\r\n return True \r\n\r\nn = int(input())\r\nj = 1\r\nk = n * j + 1\r\nans = 1\r\n\r\nwhile isprime(k):\r\n ans += 1\r\n j += 1\r\n k = n * j + 1\r\nprint(ans)", "def isprime(n):\r\n for i in range(2,n):\r\n if(n%i==0):\r\n return True\r\n return False\r\nn=int(input())\r\nm=1\r\nwhile(True):\r\n if(isprime(m*n+1)):\r\n print(m)\r\n break\r\n m+=1", "n = int(input())\n\nif n == 1:\n print(3)\nelif n == 2:\n print(4)\nelif n % 2 == 1:\n print(1)\nelse:\n print(n-2)\n # n * (n -2) - 1 =>\n # = n*n -2n -1 =>\n # = (n-1)*(n-1) => que não é primo\n \t \t\t\t \t\t \t\t\t\t\t \t \t\t", "n = int(input())\r\n\r\n\r\ndef is_prime(n):\r\n if n <= 1:\r\n return False\r\n if n <= 3:\r\n return True\r\n if n % 2 == 0 or n % 3 == 0:\r\n return False\r\n i = 5\r\n while i * i <= n:\r\n if n % i == 0 or n % (i + 2) == 0:\r\n return False\r\n i = i + 6\r\n return True\r\n\r\n\r\nm = -1\r\nfor i in range(1,10**3):\r\n if not is_prime(n*i+1):\r\n m=i\r\n break\r\nprint(m)\r\n", "n = int(input())\nm = 1\nd = 2\nwhile True:\n teste = n * m + 1\n if teste > d and teste % d == 0:\n print(m)\n break\n if teste > 2 and teste % 2 == 0:\n print(m)\n break\n if teste > 3 and teste % 3 == 0:\n print(m)\n break\n if teste > 5 and teste % 5 == 0:\n print(m)\n break\n d += 1\n m += 1\n\n\t \t \t \t\t \t \t\t \t\t\t \t \t", "import math\r\nt=1\r\ndef isprime(n):\r\n for i in range(2,n):\r\n if n%i==0:\r\n return False\r\n return True\r\nwhile t:\r\n t-=1\r\n n=int(input())\r\n for i in range(1,1001):\r\n if not isprime((n*i+1)):\r\n print(i)\r\n break\r\n \r\n", "def is_prime(n):\n result = True\n for i in range(2,n):\n if(n%i == 0):\n result = False\n break\n return result\n\ndef hypothesis(n, m=1):\n if (not is_prime(n*m+1)):\n return m \n else:\n return hypothesis(n,m+1)\n\nprint(hypothesis(int(input())))\n\n \n \t \t\t\t\t \t \t\t \t\t\t\t \t\t\t\t\t\t", "n = int(input())\r\n\r\nfor m in range(1, 1001):\r\n num = n * m + 1\r\n for i in range(2, int(num ** 0.5) + 1):\r\n if num % i == 0:\r\n print(m)\r\n exit()\r\n", "n = int(input())\n\n# x^2 == x^2 + 1 - 1 == (x + 1)* (x - 1) + 1\n# n * m = (x + 1)(x -1)\n\nif n <= 2:\n print(\"{}\".format(n + 2))\nelse:\n print(\"{}\".format(n - 2))\n", "def not_prime(n):\n for d in range(2, n):\n if n % d == 0:\n return True\n\n\nn = int(input())\nfor m in range(1, 1000):\n result = (n * m) + 1\n if not_prime(result):\n break\nprint(m)\n\n \t \t \t \t \t\t\t\t \t\t\t\t \t\t\t\t\t", "from math import sqrt\r\ndef isPrime(n):\r\n if (n <= 1):\r\n return False\r\n for i in range(2, int(sqrt(n))+1):\r\n if (n % i == 0):\r\n return False\r\n return True\r\nn=int(input())\r\nfor m in range(1,1001):\r\n if isPrime(m*n+1)==False:\r\n print(m)\r\n break", "def prime(n):\r\n if n<2:return True\r\n for j in range(2,int(pow(n,0.5))+1):\r\n if n%j==0:\r\n return True\r\n return False\r\nn=int(input())\r\ni=1\r\nwhile 1:\r\n if prime(n*i+1):\r\n print(i)\r\n break\r\n i+=1", "def kiem(n):\r\n for i in range(2,int(n/2)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\nn=int(input())\r\nif n%2!=0:\r\n print(\"3\")\r\nelse:\r\n m=1\r\n while(kiem(n*m+1)):\r\n m+=1\r\n print(m)\r\n \r\n", "import math\n\ndef is_prime(x):\n for i in range(2, int(math.sqrt(x)) + 1):\n\n if x % i == 0:\n return False\n\n return True\n\nn = int(input())\n\nfor x in range(1, 1001):\n if not is_prime(n*x+1):\n print(x)\n break\n\n \t\t \t\t\t \t \t\t \t \t \t \t\t", "n = int(input())\nprintado = False\nnum = 0\n\nfor i in range(1000):\n if printado:\n break\n\n num += 1\n res = num * n + 1\n\n for j in range(2, res//2 + 1):\n if res % j == 0:\n print(num)\n printado = True\n break\n\n\t\t\t \t \t\t\t\t\t \t \t\t \t\t\t", "import math\r\nimport sys\r\n\r\n\r\ndef isPrime(n):\r\n if n % 2 == 0:\r\n return n == 2\r\n d = 3\r\n while d * d <= n and n % d != 0:\r\n d += 2\r\n return d * d > n\r\n\r\nn = int(input())\r\nm = 1\r\nwhile True:\r\n a = n * m + 1\r\n if not isPrime(a):\r\n print(m)\r\n sys.exit()\r\n m += 1\r\n", "def checa_nao_primo(numero):\n for i in range(2, numero//2):\n if numero%i==0:\n return True\n return False\n\nn = int(input())\n\nif n%2==1 and n!=1:\n print(1)\n\nelse:\n m = 1\n while True:\n if checa_nao_primo(n*m + 1):\n break\n else:\n m += 1\n print(m)\n\t\t \t\t \t\t \t \t\t\t\t\t\t\t \t \t\t \t \t", "\r\nno = int(input())\r\nans =0\r\nfor i in range(1,100):\r\n ans = no*i+1\r\n for j in range(2,(no*i+1)//2 +1):\r\n if ans%j==0:\r\n print(i)\r\n exit()", "def prost(a):\r\n k = 0\r\n for i in range(2, int(a ** 0.5) + 1):\r\n if a % i == 0:\r\n k += 1\r\n if k == 0:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nn = int(input())\r\nfor m in range(1, 1001):\r\n if not prost(n * m + 1):\r\n print(m)\r\n break\r\n", "def isPrime(x):\r\n if x <= 1:\r\n return False\r\n for i in range(2, x):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn, m = int(input()), 1\r\nwhile isPrime(n*m+1):\r\n m += 1\r\nprint(m)", "def prime(p):\r\n c = 0\r\n for i in range(1, int(p ** 0.5) + 1):\r\n if p % i == 0:\r\n c += 1\r\n if c > 1:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\nfor i in range(1, 1000 + 1):\r\n if not prime((n * i) + 1):\r\n print(i)\r\n break", "def check_prime(n):\n i = 2\n while(i*i<=n):\n if n%i == 0:\n return False\n i+=1\n return True\n\nn = int(input())\nfor i in range(1, 1001):\n if (not(check_prime(i*n+1))):\n print(i)\n break\n\n", "n = int(input())\r\n\r\ndef isPrime(m):\r\n f = 0\r\n for i in range(1, m + 1):\r\n if m % i == 0:\r\n f += 1\r\n if f == 2:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nfor m in range(1, 1001):\r\n if not isPrime(n * m + 1):\r\n print(m)\r\n break", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\tif n>2:\n\t\tprint(n-2)\n\telse:\n\t\tprint(n+2)\n\nsolve()\n", "def validate_if_is_prime(number):\n if (number == 1):\n return False\n\n for i in range(2, number):\n if (number % i) == 0:\n return False\n\n return True \n\n\n\nif __name__ == \"__main__\":\n n = int(input())\n for i in range(1, 1001):\n number = (n * i) + 1\n if not(validate_if_is_prime(number)):\n print(i)\n break \n\t \t\t \t\t \t\t \t\t\t\t \t\t \t\t", "def is_prime(n):\r\n arr=[]\r\n for j in range(2,n):\r\n if n%j==0:\r\n arr.append(j)\r\n if len(arr)==0 and n>2:\r\n arrb=1\r\n elif n>3:\r\n arrb=n-2\r\n elif n==1:\r\n arrb=3\r\n else:\r\n arrb=4\r\n return arrb\r\nprint(is_prime(int(input())))", "def ispr(n):\r\n if n == 2 or n == 3: return True\r\n if n % 2 == 0 or n % 3 == 0 or n < 2: return False\r\n k = 5\r\n while k * k <= n:\r\n if n % k == 0 or n % (k + 2) == 0: return False\r\n k += 6\r\n return True\r\nn = int(input())\r\nfor x in range(1, 1001):\r\n if not ispr(n * x + 1):\r\n print(x)\r\n break\r\n else: pass", "a = int(input())\r\nif (a-2) <= 0:\r\n print(a+2)\r\nelse:\r\n print(a-2)", "n = int(input())\nif (n%2 == 1):\n if (n>1):\n print(1)\n else:\n print(3)\nelif(n == 2):\n print(4)\nelse:\n print(n-2)\n\t\t\t \t\t\t \t \t \t\t \t\t \t \t \t\t", "def is_prime(num):\r\n if num < 2:\r\n return False\r\n for i in range(2, int(num ** 0.5) + 1):\r\n if num % i == 0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\n\r\nm = 1\r\nwhile True:\r\n result = n * m + 1\r\n if not is_prime(result):\r\n print(m)\r\n break\r\n m += 1", "n = int(input())\r\nc = 1\r\n\r\n\r\ndef is_prime(num):\r\n l = []\r\n for d in range(1, int(num**0.5)+1):\r\n if num % d == 0:\r\n l.append(d)\r\n l.append(num//d)\r\n l = set(l)\r\n if len(l) == 2:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nfor m in range(1,1001):\r\n num2 = n * m + 1\r\n if is_prime(num2) is False:\r\n print(m)\r\n exit()", "#e\nn = int(input())\n\ndef isPrime(n):\n for i in range(2, n):\n if (n%i) == 0:\n return False\n return True\n\nif (n%2 == 1) and (n != 1):\n print('1')\nelse:\n x = True\n y = 0\n while x == True:\n y = y + 1\n z = (n * y) + 1\n x = isPrime(z)\n if x == False:\n print(y)\n \t\t \t\t\t\t\t \t\t\t \t\t\t", "\r\n'''\r\nLight temp.\r\n'''\r\nimport sys\r\nfrom math import ceil,floor,log2,sqrt\r\n\r\ndef readall():\r\n return [int(x) for x in sys.stdin.read().split()]\r\n\r\ndef u():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\nn = u()[0]\r\n\r\ndef pc(x):\r\n if x == 2:\r\n return True\r\n \r\n if x % 2 == 0:\r\n return False\r\n \r\n i = 3\r\n while i**2 <= x:\r\n if x % i == 0:\r\n return False\r\n i += 2\r\n return True\r\n\r\nfor i in range(1,1001):\r\n if not pc(n*i+1):\r\n print(i)\r\n exit()\r\n\r\n#if num is odd and greater than special case 1 - then take whatever odd number to generat a + 1 div by 2\r\n#if n is even tho, take a number m s.t. n*m % 3 == 2", "n = int(input())\nif n > 2:\n print(n - 2)\nelif n == 1:\n print(3)\nelif n == 2:\n print(4)\n", "# Time complexity: O(1)\n# Space complexity: O(1)\n# Rationale: when m = n+2, n*m+1 = n*(n+2)+1 = (n+1)^2. This works for 1<=n<=998\n# since 1<=m<=1000. If n>998, we can use m=n-2, which gives n*m+1 = n*(n-2)+1 = (n-1)^2.\n\nn = int(input())\nif n <= 998:\n print(n + 2)\nelif n > 998:\n print(n - 2)\n\n \t\t \t\t\t \t \t\t\t \t \t\t \t \t\t\t", "def isPrime(n):\n for i in range(2,n):\n if (n%i) == 0:\n return False\n return True\n \ndef main():\n n = int(input())\n for i in range(1,1000):\n if(not isPrime(n*i+1)):\n print(i)\n return\n\nmain()\n \t \t \t\t\t\t \t\t\t \t\t \t\t", "a = int(input())\r\nif a == 0:\r\n print(1)\r\nelif a == 1:\r\n print(3)\r\nelif a == 2:\r\n print(4)\r\nelse:\r\n print(a - 2)\r\n", "from math import sqrt\r\n\r\n\r\ndef is_prime(x):\r\n if x == 1:\r\n return False\r\n if x % 2 == 0:\r\n return True\r\n for i in range(3, int(sqrt(x))+1):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\nif n % 2 == 1:\r\n if n == 1:\r\n print(3)\r\n else:\r\n print(1)\r\nelse:\r\n for m in range(1, 100):\r\n if not is_prime(m*n+1):\r\n print(m)\r\n break\r\n\r\n", "import math\r\ndef isPrime(n):\r\n for i in range(2,int(math.sqrt(n)+1)):\r\n if n%i == 0:\r\n return False\r\n return True\r\n\r\ndef solve(n):\r\n m = 1\r\n temp = n* m + 1\r\n while isPrime(temp):\r\n m += 1\r\n temp = n * m + 1\r\n # print( temp )\r\n return m\r\n\r\n\r\n\r\n# n,m,z = map(int,input().split())\r\nn = int(input())\r\n# l = list(map(int,input().split()))\r\n# n = int(input())\r\nprint(solve(n)) \r\n\r\n\r\n\r\n\r\n", "def prime(n):\n if n == 1:\n return False\n elif n > 1:\n for i in range(2, n):\n if (n % i) == 0:\n return False\n return True\n\ndef main():\n n = int(input())\n m = 1\n continuar = True\n\n while continuar:\n p = (n * m) + 1\n if prime(p) == False:\n continuar = False\n print(m)\n m += 1\n\nmain()\n \t\t \t\t\t\t\t\t \t\t \t\t \t \t \t \t", "num = int(input())\r\n\r\n\r\ndef is_prime(n):\r\n # If n is less than 2, it cannot be a prime number\r\n if n < 2:\r\n return False\r\n \r\n # Check if n is divisible by any number from 2 to the square root of n\r\n for i in range(2, int(n ** 0.5) + 1):\r\n if n % i == 0:\r\n return False\r\n \r\n # If n is not divisible by any number from 2 to the square root of n, it is a prime number\r\n return True\r\n\r\nfor j in range(1, 1000):\r\n temp = is_prime(j * num + 1)\r\n if not temp:\r\n print(j)\r\n break", "n = int(input())\r\nm = 0\r\n\r\nif (n == 1):\r\n m = 3\r\nelif (n == 2):\r\n m = 4\r\nelse:\r\n m = n-2\r\n\r\nprint(m)", "n = int(input())\ni = 1\ncontinua = True\nwhile continua and i!=1001:\n primo = True\n num = n*i + 1\n for j in range(2,num):\n if(num%j==0):\n primo = False\n continua = False\n i+=1\nprint(i-1)\n\t\t \t \t\t\t \t\t\t\t\t\t\t\t\t \t \t", "def iscomposite(num):\r\n for i in range(2, num):\r\n if num % i == 0:\r\n return True\r\n return False\r\n\r\n\r\nn = int(input())\r\ni = 1\r\nwhile(True):\r\n if(iscomposite((n*i)+1)):\r\n print(i)\r\n break\r\n else:\r\n pass\r\n i += 1\r\n", "def is_prime(number):\n if number < 2:\n False\n for i in range(2, number//2 + 1):\n if number % i == 0:\n return False\n return True\n\n\nn = int(input())\n\nfor m in range(1, 1000):\n if not is_prime(n*m+1):\n print(m)\n break\n\n \t \t\t\t \t \t \t\t \t\t \t", "n = int(input())\r\nif n%2!=0 and n>3:\r\n print(1)\r\nelif n==1:\r\n print(3)\r\nelif n==2:\r\n print(4)\r\nelse:\r\n print(n-2)", "n = int(input())\r\nif n == 1: print(3)\r\nelif n % 2 == 1: print(1)\r\nelif n % 3 == 1: print(2)\r\nelif n % 3 == 2: print(4)\r\nelse: print(n +2)", "n = int(input())\r\nif n==1 or n==2:\r\n print(n + 2)\r\nelse:\r\n print(n - 2)", "import bisect\r\nimport time\r\nimport sys\r\ndef find_le(a, x):\r\n i = bisect.bisect_right(a, x)\r\n if i:\r\n return i - 1\r\ndef iint():\r\n return int(input())\r\ndef iarr():\r\n return list(map(int,input().split()))\r\ndef twodarr(n,m):\r\n return [[0 for i in range(m)] for j in range(n)]\r\ndef gcd(a,b):\r\n if a % b == 0:\r\n return b\r\n else:\r\n return gcd(b,a % b)\r\ndef lcm(a,b):\r\n return a * b //gcd(a,b)\r\ndef binpow(a,b,n = 1000000007):\r\n a %= n\r\n res = 1\r\n while b > 0:\r\n if b % 2:\r\n res = res * a % n\r\n a = a * a % n\r\n b //= 2\r\n return res\r\ndef sieve(n):\r\n is_prime = [True] * n\r\n is_prime[0] = False\r\n is_prime[1] = False\r\n primes = []\r\n for i in range(2,n):\r\n if is_prime[i]:\r\n primes.append(i)\r\n for j in range(i * i,n,i):\r\n is_prime[j] = False\r\n return is_prime\r\n \r\nclass Rectangle:\r\n def __init__(self,x1,y1,x2,y2):\r\n self.tr_x = x2\r\n self.tr_y = y2\r\n self.bl_x = x1\r\n self.bl_y = y1\r\n def __repr__(self):\r\n return (f\"Rectangle with bottom left ({self.bl_x},{self.bl_y}) and top right ({self.tr_x},{self.tr_y})\")\r\n def area(self):\r\n return (self.tr_y - self.bl_y) * (self.tr_x - self.bl_x)\r\n def does_intersect(self,other):\r\n if self.tr_y <= other.bl_y or self.bl_y >= other.tr_y or\\\r\n self.bl_x >= other.tr_x or self.tr_x <= other.bl_x:\r\n return False\r\n else:\r\n return True\r\n def intersection_area(self,other):\r\n if not self.does_intersect(other):\r\n return 0\r\n else:\r\n return (abs(max(self.bl_x,other.bl_x) - min(self.tr_x,other.tr_x)) *\r\n abs(max(self.bl_y,other.bl_y) - min(self.tr_y,other.tr_y)))\r\n def intersect(self,other):\r\n x1 = max(self.bl_x,other.bl_x)\r\n x2 = min(self.tr_x,other.tr_x)\r\n y1 = max(self.bl_y,other.bl_y)\r\n y2 = min(self.tr_y,other.tr_y)\r\n if not self.does_intersect(other):\r\n return Rectangle(0,0,0,0)\r\n else:\r\n return Rectangle(x1,y1,x2,y2)\r\n def length(self):\r\n return self.tr_x - self.bl_x\r\n def height(self):\r\n return self.tr_y - self.bl_y\r\n#sys.stdin = open(\"cowsignal.in\", \"r\")\r\n#sys.stdout = open(\"cowsignal.out\", \"w\")\r\ndef dfs(graph,start):\r\n stack = [start]\r\n while len(stack) > 0:\r\n vertex = stack.pop()\r\n print(vertex)\r\n for node in graph[vertex]:\r\n stack.append(node)\r\ndef bfs(graph,start):\r\n queue = [start]\r\n while len(queue) > 0:\r\n vertex = queue.pop(0)\r\n print(vertex)\r\n for node in graph[vertex]:\r\n queue.append(node)\r\ndef haspath(graph,start,end):\r\n q = [ start ]\r\n visited = {}\r\n while len(q) > 0:\r\n vertex = q.pop(0)\r\n if vertex == end:\r\n return True\r\n if not visited:\r\n for node in graph[vertex]:\r\n q.append(node)\r\n visited[vertex] = True\r\n return False\r\ndef connectedcount(graph):\r\n visited = {}\r\n res = 0\r\n for node in graph:\r\n if node not in visited:\r\n nodes = 0\r\n stack = [ node ]\r\n while len(stack) > 0:\r\n print(stack)\r\n vertex = stack.pop()\r\n visited[vertex] = 1\r\n for children in graph[vertex]:\r\n if children not in visited:\r\n print(\"children\",children)\r\n \r\n nodes += 1\r\n stack.append(children)\r\n print(nodes)\r\n res += 1\r\n return res\r\n\r\ndef shortest_dist(start,end):\r\n if start == end:\r\n return 0 \r\n q = [[start,0]]\r\n res = 99999999999\r\n visited = {}\r\n while q:\r\n node = q.pop(0)\r\n if node[0] not in visited:\r\n for vertex in graph[node[0]]:\r\n q.append([vertex,node[1] + 1])\r\n if vertex == end:\r\n res = min(res,node[1] + 1)\r\n visited[node[0]] = 1\r\n return res\r\n\r\nn = iint()\r\nis_prime = sieve(10000)\r\nfor m in range(1,1001):\r\n if not is_prime[n * m + 1]:\r\n print(m)\r\n break\r\n \r\n \r\n \r\n", "n = int(input())\r\nprint(n-2 if n>3 else n+2)", "def isprime(num):\n div = 0\n for i in range(1, num + 1):\n if num % i == 0:\n div += 1\n return div == 2\n\ndef findInto(num):\n if num == 1:\n return 3\n if num % 2 != 0:\n return 1\n m = 1\n while m > 0:\n if not isprime((num * m) + 1):\n return m\n m += 1\n\nnum = int(input())\nprint(findInto(num))\n", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\ndef is_prime(num):\n if num < 2:\n return False\n elif num == 2:\n return True\n \n for i in range(2, int(num**0.5)+1):\n if num % i == 0:\n return False\n return True\n\nn = int(input())\nm=1\nwhile True:\n x = n*m+1\n if not is_prime(x):\n print(m)\n break\n m += 1", "n = int(input())\r\nprint(min(n + 2, 999))", "n = int(input())\n\nfor i in range(1,1001):\n valor = i*n+1\n \n flag = False\n\n for j in range(2,valor):\n if (valor % j) == 0:\n flag = True\n break\n\n if flag:\n print(i)\n break\n \t\t\t \t \t\t\t \t \t\t \t\t \t", "def isprime(num):\r\n for n in range(2,int(num**0.5)+1):\r\n if num%n==0:\r\n return False\r\n return True\r\n\r\no=int(input())\r\nfor i in range(1,1001):\r\n if isprime(o*i+1)==False :\r\n print(i)\r\n break\r\n", "def is_prime(number:int)-> bool:\n if number == 1:\n return False\n for i in range(2, number//2 +1):\n if number % i == 0:\n return False \n return True\n\ndef find_m():\n n = int(input())\n m = 1\n while True:\n if not is_prime(n*m + 1):\n return m\n m += 1\n\nm = find_m()\nprint(m)\n\n\t \t \t\t \t \t \t \t\t \t\t \t", "from sys import stdin,stdout\r\nfrom collections import Counter\r\nst=lambda:list(stdin.readline().strip())\r\nli=lambda:list(map(int,stdin.readline().split()))\r\nmp=lambda:map(int,stdin.readline().split())\r\ninp=lambda:int(stdin.readline())\r\npr=lambda n: stdout.write(str(n)+\"\\n\")\r\n\r\nn=inp()\r\nif n==1:\r\n pr(3)\r\nelif n==2:\r\n pr(4)\r\nelse:\r\n pr(n-2)\r\n", "def num_primo(num):\n\n for i in range(2,num):\n\n if(num%i == 0):\n return False\n return True\nn = int(input())\nm = 1\n\nwhile(True):\n if(not num_primo((n*m)+1)):\n print(m)\n break\n m += 1\n \t \t\t\t \t \t\t \t\t\t \t \t\t \t", "n = int(input())\n\n\ndef primo(numero):\n if numero < 2:\n return False\n\n for i in range(2, int(numero**0.5) + 1):\n if numero % i == 0:\n return False\n\n return True\n\n \n\nfor i in range(1, 10):\n if(not primo((i*n)+1)):\n print(i)\n break\n\n \t \t \t \t \t \t \t\t \t \t\t\t\t", "print(min(int(input())+2,999))", "def is_prime(n):\r\n if n == 1:\r\n return False\r\n i = 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\n\r\nn = int(input())\r\nfor m in range(1, 1000 + 1):\r\n if not is_prime(m * n + 1):\r\n print(m)\r\n break\r\n", "import sys\r\nimport math\r\n\r\nint_inp = lambda: int(input())\r\nstr_inp = lambda: input().strip()\r\nflt_inp_list = lambda: list(map(float, input().strip().split()))\r\nint_inp_list = lambda: list(map(int, input().strip().split()))\r\nstr_inp_list = lambda: list(input().split())\r\n\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n\r\ndef is_prime(n):\r\n if n <= 0:\r\n return False\r\n i = 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\nn = int_inp()\r\n\r\nfor i in range(1, 1000):\r\n if not is_prime(n * i + 1):\r\n print(i)\r\n break\r\n", "val=int(input())\nif (val == 2 ):\n print(7)\nelif (val == 1):\n print(7)\nelif (val>2):\n print(val-2)\n\t \t\t \t \t\t\t \t\t\t \t\t\t\t \t \t\t", "n = int(input())\r\nif n > 2:\r\n ans = n - 2\r\nif n == 1:\r\n ans = 3\r\nif n == 2:\r\n ans = 4\r\nprint(ans)\r\n", "def tub(a):\n for i in range(2, int(a**0.5) + 1):\n if a%i==0:\n return 0\n return 1\nn = int(input())\ni = 1\nwhile tub(i*n+1):\n i += 1\nprint(i)\n", "def isprimo(primo):\n lista_divisores = []\n for num in range (1, primo + 1):\n if primo % num == 0:\n lista_divisores.append(num)\n if len(lista_divisores) == 2 and lista_divisores[0] == 1 and lista_divisores[1] == primo:\n return False\n else:\n return True\n\nn = int(input())\nteste = False\nm = 1\nwhile teste == False:\n teste = n * m + 1\n teste = isprimo(teste)\n if teste == False:\n m += 1\n else:\n break\nprint(m)\n\t\t\t\t \t\t \t \t\t\t \t \t \t\t \t \t", "def is_prime(num):\n j = 2\n while j**2 <= num:\n if prime % j == 0:\n return False\n j += 1\n return True\n\nif __name__ == \"__main__\":\n n = int(input())\n if not (n % 2 == 0) and n != 1:\n print(\"1\")\n else:\n for m in range(1, 1001):\n prime = (n * m) + 1\n if not is_prime(prime):\n print(m)\n break\n \t\t\t \t \t\t \t \t\t \t \t \t\t \t \t", "def ehPrimo(n):\n if n > 1:\n for i in range(2, (n // 2) + 1):\n if n % i == 0:\n return False\n return True\n else:\n return False\n\ndef main():\n n = int(input())\n m = 1\n while ehPrimo(n*m + 1):\n m += 1\n print(m)\n\nmain()\n \t\t \t \t \t\t\t\t \t\t \t\t \t", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nn = ii()\r\nif n == 1:\r\n print(3)\r\nelif n == 2:\r\n print(4)\r\nelse:\r\n print(n - 2)\r\n", "def primo(num):\n cont = 0\n for a in range(1,num+1):\n if(num % a == 0):\n cont += 1\n if(cont == 2):\n return True\n return False\n\ndef contraprova(n):\n m = 1\n while(True):\n if(primo(n*m + 1)):\n m += 1\n else:\n break\n return m\n\nn = int(input())\nprint(contraprova(n))\n\n \t \t\t\t \t \t\t\t \t \t \t\t \t\t\t \t \t\t", "a = int(input())\r\n\r\nif a == 1:\r\n print(3)\r\nelif a == 2:\r\n print(4)\r\nelse:\r\n print(a - 2)\r\n", "n = int(input())\r\nx = min(n+2,999)\r\nprint(x)", "n = int(input())\r\nflag_1 = True\r\nflag_2 = True\r\ni = 1\r\nwhile flag_1:\r\n m = n * i + 1\r\n j = 2\r\n while j != m // 2 + 1 and flag_2:\r\n if m % j == 0:\r\n flag_1 = False\r\n flag_2 = False\r\n j += 1\r\n i += 1\r\nprint(i - 1)", "n=10000\r\ndef sieve():\r\n prime=[True for i in range(n+1)]\r\n p = 2\r\n \r\n while(p*p <= n):\r\n if(prime[p]):\r\n for i in range(p*p,n+1,p):\r\n prime[i]=False\r\n p+=1\r\n \r\n primes=[]\r\n for i in range(2,n+1):\r\n if(prime[i]):\r\n primes.append(i)\r\n return primes\r\nt=int(input())\r\nx = sieve()\r\nfor m in range(1,1001):\r\n if ((t*m)+1) not in x:\r\n print(m)\r\n break\r\n", "import math\r\ndef prime(x):\r\n if x == 1:\r\n return False\r\n flag = 0\r\n for i in range(2,math.ceil((x**0.5)+1)):\r\n if x % i == 0:\r\n return False\r\n return True\r\n \r\nn1 = int(input())\r\n\r\nif n1%2 != 0:\r\n if n1==1:\r\n print(3)\r\n else:\r\n print(1)\r\nelse:\r\n \r\n b1 = False\r\n start = 1\r\n while b1==False:\r\n if prime((n1*start)+1) == False:\r\n print(start)\r\n break\r\n start+=1\r\n ", "n = int(input())\n\nfor m in range(1,1000+1):\n\taux = (n * m) + 1\n\tachou = False\n\t\n\tfor e in range(2, aux+1):\n\t\tif aux % e == 0 and aux != e and e != 1:\n\t\t\tachou = True\n\t\t\tbreak\n\tif achou:\n\t\tprint(m)\n\t\tbreak\n\t\n\t\n\t\t\n\t\n\n\t\t \t \t \t \t \t\t\t \t\t \t", "from collections import deque\nfrom sys import stdin, stdout\n\ninput = stdin.readline\nprint = stdout.write\n\nn = int(input())\nif n==1:\n print('3')\nelif n==2:\n print('4')\nelse:\n print(str(n-2))\n", "inp = int(input())\nif inp == 2:\n print(7)\nif inp > 2:\n print(inp - 2)\nif inp == 1:\n print(7)\n\t\t\t\t \t \t \t\t\t \t\t\t \t\t \t\t\t \t\t", "import math\n\ndef isPrime(m):\n for i in range(2, int(math.sqrt(m)) + 1):\n if (m % i == 0):\n return False\n return True\n\ndef main():\n n = int(input())\n\n for m in range(1, 1001):\n if (not isPrime(n * m + 1)):\n return print(m)\n\nmain()\n\t\t \t \t\t \t\t\t\t \t \t\t \t \t", "print(min(int(input())+2, 999))", "# Python program to print all Primes Smaller\r\n# than or equal to N using Sieve of Eratosthenes\r\n\r\n\r\ndef SieveOfEratosthenes(num):\r\n\tprime = [True for i in range(num+1)]\r\n\tp = 2\r\n\twhile (p * p <= num):\r\n\t\tif (prime[p] == True):\r\n\t\t\tfor i in range(p * p, num+1, p):\r\n\t\t\t\tprime[i] = False\r\n\t\tp += 1\r\n\treturn prime\r\n\t\r\nn = int(input())\r\nprime = SieveOfEratosthenes(1000*n)\r\nif n == 1:\r\n print(8)\r\nelse:\r\n for i in range(1,1001):\r\n if not prime[i*n +1]:\r\n print(i)\r\n break", "# is_prime foi feita com ajuda do chatGPT\n\ndef humilharpolandball(n):\n for m in range(1, 1000001):\n x = n * m + 1 \n if not is_prime(x):\n return m \n \ndef is_prime(number):\n if number <= 1:\n return False\n for i in range(2, int(number ** 0.5) + 1):\n if number % i == 0:\n return False\n return True\n\nn = int(input())\nprint(humilharpolandball(n))\n \t \t\t\t\t \t\t \t \t \t\t \t", "from math import *\r\nimport sys, random\r\n\r\ndef nextInt():\r\n return int(input())\r\ndef nextStrs():\r\n return input().split()\r\ndef nextInts():\r\n return list(map(int,nextStrs()))\r\n\r\ndef isPrime(x):\r\n if x == 0 or x == 1:\r\n return False\r\n else:\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\ndef main():\r\n n = nextInt()\r\n\r\n for i in range(1,2*10**3+1):\r\n if not isPrime(n*i+1):\r\n print(i)\r\n return 0\r\n \r\n \r\nif __name__ == '__main__':\r\n exit(main())\r\n\r\n", "n=int(input())\r\nif n==2:\r\n\tprint(4)\r\nelif n%2==0 and n!=2:\r\n\tprint(n-2)\r\nelif n==1:\r\n\tprint(3)\r\nelse:\r\n\tprint(1)\r\n\t", "def isPrime(n):\r\n\tfor i in range(2,int(n**(1/2))+1):\r\n\t\tif n%i==0:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nn=int(input())\r\nm=1\r\nwhile isPrime(n*m+1):\r\n\tm+=1\r\nprint(m)", "x=int(input())\r\nfor i in range(1,20):\r\n for j in range(2,((x*i+1)//2)+1):\r\n if (x*i+1)%j==0:\r\n print(i)\r\n exit()", "n = int(input())\n\ndef check_prime(a):\n if a < 2:\n return False\n if a == 2:\n return True\n for i in range(2,a):\n if a % i == 0:\n return False\n return True\n\nfor m in range(1, 1001):\n number = n*m + 1\n if not check_prime(number):\n print(m)\n exit()", "def eh_primo(n): \n for i in range(2, n):\n if n%i == 0:\n return False\n else:\n return True\n\nn = int(input())\n\n\nfor i in range(1, 10**3):\n if eh_primo(n*i + 1):\n continue\n else:\n print(i)\n break\n\t\t\t\t \t \t\t\t \t \t", "import math as m\r\ndef isprime(a):\r\n count = 2\r\n for i in range(2,int(a**0.5)+1):\r\n if a % i == 0:\r\n count += 1\r\n if count == 2:\r\n return True\r\n else:\r\n return False\r\nn = int(input())\r\ndef main(n):\r\n List = []\r\n List2 = []\r\n if n == 1:\r\n return 3\r\n elif n == 2:\r\n return 4\r\n elif n >= 3:\r\n l = 0\r\n for i in range(n):\r\n l = (n*i)+1\r\n List.append(l)\r\n for j in List:\r\n if isprime(j) == False:\r\n List2.append(j)\r\n break\r\n return (List2[0]-1)//n\r\nprint(main(n))\r\n", "\n\nt =1\nimport collections\n\nwhile(t>0):\n n = int(input())\n\n if(n==1):\n print(\"3\")\n elif(n==2):\n print(\"4\")\n else:\n print(n-2)\n \n\n \n\n t-=1", "n=int(input())\r\n#l=list(map(int,input().split()))\r\ndef isprime(k):\r\n for i in range(2,k):\r\n if(k%i==0):\r\n return False\r\n return True\r\n\r\n\r\n\r\n\r\n\r\ni=1\r\nwhile(True):\r\n k=i*n+1\r\n if(isprime(k)==False):\r\n print(i)\r\n break\r\n i=i+1\r\n", "n = int(input())\n\nif n % 2 == 1:\n print(\"{}\".format(3))\nelif n == 2:\n print(\"{}\".format(n + 2))\nelse:\n print(\"{}\".format(n - 2))\n", "n = int(input())\r\n\r\ndef eh_primo(num):\r\n if num > 1:\r\n for i in range(2, int(num/2)+1):\r\n if (num % i) == 0:\r\n return False # nao e primo\r\n else:\r\n return True # primo\r\n else:\r\n return False # nao e primo\r\n\r\nm = 1\r\nprimo = True\r\nwhile primo:\r\n num_hip = n*m + 1\r\n if eh_primo(num_hip):\r\n m += 1\r\n else:\r\n primo = False\r\nprint(m)", "x=int(input())\r\nif x<900:\r\n print(x+2)\r\nelse:\r\n print(x-2)", "def isNotPrime(x):\n if x < 4:\n return False\n if x % 2 == 0:\n return True\n for div in range(2, x):\n if x % div == 0:\n return True\n return False\n\ndef findM(n, m):\n prime = n * m + 1\n if isNotPrime(prime):\n return m\n return findM(n, m+1)\n\nn = int(input())\nprint(findM(n, 1))\n \t\t \t \t\t \t\t\t \t\t \t \t\t\t \t\t\t", "def generate_primes(N, n):\n is_prime = [1] * (n + 1)\n is_prime[0] = is_prime[1] = 0\n m = 1\n for i in range(2, n + 1):\n if is_prime[i] == 1:\n if i > N:\n if (i - 1) / N > m:\n print(m)\n return\n\n if (i - 1) % N == 0:\n m += 1\n for j in range(i, n + 1, i):\n is_prime[j] = 0\n\n\nn = int(input())\ngenerate_primes(n, 1000000)\n\n\t \t \t\t \t \t \t \t \t\t\t\t\t \t \t\t", "# import os\r\ndef is_prime(n):\r\n import math\r\n if n < 2:\r\n return False\r\n p = True\r\n for i in range(2, int(math.sqrt(n)+1)):\r\n if n % i == 0:\r\n p = False\r\n break\r\n return p\r\nt = int(input())\r\n\r\nfor i in range(1,1000):\r\n if not is_prime((t*i)+1):\r\n print(i)\r\n break", "# import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\ndef prime(n):\r\n if n<=1:return 0\r\n elif n<=3:return 1\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return 0\r\n return 1\r\n\r\nn=int(input())\r\nif (n&1):\r\n print(3)\r\nelse:\r\n for m in range(1,1001):\r\n if not prime(n*m+1):\r\n print(m)\r\n break", "'''\r\na=[]\r\nfor i in range(1, 1001):\r\n a.append(i)\r\ni=1\r\nwhile i!=len(a):\r\n k=1\r\n while k+i<len(a):\r\n if a[k+i]%a[i]==0:\r\n a.pop(k+i)\r\n else:\r\n k+=1\r\n i+=1\r\n'''\r\nn=int(input())\r\nfor i in range(1, 1001):\r\n a=i*n+1\r\n check=False\r\n for j in range(2, a):\r\n if a%j==0:\r\n check=True\r\n break\r\n if check==True:\r\n print(i)\r\n break\r\n\r\n\r\n", "def es_primo(a):\r\n if a == 1:\r\n return False\r\n elif a==2:\r\n return True\r\n for i in range(2,a):\r\n if a%i==0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\nm = 1\r\n\r\nwhile es_primo(n*m+1):\r\n m = m+1\r\n\r\nprint(m)\r\n", "import math\n\nn = int(input())\n\nfor i in range(1, 1000): \n \n m = n * i + 1\n k = math.sqrt(m)\n j = 2\n for l in range( j, math.floor(k+1)):\n if (m % j == 0):\n break\n j = j +1\n if (j <= k):\n \n print(i)\n break\n \n \n ", "import math\r\n\r\ndef isPrime(n):\r\n if n%2 == 0:\r\n return False\r\n \r\n for i in range(3, round(math.sqrt(n)), 2):\r\n if n%i == 0:\r\n return False\r\n \r\n return True\r\n\r\nn = int(input())\r\n\r\nif n == 2:\r\n print(4)\r\n\r\nelif n%2 == 1:\r\n print(3)\r\n\r\nelse:\r\n for i in range(1000):\r\n if not isPrime(n*i+1):\r\n print(i)\r\n break\r\n\r\n", "def simple_digit(n):\r\n for i in range(2, int(pow(n, 0.5) + 1)):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\nfor i in range(1,1001):\r\n if not simple_digit(n * i + 1):\r\n print(i)\r\n break\r\n", "nr = int(input())\r\nm = 1\r\ncase = True\r\nwhile case:\r\n ourNumber = (nr * m) + 1\r\n for x in range(ourNumber - 1, 1, -1):\r\n if ourNumber % x == 0:\r\n case = False\r\n if case:\r\n m += 1\r\nprint(m)", "\r\ndef solve(n):\r\n\r\n if n > 2:\r\n return n - 2\r\n elif n == 1:\r\n return 3\r\n else:\r\n return 4\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print(solve(n))", "class Solution:\r\n def poland_ball(self, n):\r\n divisors = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]\r\n for i in range(1, 1000):\r\n res = n*i+1\r\n for d in divisors:\r\n if res not in divisors and res % d == 0:\r\n return i\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n ob = Solution()\r\n print(ob.poland_ball(n))", "def is_prime(n):\n for i in range(3, n // 2):\n if (n % i == 0):\n return False\n \n return True\n\ndef main():\n n = int(input())\n \n if n == 1:\n print(\"3\")\n elif n == 2:\n print(\"4\")\n elif n % 2 == 1:\n print(\"1\")\n else:\n for j in range(1000):\n if (not is_prime(n*j + 1)):\n print(j)\n break\n\nmain()\n\t \t \t \t \t\t\t\t \t \t \t \t \t", "import math\r\n\r\nfrom sys import stdin\r\n\r\nfrom collections import defaultdict\r\n\r\n\r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\ndef isPrime(n: int) -> bool:\r\n\r\n if n > 1:\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n return False\r\n return True \r\n return False\r\n\r\ndef solve():\r\n\r\n n = int(input())\r\n\r\n for m in range(1, 1001):\r\n res = n * m + 1\r\n if not isPrime(res):\r\n print(m)\r\n return\r\n\r\n\r\nsolve()\r\n\r\n", "def isprime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if(n%i==0):\r\n return(0)\r\n return(1)\r\n\r\nn=int(input())\r\ni=1\r\nwhile(1):\r\n if(isprime(n*i+1)==0):\r\n print(i)\r\n break\r\n i+=1", "def verifica_primo(num):\n if num>1:\n for i in range(2,num):\n if(int(num%i)==0):\n return 1\n else:\n return 0\n else:\n return 0\n\ndef main():\n n= int(input())\n m=1\n while True:\n if verifica_primo(int((n*m)+1))==1:\n print(m)\n break\n else:\n m+=1\n\nmain()\n \n \t \t\t \t \t \t \t\t \t \t", "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\ncompare max\r\n'''\r\n\r\ndef solve():\r\n squares = set()\r\n for i in range(1,2001):\r\n squares.add(i*i)\r\n\r\n n = II()\r\n if n&1:\r\n print(3)\r\n else:\r\n for i in range(1,1001):\r\n if i*n + 1 in squares:\r\n print(i)\r\n break\r\n\r\nsolve()", "def f(m):\r\n for i in range(2, (m // 2) + 1):\r\n if m % i == 0:\r\n return True\r\n return False\r\n\r\n\r\nn = int(input())\r\nm = 1\r\nwhile True:\r\n if f(n * m + 1):\r\n print(m)\r\n break\r\n m += 1\r\n", "# Esse programa usa um algoritmo do repositorio\n\nfrom math import sqrt\n\n# Testa se o numero n tem divisores inteiros entre 2 e raiz quadrada de n. Caso tenha, entao ele eh primo\ndef primo(n):\n if (n < 2):\n return False\n if (n % 2 == 0 and n != 2):\n return False\n for i in range(2, int(sqrt(n))+1):\n if (n % i == 0):\n return False\n return True\n\n# Fim do algoritmo do repositorio\n\ndef main():\n n = int(input())\n for i in range(1, 1001):\n if (not primo((n*i)+1)):\n print(i)\n break\nmain()\n \t \t\t \t\t\t\t \t \t \t\t \t\t \t \t\t", "n=int(input())\r\nm=1\r\nwhile True:\r\n i=m*n+1\r\n j=2\r\n ctr=0\r\n while j<i:\r\n if i%j==0:\r\n # print(i,j)\r\n ctr+=1\r\n j+=1\r\n if ctr>=1:\r\n print(m)\r\n break\r\n m+=1", "n = int(input())\nif (n > 2):\n print(n-2)\nelif (n == 2):\n print(4)\nelse:\n print(3)", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nx = int(input())\n\nif x == 1:\n print(3)\n\nelif x == 2:\n print(4)\n\nelse:\n print(x-2)\n \t \t\t\t\t\t \t \t \t \t\t\t \t \t\t \t", "n = int(input())\n# if n is odd => n * odd + 1 = even\n# if n is even => n * (n - 2) + 1 = n^2 - 2n + 1 = (n - 1) * (n + 1)\n# if n = 2 => m = 4\nres = 4 if n == 2 else 3 if n & 1 == 1 else n - 2\nprint(res)\n", "def prime(x):\r\n for __ in range(2, int(x ** 0.5) + 1):\r\n if x % __ == 0: return False\r\n return True\r\n\r\n\r\nn = int(input())\r\nfor m in range(1, 1001):\r\n j = n * m + 1\r\n if prime(j): continue\r\n print(m)\r\n exit()\r\n", "n = int(input())\n\nif (n > 2):\n if (n%2 != 0):\n print(1)\n else:\n print(n-2)\nelse:\n if (n == 1):\n print(3)\n else:\n print(4)\n \t \t\t \t \t\t\t\t \t\t\t \t \t \t\t\t \t", "def isPrime(n):\r\n if n > 1: \r\n for i in range(2,n): \r\n if (n % i) == 0: \r\n return False\r\n return True\r\n else:\r\n return False\r\nn = int(input())\r\ni=1\r\nwhile(True):\r\n if(isPrime(n*i+1)):\r\n i=i+1\r\n else:\r\n print(i)\r\n break\r\n \r\n ", "def primo(num):\n for i in range(2, int(num/2)+1):\n if num % i == 0:\n return False\n return True\n\nn = int(input())\n\nfor m in range(1, 1001):\n if primo((n * m) + 1) == False:\n print(m)\n break\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\nif n>2:\n ans = n-2\nelse:\n ans = n+2\n \nprint(ans)\n \t\t\t \t \t\t \t\t \t\t \t\t \t \t\t", "n=int(input())\r\nr,m=0,1\r\nwhile(True):\r\n k=n*m+1\r\n for i in range(2,k):\r\n if k%i==0:\r\n print(m)\r\n r=1\r\n break\r\n if r==1:\r\n break\r\n m+=1", "def is_prime(n):\n if n < 2:\n return False\n \n if n == 2:\n return True\n \n if (n % 2 == 0):\n return False\n \n for i in range(3,n+1,2):\n if i*i > n:\n break\n\n if (n%i == 0):\n return False\n \n return True\n\nx = int(input())\n\nfor i in range(1, 1001, 1):\n aux = x * i + 1\n\n if not is_prime(aux):\n print(i)\n break\n\n\n \t\t\t\t \t\t\t\t \t \t \t\t \t\t", "n = int(input())\r\nop = 0\r\nfor i in range(1, 1001):\r\n ans = n * i + 1\r\n d = 2\r\n while d * d <= ans:\r\n if ans % d == 0:\r\n op = i\r\n break\r\n d += 1\r\n if op:\r\n break\r\nprint(op)", "print(min(int(input()) + 2, 999))\n \t \t\t \t\t\t\t \t\t \t\t\t\t\t \t", "def verify_primo(x):\n divisor = 2\n while divisor < x:\n if x % divisor == 0:\n return False\n divisor += 1\n return True\n\nentrada = int(input())\nresult = 1\neh_primo = True\nwhile True:\n eh_primo = verify_primo((entrada * result) + 1)\n if eh_primo == False:\n print(result)\n break\n result += 1\n\n \t \t \t \t\t\t\t \t\t\t \t \t \t \t \t", "def main(n):\r\n if n == 1:\r\n r = 3\r\n elif n == 2:\r\n r = 4\r\n else:\r\n r = n - 2\r\n print(r)\r\n\r\nmain(int(input()))\r\n", "from math import sqrt, floor\n\nn = int(input())\n\ndef prime(k):\n j = floor(sqrt(k))\n for i in range(2,j+1):\n if k % i == 0:\n return 0\n return 1\n\nfor m in range(1,1001):\n r = (n*m)+1\n if prime(r) == 0:\n print (m)\n break\n\t \t\t \t \t \t \t \t\t \t \t", "from cmath import *\r\nfrom decimal import *\r\nimport sys\r\ndef _input(): return map(int, input().split())\r\ndef _list(): return list(map(int, input().split()))\r\n\r\na=[0]*10001\r\n\r\ndef solves():\n n=int(input())\n m=1\n while True:\n if (a[n*m+1]!=0):\n print(m)\n return\n else:\n m+=1\n\r\n\r\nt=1\r\n#t =int(input())\r\nfor i in range(2,10000):\r\n if a[i]==0:\r\n for j in range(i*2,10000,i):\r\n a[j]=1\r\nfor _ in range(0,t):\r\n solves()\r\n", "import math\r\ndef is_prime(num):\r\n for d in range(2,int(math.sqrt(num))+1):\r\n if num%d==0:\r\n return False\r\n return True\r\ndef polandball_and_hypothesis():\r\n a=int(input())\r\n for i in range(1,2000):\r\n if is_prime(a*i+1)==False:\r\n print(i)\r\n break\r\npolandball_and_hypothesis()", "def is_prime(I):\r\n if I==1: return False\r\n if I==2: return True\r\n else:\r\n for i in range(2,int(I**0.5)+1):\r\n if I%i==0:\r\n return False\r\n return True\r\nn=int(input())\r\ni=1\r\nwhile True:\r\n if is_prime((i*n)+1)!=True:\r\n print(i)\r\n break\r\n i=i+1", "def printTeste(n,m):\n print(n*m+1)\n\nn = int(input())\nm = 0\nif(n==1):\n m=3\n \nelif(n==2):\n m=4\nelif(n%2!=0):\n m=1\nelse:\n m=(n-2)\n\nprint(m)\n \t \t\t \t \t\t \t\t\t \t\t\t \t\t", "n=int(input())\r\nprint(n-2 if n>2 else n+2)\r\n", "def cp(m):\r\n for i in range(2,m//2):\r\n if m%i == 0:\r\n return False\r\n return True\r\nn=int(input())\r\nfor j in range(1,1000):\r\n x=cp(n*j+1)\r\n if not x:\r\n print(j)\r\n break", "import math\r\ndef kesava(n):\r\n for i in range(1,1001):\r\n for j in range(2,int(math.sqrt((n*i)+1))+1):\r\n if ((n*i)+1)%j==0:\r\n return i \r\nprint(kesava(int(input())))", "\"\"\"\r\nLINK: https://codeforces.com/problemset/problem/755/A\r\n\r\nSince (n * m + 1) (say x) as not very large, we find primes till x and then find m with brute-force such that x is not a prime\r\n\r\nCOMPLEXITY:\r\nTC - O(nloglogn + m) for sieve + finding m\r\nSC - O(n*1000) for 'is_prime'\r\n\"\"\"\r\n\r\n\r\n\r\ndef get_num1(n):\r\n max_val = n * 1000 + 1\r\n is_prime = [True] * max_val\r\n\r\n for i in range(2, max_val):\r\n if not is_prime[i]:\r\n continue\r\n for j in range(i * i, max_val, i):\r\n is_prime[j] = False\r\n\r\n # Find m such that (n * m + 1) is not prime\r\n for m in range(1, 1001):\r\n if not is_prime[n * m + 1]:\r\n return m\r\n\r\n return -1\r\n\r\ndef get_num(n):\r\n if n == 1:\r\n return 3\r\n if n == 2:\r\n return 4\r\n\r\n return n - 2\r\n\r\nprint(get_num(int(input())))\r\n", "# for testCase in range(int(input())):\n# n ,x = map(int ,input().split())\n# print(x*2)\nn = int(input())\nif n <= 998:\n print(n+2)\nelse:\n print(n)\n", "# cook your dish here\r\nn=int(input())\r\nif n==2:\r\n print(4)\r\nelif n%2==1:\r\n print(3)\r\nelse:\r\n print(n-2)", "# Version 16.0\r\ndef main() -> None:\r\n def isPrime( n : int ) -> bool:\r\n if n <= 1: return False\r\n if n % 2 == 0: return n == 2\r\n max_div = math.floor(math.sqrt(n))\r\n for i in range(3, 1 + max_div, 2):\r\n if n % i == 0: return False\r\n return True\r\n\r\n\r\n n = ii()\r\n i = 1\r\n while True:\r\n if isPrime((n*i)+1): i+=1\r\n else: p(i); break\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()", "def isPrime(n):\r\n if n<2:\r\n return False\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\nn=int(input())\r\nif n%2!=0:\r\n print(3)\r\nelse:\r\n m=1 \r\n while isPrime(n*m+1):\r\n m+=1 \r\n print(m)", "from math import sqrt\n\nif __name__ == \"__main__\":\n n = int(input())\n \n for i in range(1000):\n number = i * n + 1\n t = int(sqrt(number))\n flag = 0\n for j in range(2, t + 1, 1):\n if number % j == 0:\n flag = 1\n break\n if flag == 1:\n print(i)\n break\n \n\t \t \t \t \t \t \t\t \t\t\t\t\t\t\t \t\t\t", "def ehPrimo(n):\n quant = 0\n for i in range(1, n+1):\n if(n%i == 0):\n quant += 1\n if (quant == 2):\n return True\n else:\n return False\n\nn = int(input())\nachou = False\nm = 1\n\nwhile not achou:\n if (ehPrimo(m*n+1)):\n m+=1\n else:\n break\n\nprint (m)\n \t\t\t\t\t \t\t\t \t \t\t\t \t \t \t", "N = int(input())\r\nprint(7 if N<=2 else N-2)", "a = int(input())\r\ni = 1\r\nwhile True:\r\n b = (a*i)+1\r\n if b%2 == 0 and b != 2:\r\n print(i)\r\n break\r\n if b%3 == 0 and b != 3:\r\n print(i)\r\n break\r\n if b%5 == 0 and b != 5:\r\n print(i)\r\n break\r\n if b%7 == 0 and b != 7:\r\n print(i)\r\n break\r\n if b%11 == 0 and b != 11:\r\n print(i)\r\n break\r\n i+=1", "def checkPrime(n):\n if n > 1:\n for number in range(2, (n // 2) + 1):\n if (n % number) == 0:\n return 0\n return 1\n\n\ndef getNonPrime(n, m):\n try_prime = (n * m) + 1\n if not checkPrime(try_prime):\n print(m)\n else:\n getNonPrime(n, m + 1)\n\n\nif __name__ == \"__main__\":\n n = int(input())\n m = 1\n\n getNonPrime(n, m)\n\n\t\t\t \t\t \t \t \t\t \t \t\t\t\t \t\t\t", "import math\nn = int(input())\nm = 1\nif (n & 1):\n\tif n == 1:\n\t\tprint(3)\n\telse:\n\t\tprint(1)\nelse:\n\tfor i in range(1000):\n\t\tflag = False\n\t\tnum = n * m + 1\n\t\tx = math.sqrt(num)\n\t\tif num % 2 == 0:\n\t\t\tflag = True\n\t\telse:\n\t\t\tfor i in range(2, int(x) + 1):\n\t\t\t\tif num % i == 0:\n\t\t\t\t\tflag = True\n\t\t\t\t\tbreak\n\t\tif flag:\n\t\t\tprint(m)\n\t\t\tbreak\n\t\telse:\n\t\t\tm += 1\n\t\t\n\t \t \t \t\t \t \t \t\t \t\t\t \t\t", "def eh_primo(x):\n\tfor i in range(2, (x//2)+1):\n\t\tif x % i == 0:\n\t\t\treturn 0\n\treturn 1\n\nn = int(input())\n\nfor i in range(1001):\n\tif not eh_primo(n*i + 1):\n\t\tprint(i)\n\t\tbreak\n\t \t \t \t \t\t \t\t \t \t \t \t", "n=int(input())\r\nk=0\r\nfor m in range(1,1000):\r\n for i in range(2,int((n*m+1)**0.5)+1):\r\n if (n*m+1)%i==0:\r\n print(m)\r\n k=1\r\n break\r\n if k==1: break", "def prime(x):\r\n is_prime = True\r\n while is_prime and x>=3:\r\n for i in range(2, ((x+1)//2)+1):\r\n if x%i == 0:\r\n is_prime = False\r\n break\r\n return is_prime\r\n\r\nn = int(input())\r\nif n ==1:\r\n print(3)\r\nelif n%2!=0:\r\n print(1)\r\nelse:\r\n m=1\r\n while prime(n*m+1) and m<1000:\r\n m+=1\r\n else:\r\n print(m)", "from sys import stdin, stdout \r\n\r\nn = int(stdin.readline())\r\nif n%2 == 1:\r\n stdout.write('3')\r\nelse:\r\n\r\n primes = [3,5,7,11,13,17,19,23,29,31]\r\n m = 1\r\n b = True\r\n while b:\r\n v = m*n+1\r\n for p in primes:\r\n if v%p ==0 and v!=p:\r\n b = False\r\n break\r\n else:\r\n m+=1\r\n stdout.write(str(m))", "# cook your dish here\r\n\r\ndef main():\r\n n = int(input())\r\n if n==1:\r\n print(3)\r\n elif n==2:\r\n print(4)\r\n else:\r\n print(n-2)\r\n \r\nmain()\r\n", "def check(a):\r\n if a == 2 or a == 3:\r\n return True\r\n else:\r\n b = int(a ** 0.5)\r\n for i in range(2,b+1):\r\n if a % i == 0:\r\n return False\r\n return True\r\na = int(input())\r\nm = 1\r\n\r\nwhile True:\r\n if (check((a*m)+1)) == False:\r\n print(m)\r\n break\r\n else:\r\n m += 1\r\n", "n = int(input())\r\nif n == 2:\r\n print(4)\r\nelse:\r\n print(999 if n % 2 == 1 else n - 2)", "seive=[1 for i in range(10**6+5)]\r\nseive[0]=0\r\nseive[1]=0\r\nfor i in range(2,10**6+5):\r\n for j in range(i*i,10**6+5,i):\r\n seive[j]=0\r\nn=int(input())\r\nfor i in range(1,1001):\r\n if(seive[n*i+1]==0):\r\n print(i)\r\n break\r\n", "def notsimple(a):\n count = 0\n flag = False\n for i in range(1,a+1):\n if a%i == 0:\n count+=1\n if count == 3:\n flag = True\n break\n if flag:\n return True\n else:\n return False\nn = int(input())\nfor i in range(1,1000):\n if notsimple((n*i)+1):\n print(i)\n break\n", "from math import ceil,sqrt\r\nn = int(input())\r\ndef prime(x):\r\n if x < 2:\r\n return False\r\n if x == 2:\r\n return True\r\n for i in range(2,1+ceil(sqrt(x))):\r\n if not x%i:\r\n return False\r\n return True\r\nm = 1\r\nwhile prime(n*m+1):\r\n m+=1\r\nprint(m)", "def isprime(m):\r\n j=[]\r\n for d in range(1,int(m**0.5)+1):\r\n if m%d==0:\r\n j.append(d)\r\n j.append(m//d)\r\n j=set(j)\r\n if len(j)==2:\r\n return True\r\n else:\r\n return False\r\n\r\nn=int(input())\r\nfor m in range(1,1000+1):\r\n z=n*m+1\r\n if isprime(z)==False:\r\n print(m)\r\n exit()", "n = int(input())\r\n\r\ndef prime(n):\r\n\r\n if n < 2:\r\n return True\r\n\r\n for i in range(2, n):\r\n\r\n if n % i == 0:\r\n return False\r\n\r\n return True\r\n\r\ni = 1\r\nans = 1\r\nwhile True:\r\n num = (i * n) + 1\r\n\r\n if not prime(num):\r\n ans = i\r\n break\r\n i += 1\r\n\r\nprint(i)", "import math\r\ndef prime(n):\r\n if(n==1):\r\n return False\r\n elif(n==2):\r\n return True\r\n elif(n%2==0):\r\n return False\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n if(n%i==0):\r\n return False\r\n return True\r\nn=int(input())\r\ni=1\r\ns=1\r\nwhile(s):\r\n if(not prime(n*i+1)):\r\n s=0\r\n else:\r\n i+=1\r\nprint(i)\r\n \r\n \r\n", "def is_prime(number):\r\n if number < 2:\r\n return False\r\n for i in range(2, int(number ** 0.5) + 1):\r\n if number % i == 0:\r\n return False\r\n return True\r\nn=int(input())\r\nfor i in range(1,18):\r\n if not is_prime(n*i+1):\r\n print(i)\r\n exit()", "def isPrime(n):\n for i in range(2, (n // 2) + 1):\n if(n % i == 0):\n return False\n return True\n\ndef find_CounterExemple(n):\n for m in range(1, 1000):\n if not(isPrime(n * m + 1)):\n return m\n \n\nn = int(input())\nprint(find_CounterExemple(n))\n \t \t \t\t \t\t\t \t \t \t\t \t\t\t", "def is_prime(x):\r\n if x in (1, 2, 3):\r\n return True\r\n\r\n for i in range(2, int(x / 2) + 1):\r\n if x % i == 0:\r\n return False\r\n\r\n return True\r\n\r\ndef get_answer(n):\r\n for m in range(1, 1001):\r\n if not is_prime(n * m + 1):\r\n return m\r\n\r\nn = int(input())\r\n\r\nprint(get_answer(n))", "n = int(input())\r\nif n>2:\r\n print(n-2)\r\nif n == 2:\r\n print(4)\r\nif n == 1:\r\n print(9)\r\n", "def isPrime(number):\n\ts = int(number ** 1/2)\n\t\n\twhile s > 1:\n\t\tif(number % s == 0):\n\t\t\treturn False\n\t\ts -= 1\n\treturn True\n\n\nn = int(input())\n\nm = 1\nwhile True:\n\tk = n * m + 1\n\tif(not isPrime(k)):\n\t\tprint(m)\n\t\tbreak\n\tm += 1\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", "def prime(n):\r\n if n < 2:\r\n return False\r\n elif n != 2 and n % 2 == 0:\r\n return False\r\n lim = pow(n, 0.5) + 1\r\n for j in range(3, int(lim), 2):\r\n if n % j == 0:\r\n return False\r\n return True\r\ndef f():\r\n n = int(input())\r\n m = 1\r\n while prime(int(n * m) + 1) == True:\r\n m += 1\r\n print(m)\r\nf()\r\n", "\"\"\"\nSummary of Code:\n- find all primes below n * m + 1\n- for every m, check if it is prime or not\n\nRuntime Complexity:\n- input => O(1)\n- primes => O(n log log n)\n- m => O(10^3)\n- total => O(n log log n + 10^3)\n\nSpace Complexity:\n- input => O(1)\n- primes => O(n * 10^3 + 1)\n- total => O(n * 10^3)\n\nWhy the chosen algorithm work:\n- the runtime is O(n log log n + 10^3) which maximum will be\n around 7 * 10**6 + 10^3 < 10^7\n- therefore it will end in time\n\"\"\"\nfrom sys import stdin\n\ndef main():\n input = stdin.readline\n n = int(input())\n primes = [1] * (n * 10**3 + 1)\n primes[0] = 0; primes[1] = 0\n for i in range(len(primes)):\n if primes[i] == 0:\n continue\n for j in range(i*2, len(primes), i):\n primes[j] = 0\n\n for m in range(1, 10**3 + 1):\n num = n * m + 1\n if primes[num] == 0:\n print(m)\n exit()\n\n\nif __name__ == '__main__':\n main()\n\t\t \t \t \t \t\t \t \t \t\t \t \t\t", "def is_prime(n):\r\n count = 0\r\n for i in range(1, n + 1):\r\n if n % i == 0:\r\n count += 1\r\n if count == 2:\r\n return True\r\n return False\r\nn = int(input())\r\ncheck = True\r\nm = 1\r\nwhile check:\r\n r = n * m + 1\r\n if is_prime(r) == False:\r\n print(m)\r\n check = False\r\n else:\r\n m += 1\r\n", "import math\r\nfrom math import sqrt\r\n\r\ndef prime(x):\r\n if(x<=1):\r\n return False\r\n if(x==2):\r\n return True\r\n for y in range(2,int(math.sqrt(x))+1):\r\n if(x%y==0):\r\n return False\r\n return True\r\n\r\nx=int(input())\r\np=1\r\na=x*p+1\r\nwhile(prime(a)==True):\r\n p=p+1\r\n a=x*p+1\r\n \r\nprint(p)" ]

[ "m = int(input())\r\nbasis = []\r\nfor i in range(m):\r\n a = int(input())\r\n need=0\r\n for v,bitset in basis:\r\n if a^v<a:\r\n need^=bitset\r\n a^=v\r\n if a:\r\n basis.append((a,need^(1<<i)))\r\n print(0)\r\n else:\r\n res = [d for d in range(i) if 1<<d&need]\r\n print(len(res), *res)", "m = int(input())\r\narr = []\r\nbits = []\r\nfor i in range(m):\r\n x = int(input())\r\n bit = 0\r\n for j in range(len(arr)):\r\n p = arr[j] ^ x\r\n if p < x:\r\n x = p\r\n bit ^= bits[j]\r\n if x == 0:\r\n ans = \"\"\r\n r = 0\r\n for j in range(i):\r\n if bit & (1 << j) == 1 << j:\r\n r += 1\r\n ans += str(j) + \" \" \r\n print(str(r) + \" \" + ans)\r\n else:\r\n print(0)\r\n arr.append(x)\r\n bits.append(bit ^ (1 << i))\r\n", "import sys\r\ninput, print = sys.stdin.readline, sys.stdout.write\r\n\r\nMAX = 2000\r\n\r\nbasis = [0] * MAX\r\nindices = [0] * MAX\r\n\r\ndef add(x, y):\r\n mask = 1 << y\r\n for i in range(MAX):\r\n if x >> i & 1:\r\n if basis[i] == 0:\r\n basis[i] = x\r\n indices[i] = mask\r\n return\r\n x ^= basis[i]\r\n mask ^= indices[i]\r\n\r\ndef query(x):\r\n mask = 0\r\n for i in range(MAX):\r\n if x >> i & 1:\r\n x ^= basis[i]\r\n mask ^= indices[i]\r\n return mask if x == 0 else -1\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n x = int(input())\r\n mask = query(x)\r\n if mask == -1:\r\n print(str(0) + \"\\n\")\r\n else:\r\n ret = [str(i) for i in range(MAX) if mask >> i & 1]\r\n print(str(len(ret)) + \" \" + \" \".join(ret) + \"\\n\")\r\n add(x, i)", "import sys, os\r\n\r\nnumbs = [int(x) for x in sys.stdin.buffer.read().split()]\r\nn = numbs.pop(0)\r\n\r\nbase = []\r\nout = []\r\n\r\nfor i in range(n):\r\n x = numbs[i]\r\n how = 0\r\n \r\n for b,rep in base:\r\n if x.bit_length() == b.bit_length():\r\n x ^= b\r\n how ^= rep\r\n \r\n if x:\r\n how |= 1 << i\r\n\r\n a = 0\r\n b = len(base)\r\n while a < b:\r\n c = a + b >> 1\r\n if base[c][0] > x:\r\n a = c + 1\r\n else:\r\n b = c\r\n base.insert(a, (x, how))\r\n \r\n out.append(0)\r\n else:\r\n outind = len(out)\r\n out.append(-1)\r\n \r\n y = bin(how).encode('ascii')\r\n ylen = len(y)\r\n for i in range(2,len(y)):\r\n if y[i] == 49:\r\n out.append(ylen - 1 - i)\r\n out[outind] = len(out) - 1 - outind\r\n\r\nos.write(1, b'\\n'.join(str(x).encode('ascii') for x in out))\r\n", "m = int(input())\r\nbase = []\r\nfor i in range(m):\r\n a = int(input())\r\n need=0\r\n for v,bitset in base:\r\n if a^v<a:\r\n need^=bitset\r\n a^=v\r\n if a:\r\n print(0)\r\n\r\n base.append((a,need^(1<<i)))\r\n else:\r\n res = []\r\n for d in range(i):\r\n if need&(1<<d):\r\n res.append(d)\r\n print(len(res), *res)", "n = int(input())\r\nt = [0 for i in range(2000)]\r\nc = [0 for i in range(2000)]\r\nfor i in range(n) :\r\n x = int(input())\r\n r = 0\r\n ok = False\r\n for j in range(2000) :\r\n if x >> j & 1 :\r\n if t[j] != 0 :\r\n x ^= t[j]\r\n r ^= c[j]\r\n else :\r\n t[j] = x\r\n c[j] = r ^ (1 << i)\r\n ok = True\r\n break\r\n if ok :\r\n print(0)\r\n continue\r\n a = []\r\n for j in range(2000) :\r\n if r >> j & 1 :\r\n a.append(j)\r\n print(len(a))\r\n for y in a :\r\n print(y)\r\n ", "n = int(input())\r\nb = []\r\nbb =[]\r\nfor i in range(n):\r\n x=int(input())\r\n idx = 0\r\n for j in range(len(b)):\r\n nxt = b[j] ^ x\r\n if nxt < x :\r\n x = nxt\r\n idx ^= bb[j]\r\n if x == 0:\r\n cnt = 0\r\n v = []\r\n for k in range(2000):\r\n if idx & (1 << k) :\r\n v.append(k)\r\n print(len(v),end=' ')\r\n for e in v:\r\n print(e,end=' ')\r\n print()\r\n else :\r\n print(0)\r\n idx ^= 1 << i\r\n b.append(x)\r\n bb.append(idx)\r\n\r\n \r\n " ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\npre = -1\r\nj = 0\r\nfor i in range(N):\r\n while j<N and A[i]!=B[j]:\r\n j+=1\r\n if j<N and A[i]==B[j]:\r\n pre = i+1\r\n \r\nprint(N-pre)\r\n \r\n \r\n ", "n = int(input())\r\nl1 = [int(x) for x in input().split()]\r\nl2 = [int(x) for x in input().split()]\r\n\r\nused = set()\r\nj = len(l1)-1\r\nworst = j\r\n\r\nfor i in range(len(l2)-1, -1, -1):\r\n if l2[i] in used:\r\n continue\r\n if l2[i] == l1[j]:\r\n j-=1\r\n else:\r\n while l2[i] != l1[j]:\r\n used.add(l1[j])\r\n j-=1\r\n j -= 1\r\n worst = j+1\r\n#print(worst)\r\nprint(len(l1) - worst - 1)\r\n", "u,d,x,n=0,0,0,int(input())\n\n# n = [0 for i in range(n+10)]\n\nf=list(map(int,input().split()))\n\ns=list(map(int,input().split()))\n\nwhile d<n:\n\n if s[d]!=f[u]:\n\n x+=1\n\n d+=1\n\n else:\n\n d+=1\n\n u+=1\n\nprint(x)\n\n", "\r\n\r\ndef solve():\r\n n = int(input())\r\n arr1 = list(map(int, input().split(\" \")))\r\n arr2 = list(map(int, input().split(\" \")))\r\n index = [0 for i in range(0, n + 1)]\r\n for i in range(0, n):\r\n index[arr2[i]] = i\r\n for i in range(0, n):\r\n arr1[i] = index[arr1[i]]\r\n max_value = 0\r\n b = [0 for i in range(0, n)]\r\n for i in range(0, n):\r\n if max_value > arr1[i]:\r\n b[i] = 1\r\n if i - 1 >= 0:\r\n b[i] += b[i - 1]\r\n max_value = max(max_value, arr1[i])\r\n ans = 0\r\n for i in range(n - 1, -1, -1):\r\n if b[i] > 0:\r\n ans += 1\r\n print(ans)\r\n pass\r\n\r\nt = 1\r\n\r\nwhile t > 0:\r\n solve()\r\n t -= 1", "n = int(input())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\nvis, j = set(), n-1\r\nres = j\r\nfor i in range(n-1, -1, -1):\r\n if a2[i] in vis:\r\n continue\r\n if a2[i] == a1[j]:\r\n j -= 1\r\n continue\r\n while a2[i] != a1[j]:\r\n vis.add(a1[j])\r\n j -= 1\r\n j -= 1\r\n res = j+1\r\nprint(n-res-1)\r\n", "input()\r\nperm_target = list(map(int, input().split()))\r\nperm_given = list(map(int, input().split()))\r\ncursor = 0\r\nmove = 0\r\nfor val in perm_given:\r\n if val == perm_target[cursor]:\r\n cursor += 1\r\n else:\r\n move += 1\r\nprint(move)", "n = int(input())\r\nt = list(map(int, input().split()))\r\npom = list(map(int, input().split()))\r\nj = 0\r\nfor i in range(n):\r\n if pom[i] == t[j]:\r\n j += 1\r\nprint(n - j)# 1698397206.2944677", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ni = j = 0\r\nfor j in range(n):\r\n if b[j] == a[i]:\r\n i = i + 1\r\nprint(n-i)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nout=list(map(int,input().split()))\r\nmp=dict()\r\nans=0\r\nfor i in range(n):\r\n mp[arr[i]]=i\r\nfor i in range(n):\r\n mp[out[i]]+=ans\r\n if i==mp[out[i]]:continue\r\n ans+=1\r\nprint(ans)" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nchars=['G','B']\r\nN,K,a,b = map(int, input().split())\r\nif a<b:\r\n a,b = b,a\r\n chars=['B','G']\r\n \r\nans = ['']\r\nwhile a>0:\r\n if a>b:\r\n if len(ans[-1])>=K:break\r\n ans[-1]+=chars[0]\r\n a-=1\r\n if len(ans[-1])==K:\r\n if b>0:\r\n ans[-1]+=chars[1]\r\n ans.append('')\r\n b-=1\r\n else:\r\n ans[-1]+=chars[1]\r\n ans.append('')\r\n b-=1\r\n \r\n#print(a,b)\r\nif a>0:\r\n exit(print('NO'))\r\nprint(''.join(ans))\r\n\r\n", "from math import ceil\r\nfrom sys import stdin\r\ndef solve(n,k,a,b):\r\n s = [\"G\", \"B\"]\r\n if a >= b: f = 0\r\n else:\r\n f = 1\r\n a, b = b, a\r\n ans = \"\"\r\n d, m = divmod(a, b + 1)\r\n if ceil(a/(b+1)) <= k:\r\n for _ in range(b):\r\n if m:\r\n ans += s[f] * (d + 1) + s[f ^ 1]\r\n m -= 1\r\n else:\r\n ans += s[f] * d + s[f ^ 1]\r\n ans += s[f] * d\r\n else:\r\n ans = \"NO\"\r\n return ans\r\n \r\n\r\n \r\n \r\n \r\nn,k,a,b = map(int, input().split())\r\nprint(solve(n,k,a,b))\r\n ", "def solve():\r\n n, k, a, b = map(int, input().split())\r\n if a == b:\r\n print('GB' * a)\r\n return\r\n if a / k > b + 1 or b / k > a + 1:\r\n print('NO')\r\n return\r\n if a > b:\r\n ans = ''\r\n while a > b + k:\r\n ans += 'G' * k + 'B'\r\n a -= k\r\n b -= 1\r\n ans += 'G' * (a - b) + 'BG' * b\r\n print(ans)\r\n else:\r\n ans = ''\r\n while b > a + k:\r\n ans += 'B' * k + 'G'\r\n b -= k\r\n a -= 1\r\n ans += 'B' * (b - a) + 'GB' * a\r\n print(ans)\r\nsolve()\r\n", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\nn,k,g,b = map(int,input().split(\" \"))\r\nlast,ans,pos,cur = '','',True,0\r\nwhile g or b:\r\n if cur == k:\r\n if last == 'G' and b:\r\n ans += \"B\"\r\n last = \"B\"\r\n b -= 1\r\n cur = 1\r\n elif last == \"B\" and g:\r\n ans += \"G\"\r\n last = \"G\"\r\n g -= 1\r\n cur = 1\r\n else:\r\n pos = False\r\n break\r\n elif g > b:\r\n ans += 'G'\r\n if last == \"G\":\r\n cur += 1\r\n else:\r\n last = \"G\"\r\n cur = 1\r\n g -= 1\r\n else:\r\n ans += \"B\"\r\n if last == \"B\":\r\n cur += 1\r\n else:\r\n last = \"B\"\r\n cur = 1\r\n b -= 1\r\n\r\nif pos:\r\n print(ans)\r\nelse:\r\n print(\"NO\")", "# Problem: D. Green and Black Tea\r\n# Contest: Codeforces - Codeforces Round 386 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/746/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\nfrom collections import *\r\nfrom functools import *\r\nfrom itertools import *\r\nfrom operator import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nimport math\r\nimport re\r\nimport os\r\nimport io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n \r\ndef I():\r\n return input().decode('utf-8').strip()\r\n \r\ndef II(base=10):\r\n return int(input(),base)\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 main():\r\n\tn,k,a,b = LII()\r\n\tres, wa, wb = [], 0, 0\r\n\twhile a or b:\r\n\t\tif wa<k and (a>=b or wb==k):\r\n\t\t\twa,wb = wa+1,0\r\n\t\t\ta -= 1\r\n\t\t\tres.append('G')\r\n\t\telse:\r\n\t\t\twa,wb = 0,wb+1\r\n\t\t\tb -= 1\r\n\t\t\tres.append('B')\r\n\t\tif a<0 or b<0:\r\n\t\t\treturn 'NO'\r\n\treturn ''.join(res)\r\nprint(main())\r\n\t", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\nimport math\r\nn,k,a,b=map(int,input().split())\r\n\r\nif a==b:\r\n temp=\"\"\r\n for _ in range(a):\r\n temp+=\"GB\"\r\n print(temp)\r\nelif a>b:\r\n part=math.ceil(a/k)\r\n if b<part-1:\r\n print(\"NO\")\r\n else:\r\n temp=[]\r\n while a:\r\n kk=min(k,a)\r\n if b>0:\r\n temp.append(\"G\"*kk+\"B\")\r\n else:\r\n temp.append(\"G\"*kk)\r\n b-=1\r\n a-=kk\r\n for i in range(len(temp)):\r\n curr=min(k-1,b)\r\n b-=curr\r\n currtemp=\"B\"*curr\r\n temp[i]+=currtemp\r\n if b==0:break\r\n \r\n print(\"\".join(temp))\r\n \r\nelse:\r\n part=math.ceil(b/k)\r\n if a<part-1:\r\n print(\"NO\")\r\n else:\r\n temp=[]\r\n while b:\r\n kk=min(k,b)\r\n if a>0:\r\n temp.append(\"B\"*kk+\"G\")\r\n else:\r\n temp.append(\"B\"*kk)\r\n a-=1\r\n b-=kk\r\n for i in range(len(temp)):\r\n curr=min(k-1,a)\r\n a-=curr\r\n currtemp=\"G\"*curr\r\n temp[i]+=currtemp\r\n if a==0:break\r\n \r\n print(\"\".join(temp))", "n,k,a,b = map(int,input().split()) #чай\r\nres=''\r\nc=0\r\nfor i in range(n):\r\n if a>=b and c<k:\r\n a-=1\r\n if not res or res[-1]=='G':\r\n c+=1\r\n else:\r\n c=1\r\n res+='G'\r\n\r\n elif (b>=a and c<k):\r\n b-=1\r\n if not res or res[-1] == 'B':\r\n c+=1\r\n else:\r\n c=1\r\n res+='B'\r\n elif c==k:\r\n if res[-1]=='G':\r\n if b>0:\r\n b-=1\r\n res+='B'\r\n c=1\r\n else:\r\n print('NO')\r\n exit()\r\n else:\r\n if a>0:\r\n a-=1\r\n res+='G'\r\n c=1\r\n else:\r\n print('NO')\r\n exit()\r\nprint(res)\r\n", "import bisect\r\nimport decimal\r\nimport heapq\r\nfrom types import GeneratorType\r\nfrom math import inf\r\nimport sys\r\nfrom heapq import heappush, heappop, heappushpop\r\nfrom functools import cmp_to_key\r\nfrom collections import defaultdict, Counter, deque\r\nimport math\r\nfrom functools import lru_cache\r\nfrom heapq import nlargest\r\nfrom functools import reduce\r\nimport random\r\nfrom itertools import combinations, permutations\r\nfrom operator import xor, add\r\nfrom operator import mul\r\nfrom typing import List, Callable, Dict, Set, Tuple, DefaultDict\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().strip()\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().strip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n def ask(self, lst):\r\n # CF交互题输出询问并读取结果\r\n self.lst(lst)\r\n sys.stdout.flush()\r\n res = self.read_int()\r\n # 记得任何一个输出之后都要 sys.stdout.flush() 刷新\r\n return res\r\n\r\n def out_put(self, lst):\r\n # CF交互题输出最终答案\r\n self.lst(lst)\r\n sys.stdout.flush()\r\n return\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n @staticmethod\r\n def get_random_seed():\r\n # 随机种子避免哈希冲突\r\n return random.randint(0, 10**9+7)\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n, k, a, b = ac.read_ints()\r\n pre = [\"C\", 0]\r\n ans = []\r\n while a and b:\r\n if a >= b:\r\n if int(pre[0]==\"G\")*pre[1] + 1 <= k:\r\n ans.append(\"G\")\r\n a -= 1\r\n pre = [\"G\", int(pre[0]==\"G\")*pre[1] + 1]\r\n elif int(pre[0]==\"B\")*pre[1] + 1 <= k:\r\n ans.append(\"B\")\r\n pre = [\"B\", int(pre[0]==\"B\")*pre[1] + 1]\r\n b -= 1\r\n else:\r\n break\r\n else:\r\n if int(pre[0]==\"B\")*pre[1] + 1 <= k:\r\n ans.append(\"B\")\r\n b -= 1\r\n pre = [\"B\", int(pre[0]==\"B\")*pre[1] + 1]\r\n elif int(pre[0]==\"G\")*pre[1] + 1 <= k:\r\n ans.append(\"G\")\r\n pre = [\"G\", int(pre[0]==\"G\")*pre[1] + 1]\r\n a -= 1\r\n else:\r\n break\r\n\r\n while a and int(pre[0]==\"G\")*pre[1] + 1 <= k:\r\n ans.append(\"G\")\r\n a -= 1\r\n pre = [\"G\", int(pre[0] == \"G\") * pre[1] + 1]\r\n while b and int(pre[0]==\"B\")*pre[1] + 1 <= k:\r\n ans.append(\"B\")\r\n b -= 1\r\n pre = [\"B\", int(pre[0]==\"B\")*pre[1] + 1]\r\n ac.st(\"\".join(ans) if len(ans)==n else \"NO\")\r\n return\r\n\r\n\r\nSolution().main()\r\n", "n,k,a,b=map(int, input().split())\r\nf=0\r\nif a<b:\r\n\tc=a\r\n\ta=b\r\n\tb=c\r\n\tf=(f^1)\r\nhi=a//k\r\nif a%k:\r\n\thi+=1\r\nhi-=1\r\nif hi>b:\r\n\tprint(\"NO\")\r\n\texit()\r\nwhile a or b:\r\n\tfor i in range(0, k):\r\n\t\tif a>0:\r\n\t\t\ta-=1\r\n\t\t\tif f==0:\r\n\t\t\t\tprint(\"G\", end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(\"B\", end=\"\")\r\n\t\telse:\r\n\t\t\tbreak\r\n\tif a<b:\r\n\t\tc=a\r\n\t\ta=b\r\n\t\tb=c\r\n\t\tf=(f^1)\r\n\telse:\r\n\t\tif b>0:\r\n\t\t\tb-=1\r\n\t\t\tif f==0:\r\n\t\t\t\tprint(\"B\", end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(\"G\", end=\"\")", "from sys import stdin\r\n\r\ndef main():\r\n n,k,a,b = [int(i) for i in stdin.readline()[:-1].split()]\r\n c1,c2 = 'G','B'\r\n if a<b:\r\n a,b = b,a\r\n c1,c2 = c2,c1\r\n if b == 0 and a>k:\r\n print('NO')\r\n return\r\n ma = a\r\n ma //= b+1\r\n if a%(b+1) > 0:\r\n ma += 1\r\n if ma>k:\r\n print('NO')\r\n return\r\n s = ''\r\n for i in range(a%(b+1)):\r\n s+=c1*ma\r\n s+=c2\r\n for i in range(b-a%(b+1)):\r\n s+=c1*(a//(b+1))\r\n s+=c2\r\n s+=c1*(a//(b+1))\r\n print(s)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == \"__main__\":\r\n n, k, *color = map(int, input().split())\r\n s = 'GB'\r\n state = cnt = 0\r\n res = []\r\n for i in range(n):\r\n if cnt == k:\r\n state ^= 1\r\n if color[state] == 0:\r\n print(\"NO\")\r\n exit()\r\n cnt = 1\r\n elif color[0] > color[1]:\r\n cnt = 1 if state != 0 else cnt + 1\r\n state = 0\r\n else:\r\n cnt = 1 if state != 1 else cnt + 1\r\n state = 1\r\n res.append(s[state])\r\n color[state] -= 1\r\n \r\n print(''.join(res))\r\n", "\ndef read_int():\n return int(input())\n\ndef read_ints():\n return list(map(int, input().split()))\n\nn,k,a,b = read_ints()\nch = 'GB'\nif a < b:\n a,b = b,a\n ch = 'BG'\n\nresult = []\nc = min(k,a-b)\nresult.append(ch[0]*c)\na -= c\nwhile b > 0:\n result.append(ch[1])\n b -= 1\n c = min(k,a-b)\n result.append(ch[0]*c)\n a -= c\nif a > 0:\n print('NO')\nelse:\n print(''.join(result))\n", "'''\r\nhttps://codeforces.com/problemset/problem/746/D\r\n\r\n输入 n k(1≤k≤n≤1e5) a b(0≤a,b≤n 且 a+b=n)。\r\n构造一个长为 n 的字符串，包含 a 个 'G' 和 b 个 'B'，且不能有长度超过 k 的连续相同字母。\r\n如果无法构造，输出 NO，否则输出任意一个符合要求的字符串。\r\n输入 5 1 3 2\r\n输出 GBGBG\r\n\r\n输入 7 2 2 5\r\n输出 BBGBGBB\r\n\r\n输入 4 3 4 0\r\n输出 NO\r\n'''\r\n\r\nfrom collections import deque\r\nimport sys\r\nr = sys.stdin.readline\r\n\r\n\r\ndef _n():\r\n return int(input())\r\n\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef _nS():\r\n return input().split()\r\n\r\n\r\ndef solve():\r\n n, k, a, b = _nA()\r\n ret = deque([])\r\n f = 0\r\n if a < b:\r\n f = 1\r\n a, b = b, a\r\n while a or b:\r\n if a == b:\r\n ret.append('G')\r\n ret.append('B')\r\n a -= 1\r\n b -= 1\r\n continue\r\n d = a-b\r\n if d <= k:\r\n for _ in range(d):\r\n ret.append('G')\r\n a -= d\r\n else:\r\n for _ in range(k):\r\n ret.append('G')\r\n a -= k\r\n if a and b == 0:\r\n print('NO')\r\n return\r\n if b:\r\n ret.append(\"B\")\r\n b -= 1\r\n if f:\r\n for i in range(n):\r\n if ret[i] == 'G':\r\n ret[i] = 'B'\r\n else:\r\n ret[i] = 'G'\r\n print(''.join(ret))\r\n\r\n\r\nsolve()\r\n", "import sys\r\ninput=sys.stdin.readline\r\nl=input().split()\r\nn=int(l[0])\r\nk=int(l[1])\r\na=int(l[2])\r\nb=int(l[3])\r\nz=min(a,b)\r\nif(z<(n//(k+1))):\r\n print(\"NO\")\r\n quit()\r\nlasta=0\r\nlastb=0\r\nfor i in range(n):\r\n if(a>=b):\r\n if(lasta==k):\r\n print('B',end=\"\")\r\n b-=1\r\n lastb+=1\r\n lasta=0\r\n else:\r\n print('G',end=\"\")\r\n a-=1\r\n lasta+=1\r\n lastb=0\r\n else:\r\n if(lastb==k):\r\n print('G',end=\"\")\r\n a-=1\r\n lastb=0\r\n lasta+=1\r\n else:\r\n print('B',end=\"\")\r\n b-=1\r\n lastb+=1\r\n lasta=0\r\n", "n,k,a,b=map(int,input().split())\r\nx=min(a,b)\r\ny=max(a,b)\r\nif x==a:\r\n\tL='G'\r\n\tH='B'\r\nelse:\r\n\tH='G'\r\n\tL='B'\r\nif y>(x+1)*k:\r\n\tprint(\"NO\")\r\nelse:\r\n\tq=y//(x+1)\r\n\tw=y%(x+1)\r\n\tg=H*q\r\n\tans=\"\"\r\n\ti=0\r\n\twhile(i<n):\r\n\t\tans+=g\r\n\t\ti+=q\r\n\t\tif(w):\r\n\t\t\tans+=H\r\n\t\t\tw-=1\r\n\t\t\ti+=1\r\n\t\tans+=L\r\n\t\ti+=1\r\n\tprint(ans[:n])", "from collections import deque\r\nn,k,a,b = map(int,input().split())\r\nka = a\r\nkb = b\r\n\r\n# GB\r\nl = []\r\nfor i in range(n):\r\n if a > 0 and b > 0:\r\n if i%2 == 0:\r\n l.append(\"G\")\r\n a -= 1\r\n\r\n else:\r\n l.append(\"B\")\r\n b -= 1\r\n\r\nstack = []\r\nif a > 0:\r\n i = 0\r\n while i < len(l):\r\n if l[i] == \"G\":\r\n stack.append(\"G\")\r\n cnt = 0\r\n while cnt < k-1 and a > 0:\r\n cnt += 1\r\n a -= 1\r\n stack.append(\"G\")\r\n\r\n else:\r\n stack.append(\"B\")\r\n\r\n i += 1\r\n\r\n if len(stack) > 0:\r\n if stack[-1] == \"B\":\r\n cnt = 0\r\n while cnt < k and a > 0:\r\n cnt += 1\r\n a -= 1\r\n stack.append(\"G\")\r\n\r\nif b > 0:\r\n cnt = 0\r\n while cnt < k and b > 0:\r\n cnt += 1\r\n b -= 1\r\n stack.append(\"B\")\r\n\r\n i = 0\r\n while i < len(l):\r\n if l[i] == \"G\":\r\n stack.append(\"G\")\r\n\r\n else:\r\n stack.append(\"B\")\r\n cnt = 0\r\n while cnt < k-1 and b > 0:\r\n cnt += 1\r\n b -= 1\r\n stack.append(\"B\")\r\n\r\n i += 1\r\n\r\n if len(stack) > 0:\r\n if stack[-1] == \"G\":\r\n cnt = 0\r\n while cnt < k and b > 0:\r\n cnt += 1\r\n b -= 1\r\n stack.append(\"B\")\r\n\r\nif len(stack) == n:\r\n print(\"\".join(stack))\r\n exit()\r\n\r\n# BG\r\nl = []\r\nfor i in range(n):\r\n if a > 0 and b > 0:\r\n if i % 2 == 0:\r\n l.append(\"B\")\r\n a -= 1\r\n\r\n else:\r\n l.append(\"G\")\r\n b -= 1\r\n\r\nstack = []\r\nif a > 0:\r\n cnt = 0\r\n while cnt < k and a > 0:\r\n cnt += 1\r\n a -= 1\r\n stack.append(\"G\")\r\n\r\n i = 0\r\n while i < len(l):\r\n if l[i] == \"G\":\r\n stack.append(\"G\")\r\n cnt = 0\r\n while cnt < k - 1 and a > 0:\r\n cnt += 1\r\n a -= 1\r\n stack.append(\"G\")\r\n\r\n else:\r\n stack.append(\"B\")\r\n\r\n i += 1\r\n\r\n if len(stack) > 0:\r\n if stack[-1] == \"B\":\r\n cnt = 0\r\n while cnt < k and a > 0:\r\n cnt += 1\r\n a -= 1\r\n stack.append(\"G\")\r\n\r\nif b > 0:\r\n cnt = 0\r\n while cnt < k and b > 0:\r\n cnt += 1\r\n b -= 1\r\n stack.append(\"B\")\r\n\r\n i = 0\r\n while i < len(l):\r\n if l[i] == \"G\":\r\n stack.append(\"G\")\r\n\r\n else:\r\n stack.append(\"B\")\r\n cnt = 0\r\n while cnt < k - 1 and b > 0:\r\n cnt += 1\r\n b -= 1\r\n stack.append(\"B\")\r\n\r\n i += 1\r\n\r\n if len(stack) > 0:\r\n if stack[-1] == \"G\":\r\n cnt = 0\r\n while cnt < k and b > 0:\r\n cnt += 1\r\n b -= 1\r\n stack.append(\"B\")\r\n\r\nif len(stack) == n:\r\n print(\"\".join(stack))\r\n exit()\r\n\r\nprint(\"NO\")", "# Problem: D. Green and Black Tea\r\n# Contest: Codeforces - Codeforces Round 386 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/746/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\nimport random\r\nfrom types import GeneratorType\r\nimport bisect\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),\r\n (-1, 1)] # →↘↓↙←↖↑↗\r\nRANDOM = random.randrange(2 ** 62)\r\nMOD = 10 ** 9 + 7\r\n# MOD = 998244353\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/746/D\r\n\r\n输入 n k(1≤k≤n≤1e5) a b(0≤a,b≤n 且 a+b=n)。\r\n构造一个长为 n 的字符串，包含 a 个 'G' 和 b 个 'B'，且不能有长度超过 k 的连续相同字母。\r\n如果无法构造，输出 NO，否则输出任意一个符合要求的字符串。\r\n输入 5 1 3 2\r\n输出 GBGBG\r\n\r\n输入 7 2 2 5\r\n输出 BBGBGBB\r\n\r\n输入 4 3 4 0\r\n输出 NO\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, k, a, b = RI()\r\n G,B = 'G','B'\r\n\r\n if a == b:\r\n return print('GB'*a)\r\n elif a < b:\r\n a,b= b,a\r\n G,B = B,G\r\n if k*(b+1) < a:\r\n return print('NO')\r\n ans = [G,B]*b + [G]\r\n a -= b + 1\r\n for i in range(0,len(ans),2):\r\n p = min(k-1,a)\r\n ans[i] += G * p\r\n a -= p\r\n if a == 0:\r\n break\r\n print(''.join(ans))\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k, a, b = map(int, input().split())\r\nc1, c2 = \"G\", \"B\"\r\nif a < b:\r\n a, b = b, a\r\n c1, c2 = c2, c1\r\nx = a // k + min(a % k, 1)\r\nif not x - 1 <= b <= k * (x + 1):\r\n ans = [\"NO\"]\r\nelse:\r\n u = [0] * (x + 1)\r\n for i in range(b):\r\n u[(i + 1) % (x + 1)] += 1\r\n ans = []\r\n for i in u:\r\n ans.append(c2 * i)\r\n c = min(a, k)\r\n ans.append(c1 * c)\r\n a -= c\r\nsys.stdout.write(\"\".join(ans))", "n,k,a,b = map(int,input().split())\r\nch1,ch2 = 'G','B'\r\nif a < b:\r\n a,b = b,a\r\n ch1,ch2 = ch2,ch1\r\n\r\nif a > k * (b + 1):\r\n print('NO')\r\n exit()\r\nans = []\r\na -= b\r\nfor _ in range(b):\r\n sub = min(a,k - 1)\r\n a -= sub\r\n ans.append(ch1 * (sub + 1))\r\n ans.append(ch2)\r\nif a:\r\n ans.append(ch1 * a)\r\nprint(''.join(ans))" ]

[ "s = input()\r\nn = len(s)\r\n\r\nbeg = [0] * n\r\nend = [0] * n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i-j < 0 or i+j >= n: break\r\n if s[i-j] != s[i+j]: break\r\n beg[i-j] += 1\r\n end[i+j] += 1\r\n\r\n for j in range(n):\r\n if i-j < 0 or i+j+1 >= n: break\r\n if s[i-j] != s[i+j+1]: break\r\n beg[i-j] += 1\r\n end[i+j+1] += 1\r\n\r\nsuf = [0] * (n+1)\r\nfor i in range(n-1, -1, -1):\r\n suf[i] = suf[i+1] + beg[i]\r\n\r\nprint(sum(end[i] * suf[i+1] for i in range(n)))\r\n", "def ispalindrome(s):\n\tif s==s[::-1]:\n\t\treturn True\n\treturn False\n\ns = input()\nn = len(s)\ndp = [[0 for i in range(n)] for j in range(n)]\nfor i in range(n):\n\tdp[i][i] = 1\nfor i in range(1,n):\n\tfor j in range(i-1,-1,-1):\n\t\tif s[i]==s[j] and (j+1>i-1 or dp[j+1][i-1]):\n\t\t\tdp[j][i] = 1\npref = [0]*n\nsuff = [0]*n\npref[0] = suff[-1] = 1\nfor i in range(1,n):\n\t# pref[i] = pref[i-1]\n\tfor j in range(i,-1,-1):\n\t\tif dp[j][i]:\n\t\t\tpref[i] += 1\nfor i in range(n-2,-1,-1):\n\tsuff[i] = suff[i+1]\n\tfor j in range(i,n):\n\t\tif dp[i][j]:\n\t\t\tsuff[i] += 1\n\n# for i in dp:\n# \tprint (*i)\n# print (pref)\n# print (suff)\n\nans = 0\ncurr = 0\nfor i in range(n-1):\n\tans += suff[i+1]*pref[i]\nprint (ans)\n\n", "def answer(n,A):\r\n p=[[0 for i in range(n)] for j in range(n)]\r\n \r\n for i in range(n):\r\n for j in range(n-i):\r\n r=j\r\n c=i+j\r\n if r==c:\r\n p[r][c]=1\r\n \r\n elif c==r+1:\r\n if A[c]==A[r]:\r\n p[r][c]=1\r\n else:\r\n if A[r]==A[c] and p[r+1][c-1]:\r\n p[r][c]=1\r\n \r\n s=[0]*n\r\n s[0]=1\r\n for i in range(1,n):\r\n count=0\r\n for j in range(0,i+1):\r\n if p[j][i]==1:\r\n count+=1\r\n s[i]=s[i-1]+count\r\n \r\n dp=[0]*n\r\n \r\n for i in range(1,n):\r\n count=0\r\n for j in range(i,0,-1):\r\n count+=p[j][i]*s[j-1]\r\n \r\n dp[i]=dp[i-1]+count\r\n \r\n \r\n return dp[-1]\r\n \r\ns=input()\r\nprint(answer(len(s),s))", "from os import path;import sys,time\r\nmod = int(1e9 + 7) ;maxx = float('inf')\r\nimport sys,time, collections as c , math as m , pprint as p , bisect as bs\r\nI = lambda :int(sys.stdin.buffer.readline())\r\nlint = lambda :[int(x) for x in sys.stdin.buffer.readline().split()]\r\nS = lambda: sys.stdin.readline().strip('\\n')\r\nnCr = lambda n, r: reduce(mul, range(n - r + 1, n + 1), 1) // factorial(r)\r\nceill = lambda n , x: (n+x -1 )//x\r\nT =0\r\ndef solve():\r\n\ts = S() ; n = len(s)\r\n\tl , r , ans = [0]*n , [0]*n , 0\r\n\ta = [(i,i) for i in range(n)] + [(i,i+1) for i in range(n-1) if s[i] == s[i+1]]\t\r\n\tfor i , j in a:\r\n\t\twhile i >=0 and j < n and s[i] == s[j]:\r\n\t\t\tl[j]+=1 ; r[i]+=1\r\n\t\t\tj+=1 ; i-=1\r\n\tfor i in range(n):\r\n\t\tfor j in range(i+1 , n ):\r\n\t\t\tans+=l[i]*r[j]\r\n\tprint(ans)\r\n\r\n\r\n\t\t\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef run():\r\n if (path.exists('input.txt')):\r\n sys.stdin=open('input.txt','r')\r\n sys.stdout=open('output.txt','w')\r\n\r\nrun()\r\nT = I() if T else 1\r\nfor _ in range(T):\r\n solve()\r\n\r\n\r\n", "s = input()\nn = len(s)\nisPalindrome = [[False for i in range(n)] for j in range(n)]\nfor i in range(n):\n isPalindrome[i][i] = True\nfor i in range(n - 1, -1, -1):\n for j in range(i + 1, n):\n if j - i == 1:\n isPalindrome[i][j] = (s[i] == s[j])\n else:\n isPalindrome[i][j] = (s[i] == s[j]) and (isPalindrome[i + 1][j - 1])\npairs = [0] * n\npalindromes = [0] * n\npalindromes[0] = 1\nfor i in range(1, n):\n t = 0\n for j in range(1, i + 1):\n if isPalindrome[j][i]:\n pairs[i] += palindromes[j - 1]\n t += 1\n if isPalindrome[0][i]:\n t += 1\n pairs[i] += pairs[i - 1]\n palindromes[i] = palindromes[i - 1] + t\nprint(pairs[n - 1])", "s = input()\r\nn = len(s)\r\nL, R = [0]*n, [0]*n\r\nfor i in range(n):\r\n for j in (i-1, i):\r\n k = i\r\n while j >= 0 and k < n and s[j] == s[k]:\r\n L[k] += 1\r\n R[j] += 1\r\n j -= 1\r\n k += 1\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n ans += L[i]*R[j]\r\nprint(ans)", "def f(t):\r\n m=len(t)\r\n flag=True\r\n for i in range(m//2):\r\n if t[i]!=t[m-1-i]:\r\n flag=False\r\n return flag\r\ns=input()\r\nn=len(s)\r\nl=[0]*n\r\nr=[0]*n\r\narr=[(i,i) for i in range(n)]+[(i,i+1) for i in range(n-1) if s[i]==s[i+1]]\r\nfor x,y in arr:\r\n while x>=0 and y<n and s[x]==s[y]:\r\n r[x]+=1\r\n l[y]+=1\r\n x-=1\r\n y+=1\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n ans+=l[i]*r[j]\r\nprint(ans)", "import sys\r\ninput=sys.stdin.readline\r\ns=list(input().rstrip())\r\nn=len(s)\r\nl=[0]*n # [0,i]\r\nr=[0]*n # [i,n-1]\r\nfor i in range(n):\r\n j=0\r\n while 0<=i-j and i+j<n and s[i-j]==s[i+j]:\r\n l[i+j]+=1\r\n r[i-j]+=1\r\n j+=1\r\n j=1\r\n while 0<=i-j+1 and i+j<n and s[i-j+1]==s[i+j]:\r\n l[i+j]+=1\r\n r[i-j+1]+=1\r\n j+=1\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n ans+=l[i]*r[j]\r\nprint(ans)", "def main():\n s = tuple(input())\n n = len(s)\n a, b = [1] * n, [1] * n\n for i in range(n):\n for x, y in zip(range(i, -1, -1), range(i + 2, n)):\n if s[x] != s[y]:\n break\n a[y] += 1\n b[x] += 1\n for x, y in zip(range(i, -1, -1), range(i + 1, n)):\n if s[x] != s[y]:\n break\n a[y] += 1\n b[x] += 1\n x = 0\n for i, y in enumerate(a):\n x += y\n a[i] = x\n print(sum(x * y for x, y in zip(a, b[1:])))\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict\r\nS = input()\r\nN = len(S)\r\n# Step 1: Find the positions of a-z\r\nPos = defaultdict(list)\r\nfor i in range(N):\r\n Pos[S[i]].append(i)\r\n# Step 2: Find Ends here dp\r\n# Minor Change: Add a bool dict to catch the palindrome\r\nRange = defaultdict(bool)\r\ndpE = [1] * N\r\nfor i in range(N):\r\n Range[(i,i)] = True\r\n for pos in Pos[S[i]]:\r\n if(pos>=i):\r\n break\r\n else:\r\n if(i - pos == 1):\r\n if(S[i] == S[pos]):\r\n Range[(pos,i)] = True\r\n dpE[i] += 1\r\n elif(Range[(pos+1,i-1)]):\r\n Range[(pos,i)] = True\r\n dpE[i] += 1\r\n\r\n# Step 3: Find Till Here dp\r\n\r\ndpT = [0] * N\r\ndpT[-1] = 1\r\nfor i in range(N-2,-1,-1):\r\n dpT[i] += dpT[i+1] + 1\r\n for j in range(N-1,i,-1):\r\n if(Range[(i,j)]):\r\n dpT[i] += 1\r\n\r\n# Step 4: It's Time\r\nAns = 0\r\nfor i in range(N-1):\r\n Ans += dpE[i] * dpT[i+1]\r\nprint(Ans)\r\n\r\n\r\n\r\n\r\n", "word = input()\r\nn = len(word)\r\ndp = [[0 for i in range(n)]for j in range(n)]\r\n\r\n# 1 size palindrome\r\nfor i in range(n):\r\n\tdp[i][i] = 1\r\n\r\n# i --> size\r\n# j --> start index\r\nfor i in range(1,n):\r\n\tfor j in range(n-i):\r\n\t\t# could be a palindrome\r\n\t\tif word[j]==word[j+i]:\r\n\t\t\t# size 2 palindrome\r\n\t\t\tif i-1==0:\r\n\t\t\t\tdp[j][j+i] = 1\r\n\t\t\telse:\r\n\t\t\t\t# valid palindrome\r\n\t\t\t\tif dp[j+1][j+i-1]==1:\r\n\t\t\t\t\tdp[j][j+i]=1\r\n\t\t\t\t\t\r\npre = [0 for i in range(n)]\r\npost = [0 for i in range(n)]\r\n\r\n# count of palindrome from 1 to i characters\r\nfor i in range(n):\r\n\tcnt = 0\r\n\tfor j in range(n):\r\n\t\tcnt+=dp[j][i]\r\n\tpre[i] = cnt\r\n\r\n# count of palindrome start from ith character\r\nfor i in range(n):\r\n\tcnt = 0\r\n\tfor j in range(n):\r\n\t\tcnt+=dp[i][j]\r\n\tpost[i] = cnt\r\n\r\n# prefixing post array \r\nfor i in range(n-2,-1,-1):\r\n\tpost[i] = post[i]+post[i+1]\r\n\r\n# calculating ans \r\nans = 0\r\nfor i in range(n-1):\r\n\tans+=(pre[i]*post[i+1])\r\nprint(ans)" ]

[ "def fun(l,val):\r\n b=0\r\n e=len(l)-1\r\n ans=-1\r\n while(b<=e):\r\n mid=(b+e)//2\r\n if l[mid]>=val:\r\n e=mid-1\r\n else:\r\n ans=mid\r\n b=mid+1\r\n return ans\r\n \r\nn,d=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n l.append([x,y])\r\nl.sort()\r\nlst=[]\r\nfor i in l:\r\n lst.append(i[0])\r\nans=[0]\r\nfor i in range(n):\r\n ans.append(ans[-1]+l[i][1])\r\na=0\r\n\r\nfor i in range(n):\r\n ind=fun(lst,lst[i]+d)\r\n \r\n if ind!=-1:\r\n a=max(a,ans[ind+1]-ans[i])\r\nprint(a)\r\n\r\n \r\n \r\n \r\n \r\n", "t,m=map(int,input().split())\nd=[]\np=[]\nfor _ in range(t):\n l,o=map(int,input().split())\n d.append(l)\n p.append(o)\n\npairs = sorted(zip(d, p))\n\nmax_friendship = 0\ncurr_friendship = 0\nj = 0\n\nfor i in range(t):\n\n curr_friendship += pairs[i][1]\n\n while pairs[i][0] - pairs[j][0] >= m:\n curr_friendship -= pairs[j][1]\n j += 1\n\n max_friendship = max(max_friendship, curr_friendship)\n\nprint(max_friendship)\n \t \t \t \t\t \t\t\t \t \t \t\t", "import sys\r\n# import itertools\r\n# import math\r\n# import os\r\n# import random\r\n# from bisect import bisect, bisect_left\r\n# from collections import *\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush\r\n# from io import BytesIO, IOBase\r\n# from string import *\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# endregion fastio\r\n\r\n# MOD = 998244353\r\n# MOD = 10 ** 9 + 7\r\n# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL\r\n# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))\r\n# INF = 10 ** 9 + 5\r\n# INF = 10 ** 18 + 5\r\n\r\ndef main():\r\n n, d = mint()\r\n a = []\r\n for _ in range(n):\r\n a.append(ints())\r\n a.sort()\r\n \r\n l = 0\r\n ans = a[0][1]\r\n curr = a[0][1]\r\n for r in range(1, n):\r\n while a[r][0] - a[l][0] >= d:\r\n curr -= a[l][1]\r\n l += 1\r\n curr += a[r][1]\r\n ans = max(ans, curr)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, d = map(int, input().split())\r\nv = sorted([list(map(int, input().split())) for i in range(n)], key = lambda x: x[0])\r\n \r\nb = 0; s = sol = v[0][1]\r\nfor i in range(1, n):\r\n while v[i][0] >= d + v[b][0]:\r\n s -= v[b][1]\r\n b += 1\r\n s += v[i][1]\r\n sol = max(sol, s)\r\n \r\nprint(sol)", "import sys\r\n\r\n\r\ndef sum_smaller():\r\n result = 0\r\n final_index = 0\r\n for i in range(start, end):\r\n if friends[i][0] >= friends[end][0] + d:\r\n result += friends[i][1]\r\n final_index += 1\r\n else:\r\n break\r\n return result, final_index\r\n\r\n\r\nin_f = sys.stdin.read(-1).replace(\"\\r\\n\", \"\\r\")\r\nin_f = in_f.split()\r\n\r\nn = int(in_f[0])\r\nd = int(in_f[1])\r\n\r\nfriends = []\r\nfor i in range(2, 2*(n+1), 2):\r\n friends.append([int(in_f[i]), int(in_f[i+1])])\r\nfriends.sort(reverse=True)\r\n\r\nfactor = 0\r\nmax_factor = 0\r\nstart = 0\r\nend = 0\r\nwhile end != n:\r\n if friends[start][0] >= friends[end][0] + d:\r\n extra_factor, move_index = sum_smaller()\r\n factor -= extra_factor\r\n start += move_index\r\n factor += friends[end][1]\r\n max_factor = max(max_factor, factor)\r\n end += 1\r\nprint(max_factor)\r\n", "n,d = map(int,input().split())\r\nmx = 0\r\nm = []\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n m.append((a,b))\r\n mx =max(mx,b)\r\nm.sort()\r\ni = 0\r\nj = 0\r\nk = m[0][1]\r\nwhile j < n -1:\r\n if m[j+1][0] - m[i][0] < d:\r\n j += 1\r\n k += m[j][1]\r\n mx = max(mx,k)\r\n else:\r\n i += 1\r\n if k >= m[j+1][1]:\r\n k -= m[i-1][1]\r\n else:\r\n k = 0\r\nprint(mx)\n# Wed Jul 12 2023 12:50:34 GMT+0300 (Moscow Standard Time)\n", "\r\ndef lower_bound(nums, target):\r\n l, r = 0, len(nums) - 1\r\n while l <= r:\r\n mid = l + (r - l) // 2\r\n if nums[mid][0] >= target:\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return l-1\r\n\r\n\r\nn, d = map(int, input().split())\r\nl = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n l.append([a, b])\r\n\r\nl.sort()\r\nsumm = [0]*n\r\nsumm[0] = l[0][1]\r\n\r\nfor i in range(1, n):\r\n summ[i] = summ[i-1]+l[i][1]\r\n\r\nmaxx = 0\r\n\r\n\r\nfor i in range(n):\r\n cost = l[i][0]\r\n idx = lower_bound(l, cost+d)\r\n\r\n if (i > 0):\r\n cur = summ[idx]-summ[i-1]\r\n else:\r\n cur = summ[idx]\r\n\r\n if (cur > maxx):\r\n maxx = cur\r\n\r\nprint(maxx)\r\n", "from bisect import bisect_left\r\nn,d=map(int,input().split())\r\ndata=[]\r\nfor _ in range(n):\r\n data.append(list(map(int,input().split())))\r\ndata.sort()\r\n# pref sum for friend factor\r\npref=[0]\r\nfor a,b in data:\r\n pref.append(pref[-1]+b)\r\n \r\nres=0\r\n\r\nfor i in range(n):\r\n a,b=data[i]\r\n c=bisect_left(data,[a+d,-float('inf')])\r\n res=max(res,pref[c]-pref[i])\r\n\r\nprint(res)", "n, d = map(int, input().split())\r\ns = [[int(i) for i in input().split()] for i in range(n)]\r\ns.sort(key = lambda x: x[0])\r\ni = 0\r\nj = 0\r\nresult = 0\r\nsumm = 0\r\nwhile j < len(s):\r\n if abs(s[j][0] - s[i][0]) < d:\r\n summ += s[j][1]\r\n j += 1 \r\n result = max(result, summ)\r\n else:\r\n result = max(result, summ)\r\n summ -= s[i][1]\r\n i += 1\r\nprint(result)\r\n ", "n, d = map(int, input().split())\n\nfriends = []\nfor _ in range(n):\n m, s = map(int, input().split())\n friends.append((m, s))\n\nfriends.sort() # Сортируем друзей по количеству денег\n\nmax_money = 0\ncurrent_money = 0\nleft = 0\n\nfor right in range(n):\n current_money += friends[right][1] # Увеличиваем текущую сумму денег\n\n while friends[right][0] - friends[left][0] >= d:\n current_money -= friends[left][1] # Уменьшаем текущую сумму денег\n left += 1 # Сдвигаем левый указатель\n\n max_money = max(max_money, current_money) # Обновляем максимальную сумму денег\n\nprint(max_money)", "n , d = list(map(int,input().split()))\r\nl = []\r\nfor i in range(n):\r\n m , s = list(map(int,input().split()))\r\n l.append([m , s])\r\nl.sort()\r\ni = 0\r\ns = 0\r\nm_x= 0\r\nfor k in range(n):\r\n s += l[k][1]\r\n while(l[k][0]-l[i][0] >= d):\r\n s -= l[i][1]\r\n i += 1\r\n m_x = max(m_x , s)\r\nprint(m_x)", "n, d = map(int, input().split())\r\nl = []\r\nfor i in range(0, n):\r\n l.append(list(map(int, input().split())))\r\nl = sorted(l, key=lambda x:x[0])\r\nfactor = [0] * (n + 1)\r\nfor i in range(0, n):\r\n factor[i + 1] += factor[i] + l[i][1]\r\nans = 0\r\nfor i in range(0, n):\r\n low = i\r\n high = n\r\n val = l[i][0] + d\r\n while low < high:\r\n mid = (low + high) // 2\r\n if l[mid][0] < val:\r\n low = mid + 1\r\n else:\r\n high = mid\r\n if low < n and l[low][0] < val:\r\n low += 1\r\n if low == i + 1:\r\n ans = max(ans, factor[i + 1] - factor[i])\r\n else:\r\n ans = max(ans, factor[low] - factor[i])\r\n if low == n:\r\n break\r\nprint(ans)", "n, d = map(int, input().split())\r\nstore = []\r\nfor _ in range(n):\r\n money, friendship = map(int, input().split())\r\n store.append([money, friendship])\r\n\r\nstore.sort()\r\npref = [0]\r\nfor i in range(n):\r\n pref.append(pref[-1] + store[i][1])\r\n\r\nres = 0\r\nfor i in range(n):\r\n res = max(res, store[i][1])\r\n l, r = i + 1, n - 1\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if store[mid][0] - store[i][0] < d:\r\n res = max(res, pref[mid + 1] - pref[i])\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\nprint(res)", "def get_input():\n lines = []\n user_input = input()\n\n for i in user_input.split():\n lines.append(int(i))\n\n return lines\n\n\nfriends_total, diff_money = get_input()\nmoney_friendship = []\n\nfor friend in range(0, friends_total):\n money_friendship.append(get_input())\n\ncurrent_friendship_f = 0\nmoney_friendship.sort()\nl = 0\nres = 0\n\nfor r in range(friends_total):\n current_friendship_f += money_friendship[r][1]\n while l < friends_total and abs(money_friendship[r][0] - money_friendship[l][0]) >= diff_money:\n current_friendship_f -= money_friendship[l][1]\n l += 1\n res = max(res, current_friendship_f)\n\nprint(res)\n", "\r\ndef find_kefas_best_friends(n, diff, friends):\r\n friends.sort()\r\n max_f, factor_acc, j = 0, 0, 0\r\n\r\n for i in range(n):\r\n factor_acc += friends[i][1]\r\n while friends[i][0] - friends[j][0] >= diff:\r\n factor_acc -= friends[j][1]\r\n j += 1\r\n max_f = max(max_f, factor_acc)\r\n\r\n return max_f\r\n\r\n\r\nn_str, diff_str = input().split()\r\nn = int(n_str)\r\ndiff = int(diff_str)\r\nfriends = [None]*n\r\nfor f in range(n):\r\n (money_str, factor_str) = input().split()\r\n friends[f] = int(money_str), int(factor_str)\r\n\r\nprint(find_kefas_best_friends(n, diff, friends))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 R():return map(int,input().split())\r\na,b=R();s=i=m=n=0\r\nA=sorted([[*R()]for _ in range(a)])\r\nfor i in range(a):\r\n m+=A[i][1]\r\n while A[i][0]-A[s][0]>=b:\r\n m-=A[s][1];s+=1\r\n n=max(m,n)\r\nprint(n)", "import bisect\r\nn,d=map(int,input().split())\r\nfr={}\r\nfor i in range(n):\r\n m,f=map(int, input().split())\r\n if m in fr:\r\n fr[m]+=f\r\n else:\r\n fr[m]=f\r\n\r\na=sorted(fr.keys())\r\nma=fr[a[0]]\r\nc=fr[a[0]]\r\nst=a[0]\r\n# print(fr)\r\npr=[0]\r\nfor i in a:\r\n pr.append(pr[-1]+fr[i])\r\n# print(a, pr)\r\nfor i in range(len(a)):\r\n # if a[i]+d>a[-1]:\r\n # ma=max(ma, pr[-1]-pr[i-1])\r\n # print(\"Hello\", a[i], d, a[-1])\r\n # else:\r\n j=bisect.bisect_right(a, a[i]+d-1)\r\n \r\n # print(i,j, pr[j]-pr[i])\r\n ma=max(ma,pr[j]-pr[i] )\r\nma=max(ma, c)\r\nprint(ma)", "n, d = map(int, input().split())\r\nfriends = [] # money, friendship\r\nfor _ in range(n):\r\n friends.append(tuple(i for i in map(int, input().split())))\r\nfriends = sorted(friends)\r\nl = 0\r\nr = 0\r\nmaxFriendship = 0\r\ncurFriendship = 0\r\nwhile r < len(friends):\r\n if friends[l][0] + d <= friends[r][0]:\r\n curFriendship -= friends[l][1]\r\n l += 1\r\n else:\r\n curFriendship += friends[r][1]\r\n maxFriendship = max(maxFriendship, curFriendship)\r\n r += 1\r\n\r\nprint(maxFriendship)", "n, d = map(int,input().split())\r\nd1 = {}\r\nfor i in range(n):\r\n a1,a2 = map(int,input().split())\r\n if a1 in d1:\r\n n -= 1\r\n d1[a1] += a2\r\n else:\r\n d1[a1] = a2\r\n\r\nd1 = list(d1.items())\r\nd1 = sorted(d1)\r\ni = 0\r\n\r\nj = -1\r\ns = 0\r\ns1 = s\r\nwhile j+1<n:\r\n j += 1\r\n s += d1[j][1]\r\n while d1[i][0] + d <= d1[j][0] :\r\n i += 1\r\n s -= d1[i-1][1]\r\n if s>s1:\r\n s1 = s\r\n\r\nprint(s1)\r\n", "def R():return map(int,input().split())\r\na,b=R();s=0\r\nA=sorted([[*R()]for _ in range(a)])\r\nm=n=A[0][1]\r\nfor i in range(a):\r\n while s<a-1 and A[s+1][0]-A[i][0]<b:\r\n s+=1;m+=A[s][1]\r\n n=max(m,n);m-=A[i][1]\r\nprint(n)", "n, d = map(int, input().split())\r\na = []\r\nmx = -1\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append((x, y))\r\na.sort()\r\nidx = 1\r\nprev = 0\r\nc = a[0][1]\r\nfor i in range(n):\r\n c -= prev\r\n while idx < n:\r\n if a[idx][0] - a[i][0] < d:\r\n c += a[idx][1]\r\n idx += 1\r\n else:\r\n break\r\n prev = a[i][1]\r\n mx = max(c, mx)\r\nprint(mx)\r\n\n# Wed Jul 12 2023 11:02:52 GMT+0300 (Moscow Standard Time)\n", "'''Sliding window'''\r\n\r\nn, d = map(int, input().split())\r\nf = [tuple(map(int, input().split())) for _ in range(n)]\r\nf.sort()\r\np1, p2 = 0, 0\r\ns = 0\r\nm = 0\r\nwhile p2!=n:\r\n if f[p2][0]-f[p1][0] < d:\r\n s+=f[p2][1]\r\n p2+=1\r\n m = max(m,s)\r\n else:\r\n s-=f[p1][1]\r\n p1+=1\r\nprint(m)", "n, d = map(int, input().split())\r\n\r\na = []\r\nfor i in range(n):\r\n s, m = map(int, input().split())\r\n a.append((s, m))\r\n\r\na.sort()\r\npre = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n pre[i] = pre[i - 1] + a[i - 1][1]\r\n\r\nmaxx = -1\r\nfor i in range(n, 0, -1):\r\n l = 0\r\n r = i\r\n while l < r:\r\n mid = (l + r) // 2\r\n if a[mid][0] > a[i - 1][0] - d:\r\n r = mid\r\n else:\r\n l = mid + 1\r\n maxx = max(maxx, pre[i] - pre[l])\r\n\r\nprint(maxx)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn, d = map(int,input().split())\r\nls = []\r\nfor _ in range(n) :\r\n ls.append(list(map(int,input().split())))\r\nls.sort()\r\ni, j = 0, 0\r\nsm, mx = 0, 0\r\nwhile i < n :\r\n while i < n and (ls[i][0]-ls[j][0]+1) <= d :\r\n sm += ls[i][1]\r\n i += 1\r\n mx = max(mx,sm)\r\n sm -= ls[j][1]\r\n j += 1\r\nprint(mx)", "import sys\r\ninput=sys.stdin.readline\r\nppl,diff = map(int,input().split())\r\nlst = []\r\nfor i in range(ppl):\r\n lst.append(list(map(int,input().split())))\r\nlst.sort()\r\nl,r,sm,mx = 0,0,0,0\r\nwhile r<ppl:\r\n sm+=lst[r][-1]\r\n while lst[r][0]-lst[l][0]>=diff:\r\n sm-=lst[l][-1]\r\n l+=1\r\n mx = max(mx,sm)\r\n r+=1\r\nprint(mx)", "# -*- coding: utf-8 -*-\r\n\r\n# https://codeforces.com/problemset/problem/580/B?locale=en\r\n\r\n# Kefa wants to celebrate his first big salary by going to restaurant. However, he needs company.\r\n# Kefa has n friends, each friend will agree to go to the restaurant if Kefa asks. \r\n# Each friend is characterized by the amount of money he has and the friendship factor in respect to Kefa. \r\n# The parrot doesn't want any friend to feel poor compared to somebody else in the company (Kefa doesn't count). \r\n# A friend feels poor if in the company there is someone who has at least d units of money more than he does. \r\n# Also, Kefa wants the total friendship factor of the members of the company to be maximum. \r\n# Help him invite an optimal company!\r\n\r\n# Input: The first line of the input contains two space-separated integers, n and d (1 ≤ n ≤ 105)\r\n# the number of Kefa's friends and the minimum difference between the amount of money in order to feel poor, respectively.\r\n# Next n lines contain the descriptions of Kefa's friends, \r\n# the (i + 1)-th line contains the description of the i-th friend of type mi, si (0 ≤ mi, si ≤ 109) \r\n# the amount of money and the friendship factor, respectively. \r\n\r\n# Output: Print the maximum total friendship factor that can be reached.\r\n\r\n# Constants for indexes in a 'friend' tuple\r\nMONEY = 0\r\nFRIENDSHIP = 1\r\n\r\ndef max_friendship_given_critical_money_difference(arr, diff):\r\n \r\n def good(l, r):\r\n return (l == r) or (arr[l][MONEY] + diff > arr[r][MONEY])\r\n \r\n def add(i, curr):\r\n i += 1\r\n if (arr[i] != None):\r\n curr += arr[i][FRIENDSHIP]\r\n return i, curr\r\n\r\n def remove(i, curr):\r\n curr -= arr[i][FRIENDSHIP]\r\n i += 1\r\n return i, curr\r\n\r\n \r\n # sort the array by money values\r\n arr.sort(key = lambda x:x[MONEY])\r\n \r\n l, max_friendship, curr_friendship = 0,0,0\r\n \r\n # add sentimel and initialize with first element\r\n arr.append(None)\r\n r, curr_friendship = add(-1, curr_friendship)\r\n \r\n while(arr[r] != None):\r\n if (good(l, r)):\r\n max_friendship = max(max_friendship, curr_friendship)\r\n r, curr_friendship = add(r, curr_friendship)\r\n else:\r\n l, curr_friendship = remove(l, curr_friendship) \r\n \r\n arr.pop()\r\n return max_friendship\r\n\r\n# input number of friends and critical money difference\r\nn, diff = map(int, input().split())\r\nfriends = []\r\n\r\n# input friends one by one\r\nfor i in range(n):\r\n money, friendship = map(int, input().strip().split())\r\n friends.append((money, friendship))\r\n\r\nresult = max_friendship_given_critical_money_difference(friends, diff)\r\nprint (result)\r\n", "n, d = map(int, input().split())\na = []\nans = 0\nfor _ in range(n):\n a.append(list(map(int, input().split())))\na.sort()\ni = 0\ncnt = 0\nfor j in range(n):\n cnt += a[j][1]\n while a[i][0] <= a[j][0]-d:\n cnt -= a[i][1]\n i += 1\n ans = max(ans, cnt)\nprint(ans)" ]

[ "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Apr 14 12:45:15 2022\r\n\r\n@author: dehon\r\n\"\"\"\r\n\r\nn = int(input())\r\nif(n%2 == 1):\r\n print(-1)\r\nelse:\r\n for i in range(1,n+1):\r\n if(i%2 == 1):\r\n print(i+1, end=' ')\r\n else:\r\n print(i-1, end=' ')", "n = int(input())\r\narr = [0] * n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n arr[i] = i + 2\r\n else:\r\n arr[i] = i\r\n\r\nif n != 1 and n % 2 == 0:\r\n print(*arr)\r\nelse:\r\n print(-1)\r\n", "a = int(input())\r\nif a % 2:\r\n print(-1)\r\nelse:\r\n n = list(range(1, a + 1))\r\n for i in range(0, a, 2):\r\n n[i], n[i + 1] = n[i + 1], n[i]\r\n print(' '.join(list(map(str, n))))\r\n", "n=int(input())\nl=[]\nif n%2==1:\n\tprint(-1)\nelse:\n\tfor i in range(n-1):\n\t\tl.append(i+2)\n\tl=l[::-1]\n\tl.append(1)\nprint(*l)\n\t \t \t \t\t \t\t \t \t\t\t\t \t", "n = int(input())\nif n % 2 == 1:\n print(str('-1'))\nelse:\n for i in range(0, n):\n if (i % 2 == 0):\n print(str(i + 2), end=\" \")\n else:\n print(str(i), end=\" \")\n\n print(\"\")\n\n \t \t \t\t \t\t \t \t\t \t\t\t \t\t\t \t", "inp = int(input())\r\ni = 2\r\nif inp % 2 == 0:\r\n while i <= inp:\r\n if i % 2 == 0:\r\n print(i, end=\" \")\r\n i -= 1\r\n else:\r\n print(i, end=\" \")\r\n i +=3\r\nelse:\r\n print(\"-1\")", "n=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n l=[x for x in range (1,n+1)]\r\n for i in range (0,n-1,2):\r\n # print(i)\r\n l[i],l[i+1]=l[i+1],l[i]\r\n print(*l)\r\n", "a = int(input())\r\nif a % 2 == 1:\r\n print(-1)\r\nelse:\r\n b = [0]*a\r\n for i in range(1,a+1,2):\r\n b[i-1] = i+1\r\n b[i] = i\r\n for j in b :\r\n print(j,end = ' ')", "def f(s):\r\n if s%2 != 0 : return -1\r\n seq = []\r\n for i in range(0,s,2):\r\n seq.append(i+2)\r\n seq.append(i+1)\r\n return \" \".join([str(i) for i in seq])\r\n\r\nt=int(input())\r\nprint(f(t))", "n=int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n p=[]\r\n for i in range(1,n+1):\r\n if i%2==0:\r\n p.append(i-1)\r\n else:\r\n p.append(i+1)\r\n a=' '.join(str(i)for i in p)\r\n print(a)", "n = int(input())\r\nif(n%2 == 1):\r\n print(-1)\r\nelse:\r\n a = []\r\n for i in range(n//2):\r\n a += [2*i+2] + [2*i+1]\r\n print(*a)", "n = int(input())\r\n\r\nnums = []\r\nfor i in range(n):\r\n if n > 1:\r\n nums.append(i + 1)\r\n 3\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(n - 1):\r\n if i % 2 == 0:\r\n nums[i], nums[i + 1] = nums[i + 1], nums[i]\r\n print(*nums)\r\n", "\nn = int(input())\n\nif n % 2 == 0:\n\n ans = []\n a = [i for i in range(1, n + 1)]\n\n for i in range(0,n,2):\n temp = sorted([a[i],a[i+1]],reverse=True)\n for j in temp:\n ans.append(j)\n\n print(*ans)\n\nelse:\n print(-1)\n \t \t\t\t\t\t \t\t\t \t \t\t\t \t \t \t\t\t \t\t", "n = int(input().strip())\nt = []\nif n % 2 != 0:\n print(-1)\nelse:\n for i in range(1, n+1):\n t.append(i)\n \n i = 0\n while n:\n t[i], t[i+1] = t[i+1], t[i]\n i += 2\n n -= 2\n for i in t:\n print(i, end = \" \")\n \n", "n=int(input())\r\nif n&1:\r\n print(-1)\r\nelse:\r\n print(*range(n,0,-1))", "n = int(input())\r\n\r\nif n % 2 == 1 :\r\n print(-1)\r\n \r\nelse :\r\n for i in range(1, n//2 + 1) :\r\n print(2*i, 2*i - 1, end = \" \")\r\n ", "a = int(input())\r\nif(a%2 == 1):\r\n print(-1)\r\nelse:\r\n for i in range(2, a+1, 2):\r\n print(f\"{i} {i-1}\", end=\" \")", "n=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n l=[]\r\n for x in range(1,n+1,2):\r\n l.append(x+1)\r\n l.append(x)\r\n for x in l:\r\n print(x,end=' ')", "n=int(input())\r\nif n%2==1:print(-1);exit()\r\nfor i in range(1,n+1):\r\n if i%2==0:print(i-1,end=' ')\r\n else:print(i+1,end=' ')", "n = int(input())\r\nar = [i for i in range(1,n+1)]\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if ar[i]!=i:\r\n ar[i],ar[i+1] = ar[i+1],ar[i]\r\n\r\nif n%2==0:\r\n print(*ar)", "per=int(input())\r\nif(per % 2 ==0):\r\n for i in range(per):\r\n print(per-i)\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nlis = []\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(1 , n + 1 , 2):\r\n lis.append(i + 1)\r\n lis.append(i)\r\n print(*lis)\r\n", "def permu(n):\r\n if n%2 == 1:\r\n print(-1)\r\n else:\r\n for i in range(1, n+1, 2):\r\n print(i+1, i, end=' ')\r\n\r\npermu(int(input()))\r\n", "n=int(input())\r\nif(n%2==0):\r\n for i in range(n):\r\n print(n-i,end=' ')\r\nelse:\r\n print(-1)", "n = int(input())\r\na = list(range(1, n + 1))\r\nif n % 2 == 1:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(0, n, 2):\r\n\t\ta[i], a[i + 1] = a[i + 1], a[i]\r\n\tprint(*a)", "def Perfect_Permutation():\r\n permutLength = int(input())\r\n strOutput = ''\r\n listOutput = []\r\n if permutLength % 2 != 0:\r\n strOutput = strOutput + '-1'\r\n else:\r\n i = 0\r\n while i < permutLength:\r\n num = i + 1\r\n listOutput.append(num+1)\r\n listOutput.append(num)\r\n i += 2\r\n for j in listOutput:\r\n strOutput = strOutput + str(j) + ' '\r\n\r\n print(strOutput)\r\n\r\nPerfect_Permutation()", "n = int(input())\r\n\r\nif n % 2 == 0:\r\n for k in range(1, n + 1):\r\n if k % 2 == 1:\r\n print(k + 1, end=' ')\r\n else:\r\n print(k - 1, end=' ')\r\nelse:\r\n print(\"-1\")\r\n\r\nprint() ", "n=int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n lis=[]\r\n c=2\r\n while c<=n:\r\n lis.append(c)\r\n lis.append(c-1)\r\n c=c+2\r\n for i in lis:\r\n print(i, end= \" \")\r\n", "n=int(input())\r\na=[]\r\nif n%2==1:\r\n print('-1')\r\nelse:\r\n for i in range(1,n+1):\r\n a.append(i)\r\n a.sort(reverse=True)\r\n for k in range(len(a)):\r\n print(a[k],end=' ')\r\n", "n=int(input())\r\nL=[]\r\nif n%2==0:\r\n for i in range(1,n+1):\r\n if i%2==0:\r\n L.append(i-1)\r\n else:\r\n L.append(i+1)\r\n for i in L:\r\n print(i, end=' ')\r\n\r\n\r\nelse:\r\n print(-1)", "n= int(input())\r\nif n%2==1:\r\n print(\"-1\")\r\nelse:\r\n print(\"2 1\",end=' ')\r\n\r\n while(n>=3):\r\n print(n,end=\" \")\r\n n= n-1\r\n\r\n", "n = int(input())\r\n\r\nif n%2 == 0:\r\n a = [int(x) for x in range(1,n+1)]\r\n a = [str(x+1) if x%2 == 1 else str(x-1) for x in a]\r\n print(' '.join(a))\r\nelse:\r\n print(-1)", "n=int(input())\r\nif n==1:\r\n print(-1)\r\n\r\nelse:\r\n if n%2==0:\r\n i=0\r\n while i<n:\r\n print(str(i+2)+' ' +str(i+1),end=\" \")\r\n i+=2\r\n else:\r\n print(-1)", "n=int(input())\r\nif n%2==1:\r\n\tprint(-1)\r\nelse:\r\n\ti=1\r\n\twhile i<n:\r\n\t\tprint(i+1, end=\" \")\r\n\t\tprint(+i, end=\" \")\r\n\t\ti+=2\r\n\r\n", "n = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n permute = [i for i in range(1, n+1)]\r\n j = 0\r\n while j < n:\r\n permute[j], permute[j+1] = permute[j+1], permute[j]\r\n j += 2\r\n for num in permute:\r\n print(num, end=\" \")\r\n", "n = int(input())\n\nif(n % 2 == 1):\n\tprint(\"-1\")\nelse:\n\tfor i in range(2, n+2, 2):\n\t\tprint(\"%d %d \"%(i, i-1), end=\"\")\n\tprint(\"\")", "n = int(input())\r\n\r\nif n%2 == 1 :\r\n\tprint(-1)\r\nelse:\r\n\tlist = [0 for i in range(n)]\r\n\tfor i in range(0,n-1,2) :\r\n\t\tlist[i+1] = i+1\r\n\t\tlist[i] = i+2\r\n\t\r\n\tprint(*list)", "n = int(input())\r\nif n%2 != 0: print(-1) \r\nelse:\r\n\tarr = [x for x in range(1,n+1, 1)]\r\n\t# for i in arr:\r\n\t# \tprint(i)\r\n\tt = 1\r\n\twhile(t < n+1):\r\n\t\t#print(t)\r\n\t\tprint(arr[t], end=' ')\r\n\t\tprint(arr[t-1], end=' ')\r\n\t\tt+=2\r\n\r\n", "n = int(input())\r\n\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n perm = []\r\n for i in range(1, n+1, 2):\r\n perm.append(i+1)\r\n perm.append(i)\r\n \r\n if len(perm) == n:\r\n print(' '.join(map(str, perm)))\r\n else:\r\n print(-1)\r\n", "n=int(input())\r\ndef ans():\r\n l1=[]\r\n if n%2!=0:\r\n print(-1)\r\n else:\r\n for i in range(1,n+1):\r\n l1.append(i)\r\n for i in range(n-1):\r\n if i%2==0:\r\n l1[i],l1[i+1]=l1[i+1],l1[i]\r\n for i in l1:\r\n print(i,end=\" \")\r\n\r\nans()\r\n", "n = int(input())\r\n\r\nif n%2!=0:\r\n print(-1)\r\n\r\nelse:\r\n arr = [i for i in range(1,n+1)]\r\n\r\n\r\n for i in range(0,n,2):\r\n temp = arr[i]\r\n arr[i] = arr[i+1]\r\n arr[i+1] = temp\r\n\r\n\r\n print(*arr)\r\n", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n if(n<=1):\r\n return [-1]\r\n else:\r\n if(n%2==1):\r\n return [-1]\r\n else:\r\n l=[]\r\n for i in range(2,n+1,2):\r\n l.append(i)\r\n l.append(i-1)\r\n return l\r\nn=int(input())\r\nprint(*exe())", "n = int(input())\r\nres = list(range(n, 0, -1))\r\n\r\nif n & 1:\r\n print(-1)\r\nelse:\r\n print(*res)\r\n", "def find(n):\r\n if n %2 != 0:\r\n return -1\r\n else:\r\n l = list(range(1,n+1))\r\n l.reverse()\r\n return l\r\noutput = find(int(input()))\r\nif output == -1:\r\n print(-1)\r\nelse:\r\n print(*output)", "def per(x):\n arr=[]\n cont=x;\n while(cont>0):\n arr.append(cont)\n cont-=1\n return arr\n\ndef todo(ar):\n aux=[]\n for i in range(1,ar+1):\n if i%2==0:\n for j in per(i):\n if j not in aux:\n aux.append(j)\n return aux\nif __name__=='__main__':\n en=int(input())\n if en%2!=0:\n print(-1)\n else:\n for i in todo(en):\n print(i, end=' ')\n\t \t\t\t \t \t \t \t \t \t \t \t\t", "num=int(input())\r\nif(num%2==1):\r\n print(\"-1\")\r\nelse:\r\n print(\"2 1\",end=\" \")\r\n for i in range(3,num,2):\r\n print(i+1,i)", "n = int(input())\r\nif n%2:\r\n print(-1)\r\nelse:\r\n l = [i+1 for i in range(n)][::-1]\r\n print(*l)", "t=int(input())\r\nif(t%2==1):\r\n print(\"-1\")\r\nelse:\r\n print(\"2 1\",end=\" \")\r\n for i in range(3,t,2):\r\n print(i+1,i,end=\" \")\r\n", "n=int(input())\r\na=1\r\nif n%2==0:\r\n for i in range (1,(n//2)+1):\r\n print(a+1,a,end=' ')\r\n a=a+2\r\nelse:\r\n print('-1')\r\n", "num1 = int(input())\n\n\ndef perfect_perm(n):\n if n % 2 != 0:\n return -1\n final_str = \"\"\n if n % 2 != 0:\n print(-1)\n else:\n for i in range(0, n, 2):\n final_str += str(i+2) + \" \" + str(i+1) + \" \"\n\n return final_str.rstrip()\n\n\nprint(perfect_perm(num1))\n", "n=int(input())\r\nif(n%2==1):\r\n print(-1)\r\n exit()\r\np=list(range(1,n+1))\r\n\r\nfor x in range(0,n,2):\r\n t=p[x]\r\n p[x]=p[x+1]\r\n p[x+1]=t\r\n\r\nfor pt in p:\r\n print(pt,end=\" \")\r\n", "n = int(input())\n\nif n % 2:\n print('-1')\nelse:\n print('2', end='')\n for i in range(2, n+1):\n if i % 2:\n print(f' {i+1}', end='')\n else:\n print(f' {i-1}', end='')\n\nprint()\n\n \t\t \t \t \t \t\t\t \t \t \t \t\t", "n = int(input())\n\nif n%2 == 1:\n print(-1)\n quit()\n\nans = []\nfor i in range(n//2):\n ans.append(i*2+2)\n ans.append(i*2+1)\n\nprint(*ans, sep=\" \")\n\t \t\t\t\t \t \t \t\t \t\t \t\t \t \t\t\t \t", "a=int(input())\r\nnewlist=[]\r\nseclist=[]\r\nif a%2==1:\r\n print(\"-1\")\r\nif a%2==0:\r\n for i in range(a+1):\r\n if i>0:\r\n newlist.append(i)\r\nfor m in range(len(newlist)):\r\n if newlist[m]%2==1:\r\n seclist.append(str(newlist[m]+1))\r\n seclist.append(\" \")\r\n seclist.append(str(newlist[m]))\r\n seclist.append(\" \")\r\nprint(\"\".join(seclist))", "n = int(input())\r\n\r\nif n % 2:\r\n print(-1)\r\n exit()\r\nif n == 2:\r\n print(2,1)\r\n exit()\r\nans = []\r\nfor i in range(n):\r\n ans.append(i + 1)\r\n if i % 2:\r\n print(*ans[::-1],end = ' ')\r\n ans = []\r\n", "\r\ndef solve():\r\n #n = int(input())\r\n n = int(input())\r\n if n%2 == 1:\r\n print(-1)\r\n return\r\n i = 1\r\n res = []\r\n for i in range(1, n, 2):\r\n res.append(i+1)\r\n res.append(i)\r\n i+=2\r\n res = [str(x) for x in res]\r\n print(' '.join(res))\r\n\r\n\r\n\r\n\r\n\r\nimport math\r\nfrom collections import defaultdict\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n\r\n", "n=int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n a=[]\r\n o=1\r\n e=2\r\n for i in range(n):\r\n if i%2==0:\r\n a.append(e)\r\n e+=2\r\n else:\r\n a.append(o)\r\n o+=2\r\n for i in a:\r\n print(i,end=\" \")", "n=int(input())\r\na=[]\r\nif n%2==0:\r\n for i in range(1,n,2):\r\n a.append(i+1)\r\n a.append(i)\r\n print(*a)\r\nelse:\r\n print(\"-1\")", "n = int(input())\r\nnos = []\r\nfor i in range(1, n + 1):\r\n nos.append(i)\r\n\r\nif len(nos) != 1 and len(nos) % 2 == 0: \r\n for i in range(0, len(nos) - 1, 2):\r\n nos[i], nos[i + 1] = nos[i + 1], nos[i]\r\n val = [str(i) for i in nos]\r\n print(\" \".join(val))\r\nelse:\r\n print(\"-1\")", "n = int(input())\r\nif n%2 == 1:\r\n print(-1)\r\nelse:\r\n nlist = []\r\n for i in range(1,n+1):\r\n if i %2 == 1:\r\n nlist.append(str(i+1))\r\n else:\r\n nlist.append(str(i-1))\r\n print(' '.join(nlist))", "# t = input()\r\n# for test_case in t:\r\n\t# n = input()\r\n\t# k = input()\r\n\t# for\r\n\t\r\n# for i in [*open(0)][2::2]:\r\n # k = list(map(int , i.split() )) \r\n # print(\"YES\" if 1 in k else \"NO\" )\r\n\r\n# for _ in range(int(input())):\r\n # total = int(input())\r\n # k = list(map(int , input().split()))\r\n # print(sum(k[0:total - sum(k)]))\r\n \r\n# count = 0\r\n# for _ in range(int(input())):\r\n\t# k = list(map(int,input().split()))\r\n\t# if sum(k) >= 2:\r\n\t\t# count += 1\r\n# print(count)\r\n\r\nk = int(input())\r\nif k%2 == 1:\r\n\tprint(\"-1\")\r\nelse:\r\n\tfor x in range(1,k+1,2):\r\n\t\tprint(x+1,x ,end=\" \")\r\n", "n = int(input())\r\nans = ''\r\nif n%2 == 0:\r\n for i in range(1,n+1,2):\r\n ans += f' {i+1} {i}'\r\n print(ans[1:])\r\nelse:\r\n print(\"-1\")\r\n", "a = int(input())\r\nb = []\r\nif(a % 2 == 0):\r\n for i in range(1, a+1):\r\n b.append(i)\r\n for i in range(0, len(b)):\r\n if(i % 2 == 0):\r\n b[i] += 1\r\n else:\r\n b[i] -= 1\r\n for i in b:\r\n print(i, end=' ')\r\n\r\nelse:\r\n print('-1')", "n=int(input())\r\nif n%2!=0 :\r\n print(-1)\r\nif n%2==0 :\r\n l=[]\r\n for i in range(1,n+1) :\r\n l.append(i)\r\n j=0\r\n while j<n-1 :\r\n l[j],l[j+1]=l[j+1],l[j]\r\n j+=2\r\n for k in l :\r\n print(k,end=\" \")", "n = int(input())\r\nlist1 = []\r\n\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(1, n + 1):\r\n if i % 2 != 0:\r\n list1.append(i + 1)\r\n else:\r\n list1.append(i - 1)\r\n print(*list1, sep=\" \")", "n = int(input())\r\np = list()\r\n\r\nif n % 2 != 0:\r\n print(\"-1\")\r\n exit(0)\r\n\r\nfor i in range(n+1):\r\n p.append(i)\r\nfor i in range(1, len(p)):\r\n if i % 2 == 0:\r\n p[i] = p[i]-1\r\n else:\r\n p[i] = p[i]+1\r\n\r\nprint(*p[1:])", "from math import *\r\nimport sys\r\nimport heapq\r\nfrom collections import Counter, defaultdict, deque\r\nfrom bisect import *\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n%2 ==1:\r\n print(-1)\r\nelse:\r\n j = 2\r\n k =1\r\n for i in range(n):\r\n if i%2 == 0:\r\n print(j,end = \" \")\r\n j+=2\r\n else:\r\n print(k,end = \" \")\r\n k+=2\r\n", "n=int(input())\r\nif n%2==1 or n==1:\r\n print(-1)\r\nelse:\r\n print(*sorted([i+1 for i in range(n)],reverse=True))\r\n", "n = int(input())\r\nlst=[]\r\nif(n%2!=0):\r\n print('-1')\r\nelse:\r\n for i in range(1,n+1,2):\r\n a=i+1\r\n lst.append(a)\r\n lst.append(i)\r\n s = \" \".join(map(str,lst))\r\n print(s)", "def create_perfect_permutation(q):\r\n if q % 2 == 1:\r\n return -1\r\n else:\r\n permutation = [0] * q\r\n for i in range(0, q, 2):\r\n permutation[i] = i + 2\r\n permutation[i + 1] = i + 1\r\n return permutation\r\nq = int(input())\r\nres = create_perfect_permutation(q)\r\nif res == -1:\r\n print(-1)\r\nelse:\r\n print(\" \".join(map(str, res)))\r\n", "n=int(input())\r\nif n %2==1 :\r\n print(-1)\r\nelse:\r\n if n == 2:\r\n print(\"2 1\")\r\n else:\r\n x=n//2\r\n l=2\r\n while l < n+1 :\r\n i = l\r\n while i > l-2:\r\n print(i, end=\" \")\r\n i -= 1\r\n\r\n l+=2\r\n", "n = int(input())\r\nele=[]\r\nif(n%2==1):\r\n print(-1)\r\nelse:\r\n ele.append(2)\r\n ele.append(1)\r\n for i in range(3,n,2):\r\n ele.append(i+1)\r\n ele.append(i)\r\nprint(' '.join(str(e) for e in ele))", "k = int(input())\r\n\r\ndef solve(k):\r\n lis = []\r\n if k%2 != 0:\r\n print(\"-1\")\r\n return\r\n for i in range(k):\r\n lis.append(i+1)\r\n i = 0\r\n while i < k-1: \r\n lis[i], lis[i+1] = lis[i+1], lis[i]\r\n i+=2\r\n print(\" \".join(map(str, lis)))\r\n\r\nsolve(k)", "n=int(input())\r\nl=[]\r\nif n%2==1:\r\n print(-1)\r\nelif n%2==0:\r\n for i in range(1,n+1):\r\n l.append(i)\r\n for j in range(0,len(l)-1,2):\r\n c,d=l[j],l[j+1]\r\n l[j],l[j+1]=d,c\r\n print(*l)", "n = int(input())\nif n & 1:\n print(-1)\nelse:\n print(*[n - i for i in range(n)])\n", "n=int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n arr=[]\r\n m=2\r\n while(m<=n):\r\n arr.append(m)\r\n arr.append(m-1)\r\n m+=2\r\n print(*arr)", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n lst = []\r\n for i in range(n // 2):\r\n lst.append(2*i+2)\r\n lst.append(2*i+1)\r\n print(\" \".join(str(x) for x in lst))", "n = int(input())\r\nif n%2==1 :\r\n print(-1)\r\nelse :\r\n arr = []\r\n for i in range(n) :\r\n if i%2==0 :\r\n arr.append(i+2)\r\n else :\r\n arr.append(i)\r\n print(\" \".join(map(str,arr)))", "n = int(input())\r\nall_num = [] \r\nperfect_perm = []\r\nif n % 2 == 0:\r\n for i in range(n):\r\n all_num.append(i+1)\r\n \r\n for j in range(0, len(all_num), 2):\r\n x = all_num[j+1]\r\n y = all_num[j]\r\n \r\n perfect_perm.append(x)\r\n perfect_perm.append(y)\r\n \r\n print(*perfect_perm)\r\n \r\nelse: \r\n print(-1)\r\n \r\n", "size = int(input())\r\na = [i+1 for i in range(size)]\r\nif size%2:\r\n print(-1)\r\nelse:\r\n for i in range(0,size,2):\r\n a[i],a[i+1] = a[i+1],a[i]\r\n print(*a)", "n = int(input())\r\nout = [i+1 for i in range(n)]\r\nif n % 2 == 0:\r\n for i in range(0,n,2):\r\n out[i], out[i+1] = out[i+1], out[i]\r\n\r\n for i in range(n):\r\n print(out[i], end=' ')\r\nelse:\r\n print(\"-1\")", "n = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n output = [i - 1 if i % 2 == 0 else i + 1 for i in range(1, n + 1)]\r\n print(*output)\r\n", "num = int(input())\r\nls=[int(i) for i in range(1,num+1)]\r\nk = 0\r\nif(num%2==0):\r\n while(k<num):\r\n ls[k],ls[k+1] = ls[k+1],ls[k]\r\n k += 2\r\n print(' '.join(map(str,ls)))\r\nelse:\r\n print(-1)", "n = int(input())\n\nif n % 2 == 1:\n\tprint(-1)\nelse:\n\tarr = []\n\tfor i in range(1,n+1,2):\n\t\tarr.append(i+1)\n\t\tarr.append(i)\n\tprint(\" \".join(map(str,arr)))", "n = int(input())\r\nif n%2:\r\n print(-1)\r\nelse:\r\n d = list(range(1, n+1))\r\n i = 0\r\n while i<n:\r\n d[i], d[i+1] = d[i+1], d[i]\r\n i+=2\r\n print(*d, sep=' ')", "n = int(input())\nres = [-1] if n & 1 == 1 else [i for i in range(n, 0, -1)]\nprint(*res)\n", "n = int(input())\r\nif n%2!=0:\r\n\tprint(-1)\r\nelse:\r\n\tr = []\r\n\tfor i in range(1,n//2+1):\r\n\t\tr.append(2*i)\r\n\t\tr.append(2*i - 1)\r\n\tprint(*r)\r\n", "num=int(input())\r\nif(num%2==1):\r\n print(-1)\r\nelse:\r\n print(\"2 1\")\r\n for i in range(3,num,2):\r\n print(\" %d %d\" %(i+1,i))\r\n\r\n", "# --- Algorithm --- #\ndef function(n):\n p = []\n\n if n % 2 != 0: return -1\n\n for i in range(1, n+1):\n p.insert(0, str(i))\n\n return \" \".join(p)\n\n\n\n# --- Run --- #\nn = int(input())\nans = function(n)\nprint(ans)", "n = int(input())\r\n\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n p = list(range(1, n+1))\r\n for i in range(0, n, 2):\r\n p[i], p[i+1] = p[i+1], p[i]\r\n print(*p)\r\n", "# https://codeforces.com/problemset/problem/233/A\r\n\r\ndef check(n):\r\n if n % 2 == 1:\r\n return \"-1\"\r\n else:\r\n res = []\r\n i = 2\r\n for _ in range(n//2):\r\n res.append(i)\r\n i -= 1\r\n res.append(i)\r\n i += 3\r\n \r\n return ' '.join(map(str, res))\r\n\r\nprint(check(int(input())))", "n = int(input())\np = []\n\nif(n % 2 == 0):\n for i in range(1, n+1):\n if(i % 2 != 0):\n p.append(str(i+1)) \n p.append(str(i))\n\n print(\" \".join(p))\nelse:\n print(-1)\n", "n=int(input())\r\na=2\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n while a<=n:\r\n print(a,a-1,end=' ')\r\n a+=2\r\n\r\n \r\n", "def permu_size(n):\r\n \r\n if (n % 2 != 0):\r\n print(-1)\r\n else:\r\n for i in range(n, 0, -1):\r\n print(i)\r\n \r\nn = int(input())\r\npermu_size(n)", "a=int(input())\r\nif a%2==1:\r\n print(-1)\r\nelse:\r\n j=1\r\n for i in range(a//2):\r\n print(j+1,j,sep=' ',end=' ')\r\n j=j+2", "n = int(input())\r\nlst = []\r\nif n % 2 != 0:\r\n print('-1')\r\nelse:\r\n i = 1\r\n while i < n+1:\r\n lst.append(i)\r\n i += 1\r\n j = 0\r\n while j < n:\r\n del lst[j]\r\n lst.insert(j + 1, j + 1)\r\n j += 2\r\n text = ''\r\n for b in range(n):\r\n text += str(lst[b]) + ' '\r\n print(text)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nif n%2 != 0 :\r\n print(-1)\r\nelse :\r\n l = []\r\n for i in range(1,n+1) :\r\n l.append(i)\r\n for i in range(0,n,2) :\r\n print(l[i+1],l[i],end = ' ')\r\n print('')", "n = int(input())\r\n\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(1,n//2+1):\r\n print(2*i)\r\n print(2*i-1)\r\n", "#!/usr/bin/env python3\n# coding=utf-8\n\nn = int(input().rstrip())\nif(n % 2 == 1):\n print(-1)\nelse:\n li = []\n for i in range(1, n+1):\n li.append(str(i))\n for i in range(0, n-1, 2):\n swp = li[i]\n li[i] = li[i+1]\n li[i+1] = swp\n print(\" \".join(li))\n", "n=int(input())\r\nif n%2==1:\r\n print(\"-1\")\r\nelse:\r\n a=[0]*n\r\n for i in range(0,n):\r\n a[i]=i+1\r\n for i in range(1,int((n/2)+1)):\r\n t=a[2*(i-1)]\r\n a[(i-1)*2]=a[i*2-1]\r\n a[i*2-1]=t\r\n for i in a:\r\n print(i,end=\" \")", "import sys\r\n\r\nn = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\n sys.exit()\r\n \r\nfor i in range(1, n, 2):\r\n print(i + 1, i, end = \" \")\r\n \r\n'''6\r\n2 1 4 3 6 5\r\n''' \r\n\r\n\r\n", "def permutation():\r\n n = int(input())\r\n if n % 2 == 1: return -1\r\n r = list(range(1, n + 1))\r\n for i in range(0, n - 1, 2):\r\n \r\n r[i], r[i + 1] = r[i + 1], r[i]\r\n \r\n return ' '.join(list(map(str, r)))\r\n\r\nprint(permutation())", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef minp():\r\n return map(int, input().split())\r\n\r\n\r\ndef mlinp():\r\n return list(map(int, input().split()))\r\n\r\n\r\nt = inp()\r\n\r\nif t % 2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(1, t + 1, 2):\r\n print(i + 1, i, end=\" \")", "\r\n\r\ndef perfect_permutation():\r\n input_int = int(input())\r\n if input_int > 1 and input_int % 2 == 0:\r\n for i in range(1, input_int + 1):\r\n if i % 2 == 0:\r\n print(i - 1, end=' ')\r\n else:\r\n print(i + 1, end=' ')\r\n else:\r\n print(-1)\r\n\r\n\r\ndef main():\r\n perfect_permutation()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nif n&1==1:\r\n print(-1)\r\nelse:\r\n # 1 2 3 4\r\n # 2 1 4 3\r\n for i in range(1,n+1):\r\n if i&1==0:\r\n print(i-1,end=\" \")\r\n else:\r\n print(i+1,end=\" \")", "# http://codeforces.com/problemset/problem/32/B\r\n# http://codeforces.com/problemset/problem/266/B\r\n# http://codeforces.com/problemset/problem/271/A\r\n# http://codeforces.com/problemset/problem/275/A\r\n# http://codeforces.com/problemset/problem/59/A\r\n# http://codeforces.com/problemset/problem/281/A\r\n# http://codeforces.com/problemset/problem/110/A\r\n#\r\n\"\"\"\r\nThis is a question from codeforces.\r\n\"\"\"\r\n\r\n\r\ndef is_distinct(number: int) -> bool:\r\n \"\"\"\r\n :param number: input integer\r\n :return: boolean true/false\r\n \"\"\"\r\n key_map = [0] * 10\r\n\r\n while number:\r\n num = number % 10\r\n if key_map[num]:\r\n return False\r\n key_map[num] = 1\r\n number //= 10\r\n\r\n return True\r\n\r\n\r\ndef digit_count(number: int) -> bool:\r\n cnt = 0\r\n while number:\r\n digit = number % 10\r\n if digit == 4 or digit == 7:\r\n cnt += 1\r\n number = number // 10\r\n # print(cnt)\r\n if (cnt == 4) or (cnt == 7):\r\n return True\r\n return False\r\n\r\n\r\ndef is_prime(num: int):\r\n if num < 2:\r\n return False\r\n if num == 2:\r\n return True\r\n\r\n for k in range(2, num // 2 + 1):\r\n if num % k == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef get_next_prime(num: int) -> int:\r\n x = num + 1\r\n while not is_prime(x):\r\n x += 1\r\n # print(x)\r\n return x\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n if n % 2:\r\n print(-1)\r\n else:\r\n x = [i for i in range(1, n + 1)]\r\n # print(x)\r\n for i in range(1, n, 2):\r\n x[i], x[i - 1] = x[i - 1], x[i]\r\n print(*x)\r\n", "a=int(input())\r\nif(a%2!=0):\r\n\tprint(-1)\r\nelse:\r\n for i in range(1,a,2):\r\n print(i+1,i ,end=\" \")\r\n", "n=int(input())\r\nif(n%2):\r\n print('-1')\r\nelse:\r\n for i in range(1,n+1):\r\n if(i%2):\r\n print(i+1,end=' ')\r\n else:\r\n print(i-1,end=' ')\r\n\r\n", "n=int(input())\r\nif n%2==1:print(-1)\r\nelse:\r\n for x in range(n):print(2*(x//2)+2-(x%2),end=\" \")", "n = int(input())\r\nres = []\r\nif n % 2 == 1:\r\n print(-1)\r\n exit()\r\nelse:\r\n for i in range(1, n+1):\r\n if i % 2 == 1:\r\n res.append(i+1)\r\n else:\r\n res.append(i-1)\r\nprint(*res)\r\n", "n = int(input())\r\nres = []\r\nif n%2 ==0:\r\n for i in range(1, n//2 + 1):\r\n res.append(2*i)\r\n res.append(2*i-1)\r\n print(*res)\r\n\r\nelse:\r\n print(\"-1\")", "n = int(input())\r\nli = [i for i in range(1, n+1)]\r\nif n == 1 or n % 2 == 1:\r\n print(-1)\r\nelif n % 2 == 0:\r\n li.reverse()\r\n a = \" \".join(map(str, li))\r\n print(a)", "i = int(input())\r\nif i % 2 == 1:\r\n print('-1')\r\nelse:\r\n c = int(i/2)\r\n for v in range(c+1):\r\n if v == 0:\r\n continue\r\n elif v == c :\r\n print(v*2, end = ' ')\r\n print(v*2-1)\r\n else:\r\n print(v * 2, end=' ')\r\n print(v * 2 - 1, end = ' ')\r\n\r\n\r\n\r\n", "def solve():\r\n x = int(input())\r\n if x % 2:\r\n print(-1)\r\n else:\r\n for i in range(1, x+1):\r\n print(i+(i % 2)-(i % 2 == 0), end=' ')\r\n print()\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "n = int(input())\r\n\r\nif n % 2 != 0:\r\n print(-1)\r\n\r\nelse:\r\n r = [i for i in range(1, n + 1)]\r\n i = 0\r\n while True:\r\n r[i], r[i + 1] = r[i + 1], r[i]\r\n i += 2\r\n if i == n:\r\n break\r\n\r\n for i in r:\r\n print(i, end = \" \")", "\ndef solve(n):\n\tif n%2==1 :\n\t\treturn -1\n\tl=[]\n\ti=1\n\twhile i <= n :\n\t\tl.append(i+1)\n\t\tl.append(i)\n\t\ti+=2\n\treturn ''.join(str(x)+' ' for x in l).strip()\n \n\n\nfrom sys import stdin\ninput = stdin.readline\nn=int(input())\nprint(solve(n))\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Dec 27 23:31:14 2022\r\n\r\n@author: KIRUTHIKA GOPAL\r\n\"\"\"\r\n\r\nn=int(input())\r\n\r\nif n%2!=0:\r\n ans=-1\r\n print(ans)\r\nelse:\r\n for i in range(1,n,2):\r\n print('{} {}'.format(i+1,i),end=\" \")\r\n ", "x=int(input())\r\ny=[]\r\nz= str\r\nif (x%2 == 1):\r\n print(-1)\r\nelse:\r\n for i in range(x,0,-1):\r\n print(i, end=\" \")", "# Happy_water\r\ndef main():\r\n n = int(input())\r\n if n % 2 == 1:\r\n print(-1)\r\n return\r\n for i in range(n):\r\n if i % 2 == 0:\r\n print(i + 2, end=' ')\r\n else:\r\n print(i, end=' ')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nif n%2==1:\r\n print(-1)\r\n exit()\r\nres = [i for i in range(1, n+1)]\r\nfor i in range(0, n, 2):\r\n res[i], res[i+1] = res[i+1], res[i]\r\nfor i in res:\r\n print(i, end=\" \")", "def create_perfect_permutation(n):\r\n if n % 2 == 1:\r\n return [-1]\r\n \r\n permutation = list(range(1, n+1))\r\n for i in range(0, n, 2):\r\n permutation[i], permutation[i+1] = permutation[i+1], permutation[i]\r\n \r\n return permutation\r\n\r\nn = int(input())\r\nperfect_permutation = create_perfect_permutation(n)\r\nprint(*perfect_permutation)\r\n\r\n", "import math\r\nfrom math import *\r\n\r\n# from collections import *\r\n# from itertools import permutations\r\nmod = 10 ** 9 + 7\r\n\r\n\r\ndef main():\r\n # test = int(input())\r\n # for _ in range(test):\r\n n=int(input())\r\n if n%2==1:\r\n print(-1)\r\n else:\r\n for i in range(n,0,-1):\r\n print(i, end=\" \")\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\n\r\n# Check if a perfect permutation is possible\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n # Generate the perfect permutation\r\n permutation = []\r\n for i in range(1, n+1, 2):\r\n permutation.append(i+1)\r\n permutation.append(i)\r\n print(' '.join(map(str, permutation)))\r\n", "def Perfect_Per(n):\r\n if n % 2 == 1:\r\n return -1\r\n if n == 2:\r\n return f\"2 1\"\r\n \r\n return f\"{Perfect_Per(n-2)} {n} {n-1}\"\r\n\r\nprint(Perfect_Per(int(input())))", "\r\n#[a, b, c, d] = [int(x) for x in input().split()]\r\nc=int(input())\r\nif c%2==0:\r\n for i in range(0,c):\r\n print(c-i,\" \")\r\n \r\nelse:\r\n print(\"-1\")", "n = int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n print(2, 1),\r\n for i in range(3, n, 2):\r\n print(i+1, i),\r\n\r\n", "n=int(input())\r\nl=[i for i in range(1,n+1)]\r\nif n%2!=0:\r\n print(\"-1\")\r\nelse:\r\n i=0\r\n while i<=n:\r\n try:\r\n l[i],l[i+1]=l[i+1],l[i]\r\n i+=2\r\n except:\r\n break\r\n for i in l:\r\n print(i,end=\" \")\r\n \r\n \r\n ", "#!/usr/bin/env python3\r\n\r\ndef inp(*, cf=lambda x: x): return cf(input())\r\ndef inpint(): return inp(cf=int)\r\ndef inp_line(*, cf=lambda x: x, s=' '): return list(map(cf, input().split(s)))\r\ndef inpints(): return inp_line(cf=int)\r\ndef intstostr(l): return ' '.join([str(x) for x in l])\r\ndef listtostr(l): return ' '.join(l)\r\n\r\n\r\ndef test_case(case):\r\n n = inpint()\r\n\r\n if n % 2 == 1:\r\n return -1\r\n\r\n p = []\r\n for i in range(1, n + 1, 2):\r\n p.append(i+1)\r\n p.append(i)\r\n return intstostr(p)\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\n\r\nif n % 2 == 1:\r\n print(-1) \r\nelse:\r\n arr = range(1 , n + 1)\r\n res = \"\"\r\n for ele in arr:\r\n if ele % 2 == 1:\r\n res += str(ele + 1) + \" \"\r\n else:\r\n res += str(ele - 1) + \" \"\r\n print(res)", "sayi = input()\r\nsonuc = \"\"\r\nif not int(sayi) % 2 == 0:\r\n print(\"-1\")\r\nelse:\r\n for a in range(int(sayi)):\r\n if a % 2 == 0:\r\n sonuc = sonuc + \" \" + str(a+2)\r\n else:\r\n sonuc = sonuc + \" \" + str(a)\r\nprint(sonuc)", "n=int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n arr=[i+1 for i in range(n)]\r\n ind=0\r\n while(ind<len(arr)-1):\r\n arr[ind],arr[ind+1]=arr[ind+1],arr[ind]\r\n ind+=2\r\n print(*arr)", "N = int(input())\r\n\r\n\r\ndef perfect_perm(n):\r\n permutation = \"\"\r\n if n % 2 == 1:\r\n return \"-1\"\r\n\r\n for i in range(n):\r\n if i % 2 == 0:\r\n permutation += str(i+2) + \" \"\r\n else:\r\n permutation += str(i) + \" \"\r\n return permutation\r\n\r\n\r\nprint(perfect_perm(N))\r\n\r\n", "n=int(input())\r\nif n%2: print(-1)\r\nelse: print(*list(range(n,0,-1)))\r\n", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\n exit(0)\r\nfor i in range(n//2):\r\n print(i*2+2,end=\" \")\r\n print(i*2+1,end=\" \")\r\n", "#!/usr/bin/env python\r\n\r\nimport math, sys, itertools\r\n\r\nif __name__ == '__main__':\r\n\twtf = sys.stdin.read()\r\n\twtf = wtf.strip().split('\\n')\r\n\tn = int(wtf[0])\r\n\tif n % 2 == 0:\r\n\t\ttmp = []\r\n\t\tfor i in range(1, n + 1, 2):\r\n\r\n\t\t\ttmp.append(i + 1)\r\n\t\t\ttmp.append(i)\r\n\t\tprint(' '.join(map(str, tmp)))\r\n\telse:\r\n\t\tprint(-1)", "def main():\r\n n = int(input())\r\n if n % 2 != 0:\r\n print(-1)\r\n else:\r\n c = []\r\n for i in range(1, n, 2):\r\n c.append(str(i +1))\r\n c.append(str(i))\r\n print(' '.join(c))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n mass = [i for i in range(1, n+1)]\r\n for i in range(0, len(mass), 2):\r\n mass[i], mass[i+1] = mass[i+1], mass[i]\r\n print(*mass)", "def permu_size(n):\r\n \r\n lst = []\r\n \r\n if (n % 2 != 0):\r\n print(-1)\r\n else:\r\n for i in range(1, n+1):\r\n lst.append(i)\r\n for k in range(len(lst)//2):\r\n x = lst[2*k]\r\n y = lst[(2*k)+1]\r\n x, y = y, x\r\n print(x, y, end=\" \")\r\n \r\n\r\nn = int(input())\r\npermu_size(n)", "n = int(input())\r\n\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n res = [0]*n\r\n for i in range(2, n+1, 2):\r\n res[i-2] = i\r\n for i in range(1, n, 2):\r\n res[i] = i\r\n print(*res)\r\n", "\r\n\r\n#https://codeforces.com/problemset/problem/233/A\r\n\r\ndef solution(length):\r\n result = \"\"\r\n permutation = [0 for i in range(length)]\r\n counter = 1\r\n i = 0\r\n if length % 2 == 0:\r\n while i < length-1:\r\n permutation[i] = 2 * counter\r\n permutation[i+1] = i + 1\r\n i += 2\r\n counter += 1\r\n else:\r\n result = \"-1\"\r\n if result != \"-1\":\r\n for i in permutation:\r\n result = str(result) + str(i) + \" \"\r\n print(result) \r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n length = int(input())\r\n solution(length)", "n = int(input())\r\nif n % 2 == 0:\r\n print(*[i for i in range(n, 0, -1)], sep=\" \")\r\nelse:\r\n print(-1)", "n = int(input())\r\nif(n&1):print(-1)\r\nelse:\r\n for x,y in zip(range(2,n+1,2),range(1,n,2)):\r\n print(x,y,end = \" \")\r\n", "dizi = int(input())\r\nsayı =[]\r\nif dizi % 2 ==1:\r\n print(-1)\r\nelse:\r\n for i in range(int(dizi/2)):\r\n sayı.append(2*i+2)\r\n sayı.append(2*i+1)\r\nprint(*sayı)", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n arr = [x for x in range(1, n + 1)]\r\n for i in range(1, n, 2):\r\n arr[i - 1], arr[i] = arr[i], arr[i - 1]\r\n for num in arr:\r\n print(num, end=\" \")", "a = int(input())\r\nif a %2 != 0:\r\n print(\"-1\")\r\nelse:\r\n delon = [x for x in range(1,a+1)]\r\n for x in delon[::-1]:\r\n print(x, end=' ')", "n = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n mylist = list()\r\n new = list()\r\n for x in range(1,n+1):\r\n mylist.append(x)\r\n for s in range(n):\r\n if s % 2 != 0 and s != 0:\r\n print(mylist[s], end = ' ')\r\n print(mylist[s-1], end = ' ')", "n = int(input())\r\nif n%2 ==0:\r\n l = list(range(1,n+1))\r\n for i in range(0,n,2):\r\n l[i],l[i+1] = l[i+1],l[i]\r\n for ele in l:\r\n print(ele,end =\" \")\r\nelse:\r\n print(-1)", "n = int(input())\r\n# arr = list(map(int, input().split()))\r\n\r\nif n%2 == 1: print(\"-1\")\r\nelse:\r\n for i in range(1, n+1):\r\n if i % 2 == 0:\r\n print(i-1, end = \" \")\r\n else:\r\n print(i+1, end = \" \")\r\n\r\n", "v = int(input())\r\nif v % 2 == 1:print(-1)\r\nelse:\r\n w = []\r\n for i in range(1,v+1,2):\r\n w.append(i+1)\r\n w.append(i)\r\n print(*w)\r\n", "n = int(input())\r\nif n % 2 == 1:\r\n\tprint(-1)\r\n\texit()\r\nperm = [0] * n\r\nfor i in range(2, n + 2, 2):\r\n\tperm[i - 2] = i\r\nfor i in range(1, n, 2):\r\n\tperm[i] = i\r\nprint(*perm)", "a=int(input())\r\nif a%2!=0:\r\n print(-1)\r\nelse:\r\n print(*range(a,0,-1))", "n = int(input())\r\n\r\nif n%2!=0:\r\n print(-1)\r\nelse :\r\n sum=\"\"\r\n for i in range(1,n,2):\r\n sum+=f\"{i+1} {i} \"\r\n print(sum)", "n = int(input())\r\n\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if (i + 1) % 2 != 0:\r\n print(i + 2, end = \" \")\r\n else:\r\n print(i, end = \" \")\r\n", "n=int(input())\r\nif(n%2==1):\r\n print(-1)\r\nelse:\r\n arr=[]\r\n for i in range(n):\r\n arr.append(i+1)\r\n\r\n i=0\r\n while(i<n-1):\r\n arr[i],arr[i+1]=arr[i+1],arr[i]\r\n i+=2\r\n\r\n # arr[n-1],arr[n-2]=arr[n-2],arr[n-1]\r\n\r\n for i in range(n):\r\n print(arr[i],end=\" \")\r\n print()\r\n", "length = int(input())\r\n\r\nif length & 1:\r\n print(-1)\r\nelse:\r\n range_list = list(range(1, length + 1))\r\n \r\n for i in range(1, length, 2):\r\n x = range_list[i]\r\n range_list[i], range_list[i - 1] = range_list[i - 1], x\r\n \r\n print(*range_list)", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\n\r\n#import os\r\n#import sys\r\nfrom math import *\r\n#import re\r\n#import random\r\n#sys.set_int_max_str_digits(int(1e9))\r\n\r\n\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n for _ in range(1):\r\n n = int(input())\r\n if(n%2 == 0):\r\n print(*range(1,n+1)[::-1])\r\n else:\r\n print(-1)\r\n \r\n \r\n\r\n\r\n\r\n\r\nsolve()\r\n\r\n", "a=int(input())\r\nif a % 2 == 0:\r\n a=list(range(1,a+1))\r\n for i in range(0,len(a),2):\r\n a[i],a[i+1]=a[i+1],a[i]\r\n print(*a)\r\nelse:\r\n print(-1)\r\n", "def solve():\r\n n = int(input())\r\n if n%2!=0:\r\n print(-1)\r\n else:\r\n for i in range(1, n+1, 2):\r\n print(str(i+1)+' '+str(i), end=' ')\r\n print()\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n = int(input())\r\n\r\nif n % 2 == 1:\r\n print(\"-1\")\r\nelse:\r\n for i in range(2, n + 1, 2):\r\n print(i, i - 1, end=\" \")\r\n\r\n if n % 2 == 0:\r\n print()\r\n", "a=int(input())\r\nb=[]\r\nif a%2==1:\r\n print(-1)\r\nelse:\r\n for i in range(1,a+1):\r\n b.append(i)\r\n \r\n if len(b)>1:\r\n if i%2==0:\r\n \r\n b[i-1],b[i-2]=b[i-2],b[i-1]\r\n print(*b)", "num = int(input())\n\n# even number check\nif num % 2 != 0:\n a = -1\n print(a)\n exit()\n\n# even and odd list sorting\ni = 1\neven_list = []\nodd_list = []\nfinal_list = []\nwhile i <= num:\n if i % 2 == 0:\n even_list = even_list + [i]\n else:\n odd_list = odd_list + [i]\n i = i + 1\n# final list\ni = 0\nwhile i < num/2:\n final_list = final_list + [even_list[i]]\n final_list = final_list + [odd_list[i]]\n i = i + 1\n\n# printing out values\nfor v in final_list:\n print(v, end=' ')\n\n", "n = int(input())\nif n % 2:\n print(-1)\nelse:\n a = []\n for i in range(2, n + 1, 2):\n a.extend([i, i - 1])\n print(' '.join(map(str, a)))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Dec 21 17:26:54 2022\r\n\r\n@author: 21pt34\r\n\"\"\"\r\n\r\nn=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n for i in range(n,0,-1):\r\n print(i,end=' ')\r\n ", "# URL: https://codeforces.com/problemset/problem/233/A\n\nimport io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\nn = int(inp())\nif n % 2:\n out(\"-1\")\nelse:\n p = [i + 1 if i % 2 else i - 1 for i in range(1, n + 1)]\n out(\" \".join(map(str, p)))\n", "n = int(input())\r\n\r\nif (n%2 == 0):\r\n for i in range(0, n):\r\n if (i%2 == 0):\r\n print(i+2, end = \" \")\r\n else:\r\n print(i, end = \" \")\r\nelse:\r\n print(-1) ", "n = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n for num in range(1, n, 2):\r\n print(num + 1, num, end=' ')", "n = int(input())\r\narr = [i for i in range (1,n+1)]\r\nif n % 2 !=0:print(-1)\r\nelse:\r\n arr.reverse()\r\n print(*arr)", "n=int(input())\r\nif n%2>0:\r\n print(-1)\r\n\r\nelse:\r\n v=2\r\n nn=n//2\r\n for i in range(nn):\r\n print(v,end=\" \")\r\n print(v-1,end=\" \")\r\n v+=2", "n=int(input())\r\nif (n&1):\r\n print(-1)\r\nelse:\r\n for i in range(1,n,2):\r\n print(i+1,i,end=\" \")", "b=int(input())\r\nl=[]\r\nif(b%2==0):\r\n for i in range(0,b,2):\r\n l.append(i+2)\r\n l.append(i+1)\r\n print(*l)\r\nelse:\r\n print(-1)", "n = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n r = []\r\n for i in range(n):\r\n if i % 2 == 0:\r\n r.append(i+2)\r\n else:\r\n r.append(i)\r\n for i in r:\r\n print(i, end=\" \")", "no = int(input())\r\nif no%2:\r\n print(-1)\r\nelse:\r\n print(*range(no,0,-1))\r\n", "i=int(input())\r\n\r\nif i%2==0:\r\n\r\n lis=[ j+((-1)**(j+1)) for j in range(1,i+1)]\r\n for num in lis:\r\n print(num,end=\" \")\r\nelse:\r\n print(-1)", "def solve(n):\t\r\n\t\t\r\n\tif n%2==1 :\t\r\n\t\tprint(-1)\r\n\t\treturn\r\n\t\t\r\n\tans = []\t\r\n\tfor i in range(1,n+1,2):\r\n\t\tans.extend([i+1,i])\r\n\t\t\r\n\ts = ' '.join(map(str,ans))\r\n\tprint(s)\r\n\r\nn = int(input())\r\nsolve(n)", "lenz = int(input())\r\n\r\nif lenz % 2 != 0:\r\n\tprint(-1)\r\nelse:\r\n\tans = \"\"\r\n\tfor i in range(2, lenz+1, 2):\r\n\t\tif i != lenz:\r\n\t\t\tans += f\"{i} {i-1} \"\r\n\t\telse:\r\n\t\t\tans += f\"{i} {i-1}\"\r\n\t\r\n\tprint(ans)", "n = int(input())\r\nif n <= 1 or n%2!=0:\r\n print(-1)\r\nelse:\r\n f = True\r\n for i in range(1,n+1):\r\n if f:\r\n print(i+1,end=' ')\r\n f=False\r\n else:\r\n print(i-1,end=' ')\r\n f=True\r\n", "m=int(input())\r\nif m%2==0:\r\n i=2\r\n while i<=m:\r\n print(i,end=' ')\r\n print(i-1,end=' ')\r\n i=i+2\r\nelse:\r\n print('-1')", "n = int(input())\r\nL = []\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n for i in range(1,n+1):\r\n if i%2==1:\r\n L.append(i+1)\r\n else:\r\n L.append(i-1)\r\n print(*L)", "n = int(input())\r\n\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n elements = list(range(1, n + 1))\r\n for i in range(0, n - 1, 2):\r\n elements[i], elements[i + 1] = elements[i + 1], elements[i]\r\n\r\n print(*elements)", "from functools import partial as p_\r\nfrom operator import *\r\n\r\nn = int(input())\r\nif n%2!=0: print(-1)\r\nelse:\r\n for i in range(2,n+1,2):\r\n print(i,i-1,end=' ')", "n=int(input())\r\nl=[]\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n for i in range(0,n):\r\n l.append(i+1)\r\n \r\n for i in range(0,n,2):\r\n l[i],l[i+1]=l[i+1],l[i]\r\nprint(*l) ", "n = int(input())\r\n\r\nif n%2 != 0:\r\n print(-1)\r\nelse:\r\n lis = []\r\n \r\n for i in range(1,n+1):\r\n lis.append(i)\r\n \r\n lo = 0\r\n hi = len(lis) - 1\r\n \r\n while lo < hi:\r\n c = lis[lo]\r\n lis[lo] = lis[hi]\r\n lis[hi] = c\r\n lo+=1\r\n hi-=1\r\n \r\n for el in lis:\r\n print(el)\r\n \r\n ", "n=int(input())\r\nif n%2!=0:\r\n print(\"-1\")\r\nelse:\r\n if n==2:\r\n print(\"2 1\")\r\n if n>2:\r\n ans=\"2 1\"\r\n for i in range(3,n,2):\r\n ans+=\" \"+str(i+1)+\" \"+str(i)\r\n print(ans)", "n = int(input())\r\n\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n arr = [i for i in range(1, n+1)]\r\n newlist = []\r\n\r\n for i in range(0, n, 2):\r\n newlist.extend([arr[i+1], arr[i]])\r\n print(\" \".join(map(str, newlist)))", "n = int(input())\n\nif n % 2 == 1: \n print(-1)\nelse: \n for i in range(0, n, +2): \n print(i+2, i+1, end = '')\n if i != n-1 and i!= n-2: \n print(\" \", end = '')\n print()\n", "n = int(input())\r\nif n%2==0:\r\n c1 = 1\r\n c2 = 2\r\n ans = []\r\n for i in range(n):\r\n if i%2==0:\r\n ans.append(c2)\r\n c2+=2\r\n else:\r\n ans.append(c1)\r\n c1+=2\r\n print(*ans)\r\nelse:\r\n print(-1)", "n=int(input())\nif n%2==0:\n t=[]\n for i in range(1,n+1):\n t+=[str(i)] \n for i in range(0,n,2):\n t[i],t[i+1]=t[i+1],t[i]\n print(\" \".join(t))\nelse:\n print(-1)\n", "n = int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n l=[]\r\n for i in range(1,n+1):\r\n l.append(i)\r\n for i in range(0,len(l)-1,2):\r\n l[i],l[i+1] = l[i+1],l[i]\r\n for i in range(len(l)):\r\n l[i] = str(l[i])\r\n s = \" \".join(l)\r\n print(s)", "# 233A. Perfect Permutation\r\nn = int(input())\r\n#n = 50\r\nif n % 2 == 1:\r\n print(-1)\r\n\r\nelse:\r\n P = []\r\n i = -1\r\n while i < n - 1:\r\n i += 3\r\n P.append(i)\r\n i -= 1\r\n P.append(i)\r\n print(' '.join([str(p) for p in P]))\r\n\r\n\r\n# need to do it smarter... bruteforce doesnt work here :)\r\n# I could probably finish it with trying to generate N lists which follow mentioned rules.\r\n# I try for first position value, and then follow with other elements...\r\n# p1 = 2, and then i generate p2 = 1\r\n# p1 = 3, p3 = 1\r\n# p1 = 4, p4 = 1\r\n# p2 = 5, p5 = 2\r\n# 2 1 4 3 6 5\r\n# so it is banal... no algorithm... just generate :) ", "n=int(input())\n\nif n%2==1:\n print(-1)\nelse:\n k=list(range(1,n+1))\n for a,b in zip(k[::2],k[1::2]):\n print(b,a,end=' ')\n print()\n \n", "def main():\r\n n = int(input())\r\n answer = []\r\n if n%2 != 0:\r\n print(-1)\r\n return\r\n for i in range(n):\r\n a = i+1\r\n if a%2 != 0:\r\n answer.append(str(a+1))\r\n else:\r\n answer.append(str(a-1))\r\n\r\n answer1 = \"\"\r\n for j in answer:\r\n j = j+\" \"\r\n answer1 += j\r\n print(answer1)\r\n\r\n\r\n\r\n\r\n\r\nmain()", "n=int(input())\r\nif n%2:print(-1)\r\nelse:print(*range(n,0,-1))", "import sys\r\n\r\nn=int(input())\r\n\r\nif n%2==1:\r\n print(\"-1\")\r\nelse:\r\n for i in range(1,n+1):\r\n if i%2==1:\r\n sys.stdout.write(str(i+1)+\" \")\r\n else:\r\n sys.stdout.write(str(i-1)+\" \")", "n = int(input())\r\n\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n l = list(range(1,n+1))\r\n \r\n for i in range(0 , n , 2):\r\n if (i%2==0):\r\n a = l[i]\r\n b = l[i+1]\r\n l[i] = b \r\n l[i+1] = a \r\n print(*l) \r\n \r\n \r\n \r\n ", "n = int(input())\nif n % 2 == 1:\n\tprint(-1)\nelse:\n\tp = []\n\tfor i in range(n // 2):\n\t\tp.extend([2 * i + 2, 2 * i + 1])\n\tprint(' '.join([str(x) for x in p]))\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nm = n+1\r\nresult = \"\"\r\nif n % 2 != 0:\r\n result += (\"-1\")\r\nelse:\r\n for i in range(1, m):\r\n if i % 2 == 0:\r\n result += str(i-1)+\" \"\r\n\r\n else:\r\n result += str(i+1)+\" \"\r\n\r\nprint(result)\r\n", "n = int(input())\r\na = []\r\nchis = 1\r\ncount = 0\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(1, n + 1):\r\n if i % 2 == 1:\r\n a.append(chis + 1)\r\n else:\r\n a.append(chis)\r\n count += 1\r\n if count == 2:\r\n chis += 2\r\n count = 0\r\n print(*a)\r\n", "size = int(input())\r\npermutation = \"\"\r\nif size % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(size, 0, -1):\r\n permutation += str(i) + \" \"\r\n print(permutation)", "n = int(input())\r\nl = [i for i in range(1,n+1)]\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(0,n,2):\r\n l[i],l[i+1] = l[i+1],l[i]\r\n print(' '.join([str(i) for i in l]))\r\n ", "n=int(input())\r\nif n %2!=0:\r\n print(-1)\r\nelse:\r\n arr=[]\r\n for i in range(1,n+1):\r\n arr.append(i)\r\n\r\n for j in range(0,n,2):\r\n arr[j],arr[j+1]=arr[j+1],arr[j]\r\n\r\n for k in range(len(arr)):\r\n print(arr[k],end=\" \")\r\n\r\n", "from sys import stdout\r\nfrom itertools import chain\r\n\r\npermutation_size = int(input())\r\nif permutation_size % 2:\r\n stdout.write(\"-1\\n\")\r\nelse:\r\n stdout.write(\" \".join(map(str, chain(\r\n range(permutation_size // 2 + 1, permutation_size + 1),\r\n range(1, permutation_size // 2 + 1), \"\\n\"\r\n ))))", "n = int(input())\r\n\r\nif (n % 2 == 1):\r\n print(-1)\r\nelse:\r\n for i in range(1, n + 1):\r\n print((i + 1) if i % 2 == 1 else (i - 1), end = \" \")", "n=int(input())\r\nif (n%2==1):\r\n print(-1)\r\nelse:\r\n for i in range(1,n+1):\r\n print((i+1) if i%2==1 else (i-1),end=\" \")", "#PerfectPermutation\r\n\r\nn = int(input())\r\n\r\n\r\nif(n% 2 == 0):\r\n\tfor value in range(1,n+1):\r\n\t\tif(value % 2 !=0):\r\n\t\t\tprint(value+1,end = \" \")\r\n\t\telse:\r\n\t\t\tprint(value-1,end = \" \")\r\nelse:\r\n\tprint(-1)", "permutation = int(input())\r\nfor i in range(permutation,0,-1):\r\n if permutation % 2 == 0:\r\n print(i,end = ' ')\r\n else:\r\n print(-1)\r\n break", "n = int(input())\r\nif n % 2 == 0:\r\n l = []\r\n y = []\r\n s = \"\"\r\n for i in range(1, n+1):\r\n l.append(i)\r\n for i in range(1, n+1, 2):\r\n y.append(l[i])\r\n y.append(i)\r\n for i in y:\r\n s = s+str(i)+\" \"\r\n print(s)\r\nelse:\r\n print(\"-1\")\r\n", "n = int(input())\r\nif ((n >= 1) and (n <= 100)):\r\n if (n % 2 == 1):\r\n print(-1)\r\n else:\r\n for i in range(1, (n//2)+1):\r\n print('{} {}'.format(2*i, 2*i-1), end=' ')", "n = int(input())\r\nif n%2 !=0:\r\n print(-1)\r\n exit(0)\r\nprint(*[x for x in range(n,0,-1)])", "n = int(input())\r\n\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(1, n//2 + 1):\r\n print(2 * i, 2 * i - 1, end = \" \")\r\n print()", "n=int(input())\r\nl1=[]\r\nif n%2==0:\r\n for i in range(1,n+1):\r\n l1.append(i)\r\n for j in range(n,0,-1):\r\n print(j,end=\" \")\r\nelse:\r\n print(-1)", "n = int (input ())\r\nif n % 2 == 0:\r\n array = []\r\n for i in range (1, n + 1):\r\n if i % 2 == 0:\r\n array.append (str (i - 1))\r\n else:\r\n array.append (str (i + 1))\r\n print (' '.join (array))\r\nelse:\r\n print (-1)", "def perfect_permutation(n):\r\n if n % 2 == 1:\r\n return -1 \r\n permutation = list(range(1, n+1)) \r\n for i in range(0, n, 2):\r\n permutation[i], permutation[i+1] = permutation[i+1], permutation[i]\r\n\r\n return permutation\r\nn = int(input())\r\nresult = perfect_permutation(n)\r\nif result == -1:\r\n print(-1)\r\nelse:\r\n print(*result)\r\n", "#Perfect permutation\r\nnum = int(input())\r\nif(num%2!=0):\r\n print(-1)\r\nelse:\r\n for i in range(1,num,2):\r\n print('{} {}'.format(i+1,i),end=\" \")\r\n", "n = int(input())\r\n\r\nlist = []\r\n\r\nif n % 2 == 0:\r\n result = \"\"\r\n for i in range(n//2):\r\n\r\n result += str(i*2+2) + \" \" + str(i*2+1)\r\n if i != n//2 - 1:\r\n result += \" \"\r\n print(result)\r\nelse:\r\n print(-1)", "x = int(input())\r\n\r\ndef disp(a):\r\n for i in a:\r\n print(i, end=\" \")\r\n\r\nif x > 1 and not(x % 2): disp([i for i in range(x,0,-1)])\r\nelse: print(-1)", "# \t233A - Perfect Permutation\r\nif __name__ == '__main__' :\r\n number = int(input())\r\n lst = []\r\n if number % 2 is not 0:\r\n print(-1)\r\n else:\r\n for x in range(1,number+1):\r\n lst.append(x)\r\n for x in range(1,number,2):\r\n var = lst[x]\r\n lst[x] = lst[x-1]\r\n lst[x-1] = var\r\n print(' '.join(str(x) for x in lst))", "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 if n%2==1:\r\n print(-1)\r\n else:\r\n a = []\r\n s = n//2\r\n v = 2\r\n while s:\r\n a.append(v)\r\n a.append(v-1)\r\n v+=2\r\n s-=1\r\n print(*a)\r\nif __name__ == '__main__':\r\n main()", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n n = int(n/2)\r\n list = []\r\n for i in range(0+1,n+1):\r\n num1 = i*2\r\n num2 = i*2 -1\r\n print(num1, end=' ')\r\n print(num2, end=' ')\r\n\r\n\r\n\r\n", "n=int(input())\r\nif(n%2==0):\r\n ans=[]\r\n for i in range(2,n+1,2):\r\n ans.append(i)\r\n ans.append(i-1)\r\n \r\nelse:\r\n ans=[-1]\r\n \r\nfor i in ans:\r\n print(i,end=\" \")", "n = int(input())\r\n\r\nif n == 1 or n%2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(1,n + 1):\r\n if i%2 == 0:\r\n print(i-1,end=\" \")\r\n else:\r\n print(i+1, end=\" \")", "n = int(input())\n\nif n % 2:\n print('-1')\nelse:\n res = []\n for i in range(n):\n res.append(str(i + 2 if i % 2 == 0 else i))\n\n print(' '.join(res))\n", "n = int(input())\nif n%2==1:\n print(-1)\nelse:\n permutation = [i for i in range(1, n+1)]\n for i in range(0, n, 2):\n permutation[i], permutation[i+1] = permutation[i+1], permutation[i]\n print(' '.join([str(m) for m in permutation]))", "n = int(input())\nif n%2 != 0:\n print(-1)\nelse:\n numbers = []\n for integer in range(n,0, -1):\n numbers.append(integer)\n print(*numbers, sep=' ')\n\t\t\t \t \t\t \t \t \t \t \t\t \t", "n=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n lis=[n-i for i in range(0,n)]\r\n print(*lis)", "n=int(input())\r\nif(n%2==0):\r\n i=1\r\n while(i<=n):\r\n print(i+1,end=\" \")\r\n print(i,end=\" \")\r\n i=i+2\r\nelse:\r\n print(-1)", "n = int(input())\narr = [i for i in range(1,n+1)]\nif n % 2 == 0:\n print(*arr[::-1])\nelse:\n print(-1)\n", "n = int(input())\r\nif n%2:\r\n print(-1)\r\nelse:\r\n l = list(range(n,0,-1))\r\n print(*l)", "n = int(input())\n\nif n % 2 == 1:\n print(-1)\nelse:\n stri = '2 1'\n \n for i in range(3, n, 2):\n stri += f' {i+1} {i}'\n \n print(stri)\n \n", "import sys\ninput = sys.stdin.readline\n\nN = int(input())\nif N%2 == 1 : print(-1)\nelse :\n A = [0] * N\n for aIndex in range(1, N+1) :\n A[aIndex-1] = ((aIndex-1)//2+1)*2 - int(aIndex%2 == 0)\n print(\" \".join(map(str, A)))\n", "a=int(input())\r\nif a&1==1:\r\n print(-1)\r\nelse:\r\n res=[i+1 for i in range(a)]\r\n for i in range(0,len(res),2):\r\n print(res[i+1],end=\" \")\r\n print(res[i],end=\" \")", "n = int(input())\r\neven=2\r\nodd=1\r\nlis=[]\r\nif n%2==0:\r\n for i in range(1,n+1):\r\n if i%2==0:\r\n lis.append(odd)\r\n odd+=2\r\n else:\r\n lis.append(even)\r\n even+=2\r\nelse:\r\n print(-1)\r\nfor i in lis:\r\n print(i,end=' ')", "import sys\r\n\r\ndef main():\r\n N = int(sys.stdin.readline())\r\n if N % 2:\r\n print(-1)\r\n else:\r\n print(\"2 1\", end = \" \")\r\n for i in range(3, N, 2):\r\n print(str(i + 1) + \" \" + str(i) + \" \")\r\n print()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n = int(input())\r\nA = []\r\nif n%2 != 0:\r\n print(-1)\r\n\r\nelse:\r\n i = 1\r\n while len(A) < n:\r\n A.append(i + 1)\r\n A.append(i)\r\n i += 2\r\n a = ''\r\n for i in A:\r\n a += \" \" + str(i)\r\n \r\n print(a)\r\n \r\n \r\n\r\n\r\n", "n = int(input())\r\n\r\nif n%2 == 0:\r\n # print(*list(range(n, 0, -1)))\r\n for i in range(2, n+1, 2):\r\n print(i, i -1, end = ' ')\r\nelse: \r\n print(-1)", "#Perfect permutations\nn = int(input())\nif n%2 != 0:\n print(-1)\nelse:\n\tfor i in range(n):\n\t\tif i%2 == 0:\n\t\t\tprint((i+1)+1,end =\" \")\n\t\telse:\n\t\t\tprint((i-1)+1,end = \" \")", "N = int(input())\r\noutput = \"\"\r\nif N % 2 == 1:\r\n\r\n print(-1)\r\n\r\n\r\n\r\nelse:\r\n\r\n for i in range(1, N-1, 2):\r\n\r\n output += str(i+1) + \" \"\r\n output += str(i) + \" \"\r\n\r\n output += str(N) + \" \" + str(N-1)\r\n\r\n\r\n print(output)\r\n", "n = int(input(\"\"))\r\nif n%2 != 0:\r\n print(\"-1\")\r\nelse:\r\n while (n!=0):\r\n print(n, end=\" \")\r\n n = n-1", "n = int(input())\r\nar = [0] * n\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n ar[i] = i + 2\r\n else:\r\n ar[i] = i\r\n \r\nif n != 1 and n % 2 == 0:\r\n print(*ar)\r\nelse:\r\n print(-1)", "n=int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n list1=[ i for i in range(1,n+1) ]\r\n for i in range(0,n,2):\r\n list1[i],list1[i+1]=list1[i+1],list1[i]\r\n print(*list1)", "n=int(input())\r\nif(n%2!=0):\r\n print(-1)\r\nelse:\r\n l=[]\r\n for i in range(2, n+1, 2):\r\n l.append(str(i))\r\n l.append(str(i-1))\r\n print(' '.join(l))", "n=int(input())\r\na=2\r\nb=a-1\r\nif(n%2!=0):\r\n print('-1')\r\nelse:\r\n i=1\r\n while(i<=n/2):\r\n print(f'{a} {b}',end=' ')\r\n a=a+2\r\n b=a-1\r\n i=i+1", "n = int(input())\r\n\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n print(\"2 1\", end=' ')\r\n i=3\r\n while i <n:\r\n \r\n print(str(i + 1), str(i))\r\n i+=2\r\n \r\n print()", "n = int(input())\r\nprint(-1 if n & 1 else ' '.join([str(x+1) + ' ' + str(x) for x in range(1, n + 1, 2)]))", "def f(k, l=[]):\r\n\tfor i in range(1, k+1):\r\n\t\tl += [i]\r\n\t\tif not i%2:\r\n\t\t\tl[-1], l[-2] = l[-2], l[-1]\r\n\treturn l\r\n\r\nk = int(input())\r\nif k%2:\r\n\tprint(-1)\r\nelse:\r\n\tprint(*f(k))", "x=int(input())\r\nk=1\r\nl=[]\r\nif x%2!=0:\r\n\tprint(\"-1\")\r\nelse:\t\r\n\twhile k<=x:\r\n\t\tl.append(k+1)\r\n\t\tl.append(k)\r\n\t\tk+=2\r\n\tprint(*l)\t\r\n", "l = int(input())\r\n\r\np = [None] * l\r\n\r\nif l % 2 == 0:\r\n for i in range(int(l / 2)):\r\n # i = 0\r\n p[i] = l - i # p[0] = 100\r\n p[l - i - 1] = i + 1 # p[100] = 0\r\n\r\n o = \"\"\r\n for n in p:\r\n o += str(n) + \" \"\r\n\r\n print(o)\r\n\r\nelse:\r\n print(-1)\r\n", "input = int(input(''))\r\n\r\nif (input % 2) == 0:\r\n Output = set()\r\n for i in range(1,input+1):\r\n Output.add(i)\r\n t = list(Output)\r\n for index in range(0,len(t)-1,2):\r\n element = t[index]\r\n t[index] = t[index+1]\r\n t[index+1] = element\r\n listToStr = ' '.join([str(elem) for elem in t])\r\n print(listToStr)\r\nelse:\r\n print(-1)", "n = int(input())\r\n\r\nif n%2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(1, n+1):\r\n print(n-i+1 , end=' ')", "n = int(input())\r\nif n%2!=0:\r\n print(\"-1\")\r\nelse:\r\n i=1\r\n while i <n:\r\n print(i+1,i,end=\" \")\r\n i=i+2\r\n ", "#perfect permutation\r\nn = int(input())\r\nif(n%2 == 1):\r\n print(-1)\r\nelse:\r\n for i in range(0,n,2):\r\n print(i+2, i+1 , end =' ')\r\n ", "n = int(input()) \r\nresult = []\r\nt = 1\r\nif n %2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(1,n+1):\r\n if t:\r\n result.append(str(i+1))\r\n t-=1\r\n else: \r\n result.append(str(i-1))\r\n t+=1\r\n print(\" \".join(result))\r\n ", "k=int(input())\r\ns=''\r\nif k%2==1:\r\n print(-1)\r\nelse:\r\n for i in range(k):\r\n if i%2==0:\r\n s+=(str(i+2)+' ')\r\n else:\r\n s+=(str(i)+' ')\r\n print(s)\r\n", "# -- permutations create a list of 1 to x \r\n# values are integers and must not exceed x and are unique\r\n# look for permutations in which index i does not equal to the value\r\n# and that \r\n\r\nn = int(input())\r\n\r\nif n%2 != 0:\r\n print(\"-1\")\r\nelse:\r\n i = 2\r\n j = 1\r\n l = []\r\n for _ in range(int(n/2)):\r\n l.append(str(i))\r\n l.append(str(j))\r\n i += 2\r\n j += 2\r\n print(\" \".join(l))\r\n\r\n #pasted. invalid", "\r\nn = int(input())\r\n\r\ntry: \r\n ll = [i for i in range(1, n + 1)]\r\n\r\n for i in range(1, n + 1):\r\n ll[ll[i-1]] = i -1\r\n print(*[i + 1 for i in ll])\r\nexcept:\r\n print(-1)", "n = int(input( )) \r\nif n%2!=0 : \r\n print(-1) \r\nelse: \r\n print(\"2\" , end = \" \" )\r\n print(\"1\" , end = \" \") \r\n for i in range(3 , n , 2) : \r\n print(str(i+1)+\" \"+str(i) , end = \" \" ) \r\n \r\n \r\n ", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n res = list(range(1, n + 1))\r\n for i in range(0, n, 2):\r\n res[i], res[i + 1] = res[i + 1], res[i]\r\n print(*res)", "import math \r\ndef perfperms(n):\r\n if n%2!=0:\r\n return [-1]\r\n else:\r\n return [x for x in range(n,0,-1)]\r\nn=int(input())\r\nfor res in perfperms(n):\r\n print(res,end=\" \")", "#solution_pattern _only one is the perfect permumation, odd never possible , even order is ulta of each by two\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(i+1)\r\nif n%2==1:\r\n print (-1)\r\nelse :\r\n result=[]\r\n i=0\r\n while i <n:\r\n result.append(a[i+1])\r\n result.append(a[i])\r\n i=i+2\r\n string=\" \".join(str(e) for e in result)\r\n print (string)\r\n ", "t=int(input())\r\nif t%2!=0:\r\n print(-1)\r\nelse:\r\n ls=[i for i in range(1,t+1)]\r\n for i in range(0,t,2):\r\n ls[i],ls[i+1]=ls[i+1],ls[i]\r\n for i in ls:\r\n print(i,end=' ')", "n = int(input())\r\nq = []\r\nif n % 2 == 0:\r\n p = [i for i in range(1, n+1)]\r\n for i in range(0, n, 2):\r\n q.append(str(p[i+1]))\r\n q.append(str(p[i]))\r\n print(' '.join(q))\r\nelse: print(-1)", "n = int(input())\nif n & 1:\n print(-1)\nelse:\n temp = []\n i = 1\n while n >= i:\n temp.append(i)\n i += 1\n i = 1\n while i<n:\n temp[i] , temp[i-1] = temp[i-1] , temp[i]\n i += 2\n for i in temp:\n print(i,end=\" \")", "a = int(input());\r\nif a %2: print('-1')\r\nelse:\r\n for i in range(1, a + 1, 2):\r\n print(i + 1, end = \" \"); print(i, end = \" \")", "inp = int(input())\r\ni = 1\r\nif(inp % 2 != 0):\r\n print(\"-1\")\r\nelse:\r\n while i < inp+1:\r\n print(i+1, i, end=\" \")\r\n i += 2\r\n", "n = int(input())\r\noutput = []\r\nif n%2 != 0:\r\n print(\"-1\")\r\nelse:\r\n for i in range(2,n+1,2):\r\n output.append(str(i))\r\n for i in range(1,n+1,2):\r\n output.insert(i,str(i))\r\n \r\nfinal = ' '.join(output)\r\nprint(final)\r\n\r\n\r\n", "n = int(input())\r\ns = \"\"\r\nimport random\r\nif n%2!=0 or n==0:\r\n print(-1)\r\nelse:\r\n L = []\r\n for i in range(1,n+1):\r\n L.append(i)\r\n for j in range(0,len(L),2):\r\n L[j],L[j+1] = L[j+1],L[j]\r\n for i in L:\r\n s = s +str(i)+\" \" \r\n print(s)", "n = int(input().strip())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n arr = []\r\n for i in range(1, n+1, 2):\r\n arr.append(i+1)\r\n arr.append(i)\r\n for a in arr:\r\n print(a, end=\" \")\r\n", "n=int(input())\r\nif n%2:print(-1)\r\nelse:\r\n for i in range(2,n+1,2):\r\n print(i,i-1,end=' ')", "n = (int)(input())\r\nif n % 2:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if i % 2:\r\n print(i, end = ' ')\r\n else: print(i + 2, end = ' ')", "n=int(input())\r\ntemp=[i for i in range(1,n+1)]\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n i=0\r\n j=1\r\n while j<n:\r\n temp[i],temp[j]=temp[j],temp[i]\r\n i+=2\r\n j+=2\r\n for i in temp:\r\n print(i,end=' ')\r\n ", "n = int(input())\r\ni=0\r\nif n%2==0:\r\n li = [x for x in range(1,n+1)]\r\n while i<n:\r\n if(i+1<n):\r\n li[i],li[i+1]=li[i+1],li[i]\r\n i+=2\r\n for i in li:\r\n print(i,end=\" \")\r\nelse:\r\n print(-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=int(input())\nif n%2==1:\n print(-1)\nelse:\n for i in range(1,n+1,2):\n print(i+1,i,end=' ')\n \n \n", "\r\nfrom collections import defaultdict, deque\r\nimport collections, math\r\nfrom concurrent.futures import thread\r\nimport heapq\r\nfrom operator import indexOf\r\nimport sys, threading\r\nmod = 1000000007\r\nimport math\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split())) \r\n\r\ndef run():\r\n n = get_int()\r\n if n % 2 != 0:\r\n print(\"-1\")\r\n else:\r\n ans = []\r\n left = 1\r\n right = 2\r\n \r\n while right <= n:\r\n ans.append(right)\r\n ans.append(left)\r\n \r\n left += 2\r\n right += 2\r\n print(*ans)\r\n \r\nif __name__ == '__main__':\r\n threading.stack_size(1 << 27)\r\n sys.setrecursionlimit(1 << 30)\r\n main_thread = threading.Thread(target=run)\r\n main_thread.start()\r\n main_thread.join()", "n = int(input())\r\na = [i for i in range(1, n+1)]\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(0,len(a),2):\r\n a[i], a[i+1] = a[i+1], a[i]\r\n print(*a)\r\n", "t=int(input())\r\nl=[]\r\nif t%2==0:\r\n for i in range(1,t,2):\r\n l.append(i+1)\r\n l.append(i)\r\n print(*l,sep=\" \")\r\nelse:\r\n print('-1')", "n=int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n x=i+1\r\n if x%2!=0:\r\n print(x+1,end=\" \")\r\n else:\r\n print(x-1,end=\" \")\r\n print()\r\n\r\n \r\n", "n = int(input())\r\nres = ''\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(1, n, 2):\r\n res = res + str(i+1) + \" \" + str(i) + \" \"\r\nprint(res)\r\n", "n=int(input())\r\nl=[]\r\nif n==1 or n==0:\r\n print(-1)\r\nelse:\r\n \r\n \r\n for i in range(n,0,-1): l.append(i)\r\n #print(l[n//2],(n//2)+1)\r\n if l[n//2]==(n//2)+1:\r\n print(-1)\r\n else:\r\n print(*l)\r\n ", "n = int(input())\nif n%2 ==1:\n print(-1)\nelse:\n lst = [i+1 for i in range(n)]\n for i in range(n):\n if i %2 == 1:\n lst[i],lst[i-1] = lst[i-1],lst[i]\n print(*lst)\n", "n=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n print(n-i , end=' ')", "n=int(input())\r\na=[]\r\nb=2\r\nif n%2==0:\r\n for i in range(1,n//2+1):\r\n a.append(i*2)\r\n a.append(i*2-1)\r\n print(*a)\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nif(n%2==1):\r\n print(\"-1\")\r\nelse:\r\n i = 1\r\n while i < n:\r\n print(i+1, end=\" \")\r\n print(i, end=\" \")\r\n i+=2\r\n ", "# 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, l, c, d, p, nl, np = inp[0], inp[1], inp[2], inp[3], inp[4], inp[5], inp[6], inp[7]\r\n # a = input()\r\n # q = input()\r\n # r = [int(x) for x in input().split()]\r\n if n % 2 != 0:\r\n print(-1)\r\n else:\r\n for i in range(n, 0, -1):\r\n print(i, end=' ')\r\n tc -= 1\r\n", "\nn = int(input())\n\nif n % 2 != 0:\n print(-1)\nelse:\n a = 2\n b = 1\n for i in range(0, n, 2):\n print(a, b, end=' ')\n a += 2\n b += 2\n", "# 코드포스 233A Perfect Permutation\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nn = int(put())\r\n\r\nif n % 2:\r\n print(-1)\r\n\r\nelse:\r\n answer = []\r\n for i in range(0, n, 2):\r\n answer.extend([str(i+2), str(i+1)])\r\n\r\n print(' '.join(answer))", "def generate_perfect_permutation(n):\r\n # Check if a perfect permutation is possible\r\n if n % 2 == 1:\r\n return [-1]\r\n \r\n # Generate the perfect permutation\r\n permutation = list(range(1, n+1))\r\n for i in range(0, n, 2):\r\n permutation[i], permutation[i+1] = permutation[i+1], permutation[i]\r\n \r\n return permutation\r\n\r\n# Read the input value\r\nn = int(input())\r\n\r\n# Generate the perfect permutation\r\npermutation = generate_perfect_permutation(n)\r\n\r\n# Output the result\r\nprint(*permutation)\r\n", "n=int(input())\r\nif n%2:print(-1)\r\nelse:\r\n for i in range(1,n+1):\r\n if i%2:print(i+1,end=' ')\r\n else:print(i-1,end=' ')\r\n", "def per_perm(n):\n if n % 2 == 1:\n return -1\n else:\n permutation = [i for i in range(1, n+1)]\n for i in range(0, n, 2):\n permutation[i], permutation[i+1] = permutation[i+1], permutation[i]\n return permutation\n\nn = int(input())\nresult = per_perm(n)\nif result == -1:\n print(result)\nelse:\n for i in result:\n print(i, end=' ')\n\n\t \t\t\t\t \t \t\t\t\t\t \t \t\t\t \t \t\t\t\t", "#t = int(input())\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n\r\n if n % 2:\r\n print(-1)\r\n\r\n else:\r\n for i in range(n // 2):\r\n print(2* i+ 2, 2*i + 1, end = ' ')\r\n\r\n ", "def solve(n):\r\n permutation = []\r\n for i in range(1, n + 1):\r\n if i % 2:\r\n if (i + 1) <= n:\r\n permutation.append(str(i + 1))\r\n else:\r\n permutation.append(str(i - 1))\r\n \r\n return \" \".join(permutation) if len(permutation) == n else -1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n permutation = solve(n)\r\n\r\n print(permutation)\r\n", "n = int(input())\r\n\r\npermutation = [0] * n\r\n\r\ncurrent_num = list(range(1, n+1))\r\n\r\nif n % 2:\r\n print(\"-1\")\r\nelse:\r\n while current_num:\r\n for i, num in enumerate(permutation):\r\n if num:\r\n permutation[num-1] = i+1\r\n current_num.pop(0)\r\n elif not num and i+1 != current_num[0]:\r\n permutation[i] = current_num[0]\r\n current_num.pop(0)\r\n elif i+2 != current_num[0] and not permutation[i+1]:\r\n permutation[i+1] = current_num[0]\r\n current_num.pop(0)\r\n\r\n print(' '.join(map(str, (permutation))))\r\n", "n = int(input(\"\"))\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n i = 1\r\n while i < n:\r\n print(i+1,i, end=\" \")\r\n i += 2", "n=int(input())\r\nif n%2==0:\r\n ans=''\r\n for i in range(1,n+1):\r\n if i%2:\r\n ans+=str(i+1)+' '\r\n else:\r\n ans+=str(i-1)+' '\r\nelse:\r\n ans='-1'\r\nprint(ans)\r\n \r\n\r\n", "s=int(input())\r\nif s%2==0:\r\n for i in range(s,0,-1):\r\n print(i,end=\" \")\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n l=[]\r\n for i in range(n//2):\r\n l.append(2*i + 2)\r\n l.append(2*i + 1)\r\n print(*l)", "x=int(input())\r\nif x%2!=0:\r\n print(\"-1\")\r\nelse:\r\n a=[\"\"]*x\r\n for i in range(1,x,2):\r\n a[i]=i\r\n for i in range(2,x+1,2):\r\n a[i-2]=i\r\n for i in a:\r\n print(i,end=\" \")", "def perfect_permutation():\r\n n = int(input())\r\n if n%2 == 1:\r\n print(-1)\r\n else:\r\n for i in range (1,n+1,2):\r\n print(i+1,i,end=' ')\r\n print()\r\nperfect_permutation()\r\n", "n = int(input())\r\nif n % 2 != 0:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(0,n+1,2):\r\n\t\tif i == 0:\r\n\t\t\tcontinue\r\n\t\tprint(i, i-1,end=' ')\r\n\r\n", "\r\nn = int(input())\r\n\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n arr = [0] * n\r\n for i in range(n // 2 + 1):\r\n arr[i] = n-i\r\n arr[n-1-i] = i + 1\r\n print(*arr, sep=' ')", "n=int(input())\r\nif n%2==0:\r\n x=n\r\n for x in range(1,x,2):\r\n print(x+1,end=\" \")\r\n print(x,end=\" \")\r\nelse:\r\n print(-1)", "n=int(input())\na=[]\nif n%2:a.append(-1)\nelse:\n for i in range(2,n+1,2):\n a.append(i);a.append(i-1)\nprint(*a)\n\t \t\t \t\t \t\t \t \t \t\t\t\t", "n = int(input())\r\nper = []\r\nif n % 2 == 0:\r\n for i in range(1,n+1,2):\r\n per.append(i+1)\r\n per.append(i)\r\n print(*per)\r\nelse:\r\n print(-1)", "n = int(input())\r\n\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n a = {}\r\n for x in range(1, n+1):\r\n a[x] = x\r\n for i in range(1, len(a)):\r\n if 2*i <= len(a):\r\n a[2*i], a[2*i-1] = a[2*i-1], a[2*i]\r\n for item in range(1, len(a)+1):\r\n print(a[item], end=\" \")\r\n", "n=int(input())\r\nif (n%2==0):\r\n for i in range (1,int(n/2)+1):\r\n print(2*i,2*i -1 , end=\" \")\r\nelse:\r\n print('-1')\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nif n % 2 > 0:\r\n print (-1)\r\nelse:\r\n list = [x+1 for x in range(n)]\r\n list.sort(reverse=True)\r\n # midpoint = (n/2)-1\r\n # for index, item in enumerate(list):\r\n # neg_index = (index*-1)-1\r\n # if index<=midpoint:\r\n # list[index], list[neg_index]=list[neg_index], list[index]\r\n print(*list, sep=\" \")", "###Author : Pubudu Anuradha\r\nimport sys\r\nsys.setrecursionlimit(10**9)\r\ndef cin(datatype):\r\n return datatype(sys.stdin.readline())\r\ndef spin(datatype,retype=None):\r\n if(retype is None):\r\n return map(datatype,sys.stdin.readline().split())\r\n return retype(map(datatype,sys.stdin.readline().split()))\r\n\r\nn = cin(int)\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n for i in range(1,n+1,2):\r\n print(i+1,i,end=' ')\r\n\r\n", "# 2 1 4 3\n# 3 4 1 2\n\nsize = int(input())\n\ndef perfect_permutation(num):\n if size % 2 != 0:\n print(\"-1\")\n return\n out = \"\"\n for i in range(0, size, 2):\n out = out + f\"{i+2} {i+1} \"\n print(out.strip())\n\nperfect_permutation(size)\n", "n=int(input())\r\nl1=[]\r\nif((n%2)!=0):\r\n print(-1)\r\nelse:\r\n for i in range(1,n+1):\r\n l1.append(i)\r\n l1.reverse()\r\n for i in l1:\r\n print(i,end=\" \")", "n = int(input())\r\nif n%2!=0:\r\n print(\"-1\")\r\nelse:\r\n permutation = list(range(1, n+1))\r\n for i in range(1, n, 2):\r\n permutation[i], permutation[i-1] = permutation[i-1], permutation[i]\r\n for num in permutation:\r\n print(num, end=' ')\r\n", "#233A\r\ndef solve(n):\r\n pass\r\nn=int(input())\r\nif n<1 or n%2!=0:print(-1)\r\nelse:\r\n l=[int(i) for i in range(1,n+1)]\r\n l=l[::-1]\r\n print(*l,end=\" \")\r\n \r\n", "n = int(input())\r\n\r\nresult = [str(x) for x in range(1, n + 1)]\r\n\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(0, n, 2):\r\n result[i], result[i + 1] = result[i + 1], result[i]\r\n print(' '.join(result))\r\n\r\n", "n = int(input())\r\nlst = [0] * n\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n lst[i] = i+2\r\n else:\r\n lst[i] = i\r\n print(' '.join(str(i) for i in lst))", "while True:\r\n try:\r\n n=int(input())\r\n if n%2!=0:\r\n print(-1)\r\n else:\r\n list=[]\r\n for i in range(n):\r\n list.append(i+1)\r\n for i in range(0,n,2):\r\n temp=list[i]\r\n list[i]=list[i+1]\r\n list[i+1]=temp\r\n print(*list)\r\n except:\r\n break", "a=int(input())\r\nif a%2: print(-1)\r\nelse:\r\n for x,y in zip([i for i in range(1,a+1)if i%2],[i for i in range(1,a+1)if i%2==0]):\r\n print(y,x,end=' ')", "n=int(input())\r\nlist_1=[]\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n for i in range(1,n+1):\r\n list_1.append(i)\r\n i=0\r\n while i<len(list_1):\r\n key=list_1[i]\r\n list_1[i]=list_1[i+1]\r\n list_1[i+1]=key\r\n i+=2\r\n print(*list_1) ", "from itertools import chain\r\nfrom sys import stdout\r\npermutation_size = int(input())\r\nif permutation_size % 2:\r\n stdout.write(\"-1\\n\")\r\nelse:\r\n stdout.write(\r\n \" \".join(\r\n map(\r\n str,\r\n chain(\r\n range(permutation_size // 2 + 1, permutation_size + 1),\r\n range(1, permutation_size // 2 + 1),\r\n \"\\n\"\r\n )\r\n )\r\n )\r\n )", "def readNum():\r\n num = int(input())\r\n return num\r\n\r\n\r\ndef createPerm():\r\n num = readNum()\r\n mas = []\r\n if num % 2 == 1: print(\"-1\")\r\n else:\r\n for i in range(1, num + 1):\r\n if i % 2 == 1:\r\n mas.append(i + 1)\r\n else:\r\n mas.append(i - 1)\r\n return mas\r\n\r\n\r\ndef printMas ():\r\n mas = createPerm()\r\n for i in range(len(mas)):\r\n print(mas[i], ' ', end=\"\")\r\n \r\n\r\n\r\nprintMas() \r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n ans=[str(i) for i in range(1,n+1)]\r\n for j in range(0,n,2):\r\n ans[j],ans[j+1]=ans[j+1],ans[j]\r\n print(' '.join(ans))\r\n\r\n\r\n", "n = int(input())\r\nif n%2:\r\n print(-1)\r\n exit()\r\nfor i in range(2,n+1,2):\r\n print(i,i-1, end=' ') ", "n = int(input())\r\nif n%2:\r\n print(-1)\r\nelse:\r\n print(*[str(i+1)+' '+str(i) for i in range(1,n,2)])\r\n", "#https://codeforces.com/problemset/problem/233/A\r\nn =int(input())\r\nif n&1:\r\n print(-1)\r\nelse:\r\n l=[]\r\n for i in range(1,n+1,2):\r\n l.append(i+1)\r\n l.append(i)\r\n for i in l:\r\n print(i,end=\" \")\r\n ", "n=int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n list1=[i for i in range (1,n+1)]\r\n g=0\r\n while g<len(list1):\r\n if g%2==0:\r\n temp=list1[g]\r\n list1[g]=list1[g+1]\r\n list1[g+1]=temp\r\n g+=1\r\n print(*list1)", "n=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n t=''\r\n for i in range(1,n+1):\r\n if i%2==1:\r\n t+=str(i+1)+' '\r\n else:\r\n t+=str(i-1)+' '\r\n print(t)\r\n \r\n", "# import itertools\n\n\ndef main():\n n = int(input())\n if n % 2 == 1:\n print(\"-1\")\n return\n r = range(1, n + 1, 2)\n val = []\n for i in r:\n val += [str(i + 1), str(i)]\n print(\" \".join(val))\n\n\nif __name__ == \"__main__\":\n main()\n", "x=int(input())\r\nif x%2: print(-1)\r\nelse: print(*(list(range(x,0,-1))))", "n=int(input())\r\nif n%2==0:\r\n p=list(range(1,n+1))\r\n for i in range(1,n,2):\r\n p[i-1],p[i]=p[i],p[i-1]\r\n for x in p: print (x,end=\" \")\r\nelse:\r\n print(-1)", "x = int(input())\r\nz = [i for i in range(1 , x + 1)]\r\ny = list(z)\r\nif x % 2 == 0:\r\n for i in range(0,x,2):\r\n z[i] = y[i+1]\r\n z[i+1] = y[i]\r\n for i in z:\r\n print(i,end=\" \")\r\nelse:\r\n print(-1)\r\n#print(z)", "n=int(input())\r\nj=2\r\nif(n%2!=0):\r\n print(\"-1\")\r\nelse:\r\n print(j,end=\"\")\r\n for i in range(n-1):\r\n \r\n if(i%2==0):\r\n j-=1\r\n else:\r\n j+=3\r\n print(f' {j}',end=\"\")\r\n ", "T = int(input())\r\nif (T % 2 == 1):\r\n print(\"-1\")\r\nelse:\r\n for i in range(1, T + 1):\r\n if(i % 2 == 0):\r\n print(i - 1, end=\" \")\r\n else:\r\n print(i + 1, end=\" \")\r\n\r\n\r\n\t\t\t\t \t\t\t \t \t\t\t\t \t\t \t\t \t \t\t\t", "n = int(input())\r\n\r\nif (n % 2) == 1:\r\n\tprint(-1)\r\nelse:\r\n\ti = 1\r\n\twhile i <= n:\r\n\t\tif i == (n-1):\r\n\t\t\tprint(f\"{i + 1} {i}\")\r\n\t\telse:\r\n\t\t\tprint(f\"{i + 1} {i}\", end=\" \")\r\n\t\ti += 2", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n nchet = [2*i+1 for i in range(n//2)]\r\n chet = [2*(i+1) for i in range(n//2)]\r\n l = []\r\n for i in range(n//2):\r\n l.append(chet[i])\r\n l.append(nchet[i])\r\n \r\n print(' '.join(map(str, l)))", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n a = [[i, i - 1] for i in range(2, n + 1, 2)]\r\n for i in a:\r\n print(*i, end = ' ')", "permutation_size = int(input())\n\nif permutation_size % 2 == 1:\n print('-1')\nelse:\n lst = []\n for i in range(1, permutation_size + 1, 2):\n lst.append(i + 1)\n lst.append(i)\n print(*lst)", "import random\r\nn =int(input())\r\nif n%2==0:\r\n l = [x for x in range(1,n+1)]\r\n for j in range(0,n,2):\r\n l[j],l[j+1]=l[j+1],l[j]\r\n print(*l,sep=\" \")\r\nelif n%2!=0:\r\n print(-1)", "n=int(input())\r\nif n%2==0:\r\n a=list(range(1,n+1))\r\n for i in range(n//2): a[2*i],a[2*i +1] = a[2*i + 1],a[2*i]\r\n print(*a)\r\nelse: print(-1)\r\n", "import sys\r\n\r\nINF = 2e18 + 99\r\n\r\nn = int(input())\r\n\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n print(\"2 1\", end=' ')\r\n for i in range(3, n, 2):\r\n print(i+1, i, end=' ')\r\n print()\r\n\r\nsys.stdout.flush()\r\n", "from sys import stdin, stdout\r\nnum =int(stdin.readline())\r\nif num%2 != 0:\r\n stdout.write(str(-1))\r\nelse:\r\n for i in range(1,num+1):\r\n if i%2 == 0:\r\n stdout.write(str(i-1)+\" \")\r\n else :\r\n stdout.write(str(i+1)+\" \")\r\n", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\n# n, m = map(, int)\r\n\"\"\"\r\n7\r\n10 10 58 31 63 40 76\r\n\r\n4\r\n33 44 11 22\r\n\r\n84\r\n92 95 84 85 94 80 90 86 80 92 95 84 86 83 86 83 93 91 95 92 84 88 82 84 84 84 80 94 93 80 94 80 95 83 85 80 95 95 80 84 86 92 83 81 90 87 81 89 92 93 80 87 90 85 93 85 93 94 93 89 94 83 93 91 80 83 90 94 95 80 95 92 85 84 93 94 94 82 91 95 95 89 85 94\r\n\"\"\"\r\nn = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n ans = \"\"\r\n i = 1\r\n while i <= n:\r\n ans += str(i+1) + \" \" + str(i) + \" \"\r\n i += 2\r\n print(ans[:-1])", "n=int(input())\r\nans = [x+1 for x in range(n+1)]\r\nif n%2==1:\r\n\tprint(-1)\r\nelse:\r\n\tfor x in range(1,n+1):\r\n\t\tans[ans[x]]=x\r\n\r\n\tprint(*ans[1:])\r\n", "n = int(input())\nif n%2 == 1:\n\tprint(-1)\nelse:\n\tcurr = 2\n\tstart = 1\n\tans = []\n\tfor i in range(n):\n\t\tif i%2 == 0:\n\t\t\tans.append(curr)\n\t\t\tcurr+=2\n\t\telse:\n\t\t\tans.append(start)\n\t\t\tstart+=2\n\tprint(*ans)\n\n \t \t \t \t\t \t\t\t\t\t\t", "n = int(input())\r\nif n%2:\r\n print(-1)\r\n exit()\r\nl1 = [str(i) for i in range(2,n+1,2)]\r\nl2 = [str(i) for i in range(1,n+1,2)]\r\ns = ''\r\nfor i in range(n//2):\r\n s+=l1[i] + ' ' + l2[i] + ' ' \r\nprint(s)", "def main():\r\n n = int(input())\r\n if n % 2 == 1:\r\n print(-1)\r\n return 0\r\n lst = [int(x) for x in range(1, n + 1)]\r\n for i in range(1, n + 1, 2):\r\n print(lst[i], lst[i - 1], end=\" \")\r\n\r\n\r\nmain()\r\n", "n = int(input())\narr =[]\nif n % 2 == 0:\n for i in range(1, n+1):\n if i % 2 != 0:\n arr.append(i+1)\n else:\n arr.append(i-1)\n for i in arr:\n print(i, end=' ')\nelse:\n print(-1)\n", "n = int(input())\r\nif n % 2 == 1:\r\n print(\"-1\")\r\nelse:\r\n i = 1\r\n l = []\r\n for i in range(n):\r\n l.append(0)\r\n i=1\r\n\r\n while i < n:\r\n l[i - 1] = i + 1\r\n l[i] = i\r\n i += 2\r\n \r\n print(*l)\r\n", "a=int(input())\r\nif a%2==1:\r\n print(-1)\r\nelse:\r\n print(\"2 1\", end='')\r\n i=3\r\n while i<a:\r\n print(\" \"+str(i+1)+\" \"+str(i), end='')\r\n i=i+2", "n = int(input())\r\nif n%2: print(-1);exit(0)\r\n\r\nprint(\r\n *sum(zip(range(2,n+1,2),range(1,n+1,2)),())\r\n)", "n=int(input())\r\nif n%2:\r\n\tprint(-1)\r\nelse:\r\n\tl=[]\r\n\tfor i in range(1,n+1):\r\n\t\tl.append(i)\r\n\tfor i in range(0,n-1,2):\r\n\t\tl[i],l[i+1]=l[i+1],l[i]\r\n\tprint(*l)", "n = int(input())\r\n\r\n\r\ndef permutation():\r\n l = []\r\n temp = 0\r\n if n % 2 != 0:\r\n return -1\r\n for x in range(1, n + 1):\r\n l.append(x)\r\n\r\n for y in range(0, n - 1, 2):\r\n temp = l[y]\r\n l[y] = l[y + 1]\r\n l[y + 1] = temp\r\n\r\n return l\r\n\r\n\r\nout = permutation()\r\nif out == -1:\r\n print(-1)\r\nelse:\r\n for z in out:\r\n print(z, end=\" \")", "n = int(input())\r\nm = n + 1\r\na = []\r\nif n % 2 != 0 :\r\n print(-1)\r\nelse:\r\n for i in range(1,m):\r\n if i % 2 == 0:\r\n a.append(i - 1)\r\n else:\r\n a.append(i + 1)\r\nfor i in range(len(a)):\r\n print(a[i],end=\" \")", "n = int(input())\nif n % 2 == 1:\n print(-1)\n exit()\nfor i in range(1, n, 2):\n print(i + 1, i, end=\" \")\nprint()\n", "p=int(input())\r\nif p%2!=0:\r\n print(-1)\r\nelse:\r\n i = 1\r\n while i <=p :\r\n if i%2!=0:\r\n v=i\r\n else:\r\n print(f'{i} {v}',end=' ')\r\n i += 1", "n = int(input())\r\nlst = [0] * n\r\nif n % 2 != 0:\r\n print(\"-1\")\r\nelse:\r\n for i in range(0, n):\r\n if i % 2 == 0:\r\n lst[i+1] = i + 1\r\n else:\r\n lst[i-1] = i + 1\r\n finLst = [str(x) for x in lst]\r\n print(\" \".join(finLst))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\n\r\nn = int(input())\r\n\r\n\r\n\r\nif n%2:\r\n print(-1)\r\nelse:\r\n\r\n t=[0]*n\r\n\r\n for i in range(n):\r\n if i%2==0:\r\n t[i]=i+2\r\n else:\r\n t[i]=i\r\n print(*t)\r\n \r\n", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n numbers = list(range(1,n+1))\r\n i = 0\r\n while i <= n-1:\r\n x = numbers[i]\r\n numbers[i] = numbers[i+1]\r\n numbers[i+1] = x\r\n i += 2\r\n for var in numbers:\r\n print(var,end=' ')", "n = int(input())\r\n\r\nif n & 1:\r\n\r\n print(-1)\r\n\r\nelse:\r\n\r\n ret = [-1]\r\n\r\n for i in range(1, n + 1, 2):\r\n\r\n ret.append(i + 1)\r\n ret.append(i)\r\n\r\n print(*ret[1:])\r\n", "n = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n f = 0\r\n x = []\r\n for i in range(1, n + 1):\r\n if f == 0:\r\n x.append(i + 1)\r\n f = 1\r\n else:\r\n x.append(i - 1)\r\n f = 0\r\n print(*x)", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n a = []\r\n c = [0]*n\r\n for x in range(1, n+1):\r\n a.append(x)\r\n for i in range(1,n,2):\r\n b = a[i]\r\n c[i] = a[i-1]\r\n c[i-1] = b\r\n print(*c, sep=' ')\r\n", "n=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n a=[i for i in range(1,n+1) if i%2==0]\r\n b=[i for i in range(1,n+1) if i%2==1]\r\n for j in range(len(a)):\r\n print(a[j],end=\" \")\r\n print(b[j],end=\" \")\r\n print()\r\n", "def main():\r\n n=int(input())\r\n for i in range (1,n+1,2):\r\n if n%2!=0:\r\n print (-1)\r\n return\r\n p1=i\r\n p2=i+1\r\n print (f'{p2} {p1}', end=' ')\r\nmain ()\r\n", "n = int(input())\r\nif(n&1):\r\n print(-1)\r\nelse:\r\n llist = [i for i in range(1,n+1)]\r\n for i in range(0,n,2):\r\n print(llist[i+1], llist[i],end=\" \")\r\n", "n,string=int(input()),\"\"\r\nif n%2!=0:\r\n print(\"-1\")\r\nelse:\r\n for i in range(0,n):\r\n string+=str(n-i)+\" \"\r\n print(string)", "n = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n l = [i for i in range(1, n+1)]\r\n l.sort()\r\n for i in range(0, len(l), 2):\r\n print(l[i+1], l[i], end=' ')", "a=int(input())\r\nif a%2==1:\r\n print(-1)\r\nelse:\r\n i=1\r\n while i<a:\r\n print(str(i+1)+\" \"+str(i), end=' ')\r\n i=i+2\r\n ", "n = int(input())\r\nstr1 = \"\"\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(2,n+1,2):\r\n str1 += \"{0} {1} \".format(str(i), str(i - 1))\r\n str1.strip()\r\n print(str1)", "n = int(input())\r\nls = []\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n for i in range(1, n+1):\r\n ls.append(i)\r\nfor i in range(0, len(ls), 2):\r\n ls[i], ls[i+1] = ls[i+1], ls[i]\r\n\r\nprint(\" \".join(str(x) for x in ls))", "def main():\r\n n = int(input())\r\n if n % 2 == 1:\r\n print(-1)\r\n else:\r\n res = [\"2\", \"1\"]\r\n for i in range(3, n, 2):\r\n res.append(str(i+1))\r\n res.append(str(i))\r\n print(\" \".join(res))\r\n \r\n \r\nmain()", "n = int(input())\r\n\r\nif n % 2 == 0:\r\n print(*list(range(n,0,-1)))\r\nelse:\r\n print(-1)", "n=int(input())\r\nif n%2!=0:\r\n print('-1')\r\nelse:\r\n s=list(range(1,n+1))\r\n for i in range(0,n-1,2):\r\n s[i],s[i+1]=s[i+1],s[i]\r\n print(*s)\r\n", "\"\"\"\nA permutation is a sequence of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. Let's denote the i-th element of permutation p as pi. We'll call number n the size of permutation p1, p2, ..., pn.\n\nNickolas adores permutations. He likes some permutations more than the others. He calls such permutations perfect. A perfect permutation is such permutation p that for any i (1 ≤ i ≤ n) (n is the permutation size) the following equations hold ppi = i and pi ≠ i. Nickolas asks you to print any perfect permutation of size n for the given n.\n\nInput\nA single line contains a single integer n (1 ≤ n ≤ 100) — the permutation size.\n\nOutput\nIf a perfect permutation of size n doesn't exist, print a single integer -1. Otherwise print n distinct integers from 1 to n, p1, p2, ..., pn — permutation p, that is perfect. Separate printed numbers by whitespaces.\n\"\"\"\ndef main(size):\n if size % 2 == 1:\n print(\"-1\")\n else:\n result = \"\"\n for idx in range(1, size + 1):\n if idx % 2 == 1:\n result += str(idx + 1)+\" \"\n else:\n result += str(idx - 1)+\" \"\n print(result)\n return\n\n\nif __name__ == \"__main__\":\n permutation_size = int(input())\n main(permutation_size)", "n=int(input())\r\nif n%2==1 :\r\n print(-1)\r\n exit(0)\r\n\t\r\nwhile n!=0:\r\n print (n ,\"\",end = \"\")\t\r\n n-=1", "num=input()\r\nasw=[]\r\nnum=int(num)\r\nif num%2==0:\r\n for i in range(1,num//2+1):\r\n asw.append(2*i)\r\n asw.append(2*(i-1)+1)\r\n for x in asw:\r\n print(x,end=' ')\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\n\r\no = []\r\n\r\nif n%2 != 0:\r\n o.append(-1)\r\nelse:\r\n while len(o) != n:\r\n o.append(len(o) + 2)\r\n o.append(len(o))\r\n\r\noutput = ''\r\n\r\nfor i in o:\r\n output += str(i) + ' '\r\n\r\nprint(output)", "n = int(input())\r\nif(n % 2 != 0):\r\n print(-1)\r\nelse:\r\n l = \"\"\r\n i = 0\r\n while(i < n):\r\n l+= str(i + 2) + \" \" + str(i +1)+ \" \"\r\n i += 2 \r\n print(l[:-1])\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n", "n = int(input())\n\nres = ''\nif n&1 == 1:\n print(-1)\nelse:\n i = 1\n while True:\n res += str(i+1)\n res += ' '\n res += str(i)\n i += 2\n if i > n:\n break\n res += ' '\n\nprint(res)\n", "n = int(input())\nif n%2==0:\n a = [str(x-1) if x%2==0 else str(x+1) for x in range(1,n+1)]\n print(\" \".join(a))\nelse:\n print(\"-1\")\n", "x=int(input())\r\nif x%2==0:\r\n a,b=1,-1\r\n for i in range(1,x+1):\r\n print(i+a,end=' ')\r\n a,b=b,a\r\nelse:\r\n print(-1)", "n = int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n i=0\r\n k=2\r\n z=1\r\n for i in range(n//2):\r\n print(i+k,i+z,end=\" \")\r\n k+=1\r\n z+=1", "n = int(input())\r\nif n%2&1:\r\n print(\"-1\")\r\nelse:\r\n arr = list(range(1, n+1))\r\n for i in range(0, n, 2):\r\n arr[i], arr[i+1] = arr[i+1], arr[i]\r\n for i in arr:\r\n print(str(i), end=\" \")\r\n\r\n\r\n", "if __name__ == \"__main__\":\n n = int(input().strip())\n if (n % 2 != 0):\n print('-1')\n else:\n un = 2\n out = '2 '\n for i in range(1, n):\n if (i % 2 == 0):\n un += 3\n elif (i % 2 != 0):\n un -= 1\n out += str(un) + ' '\n print(out.strip())\n\t \t\t \t \t\t\t \t \t \t \t \t\t\t\t", "def perfectPermutations(n):\r\n if n % 2 != 0:\r\n return\r\n p = [0]*(n + 1)\r\n for i in range(1, n):\r\n if p[i] == 0:\r\n p[i] = i + 1\r\n p[i + 1] = i\r\n return p[1:]\r\nn = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n print(*perfectPermutations(n))\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nn = int(input())\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(1, n + 1, 2):\r\n print(i + 1, i, end = ' ')\r\n", "n=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n x=[i+1 for i in range(n)]\r\n i=0\r\n while(i<n):\r\n temp=str(x[i])\r\n x[i]=str(x[i+1])\r\n x[i+1]=temp\r\n i+=2\r\n print(' '.join(x))", "k=int(input())\r\nj=1\r\nif(( k==1 )or( k%2!=0)):\r\n print(-1)\r\nelse:\r\n while(j<k):\r\n print(j+1,j,end=' ')\r\n j+=2\r\n", "n=int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n l=[]\r\n for x in range(1,n+1):\r\n l.append(x)\r\n for x in range(0,len(l),2):\r\n l[x],l[x+1]=l[x+1],l[x]\r\n for x in l:\r\n print(x,end=' ')\r\n ", "y = int(input()) \r\nstring = \"\" \r\nif y % 2 == 0 and y != 1: \r\n\tfor c in range(1, y, 2): \r\n\t\tstring = string + \" \" + str(c + 1) \r\n\t\tstring = string + \" \" + str(c) \r\n\tprint(string[1:]) \r\nelse: \r\n\tprint(-1)", "n=int(input())\r\nif n%2!=0:\r\n print(f'-1')\r\nif n%2==0:\r\n if n >=2:\r\n i=1\r\n while i <=n:\r\n print(n, end=' ')\r\n n=n-1", "l = [x+1 for x in range(0,int(input()))]\r\nif len(l)%2 != 0: print(-1)\r\nelse:print(*l[::-1])", "n=int(input())\r\narr=[]\r\nif n%2==0:\r\n for i in range(2,n+1,2):\r\n arr.append(i)\r\n arr.append(i-1)\r\n \r\n print(*arr)\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", "n = int(input())\r\np = list(range(1, n+1))\r\nif n%2==1:\r\n print(\"-1\")\r\nelse:\r\n new = p[::-1]\r\n print(\" \".join([str(x) for x in new]))\r\n", "n = int(input())\r\nif n % 2 != 0:\r\n\tprint(-1)\r\nelse:\r\n\tfor i in range(2,n+1,2):\r\n\t\tprint(i, i-1,end=' ')", "num_permuations = int(input())\r\nif num_permuations % 2 != 0:\r\n print(-1)\r\nelse:\r\n nums = []\r\n for num in range(num_permuations,0,-1):\r\n nums.append(str(num))\r\n print(' '.join(nums))\r\n", "t = int(input())\r\nif t % 2 == 1:\r\n print(-1)\r\nelse:\r\n for _ in range(1, t + 1):\r\n print(_ + 1 if (_ % 2 == 1) else _ - 1)\r\n", "data = int(input())\nif data % 2 == 1:\n print(-1)\nelse:\n result = ''\n for i in range(1, data + 1):\n if i % 2 != 0:\n result += str(i + 1)\n else:\n result += str(i - 1)\n result += ' '\n print(result)\n", "n = int(input())\r\nif n % 2 == 1: # If n is odd, a perfect permutation is not possible\r\n print(-1)\r\nelse:\r\n permutation = list(range(1, n+1)) # Create a list of integers from 1 to n\r\n for i in range(0, n, 2): # Swap the elements at even positions with the next odd position\r\n permutation[i], permutation[i+1] = permutation[i+1], permutation[i]\r\n print(\" \".join(map(str, permutation))) # Convert the list to string and print it", "n = int(input())\r\n\r\nif n % 2 != 0:\r\n print(\"-1\")\r\nelse:\r\n perm = list(range(1,n+1))\r\n\r\n for i in range(0,n,2):\r\n perm[i], perm[i+1] = perm[i+1], perm[i]\r\n print(' '.join(map(str, perm)))", "n = int(input())\nif n%2==0:\n x = 2\n for i in range(n//2):\n for j in range(2):\n print(f\"{x-j}\",end =' ')\n x +=2\nelse:\n print(\"-1\")\n", "n = input()\r\nif (int(n) % 2 != 0):\r\n print(-1)\r\nelse:\r\n for i in range(1, int(n), 2):\r\n print(f\"{i + 1} {i}\", end=\" \")", "n=int(input())\r\ns=[]\r\nd=\"\"\r\nfor i in range (n):\r\n s.append(i+1)\r\n \r\n\r\ni=0\r\nj=1 \r\nif n%2==0:\r\n while j<n:\r\n temp=s[i]\r\n s[i]=s[j]\r\n s[j]=temp\r\n i=i+2\r\n j=j+2\r\n \r\n for i in s:\r\n d=d+\" \"+str(i)\r\n print(d)\r\nelse:\r\n print(-1)\r\n\r\n\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\nn=int(input())\r\nif n%2:print(-1)\r\nelse:\r\n a=[*range(1,n+1)]\r\n for i in range(0,n,2):\r\n a[i],a[i+1]=a[i+1],a[i]\r\n print(*a)\r\n\r\n#----------------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "n=int(input())\r\nif n%2:print(-1)\r\nelse:print(*list(range(n,0,-1)))", "n = int(input())\r\nl = []\r\nif n % 2 != 0:\r\n print(-1)\r\n exit()\r\nelse:\r\n for i in range(2, n + 1, 2):\r\n l.append(i)\r\n l.append(i - 1)\r\n continue\r\n list_of_strings = [str(item) for item in l]\r\n print(\" \".join(list_of_strings))\r\n", "# Read the input value n from the user\r\nn = int(input())\r\n\r\n# Check if n is odd. If it is, we cannot construct a perfect permutation.\r\nif n % 2 == 1:\r\n print(\"-1\")\r\nelse:\r\n # Create a list to store the permutation\r\n permutation = list(range(1, n+1))\r\n\r\n # Swap every two adjacent elements in the permutation\r\n for i in range(0, n-1, 2):\r\n permutation[i], permutation[i+1] = permutation[i+1], permutation[i]\r\n\r\n # Output the result\r\n print(\" \".join(str(x) for x in permutation))\r\n", "permutation_size = int(input())\r\n\r\nif permutation_size % 2 == 1:\r\n print(-1)\r\nelse:\r\n print(' '.join([str(i+1) + ' ' + str(i) for i in range(1, permutation_size, 2)]))\r\n", "n=int(input())\r\nif n%2==0 and n!=1:\r\n s=n\r\n for i in range(n):\r\n print(s,end=' ') \r\n s-=1\r\nelse:\r\n print('-1')", "def get_perm(n) :\r\n try : \r\n temp = [i + 1 for i in range(n)]\r\n for i in range(0,n,2) :\r\n temp[i],temp[i + 1] = temp[i + 1],temp[i]\r\n for ele in temp :\r\n print(ele,end= ' ')\r\n except Exception as e :\r\n print(-1)\r\n return\r\n \r\nn = int(input())\r\nget_perm(n)", "\r\nn = int(input())\r\nif n%2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if i%2 == 0:\r\n print(i+2, end=\" \")\r\n else:\r\n print(i, end=\" \")\r\n", "size = input()\nsize = int(size)\nl = [i+1 for i in range(size)]\nno_iteration = []\n\nif size % 2 == 1:\n print(-1)\nelse:\n for i in range(size):\n if i not in no_iteration:\n temp = l[i]\n temp2 = l[size-1-i]\n l[size-1-i] = temp\n l[i] = temp2\n no_iteration.append(i)\n no_iteration.append(size-1-i)\n for i in range(len(l)):\n l[i] = str(l[i])\n print(' '.join(l))\n", "def perm(l):\r\n global a\r\n if len(l)==0:\r\n return\r\n \r\n a = a+str(l[1])+' '\r\n a+=str(l[0]) + ' '\r\n return perm(l[2:])\r\n\r\nx = int(input())\r\nl=[]\r\nfor i in range(x):\r\n l.append(i+1)\r\na= ''\r\n\r\nif x%2 ==1:\r\n print(-1)\r\n exit()\r\n\r\nperm(l)\r\nprint(a.strip())", "n = int(input())\r\nif(n%2 == 1):\r\n print('-1')\r\nelse:\r\n s = list(range(1,n+1))\r\n for i in range(0,n-1,2):\r\n s[i], s[i+1] = s[i+1],s[i]\r\n print(*s)\r\n\r\n", "n = int(input())\r\narr = [i for i in range (1,n+1)]\r\narr1 = []\r\ni,con = 0,True\r\nwhile i <= n>>1:\r\n try:\r\n arr1.append(arr.pop(1))\r\n except:\r\n break\r\n arr1.append(arr.pop(0))\r\nif arr:arr1.append(arr[0])\r\nfor i in range (len(arr1)):\r\n if i+1 == arr1[i]:\r\n con = False\r\n break\r\n\r\nif con:print(*arr1)\r\nelse:print(-1)", "# import inbuilt standard input output\nfrom sys import stdin, stdout\n\ndef main():\n len_ = int(stdin.readline())\n if len_%2 == 0:\n str_ = []\n for j in range(0, len_, 2):\n str_.append(str(j + 2))\n str_.append(str(j + 1))\n string_ = \" \".join(str_)\n stdout.write(string_)\n else:\n stdout.write(\"-1\")\n\nif __name__ == \"__main__\":\n main()", "n = int(input())\r\nresult = []\r\nif n%2 == 0:\r\n for i in range(1,n+1):\r\n if i%2 != 0:\r\n result.append(str(i+1))\r\n else:\r\n result.append(str(i-1))\r\n print(\" \".join(result))\r\nelse:\r\n print(-1)\r\n \r\n ", "def solve():\r\n n = int(input())\r\n tempList = []\r\n if n % 2 == 1:\r\n print(-1)\r\n return 0\r\n else:\r\n i = 1\r\n while i < n:\r\n tempList.append(str(i+1)+' ')\r\n tempList.append(str(i)+' ')\r\n i += 2\r\n s = ''.join(tempList)\r\n print(s)\r\nsolve()", "given = [x for x in range(1, int(input()) + 1)]\r\nlens = len(given)\r\nif lens % 2 == 1:\r\n print(-1)\r\nelse:\r\n answer = []\r\n lens = len(given)\r\n i = 1\r\n while i < lens:\r\n answer.extend([i+1, i])\r\n i += 2\r\n print(*answer)\r\n", "a=int(input())\r\nif a%2!=0:\r\n print(-1)\r\nelse:\r\n s=1\r\n for i in range(a//2):\r\n print(2*s,2*s-1,end=\" \")\r\n s=s+1", "n=int(input())\r\nprint([' '.join(map(str,list(range(n,0,-1)))) ,-1][n%2==1])", "num = int(input())\r\nif num%2 !=0:\r\n print(-1)\r\nelse:\r\n li1 = list(range(num))\r\n li = [2,0]\r\n length = len(li1) //2\r\n li2 = [2,0]*length\r\n for i in range(num):\r\n print(li1[i] + li2[i],end = \" \")", "n = int(input())\r\nif n%2:\r\n print(-1)\r\nelse:\r\n ans=[]\r\n for i in range(1,n,2):\r\n ans+=[i+1,i]\r\n print(*ans)", "counter = 0\r\nn = int(input())\r\nif n%2 == 0:\r\n print(\"2 \" + \"1\", end = \" \")\r\n counter = 2\r\n if counter < n:\r\n while True:\r\n counter += 2\r\n a = counter\r\n b = counter-1\r\n print(a, b, end = \" \")\r\n if counter == n:\r\n break\r\nif n%2 == 1:\r\n print(\"-1\", end = \"\")\r\n\r\n\r\n", "n = int(input())\r\nprint(*[[*(x for x in range(n,0,-1))],[-1]][n&1])", "x = int(input())\n\nif x%2==1:\n print(-1)\n \nelse:\n for i in range(1,x//2+1):\n print(i*2,i*2-1, end=\" \")", "n = int(input()) # Permutation size.\r\n\r\nif n % 2 == 0 : # Size is even.\r\n for i in range(n) :\r\n if i % 2 == 0 : # Even.\r\n print(i + 2, end = ' ')\r\n else : # Odd.\r\n print(i, end = \" \")\r\n \r\n print()\r\n\r\nelse : # Size is odd.\r\n print(-1)", "n = int(input())\r\n\r\nif n % 2 != 0:\r\n print(\"-1\")\r\nelse:\r\n arr = []\r\n for i in range(1, n+1):\r\n arr.append(i)\r\n for j in range(0, n-1, 2):\r\n arr[j], arr[j+1] = arr[j+1], arr[j]\r\n\r\n for i in range(len(arr)):\r\n print(arr[i], end=\" \")\r\n print()\r\n", "n = int(input())\r\n\r\nif n % 2:\r\n print(-1)\r\n raise SystemExit(0)\r\n\r\nfor i in range(1, n//2 + 1):\r\n print(2*i, 2*i-1, end = \" \")", "n=int(input())\nif n%2!=0:\n print(-1)\nelse:\n a=[str(i) for i in range(1,n+1)]\n for i in range(0,n,2):\n a[i],a[i+1]= a[i+1],a[i]\n print(\" \".join(a))\n", "t=int(input())\r\nif t%2==1:\r\n print(-1)\r\nelse:\r\n for i in range(1,t+1):\r\n if i%2==0:\r\n print(i-1,end=' ')\r\n else:\r\n print(i+1,end=' ')", "n = int(input())\r\nlst = [0] * n\r\nif n % 2:\r\n print(-1)\r\nelse:\r\n for i in range(1, n + 1):\r\n if i % 2:\r\n lst[i] = i\r\n else:\r\n lst[i - 2] = i\r\n s = \" \".join(map(str, lst))\r\n print(s)\r\n\r\n\r\n", "#\"from dust i have come, dust i will be\"\r\n\r\nimport sys\r\n\r\nn=int(input())\r\n\r\nif n%2==1:\r\n print(\"-1\")\r\nelse:\r\n for i in range(1,n+1):\r\n if i%2==1:\r\n sys.stdout.write(str(i+1)+\" \")\r\n else:\r\n sys.stdout.write(str(i-1)+\" \")", "n=int(input())\r\nif n%2 !=0:\r\n print(\"-1\")\r\nelse:\r\n arr=[i for i in range(1,n+1)]\r\n i=0\r\n while i<n:\r\n arr[i],arr[i+1]=arr[i+1],arr[i]\r\n i=i+2\r\n print(*arr, sep = ' ') ", "n = int(input())\nif n % 2 != 0:\n print(-1)\nelse:\n print(*range(n, 0, -1))\n", "n = int(input())\nif n % 2 == 1:\n print(-1)\nelse:\n sequence = []\n for i in range(1, n + 1):\n sequence.append(i)\n for i in range(0, len(sequence) - 1, 2):\n temp = sequence[i]\n sequence[i] = sequence[i + 1]\n sequence[i + 1] = temp\n for i in range(len(sequence)):\n print(sequence[i], end=\" \")", "n = int(input())\r\nif(n % 2 == 1):\r\n print(-1) \r\nelse:\r\n print(2,1,end=\" \")\r\n for i in range(3,n,2):\r\n print(i+1,i,end=\" \")", "# -*- coding: utf-8 -*-\r\nn=int(input())\r\na=[]\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n for i in range(int(n/2)):\r\n a.append(2*i+2)\r\n a.append(2*i+1)\r\n for i in a:\r\n print(i,end=\" \")", "a=int(input())\r\nif(a==1 or a==0 or a%2==1):\r\n print(-1)\r\nelse:\r\n arr=[]\r\n b=True\r\n for i in range(1,a+1):\r\n if(b==True):\r\n arr.append(i+1)\r\n b=False\r\n else:\r\n arr.append(i-1)\r\n b=True\r\n print(*arr)", "num=int(input())\r\nif num%2!=0:\r\n print(-1)\r\nelse:\r\n ans=[]\r\n for i in range(1,num+1):\r\n ans.append(i)\r\n for i in range(0,num,2):\r\n ans[i],ans[i+1]=ans[i+1],ans[i]\r\n print(*ans)", "n=int(input())\r\n\r\nif n&1: print(-1)\r\nelse:\r\n r=''\r\n for i in range(1,n+1,2):\r\n r+=str(i+1)+' '+str(i)+' '\r\n\r\n print(r[:-1])\r\n\r\n", "n=int(input())\nif n%2==1:\n print(-1)\nelse:\n i=1\n while i<n:\n print(i+1, end=\" \") \n print(+i, end=\" \")\n i+=2\n\n \t \t\t\t\t\t \t\t \t \t \t \t\t \t", "n= int(input())\r\nif n%2 == 0:\r\n o = 1\r\n e = 2\r\n for i in range(n//2):\r\n print(e, o, end = ' ')\r\n o += 2\r\n e += 2\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nif n%2==1:\r\n print(\"-1\")\r\nelse:\r\n l = []\r\n for i in range(n):\r\n if i%2==0:\r\n l.insert(i,i+2)\r\n else:\r\n l.insert(i,i)\r\n print(*l)\r\n\r\n", "n= int(input())\r\n\r\nif n%2 == 1:\r\n print(-1)\r\nelse:\r\n a= list(range(1, n+1))\r\n\r\n for i in range(0, n, 2):\r\n a[i], a[i+1]= a[i+1], a[i]\r\n\r\n print(*a)", "def find_ideal_permutation(n):\r\n if n % 2 == 1:\r\n # Идеальной перестановки не существует для нечетного числа n\r\n return -1\r\n\r\n # Создаем список для хранения перестановки\r\n permutation = [0] * n\r\n\r\n # Заполняем перестановку\r\n for i in range(1, n+1):\r\n if i % 2 == 1:\r\n # Если i нечетное, помещаем i+1 в i-тую позицию\r\n permutation[i-1] = i + 1\r\n else:\r\n # Если i четное, помещаем i-1 в i-тую позицию\r\n permutation[i-1] = i - 1\r\n\r\n # Возвращаем найденную идеальную перестановку\r\n return permutation\r\n\r\n# Считываем размер перестановки\r\nn = int(input())\r\n\r\n# Находим идеальную перестановку\r\npermutation = find_ideal_permutation(n)\r\n\r\n# Выводим результат\r\nif permutation == -1:\r\n print(-1)\r\nelse:\r\n print(*permutation)", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n a = \"\"\r\n i = 1\r\n while i < n:\r\n a = a + str(i+1) + \" \" + str(i) + \" \"\r\n i = i + 2\r\n print(a)", "x=int(input())\r\nif x%2==1:\r\n print(-1)\r\nelif x%2==0:\r\n for i in range(1,x+1,2):\r\n print(i+1,end=' ')\r\n print(i,end=' ')\r\n", "n = int(input())\r\nif n%2==1:\r\n print(-1)\r\nelse:\r\n j = 0\r\n massiv = []\r\n for i in range(1,n+1):\r\n massiv.append(i)\r\n while j<len(massiv):\r\n temp = massiv[j]\r\n massiv[j]=massiv[j+1]\r\n massiv[j+1] = temp\r\n j+=2\r\n result = ' '.join(map(str,massiv))\r\n print(result)", "n=int(input())\r\nif(n%2==1):\r\n print(\"-1\")\r\nelse:\r\n print(\"2 1\",end=\" \")\r\n for i in range(3,n,2):\r\n print(i+1,end=\" \")\r\n print(i)", "n = int(input())\r\n# if n%2==0\r\nif n%2!=0:\r\n\tprint(-1)\r\nelse:\r\n\teven = []\r\n\todd = []\r\n\tfor i in range(1,n+1):\r\n\t\tif i%2==0:\r\n\t\t\teven.append(i)\r\n\t\telse:\r\n\t\t\todd.append(i)\r\n\teven.sort()\r\n\todd.sort()\r\n\r\n\tans = []\r\n\tfor x,y in zip(even,odd):\r\n\t\tans.append(x)\r\n\t\tans.append(y)\r\n\tprint(*ans)", "x=int(input())\r\nif x%2==1:\r\n print(-1)\r\nelse:\r\n list1=''\r\n for i in range(x,0,-1):\r\n list1+=str(i)+' '\r\n print(list1)", "p=int(input())\r\nif p%2: \r\n print(-1)\r\nelse: \r\n print(*list(range(p,0,-1)))", "lst = []\r\nn = int(input(''))\r\ncount = 0\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(1, n + 1):\r\n lst.append(i)\r\n count += 1\r\np = []\r\nfor j in range(count):\r\n p.append(0)\r\nfor i in range(len(lst)):\r\n if lst[i] % 2 != 0:\r\n p[i + 1] = lst[i]\r\n else:\r\n p[i - 1] = lst[i]\r\nfor k in p:\r\n print(k, end = ' ')", "n = int(input())\r\nif n%2!=0:\r\n print(-1)\r\nelse:\r\n for i in range(n,1,-1):\r\n print(i,end=' ')\r\n print(1)\r\n", "n = input()\r\nn = int(n)\r\nif(n % 2 == 1):\r\n print(-1)\r\nelse:\r\n for i in range(n, 0, -1):\r\n print(i, end='')\r\n if(i != 1):\r\n print(' ', end='')\r\n", "n = int(input())\ncount=0\nif n%2==1:\n print(-1)\nelse:\n while n != count: \n print(n-count,end=\" \")\n count+=1\n \t\t\t\t\t \t\t\t \t \t\t \t \t\t\t \t \t\t", "def main():\r\n perms = list()\r\n count = int(input())\r\n text = \"\"\r\n if count != 1 and count % 2 == 0:\r\n for i in range(1, count+1, 2):\r\n perms.append(i+1)\r\n perms.append(i)\r\n for val in perms:\r\n text += (str(val) + \" \")\r\n print(text[:-1])\r\n else: \r\n print('-1')\r\n\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\n\r\n# Check if n is odd\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n permutation = list(range(1, n + 1))\r\n\r\n # Swap adjacent elements in the sequence\r\n for i in range(0, n, 2):\r\n permutation[i], permutation[i + 1] = permutation[i + 1], permutation[i]\r\n\r\n # Print the perfect permutation\r\n print(\"\\n\".join(map(str, permutation)))\r\n", "n = int(input())\r\nif n%2 == 1:\r\n print(-1)\r\nelse:\r\n s = \"\"\r\n for i in range(n):\r\n if i%2 == 0:\r\n s += str(i+2) + \" \"\r\n else:\r\n s += str(i)\r\n if i != n-1:\r\n s += \" \"\r\n print(s)", "n=int(input())\r\n\r\nif(n%2==0):\r\n arr =[0 for i in range(n)]\r\n for i in range(n):\r\n if(i%2==0):\r\n arr[i]=i+2\r\n else:\r\n arr[i]=i\r\n for i in range(n):\r\n print(arr[i])\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\n\r\nif not n%2: \r\n for x in range(n, 0, -1): print(x, end = \" \")\r\nelse: print(-1)", "n=int(input())\r\na=[]\r\nif n<=1 or n%2!=0:\r\n print('-1')\r\nelse:\r\n for i in range(1,n+1):\r\n a.append(i)\r\n i=0 \r\n while(True):\r\n a[i],a[i+1]=a[i+1],a[i]\r\n print(a[i],a[i+1],end=' ')\r\n i=i+2\r\n if i>=len(a):\r\n break\r\n\r\n", "n=int(input());print(*(list(range(1,n+1))[::-1],[-1])[n&1])", "n = int(input(''))\r\nif n % 2 != 0:\r\n print(-1)\r\nelse:\r\n for i in range(1, n+ 1, 2):\r\n print(i+1, end = ' ')\r\n print(i, end = ' ')\r\n i += 2", "n=int(input())\r\nif(n%2!=0):\r\n print(\"-1\")\r\n exit()\r\nfor i in range(1,n,2):\r\n print(str(i+1)+\" \"+str(i),)", "n = int(input())\r\nif (n%2 == 1):\r\n print(-1)\r\nelse:\r\n print(\"2 1\")\r\n for i in range(3, n, 2):\r\n print(str(i+1))\r\n print(str(i))\r\n ", "# https://codeforces.com/problemset/problem/233/A\r\n\r\nn = int(input())\r\n\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n for i in range(1, n, 2):\r\n print(f'{i+1} {i} ', end='')\r\n", "a=int(input())\r\nif a%2==1:\r\n print(-1)\r\n exit()\r\nfor i in range(1,a,2):\r\n print(i+1,i,end=' ')\r\n", "n = int(input())\r\n \r\nif n%2 == 0:\r\n l = list()\r\n for i in range(1,n+1):\r\n l.append(i)\r\n \r\n for i in range(0,n,2):\r\n a = l[i]\r\n b = l[i+1]\r\n l[i] = b\r\n l[i+1] = a\r\n \r\n for i in l:\r\n print(i,end=' ')\r\n \r\nelse:\r\n print(-1)\r\n \r\n \r\n\r\n \r\n" ]

[ "MOD = int(1e9+7)\r\nn, m = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\n\r\nfact = [1]\r\nfor i in range(1, 1000):\r\n fact.append((fact[-1] * i) % MOD)\r\n\r\ndef fast_power(b, e):\r\n res = 1\r\n while e > 0:\r\n if e % 2 == 1:\r\n res = res * b % MOD\r\n b = b * b % MOD\r\n e //= 2\r\n return res\r\n\r\ndef inv_mod(b):\r\n return fast_power(b, MOD - 2)\r\n\r\nres = fact[n - m]\r\nfor i in range(1, m):\r\n mid = arr[i] - arr[i - 1] - 1\r\n if mid > 0:\r\n res = res * inv_mod(fact[mid]) % MOD\r\n if mid > 1:\r\n res = res * fast_power(2, mid-1) % MOD\r\nif arr[0] > 1:\r\n res = res * inv_mod(fact[arr[0] - 1]) % MOD\r\nif arr[m - 1] < n:\r\n res = res * inv_mod(fact[n - arr[m-1]]) % MOD\r\nprint(res)\r\n", "#source: https://www.programmersought.com/article/2581544332/\nimport sys\n\n\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\n\n\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\n\n\ntwodList = [[0 for _ in range(1005)] for _ in range(1005)]\npowTee = [0 for _ in range(1005)]\n\npowTee[0] = 1\ntwodList[0][0] = 1\nfor i in range(1, 1005):\n twodList[i][0] = 1\n for j in range(1, i + 1):\n twodList[i][j] = (twodList[i - 1][j] + twodList[i - 1][j - 1]) % 1000000007\n twodList[i][i] = 1\n powTee[i] = (powTee[i - 1] * 2) % 1000000007\n\nn, m = get_ints()\n\ninputListy = get_list()\n\ninputListy.sort()\n\nnumby = n - m\nroubles = twodList[numby][inputListy[0] - 1]\n\nnumby -= inputListy[0] - 1\n\nfor i in range(1, m):\n x = inputListy[i] - inputListy[i - 1] - 1\n\n if x > 0:\n roubles = ((roubles * twodList[numby][x] % 1000000007) * powTee[x - 1])\n else:\n roubles = roubles * twodList[numby][x] % 1000000007\n numby -= x\nroubles = (roubles * twodList[numby][n - inputListy[m - 1]]) % 1000000007\n\nprint(roubles)\n\n\t\t\t \t \t \t\t \t \t\t \t\t\t \t\t\t\t \t", "n, m = map(int, input().split())\r\nMOD = 1000000007\r\nnCr = [[0 for j in range(1005)] for i in range(1005)]\r\npow = [0 for i in range(1005)]\r\n\r\nfor i in range(n + 1):\r\n nCr[i][0] = 1\r\n for j in range(1, i + 1):\r\n nCr[i][j] = (nCr[i - 1][j - 1] + nCr[i - 1][j]) % MOD\r\n\r\npow[0] = pow[1] = 1\r\nfor i in range(2, n + 1):\r\n pow[i] = (pow[i - 1] * 2) % MOD\r\n\r\ns = list(map(int, input().split()))\r\ns.sort()\r\n\r\nans = 1\r\ncnt = 0\r\nfor i in range(m):\r\n if i == 0:\r\n tmp = s[i] - 1\r\n else:\r\n tmp = s[i] - s[i - 1] - 1\r\n ans = (ans * pow[tmp]) % MOD\r\n cnt += tmp\r\n ans = (ans * nCr[cnt][tmp]) % MOD\r\n\r\ncnt += n - s[m - 1]\r\nans = (ans * nCr[cnt][n - s[m - 1]]) % MOD\r\nprint(ans)\r\n", "from sys import stdin, stdout\r\n\r\n\r\ndef main():\r\n n, p = 2000, 1000000007\r\n factorial = [1] * (n + 1)\r\n for i in range(2, n + 1):\r\n factorial[i] = i * factorial[i - 1] % p\r\n while True:\r\n try:\r\n n, m = readline()\r\n except:\r\n break\r\n on = sorted(readline())\r\n off = []\r\n for i in range(1, m):\r\n c = on[i] - on[i - 1] - 1\r\n if c > 0:\r\n off.append(c)\r\n answer = pow(2, sum(off) - len(off), p) * factorial[n - m] % p\r\n off = [on[0] - 1] + off + [n - on[m - 1]]\r\n for x in off:\r\n answer = answer * pow(factorial[x], p - 2, p) % p\r\n stdout.write(str(answer) + '\\n')\r\n\r\n\r\ndef readline():\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def fac(n):\n\tif n == 0:\n\t\treturn 1\n\tans = 1\n\tfor i in range(2, n + 1):\n\t\tans *= i\n\treturn ans\n\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nans = fac(n - m)\nans //= fac(a[0] - 1)\nfor i in range(1, m):\n\tans //= fac(a[i] - a[i - 1] - 1)\n\tif a[i] - a[i - 1] - 1 != 0:\n\t\tans *= 2 ** (a[i] - a[i - 1] - 2)\nans //= fac(n - a[m - 1])\nprint(ans % 1000000007)\n\n \t \t \t\t \t \t \t\t \t\t \t\t \t", "from math import *\r\n\r\nn, m = map(int,input().split())\r\ndp = list(map(int,input().split()))\r\n\r\ndp.sort()\r\nmod = 10 ** 9 + 7\r\nk = factorial(n-m)\r\nk //= factorial(dp[0]-1)\r\n\r\nfor i in range(1, m):\r\n k //= factorial(dp[i]-dp[i-1]-1)\r\n \r\n if dp[i]-dp[i-1]-1 != 0:\r\n k *= 2**(dp[i]-dp[i-1]-2)\r\n \r\nk //= factorial(n-dp[-1])\r\n\r\nprint(k % mod)", "# https://codeforces.com/problemset/problem/294/C\r\n\r\nimport sys\r\nimport math\r\n\r\nmod = 10 ** 9 + 7\r\n\r\n\r\ndef factorial(n):\r\n x = 1\r\n for i in range(n):\r\n yield x\r\n x = x * (i + 1) % mod\r\n\r\n\r\nf = list(factorial(1001))\r\n\r\n\r\ndef C(n, k):\r\n return f[n] * pow(f[k], mod - 2, mod) * pow(f[n - k], mod - 2, mod) % mod\r\n\r\n\r\ndef main():\r\n # sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n # sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n # sys.stderr = open('E:\\\\Sublime\\\\err.txt', 'w')\r\n\r\n # n = int(sys.stdin.readline().strip())\r\n # a, b = map(int, sys.stdin.readline().strip().split()[:2])\r\n\r\n n, m = [int(x) for x in sys.stdin.readline().strip().split()]\r\n b = [-1] + [int(x) - 1 for x in sys.stdin.readline().strip().split()] + [n]\r\n b.sort()\r\n\r\n ans = 1\r\n cur = n - m\r\n for i in range(1, len(b)):\r\n l = b[i] - b[i - 1] - 1\r\n ans = ans * C(cur, l) % mod\r\n if (l > 0) and (i > 1) and (i < len(b) - 1):\r\n ans = ans * pow(2, l - 1, mod) % mod\r\n cur -= l\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n# hajj\r\n# 　　　　　　 ＿＿\r\n# 　　　　　／＞　　フ\r\n# 　　　　　| 　_　 _ l\r\n# 　 　　　／` ミ＿xノ\r\n# 　　 　 /　　　 　 |\r\n# 　　　 /　 ヽ　　 ﾉ\r\n# 　 　 │　　|　|　|\r\n# 　／￣|　　 |　|　|\r\n# 　| (￣ヽ＿_ヽ_)__)\r\n# 　＼二つ\r\n", "mod = 1000000007\nfact = [1] * 2000\nfor i in range(1, 2000):\n fact[i] = fact[i - 1] * i % mod\nn, m = map(int, input().split())\na = sorted(map(int, input().split()))\nb = []\nfor i in range (1, m):\n x = a[i] - a[i - 1] - 1\n if (x > 0):\n b.append(x)\ncount = pow(2, sum(b) - len(b), mod) * fact[n - m] % mod\nb = [a[0] - 1] + b + [n - a[-1]]\nfor i in b:\n\tcount = count * pow(fact[i], mod - 2, mod) % mod\nprint(count)\n\n\t\t \t \t\t\t \t\t\t\t \t \t \t", "def f(n):\n\tif n == 0:\n\t\treturn 1\n\tans = 1\n\tfor i in range(2, n + 1):\n\t\tans *= i\n\treturn ans\n \n \nn, m = map(int, input().split())\na = list(map(int, input().split()))\na = sorted(a)\nans = f(n - m) // f(a[0] - 1)\nfor i in range(1, m):\n\tans //= f(a[i] - a[i - 1] - 1)\n\tif a[i] - a[i - 1] != 1:\n\t\tans *= 2 ** (a[i] - a[i - 1] - 2)\nans //= f(n - a[m - 1])\nprint(ans % 1000000007)\n\n \t \t \t\t\t \t \t \t \t\t\t\t\t", "#from itertools import permutations\n#from operator import itemgetter, attrgetter\n#from functools import reduce\nn, m = map(int, input().split())\na = list(map(int, input().split()))\na.sort()\nMOD = int(1e9 + 7)\nf = [1]\nfor i in range(1, 1000):\n f.append((f[-1] * i) % MOD)\n\n\ndef bigmod(a, e, m):\n ret = 1\n while (e):\n if (e % 2 == 1):\n ret *= a\n if (ret > m):\n ret %= m\n e -= 1\n a *= a\n e /= 2\n if (a > m):\n a %= m\n return ret\n\n\ndef invmod(a, p):\n return bigmod(a, p - 2, p)\n\n\nans = f[n - m]\nfor i in range(1, m):\n mid = a[i] - a[i - 1] - 1\n if mid > 0:\n ans *= invmod(f[mid], MOD)\n ans %= MOD\n if (mid > 1):\n ans *= bigmod(2, mid - 1, MOD)\n ans %= MOD\nif a[0] > 1:\n ans *= invmod(f[a[0] - 1], MOD)\n ans %= MOD\nif a[m - 1] < n:\n ans *= invmod(f[n - a[m - 1]], MOD)\n ans %= MOD\nprint(ans)\n", "M= 1000000007\r\nf = [1]*2000\r\nfor i in range(1,2000):\r\n f[i]=f[i-1]*i%M\r\nn,m = map(int,input().split())\r\na = sorted(map(int,input().split()))\r\nb = []\r\nfor i in range (1,m):\r\n x=a[i]-a[i-1]-1\r\n if(x>0):\r\n b.append(x)\r\n#print(b)\r\ncount = pow(2,sum(b)-len(b),M)*f[n-m]%M\r\n#print(count)\r\nb = [a[0]-1]+b+[n-a[-1]]\r\n#print(b)\r\n#print(f[3])\r\nfor i in b:\r\n\tcount = count*pow(f[i],M-2,M)%M\r\n\t#print(pow(f[i],M-2,M))\r\n\t#print(i)\r\nprint(count)\r\n ", "import itertools\r\nimport math\r\n\r\ndef countEndgames(grid):\r\n ls = []\r\n for elt, gp in itertools.groupby(grid):\r\n if elt == '.':\r\n ls.append(len(list(gp)))\r\n tot = 1\r\n for i,g in enumerate(ls):\r\n if i==0 and grid[0] == '.' or i==(len(ls)-1) and grid[-1] == '.':\r\n continue\r\n tot *= 2**(g-1)\r\n tot *= math.factorial(sum(ls))\r\n for g in ls:\r\n tot //= math.factorial(g)\r\n return tot % (10**9+7)\r\n\r\nn,x = map(int, input().split())\r\nls = list(map(int, input().split()))\r\ngrid = ['.' for i in range(n)]\r\nfor x in ls:\r\n grid[x-1] = '#'\r\nprint(countEndgames(grid))\r\n", "MOD = 1000000007\r\n\r\n\r\ndef facts(m): #funcion para calcular los factoriales desde 1 hasta m, asi como sus inversos modulares\r\n fact = [0]*(m+1)\r\n fact[0] = 1\r\n for i in range(1, m+1):\r\n fact[i] = fact[i-1]*i % MOD\r\n fact_inv = [0]*(m+1)\r\n fact_inv[m] = pow(fact[m], MOD-2, MOD)\r\n for i in reversed(range(m)):\r\n fact_inv[i] = fact_inv[i + 1]*(i + 1) % MOD\r\n return fact, fact_inv\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split()) #leemos los valores n(cantidad total de luces) y m(cantidad de luces encendidas\r\n lights = sorted(map(int, input().split())) #leemos las luces encendidas y las ordenamos de forma ascendente\r\n \r\n fact, fact_inv = facts(n)\r\n \r\n ans = fact[n - m] #calculamos todas las posibles permutaciones entre las luces apagadas\r\n ans *= fact_inv[lights[0] - 1] #hallamos todas las posibles permutaciones entre la distribucion de luces de tipo 1\r\n #y nos quedamos con la parte entera de la division del total hasta el momento y todas las posibles permutaciones entre la distribucion de luces de tipo 1\r\n ans *= fact_inv[n - lights[len(lights) - 1]] #hallamos todas las posibles permutaciones entre la distribucion de luces de tipo 3\r\n #y nos quedamos con la parte entera de la division del total hasta el momento y todas las posibles permutaciones entre la distribucion de luces de tipo 3\r\n\r\n for i in range(1, len(lights)): #recorremos todas las distribuciones de luces de tipo 2\r\n ans *= fact_inv[lights[i] - lights[i - 1] - 1] #hallamos todas las posibles permutaciones entre las distribuciones de tipo 2\r\n #y nos quedamos con la parte entera de la division del total hasta el momento y todas las posibles permutaciones entre las distribuciones de tipo 2\r\n if lights[i] - lights[i - 1] - 1 != 0: #verificamos si entre dos luces encendidas hay luces apagadas\r\n ans *= 2**(lights[i] - lights[i - 1] - 2) #calculamos todas las formas de enceder las luces en una distribucion de tipo 2 y estas son multiplicadas al total\r\n print(ans % MOD) #se imprime la cantidade de formas que se pueden encender las luces modulo M\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "from math import factorial\nimport re\n\nin1 = [int(x) for x in re.split(\"\\\\s\", input())]\nin2 = [int(x) for x in re.split(\"\\\\s\", input())]\n\nin2.append(0)\nin2.append(in1[0]+1)\nin2.sort()\n\nlights = []\n\nfor x in range(len(in2)-1):\n lights.append(in2[x+1]-in2[x]-1)\n\nlightsTotal = sum(lights)\npossTotal = factorial(lightsTotal)\n\nfor x in lights:\n possTotal //= factorial(x)\n \nfor x in range(1, len(lights)-1):\n if lights[x] > 0:\n possTotal *= pow(2, lights[x]-1)\n\npossTotal %= 1000000007\n\nprint(possTotal)\n \t\t \t \t\t \t\t \t \t\t \t \t", "import sys\r\ninput=sys.stdin.readline\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nmod=10**9+7\r\nf=[1]*(n+1)\r\nfor i in range(2,n+1):\r\n f[i]=f[i-1]*i%mod\r\np2=[1]*(n+1)\r\nfor i in range(1,n+1):\r\n p2[i]=p2[i-1]*2%mod\r\nans=f[n-m]\r\nif a[0]>1:\r\n ans*=pow(f[a[0]-1],mod-2,mod)\r\nfor i in range(1,m):\r\n ans*=pow(f[a[i]-a[i-1]-1],mod-2,mod)\r\n ans%=mod\r\n if a[i]-a[i-1]-2>=0:\r\n ans*=p2[max(a[i]-a[i-1]-1-1,0)]\r\n ans%=mod\r\nif a[-1]<n:\r\n ans*=pow(f[n-a[-1]],mod-2,mod)\r\n ans%=mod\r\nprint(ans)", "\nmod = 1000000007\nn, m = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\n\nfact = [0 for _ in range(n + 1)]\nfact[0] = 1\nfor i in range(1, n + 1):\n fact[i] = fact[i - 1] * i % mod\n\narr.sort()\n\ns = n - m\n\nans = fact[s]\nif arr[0] > 1:\n ans = ans * pow(fact[arr[0] - 1], mod - 2, mod) % mod\nfor i in range(1, m):\n t = arr[i] - arr[i - 1] - 1\n if t > 0:\n ans = ans * pow(fact[t], mod - 2, mod) % mod\n ans = ans * pow(2, t - 1, mod) % mod\nif arr[-1] != n:\n t = n - arr[-1]\n ans = ans * pow(fact[t], mod - 2, mod) % mod\n\n\nprint(ans)\n\n\n\n", "M= 1000000007\r\nf = [1]*2000\r\nfor i in range(1,2000):\r\n f[i]=f[i-1]*i%M\r\nn,m = map(int,input().split())\r\na = sorted(map(int,input().split()))\r\nb = []\r\nfor i in range (1,m):\r\n x=a[i]-a[i-1]-1\r\n if(x>0):\r\n b.append(x)\r\ncount = pow(2,sum(b)-len(b),M)*f[n-m]%M\r\nb = [a[0]-1]+b+[n-a[-1]]\r\nfor i in b:\r\n\tcount = count*pow(f[i],M-2,M)%M\r\nprint(count)", "from sys import stdin, stdout\r\n\r\n\r\ndef main():\r\n p = 1000000007 # Constante brindada por el problema\r\n n, m = readline()\r\n on = sorted(readline()) # Se ordena de menor a mayor los elementos del conjunto de luces encendidas\r\n off = [] # Conjunto de cardinalidades de los segmentos de luces apagadas\r\n sum_ = 0\r\n for i in range(1, m): # Se analizan todos los segmentos interiores\r\n c = on[i] - on[i - 1] - 1\r\n if c > 0:\r\n off.append(c)\r\n sum_ += c\r\n factorial = [1] * (on[0] + sum_ + n - on[-1])\r\n for i in range(2, len(factorial)): # Factoriales modulo p hasta la cantidad de luces apagadas\r\n factorial[i] = i * factorial[i - 1] % p\r\n answer = pow(2, sum_ - len(off), p) * factorial[n - m] % p # Se calcula el numerador de la expresion\r\n off.append(on[0] - 1) # Se agregan los segmentos exteriores\r\n off.append(n - on[-1])\r\n for x in off: # Se agrega al calculo los elementos del denominador\r\n answer = answer * pow(factorial[x], p - 2, p) % p # Se utiliza el inverso multiplicativo\r\n return answer\r\n\r\n\r\ndef readline(): # Metodo para leer una linea completa, dividirla en elementos y convertirlos en numeros enteros\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\nif __name__ == '__main__':\r\n stdout.write(str(main()) + '\\n')\r\n", "from math import factorial\ndef N3():\n modi = 10**9 + 7\n n, m = [int(x) for x in input().split()]\n on = [int(x) for x in input().split()]\n on.sort()\n on = [0] + on + [n+1]\n\n off = [on[i+1]-on[i] -1 for i in range(len(on)-1)]\n s = sum(off)\n total = factorial(s)\n for i in off:\n total //= factorial(i)\n\n total %= modi\n if len(off) >= 3:\n for i in range(1, len(off)-1):\n if off[i] > 0:\n total *= pow(2, off[i]-1, modi)\n print(total % modi)\n\nif __name__ == '__main__':\n N3()\n \t \t\t\t\t\t \t \t\t\t \t\t \t\t\t\t\t \t\t", "M = 1000000007\r\n\r\n\r\ndef fac(n):\r\n if n == 0 or n == 1:\r\n return 1\r\n fact = 1\r\n for i in range(2, n+1):\r\n fact *= i\r\n return fact\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n lights = sorted(map(int, input().split()))\r\n\r\n ans = fac(n - m)\r\n ans //= fac(lights[0] - 1)\r\n ans //= fac(n - lights[len(lights) - 1])\r\n\r\n for i in range(1, len(lights)):\r\n ans //= fac(lights[i] - lights[i - 1] - 1)\r\n if lights[i] - lights[i - 1] - 1 != 0:\r\n ans *= 2**(lights[i] - lights[i - 1] - 2)\r\n print(ans % M)\r\n\r\nmain()\r\n" ]

[ "def score(x,m,w):\r\n t=(1-(m/250))*x - (50*w)\r\n return max(0.3*x,t)\r\n\r\nsl=[500,1000,1500,2000,2500]\r\nm=list(map(int, input().split()))\r\nw=list(map(int, input().split()))\r\ns,u=map(int,input().split())\r\n\r\nres=0\r\n\r\nfor i in range(5):\r\n res+=score(sl[i],m[i],w[i])\r\nres+=(100*s)\r\nres-=(50*u)\r\nprint(int(res))", "m=[int(i) for i in input().split()]\r\nw=[int(i) for i in input().split()]\r\nh1,h2=map(int,input().split())\r\nk=0\r\nfor i in range(5):\r\n k+=max(0.3*(i+1)*500,(1-m[i]/250)*(i+1)*500-50*w[i])\r\nk+=h1*100-h2*50\r\nprint(round(k))", "m = list(map(int, input().split()))\nw = list(map(int, input().split()))\nh = [500, 1000, 1500, 2000, 2500]\ns, u = map(int, input().split())\nsu = 0.0\nfor i in range(5):\n su += max(0.3*h[i], (1.0-m[i]/250.0)*h[i] - 50.0*w[i])\nsu += s*100.0\nsu -= u*50.0\nprint(int(su))\n", "import sys\r\n\r\ntime = sys.stdin.readline().split()\r\ntime = [int(x) for x in time]\r\n\r\n\r\nwrongs = sys.stdin.readline().split()\r\nwrongs = [int(x) for x in wrongs]\r\n\r\n\r\nhacks = sys.stdin.readline().split()\r\nhacks = [int(x) for x in hacks]\r\n\r\nmaxvals = [500,1000,1500,2000,2500]\r\n\r\nscore = 0\r\nfor i in range(5):\r\n score += max(0.3*maxvals[i], (1-float(time[i])/250)*maxvals[i]-50*wrongs[i])\r\n\r\nscore += 100*hacks[0]\r\nscore -= 50*hacks[1]\r\n\r\n\r\nprint(int(score))\r\n\r\n", "a=[]\r\nb=[]\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nn,m=map(int,input().split())\r\nsum=500\r\nans=0\r\nfor i in range(5):\r\n ans+=max((0.3*sum),(1-a[i]/250)*sum-50*b[i]);\r\n sum+=500;\r\nans+=100*n;\r\nans-=50*m;\r\nprint(int(ans))", "import sys\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nhs,hu = map(int, input().split())\r\nx = [500,1000,1500,2000,2500]\r\nans = hs*100 - hu*50\r\nfor i in range(5):\r\n ans += max(0.3 *x[i], (1 - m[i]/250)*x[i] -50*w[i])\r\nprint(int(ans))", "s1 = input()\r\ns2 = input()\r\nh,h1 = map(int,input().split())\r\n\r\na = s1.split(\" \")\r\nb = s2.split(\" \")\r\na = [int(i) for i in a]\r\nb = [int(i) for i in b]\r\nr = 0\r\nfor i in range(5):\r\n x = 500*(i+1)\r\n r = r+ max(.3*x,(1-a[i]/250)*x-50*b[i])\r\n\r\nr = r+100*h-50*h1\r\n\r\nprint (int(r))\r\n", "m = [int(x) for x in input().split()]\r\nw = [int(x) for x in input().split()]\r\nh = [int(x) for x in input().split()]\r\nres = 0\r\nfor i in range(5):\r\n res += max(150 * (i + 1),500 * (i + 1) - 2 * m[i] * (i + 1) - 50 * w[i])\r\nprint(res + h[0] * 100 - h[1] * 50)", "p = [500, 1000, 1500, 2000, 2500]\r\nr = lambda: list(map(int,input().split()))\r\n\r\nscore = 0\r\nfor x,m,w in zip(p,r(),r()):\r\n score += max(0.3*x,(1-m/250)*x-50*w)\r\nhack, hack_wrong = r()\r\nscore += 100*hack - 50*hack_wrong\r\nprint (int(score))", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nt,f = map(int, input().split())\r\ns = 0\r\n\r\ns += max(0.3 *500, (1 - m[0] / 250) * 500 - 50 * w[0])\r\ns += max(0.3 *1000, (1 - m[1] / 250) * 1000 - 50 * w[1])\r\ns += max(0.3 *1500, (1 - m[2] / 250) * 1500 - 50 * w[2])\r\ns += max(0.3 *2000, (1 - m[3] / 250) * 2000 - 50 * w[3])\r\ns += max(0.3 * 2500, (1 - m[4] / 250) * 2500 - 50 * w[4])\r\nprint(int(s + 100 * t - 50 * f)) \r\n", "m=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\nsh,uh=list(map(int,input().split()))\r\nsc=0\r\nmp=[500,1000,1500,2000,2500]\r\nfor i in range(len(m)):\r\n x=mp[i]\r\n y=(1-(m[i]/250))*x-(50*w[i])\r\n sc+=max(0.3*x,y)\r\nprint(int(sc+(sh*100)-(uh*50)))\r\n ", "m=[int(i) for i in input().split(' ')]\r\nw=[int(i) for i in input().split(' ')]\r\nh=[int(i) for i in input().split(' ')]\r\ns=0\r\nfor i in range(5):\r\n x=(i+1)*500\r\n s+=max(0.3*x,(1-m[i]/250)*x-50*w[i])\r\ns=s+h[0]*100-h[1]*50\r\nprint(int(s))\r\n", "xxs = [500, 1000, 1500, 2000, 2500]\nmms = list(map(float, input().split()))\nwws = list(map(int, input().split()))\nhs, hw = map(int, input().split())\nres = 0\nfor i in range(5):\n res += max(0.3 * xxs[i], ((1 - (mms[i] / 250)) * xxs[i]) - 50 * wws[i])\nprint(int(res + (100 * hs) - (50 * hw)))\n", "m=[int(x)for x in input().split()]\nw=[int(x)for x in input().split()]\ns,u=map(int,input().split())\nans=0\nfor i in range(5):\n x=(500*(i+1))\n ans+=max(0.3*x,((1-(m[i]/250))*x-(50*w[i])))\nprint(int(ans)+(100*s)-(50*u))", "#https://codeforces.com/contest/604/problem/A\r\nx = [500, 1000, 1500, 2000, 2500]\r\nm = [int(elem) for elem in input().split()]\r\nw = [int(elem) for elem in input().split()]\r\ns,u = [int(elem) for elem in input().split()]\r\n\r\nscore = [max(0.3*x[i], (1.0-(m[i]/250.0))*x[i] - 50*w[i]) for i in range(5)]\r\nscore = sum(score)\r\nscore += 100*s - 50*u\r\nprint(int(score))\r\n\r\n", "def solve():\r\n m = [int(_) for _ in input().split()]\r\n w = [int(_) for _ in input().split()]\r\n h = [int(_) for _ in input().split()]\r\n\r\n score = 500\r\n total_points = 0\r\n\r\n for i in range(len(m)):\r\n total_points += max(0.3 * score, (1 - m[i] / 250) * score - (50 * w[i]))\r\n score += 500\r\n\r\n total_points += h[0] * 100\r\n total_points -= h[1] * 50\r\n\r\n print(int(total_points))\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "\r\nm=input().split()\r\nw=input().split()\r\nh=input().split()\r\nx=[500,1000,1500,2000,2500]\r\nres=0\r\nfor i in range(5):\r\n\tres+=max(3*int(x[i])/10,(1-int(m[i])/250)*int(x[i])-50*int(w[i]))\r\n#print(res)\r\n\r\nres+=100*int(h[0])\r\nres-=50*int(h[1])\r\nprint(int(res))", "m=list(map(int,input().split()))[:5]\r\nw=list(map(int,input().split()))[:5]\r\nhs,hu=map(int,input().split())\r\nx=500\r\ny=0\r\nfor i in range(5):\r\n y+=max(0.3*x,((1-m[i]/250)*x-50*w[i]))\r\n x+=500\r\n\r\nprint(int(y)+100*hs-50*hu)", "m = list(map(int, input().split()))\nw = list(map(int, input().split()))\nh = list(map(int, input().split()))\n\nscore = h[0]*100 - h[1]*50\nfor i,s in enumerate([500, 1000, 1500, 2000, 2500]):\n score += max(0.3*s, (1 - m[i]/250)*s - 50*w[i])\n\nprint(int(score))\n", "arr1 = [int(x) for x in input().split()]\narr2 = [int(x) for x in input().split()]\narr3 = [500, 1000, 1500, 2000, 2500]\nk, l = [int(x) for x in input().split()]\nscore = 0\nfor i in range(5):\n\tscore += max(0.3*arr3[i], (1-arr1[i]/250)*arr3[i]-50*arr2[i])\nscore += 100 * k - 50 * l\nprint(int(score))\n", "PROBLEMS = (500, 1000, 1500, 2000, 2500)\n\n\ndef problem_score(x, m, w):\n return max(75*x, (250-m)*x - 250*50*w)\n\n\ndef score(ms, ws, hs, hu):\n return (sum(problem_score(x, m, w)\n for x, m, w in zip(PROBLEMS, ms, ws))//250\n + 100*hs - 50*hu)\n\n\nif __name__ == '__main__':\n m1, m2, m3, m4, m5 = map(int, input().split())\n w1, w2, w3, w4, w5 = map(int, input().split())\n hs, hu = map(int, input().split())\n print(score((m1, m2, m3, m4, m5), (w1, w2, w3, w4, w5), hs, hu))\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\ns,u = list(map(int, input().split()))\r\npt = [500, 1000, 1500, 2000, 2500]\r\nans=0\r\n\r\nans = 100*s - 50*u\r\n\r\nfor i in range(1,6):\r\n ans += max(pt[i-1]-pt[i-1]*m[i-1]//250-50*w[i-1], pt[i-1]//10*3)\r\n \r\nprint(ans)", "i = input()\r\nj = input()\r\ni = list(i.split(\" \"))\r\nj = list(j.split(\" \"))\r\nw = list(input().split(\" \"))\r\nmax = [500,1000,1500,2000,2500]\r\ncount = 0\r\nans = 0\r\nfor count in range(5):\r\n\tt = float((1 - int(i[count])/250)*int(max[count])-(50*(int(j[count]))))\r\n\tans1 = 0\r\n\tans1 = int(0.3*int(max[count]))\r\n\tif ans1 > t:\r\n\t\tans+=ans1\r\n\telse:\r\n\t\tans+=t\r\nans+=100 * int(w[0]) - 50 * int(w[1])\r\nprint(int(ans))", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(5):\r\n x = (i + 1) * 500\r\n ans += max(0.3 * x, (1 - m[i] / 250) * x - 50 * w[i])\r\nans += 100 * h[0] - 50 * h[1]\r\nprint(int(ans))\r\n", "m = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\nhsu = list(map(int,input().split()))\r\nnum = 0\r\nfor i in range(5):\r\n num += max(((i+1) * 500) * 0.3,(1.0-m[i]/250.0)* (i+1) * 500.0 - 50.0 * w[i])\r\nnum += hsu[0]*100\r\nnum -= hsu[1]*50\r\nprint(int(num))\r\n", "def main():\r\n\tp = [ 500, 1000, 1500, 2000, 2500 ]\r\n\tm = list(map(int, input().strip().split()))\r\n\tw = list(map(int, input().strip().split()))\r\n\t(hs, hu) = list(map(int, input().strip().split()))\r\n\r\n\tt = 0\r\n\tfor i in range(0, 5):\r\n\t\tt += max(int(0.3*p[i]), 2*(i+1)*(250-m[i])-50*w[i])\r\n\r\n\tt += hs*100\r\n\tt -= hu*50\r\n\r\n\tprint(t)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n", "sc=[1]*10\nmrk=input().split()\nfor i in range (0,5):\n mrk[i]=int(mrk[i])\n sc[i]=500*(i+1)\nwr=input().split()\nfor i in range (0,5):\n wr[i]=int(wr[i])\ns=0\nfor i in range (0,5):\n s+=max((0.3*sc[i]),(1-(mrk[i]/250))*sc[i]-(50*wr[i]))\nl=input().split()\ns+=100*int(l[0])-50*int(l[1])\nprint(int(s))\n\n", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n\tline_m = str(input()).split()\r\n\tline_m = [int(it) for it in line_m]\r\n\tline_w = str(input()).split()\r\n\tline_w = [int(it) for it in line_w]\r\n\th_s, h_u = str(input()).split()\r\n\th_s = int(h_s)\r\n\th_u = int(h_u)\r\n\tbase = 0\r\n\tfor i in range(5):\r\n\t\tbase += max(150 * (i + 1), (500 - 2 * line_m[i]) * (i + 1) - 50 * line_w[i])\r\n\tprint(base + 100 * h_s - 50 * h_u)\r\n", "import sys\nx = [500, 1000, 1500, 2000, 2500]\nm = list(map(int, sys.stdin.readline().split()))\nw = list(map(int, sys.stdin.readline().split()))\nhs, hu = map(int, sys.stdin.readline().split())\nans = sum([max((3*xi)//10, xi-(mi*xi)//250-50*wi) for xi, mi, wi in zip(x,m,w)])\nprint(ans+100*hs-50*hu)\n", "res = 0\r\nc = [500,1000,1500,2000,2500]\r\na = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\nhs,hu = map(int,input().split())\r\nfor i in range(5):\r\n res += max(0.3*c[i],(1-a[i]/250)*c[i]-50*w[i])\r\nprint(int(res+hs*100-50*hu))", "scores = [500 * i for i in range(1, 6)]\nminutes = map(int, input().split())\nwrongs = map(int, input().split())\ns, u = map(int, input().split())\n\ntotal_score = 0\nfor minute, wrong, score in zip(minutes, wrongs, scores):\n total_score += max(0.3 * score, (1 - minute / 250) * score - 50 * wrong)\n\nprint(int(total_score + 100 * s - 50 * u))\n", "submission_time = list(map(int,input().split()))\r\nwrong_submission = list(map(int,input().split()))\r\nsuc_hack,unsuc_hack = map(int,input().split())\r\nproblem_score = [500,1000,1500,2000,2500]\r\nscore = 0\r\nfor i in range(5):\r\n score += max(0.3*problem_score[i],(1-(submission_time[i])/250)*problem_score[i]-50*wrong_submission[i])\r\nscore += 100*suc_hack-50*unsuc_hack\r\nprint(int(score))", "\r\nx=[500,1000,1500,2000,2500]\r\nm=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\nsh,uh=map(int,input().split())\r\nt=0\r\nfor i in range(5):\r\n t+=max(0.3*x[i],(1-(m[i]/250))*x[i] -(50*w[i])) \r\n\r\nt += (sh*100) - (uh*50)\r\nprint(int(t))\r\n ", "import re\r\n\r\nm = [int(n) for n in re.split(\"\\s+\", input())]\r\nw = [int(n) for n in re.split(\"\\s+\", input())]\r\nh = [int(n) for n in re.split(\"\\s+\", input())]\r\nx = [500, 1000, 1500, 2000, 2500]\r\n\r\nprint(int(sum(list(map(lambda i: max(\r\n 0.3*i[0], (1-(i[1]/250))*i[0]-(50*i[2])), [i for i in zip(x, m, w)])))+((h[0]*100)-(h[1]*50))))\r\n", "times = list(map(int, input().split()))\r\natt = list(map(int, input().split()))\r\nn,m = map(int, input().split())\r\nsc = 0\r\nfor i in range(5):\r\n\tsc += max ( 150 * (i+1), ( 1 - times[i] / 250 ) * 500 * (i+1) - 50 * att[i] )\r\nsc += 100 * n \r\nsc -= 50 * m\r\nprint (int(sc)) \r\n\r\n", "m = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\nhs,hu = map(int,input().split()); ans = hs*100-hu*50\r\nx = [500,1000,1500,2000,2500]\r\nfor i in range(5): ans += max(0.3*x[i],(1-(m[i]/250))*x[i]-50*w[i])\r\nprint(int(ans))", "n=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\ns,us=map(int,input().split())\r\nx,mx,a=500,0,[]\r\nfor i in range(5):\r\n mx=max(0.3*x,((250-n[i])/250)*x-50*m[i])\r\n a.append(mx)\r\n x+=500\r\nsum=sum(a)\r\nprint(int(sum+s*100-50*us))", "def main():\n minutos = [int(x) for x in input().split()]\n erradas = [int(x) for x in input().split()]\n Hs, Hf = [int(x) for x in input().split()]\n x = [500, 1000, 1500, 2000, 2500]\n\n soma = sum([max(0.3*x[i], (1 - minutos[i]/250)*x[i] - 50*erradas[i]) for i in range(5)])\n\n score = soma + Hs*100 - Hf*50\n print(int(score))\n\nmain()\n\t\t\t \t\t \t\t\t \t \t\t\t \t\t\t\t", "m=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\nh1,h2=map(int,input().split())\r\ns=0\r\nfor i in range(5):\r\n s=s+max(0.3*(500*(i+1)),(1-(m[i]/250))*(500*(i+1))-50*w[i])\r\ns=s+100*h1-50*h2\r\nprint(int(s))", "__author__ = 'MoonBall'\r\n\r\nimport sys\r\n# sys.stdin = open('data/A.in', 'r')\r\nT = 1\r\n\r\ndef process():\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n c = list(map(int, input().split()))\r\n z = [500, 1000, 1500, 2000, 2500]\r\n total = 0\r\n for _ in range(5):\r\n total += max(0.3 * z[_], (1 - a[_] / 250) * z[_] - 50 * b[_])\r\n total += 100 * c[0] - 50 * c[1]\r\n\r\n print(int(total))\r\n\r\n\r\n\r\n\r\n\r\n\r\nfor _ in range(T):\r\n process()\r\n", "time=list(map(int,input().split()))\r\nwrong=list(map(int,input().split()))\r\npoint=[500,1000,1500,2000,2500]\r\ns,u=map(int,input().split())\r\nsum=0\r\nfor i in range(0,5,1):\r\n if 0.3*point[i]>(1-(time[i]/250))*point[i]-50*wrong[i]:\r\n sum+=0.3*point[i]\r\n else:\r\n sum+=(1-(time[i]/250))*point[i]-50*wrong[i]\r\nse=s*100\r\nun=u*50\r\nsum+=se\r\nsum-=un\r\nprint(int(sum))", "points = list(int(x) for x in input().split())\r\n\r\nsubmission = list(int(x) for x in input().split())\r\n\r\nrowHack = input().split()\r\nsuccessHack = int(rowHack[0])\r\nunSuccessHack = int(rowHack[1])\r\nmaxPoints = [500,1000,1500,2000,2500]\r\n\r\nres = [0,0,0,0,0]\r\nfor i in range(5):\r\n res[i] = max(0.3 * maxPoints[i], (((1 - (points[i]/250))* maxPoints[i]) - (50 * submission[i])) )\r\n\r\nsumres = sum(res)\r\n\r\nsumres = sumres + (100*successHack) - (50 * unSuccessHack)\r\nprint(int(sumres))\r\n\r\n\r\n\r\n\r\n", "p=(500,1000,1500,2000,2500)\r\na=input().split()\r\nb=input().split()\r\nc=input().split()\r\ns=int(c[0])*100-int(c[1])*50\r\nfor i in range(5):\r\n\ts+=max((250-int(a[i]))*p[i]//250-50*int(b[i]),p[i]//10*3)\r\nprint(s)", "def solve(a,b,c):\n values = [500, 1000, 1500, 2000,2500]\n res = 0\n for i,v in enumerate(a):\n score = max(.3*values[i], ((1-(v/250))*values[i]) - 50*b[i])\n res += score\n return int(res + 100*c[0] - 50*c[1])\n\n \n\n\n\ndef main():\n # vars = list(map(int, input().split(\" \")))\n # n = int(input())\n a = list(map(int, input().split(\" \")))\n b = list(map(int, input().split(\" \")))\n c = list(map(int, input().split(\" \")))\n # arr = []\n # for i in range(n):\n # arr.append(list(map(int, input().split(\" \"))))\n print(solve(a,b,c))\n\n\nmain()\n", "problems_times = input().split()\nproblems_times = list(map(int, problems_times))\n\nproblems_wrong = input().split()\nproblems_wrong = list(map(int, problems_wrong))\n\nproblems_hacks = input().split()\nh1, h2 = int(problems_hacks[0]), int(problems_hacks[1])\n\ntotal_score = 0\nproblems_scores = [500, 1000, 1500, 2000, 2500]\nfor i in range(0, len(problems_times)):\n Xi = problems_scores[i]\n Mi = problems_times[i]\n Wi = problems_wrong[i]\n score = max(0.3*Xi, (1-(Mi/250))*Xi-50*Wi)\n total_score += score\ntotal_score += h1 * 100\ntotal_score -= h2 * 50\n\nprint(int(total_score))\n \t\t\t\t \t\t\t\t\t \t\t \t\t\t\t \t\t\t \t\t\t", "s1,s2,s3,s4,s5=map(int,input().split())\r\nw1,w2,w3,w4,w5=map(int,input().split())\r\nhs,hu=map(int,input().split())\r\na1=max(0.3*(500),((1-(s1/250))*500)-(50*w1))\r\na2=max(0.3*(1000),((1-(s2/250))*1000)-(50*w2))\r\na3=max(0.3*(1500),((1-(s3/250))*1500)-(50*w3))\r\na4=max(0.3*(2000),((1-(s4/250))*2000)-(50*w4))\r\na5=max(0.3*(2500),((1-(s5/250))*2500)-(50*w5))\r\n\r\nhacks=(hs*100)-(hu*50)\r\nprint(int(a1+a2+a3+a4+a5+hacks))", "import math\r\nfrom decimal import *\r\nimport sys\r\nfrom fractions import Fraction\r\n\r\nM=list(map(int,input().split()))\r\nW=list(map(int,input().split()))\r\nH=list(map(int,input().split()))\r\nX=[500,1000,1500,2000,2500]\r\n\r\nans = H[0]*100-H[1]*50\r\n\r\nfor i in range(0,5):\r\n ans += int(max(0.3 * X[i] , (250 - M[i]) * (X[i]/250) - 50*W[i]))\r\nprint(ans)\r\n\r\n \r\n\r\n \r\n \r\n", "m = list(map(int, input().split(\" \")))\r\nw = list(map(int, input().split(\" \")))\r\n\r\nhs, hu = map(int, input().split(\" \"))\r\n\r\ns = 0\r\n\r\ns += hs*100 - hu*50\r\n\r\nfor i in range(5):\r\n s+= max(0.3*((i+1)*500), (1-m[i]/250)*((i+1)*500) - 50*w[i])\r\n \r\nprint(int(s))\r\n ", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\n#Gets the score multiplied by 250 for problem p \r\n#with last time submission t and w WAs\r\ndef scaled_problem_score(p, t, w):\r\n\tmax_pts = 500 * p\r\n\tabs_pts = (250 - t) * max_pts - 250 * 50 * w\r\n\tmin_pts = 75 * max_pts\r\n\treturn max(min_pts, abs_pts)\r\n\r\n#Time of last submission\r\nt = [int(i) for i in input().split()]\r\n#Number of WAs\r\nw = [int(i) for i in input().split()]\r\n#Hack stats\r\nh = [int(i) for i in input().split()]\r\n\r\n#The total score\r\nscore = 0\r\n#Points from solving problems\r\nfor i in range(5):\r\n\tscore += scaled_problem_score(i+1, t[i], w[i])\r\nscore //= 250\r\n#Points from hacks\r\nscore += 100 * h[0]\r\nscore -= 50 * h[1]\r\n\r\nprint(score)\r\n", "m=[int(x) for x in input().split()]\r\nw=[int(x) for x in input().split()]\r\nh=[int(x) for x in input().split()]\r\nres=0\r\nfor i in range(5):\r\n res+=max(150*(i+1),500*(i+1)-2*m[i]*(i+1)-50*w[i])\r\nprint(res+h[0]*100-h[1]*50)", "time = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\n\r\nscore = 0\r\n\r\nfor i in range(5):\r\n score += max(0.3*500*(i+1), ((1-(time[i]/250))*(500*(i+1))-(50*w[i])))\r\n\r\nscore += (100)*h[0]\r\nscore -= (50)*h[1]\r\n\r\nprint(int(score))\r\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nn1, n2 = map(int, input().split())\r\nans = n1 * 100 - n2 * 50\r\nfor i in range(5):\r\n col = 500 * (i + 1)\r\n ans += max(0.3 * col, (1 - m[i] / 250) * col - 50 * w[i])\r\nprint(int(ans))\r\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\ns, u = map(int, input().split())\r\n\r\nscore = 0\r\nfor mi, wi, x in zip(m, w, [500, 1000, 1500, 2000, 2500]):\r\n score += max(.3 * x, (1 - mi / 250) * x - 50 * wi)\r\nscore += 100 * s\r\nscore -= 50 * u\r\nprint(int(score))\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(5):\r\n u = 500 * (i + 1)\r\n ans += max(3 * u // 10, (u - m[i] * u // 250) - 50 * w[i])\r\nhs, hu = map(int, input().split())\r\nans += 100 * hs\r\nans -= 50 * hu\r\nprint(ans)", "xs = [500, 1000, 1500, 2000, 2500]\nms = [int(x) for x in input().split()]\nws = [int(x) for x in input().split()]\nhacks = [int(x) for x in input().split()]\n\nres = 0\nfor i in range(len(xs)):\n problem = max(0.3 * xs[i], (1 - ms[i]/250) * xs[i] - 50*ws[i])\n res += problem\n\nres += 100*hacks[0] - 50*hacks[1]\nprint(int(res))\n", "m=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\nh1,h2=map(int,input().split())\r\nans=0\r\nans+=max(0.3*500,(1-m[0]/250)*500-50*w[0])\r\nans+=max(0.3*1000,(1-m[1]/250)*1000-50*w[1])\r\nans+=max(0.3*1500,(1-m[2]/250)*1500-50*w[2])\r\nans+=max(0.3*2000,(1-m[3]/250)*2000-50*w[3])\r\nans+=max(0.3*2500,(1-m[4]/250)*2500-50*w[4])\r\nans+=100*h1\r\nans-=50*h2\r\nprint(int(ans))", "a=[]\r\ni=0\r\nwhile i<2:\r\n b=input().split()\r\n a.append(b)\r\n i=i+1\r\nw=[500,1000,1500,2000,2500]\r\ni=0\r\nresult=0\r\ny=input().split()\r\nresult=result+100*int(y[0])\r\nresult=result-50*int(y[1])\r\nwhile i<5:\r\n c=0.3*w[i]\r\n d=(1-int(a[0][i])/250)*w[i]-50*int(a[1][i])\r\n result=result+max(c,d)\r\n i=i+1\r\nprint(int(result))\r\n\r\n\r\n", "M = list(map(int, input().split()))\nW = list(map(int, input().split()))\nhs, hu = map(int, input().split())\nX = [500, 1000, 1500, 2000, 2500]\n\nans = 0\nfor m, w, x in zip(M, W, X):\n ans += max(0.3 * x, (1 - m / 250) * x - 50 * w)\nans += hs * 100\nans -= hu * 50\nprint(int(ans))\n", "I=lambda:map(int,input().split())\r\nm=*I(),\r\nw=*I(),\r\ns,u=I()\r\np=[500,1000,1500,2000,2500]\r\nprint(sum(max(3*p[i]//10,(250-m[i])*p[i]//250-50*w[i])for i in range(5))+s*100-u*50)", "x = [500, 1000, 1500, 2000, 2500]\r\nm = str(input()).split()\r\nw = str(input()).split()\r\nh = str(input()).split()\r\n\r\nm = [int(xx) for xx in m]\r\nw = [int(ww) for ww in w]\r\nh = [int(hh) for hh in h]\r\n\r\n\r\ndef problem_score(xx, mm, ww):\r\n score_a = 0.3 * xx\r\n score_b = (1 - mm/250)*xx - 50*ww\r\n return max(score_a, score_b)\r\n\r\nscore = 0\r\nfor i in range(0, len(m)):\r\n score += problem_score(x[i], m[i], w[i])\r\nfor i in range(0, h[0]):\r\n score += 100\r\nfor i in range(0, h[1]):\r\n score -= 50\r\n\r\nprint(int(score))\r\n", "m = list(map(int, input().split()))\nw = list(map(int, input().split()))\nhs, hu = map(int, input().split())\nx = [500, 1000, 1500, 2000, 2500]\ndef f(m, w, x):\n\treturn max(0.3*x,(1-m/250)*x-50*w)\nsol = 0\nfor i in range(5):\n\tsol += f(m[i], w[i], x[i])\nsol += 100*hs-50*hu\nsol = int(sol)\nprint(sol)\n", "m = input().split()\nw = input().split()\nhs,hu = map(int,input().split())\nvalue = 0\npont = 0\ntotal = 0\nfor i in range(5):\n value+=500\n spont = 0.3*value\n pont=(1-(int(m[i])/250))*value-50*int(w[i])\n \n if pont > spont:\n total+=pont\n else:\n total+=spont\n\ntotal+=100*hs-50*hu\n\nprint(int(total))", "x = [500,1000,1500,2000,2500]\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\ns, u = map(int, input().split())\r\nans = 0\r\nfor i in range(5):\r\n\tv1 = x[i] * 3 // 10\r\n\tv2 = ((1 - (m[i] / 250)) * x[i]) - (50 * w[i])\r\n\tans += max(v1,v2)\r\nans += s * 100\r\nans -= u * 50\r\nprint(int(ans))", "from sys import stdin\n\ntimes = stdin.readline().rstrip().split(' ')\ntimes = [int(t) for t in times]\nwrong_submissions = stdin.readline().rstrip().split(' ')\nwrong_submissions = [int(t) for t in wrong_submissions]\nhacks = stdin.readline().rstrip().split(' ')\nhacks = [int(t) for t in hacks]\n\n\nscore = 100*hacks[0] - 50*hacks[1]\n\nfor i in range(5):\n\tx = 500*(i+1)\n\tscore += max(0.3*x, (1 - times[i]/250)*x - 50*wrong_submissions[i])\n\nprint(int(score))\n", "a = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nans = c[0] * 100 - c[1] * 50\r\nfor i in range(5):\r\n ans += max(0.3 * (i + 1) * 500, (1 - a[i] / 250) * (i + 1) * 500 - 50 * b[i])\r\nprint(round(ans))", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nhs, hu = map(int, input().split())\r\n\r\ns = [500 * (x + 1) for x in range(5)]\r\n\r\nfor i in range(5):\r\n s[i] = max(0.3 * s[i], (1 - m[i]/250) * s[i] - 50 * w[i])\r\n\r\ns_t = sum(s) + 100 * hs - 50 * hu\r\n\r\nprint(int(s_t))", "#!/usr/bin/python3\nfrom fractions import *\nX = [500, 1000, 1500, 2000, 2500]\nM = [int(x) for x in input().strip().split()]\nW = [int(x) for x in input().strip().split()]\nA,B = [int(x) for x in input().strip().split()]\ntotal = 0\nfor x in range(5):\n\ttotal += max(Fraction(3,10)*X[x],(1-Fraction(M[x],250))*X[x] - 50*W[x])\n\ntotal += A*100 - B*50\nprint(total)\n", "l_m = list(map(int, input().split()))\r\nl_w = list(map(int, input().split()))\r\nl_h = list(map(int, input().split()))\r\n\r\nt = 0\r\n\r\nfor i in range(1, len(l_m) + 1):\r\n t += max(0.3*500*i, (1 - l_m[i - 1] / 250) * 500 * i - 50 * l_w[i - 1])\r\nprint(int(t + l_h[0] * 100 - l_h[1] * 50))", "m = list(map(int , input().split()))\r\nw = list(map(int , input().split()))\r\nh = list(map(int , input().split()))\r\ns = [500 , 1000 , 1500 , 2000 , 2500]\r\n\r\nsum = 0\r\n\r\nfor i in range(5):\r\n f = 0.3 * int(s[i])\r\n l = (1 - m[i] / 250)*int(s[i]) - 50*w[i]\r\n\r\n if f>l:\r\n sum += f\r\n else:\r\n sum += l \r\n\r\n\r\nsum += (h[0] * 100 - h[1] * 50)\r\nprint(int(sum))", "m = list(map(int , input().split()))\r\nw = list(map(int , input().split()))\r\ns , u = map(int , input().split())\r\nscore = 0\r\ni = 0\r\npoint = 500\r\nwhile i<len(m):\r\n score = score + max( 0.3*point , ( ( ( 1 - (m[i]/250) )*point ) - ( 50*w[i] ) ) )\r\n i = i + 1\r\n point = point + 500\r\nscore = score + 100*s - 50*u\r\nprint(int(score))", "import sys\r\n\r\ninput_file = sys.stdin\r\n#input_file = open(\"in.txt\")\r\n\r\ntimes = list(map(int,input_file.readline().rstrip().split()))\r\nwr_sub = list(map(int,input_file.readline().rstrip().split()))\r\nhacks = list(map(int,input_file.readline().rstrip().split()))\r\n\r\nsum = 0\r\n\r\nfor index in range(5):\r\n opt = (index+1)*500\r\n sum += max(0.3 * opt, (1 - times[index]/250)*opt - 50 * wr_sub[index])\r\n\r\nsum += hacks[0] * 100\r\nsum -= hacks[1] * 50\r\n\r\nprint(int(sum))\r\n", "m = list(map(int,input().split()))\r\nw= list(map(int,input().split()))\r\nha , hu = map(int,input().split())\r\n\r\nh = [500,1000,1500,2000,2500]\r\n\r\nres = 0.0\r\n\r\nfor i in range(5):\r\n res += max(0.3*h[i] , (1.0 - m[i] / 250.0)*h[i] - 50.0*w[i])\r\n\r\nres += ha * 100.0\r\nres -= hu * 50.0\r\n\r\nprint(int(res))\r\n\r\n\r\n\r\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nx = sum([max(0.3 * x * 500, ((1 - (t / 250)) * x * 500) - (50 * a)) for x, t, a in zip(range(1, 6), m, w)]) + (\r\n h[0] * 100) - (h[1] * 50)\r\nprint(int(x))\r\n", "point = [500, 1000, 1500, 2000, 2500]\nminutes = list(map(int, input().split()))\nwrong = list(map(int, input().split()))\nhack = list(map(int, input().split()))\nanswer = 0\n\nfor x, m, w in zip(point, minutes, wrong):\n answer += max(0.3 * x, (1 - m / 250) * x - 50 * w)\n\nanswer += hack[0] * 100 - hack[1] * 50\n\nprint(int(answer))\n", "m = list(map(int, input().split()))\nw = list(map(int, input().split()))\nscs, fld = map(int, input().split())\nans = 0\ncontest = [500, 1000, 1500, 2000, 2500]\ni = 0\nfor problem in contest:\n ans += max(0.3 * problem, (1 - m[i] / 250) * problem - 50 * w[i])\n i += 1\nprint(round(ans + 100 * scs - 50 * fld))\n", "m = input().split()\r\nfor i in range(5):\r\n m[i] = int(m[i])\r\nw = input().split()\r\nfor i in range(5):\r\n w[i] = int(w[i])\r\nh = input().split()\r\nfor i in range(2):\r\n h[i] = int(h[i])\r\nscore = 0\r\nfor i in range(5):\r\n x = (i+1)*500\r\n score += max(0.3*x, (1-m[i]/250)*x-50*w[i])\r\nscore += h[0]*100+h[1]*-50\r\nprint(int(score))\r\n", "a = [500, 1000, 1500, 2000, 2500]\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nhs, hu = map(int, input().split())\r\nsumma = 0\r\nfor i in range(len(m)):\r\n maxbal = max(0.3 * a[i], (1 - m[i] / 250) * a[i] - 50 * w[i])\r\n summa += maxbal\r\n\r\nhs *= 100\r\nhu *= 50\r\n\r\nprint(int(summa + hs - hu))\r\n", "m=[int(i) for i in input().split()]\r\nw=[int(i) for i in input().split()]\r\nhp,hf=map(int,input().split())\r\nsm=0 \r\nx=[500,1000,1500,2000,2500]\r\nfor i in range(5):\r\n sm+=max(x[i]*(0.3),(1-m[i]/250)*x[i]-50*w[i])\r\nsm+=hp*100 \r\nsm-=hf*50 \r\nprint(int(sm))", "class CodeforcesTask604ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.times = []\r\n self.subs = []\r\n self.hacks = []\r\n\r\n def read_input(self):\r\n self.times = [int(x) for x in input().split(\" \")]\r\n self.subs = [int(x) for x in input().split(\" \")]\r\n self.hacks = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n scores = [max(0.3 * (x + 1) * 500, (1 - self.times[x]/250) * ((x + 1) * 500) - 50 * self.subs[x]) for x in range(len(self.subs))]\r\n self.result = str(int(sum(scores) - self.hacks[1] * 50 + self.hacks[0] * 100))\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask604ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "m = list(map(int, input().split(' ')))\nw = list(map(int, input().split(' ')))\nh = list(map(int, input().split(' ')))\nx = [500, 1000, 1500, 2000, 2500]\nres = 0\n\nfor i,j,y in zip(m, w, x):\n res += max(0.3*y, (1-(i/250)) * y - 50*j)\n\nres += 100*h[0]\nres -= 50*h[1]\nprint(int(res))\n\n\n", "xs = [500, 1000, 1500, 2000, 2500]\nms = [int(i) for i in input().split()]\nws = [int(i) for i in input().split()]\nh1, h2 = map(int,input().split())\nr = 0\nfor i in range(5):\n x, m, w = xs[i], ms[i], ws[i]\n r += max(x*0.3, (1-m/250)*x - 50*w)\nprint(int(r + 100*h1 - 50*h2))\n", "t=list(map(int,input().split()))\r\n\r\ns=list(map(int,input().split()))\r\n\r\ny=list(map(int,input().split()))\r\n\r\no=[500,1000,1500,2000,2500]\r\n\r\np=0\r\nfor k in range(len(t)):\r\n p+=max(0.3*o[k],(1-t[k]/250)*o[k]-50*s[k])\r\n\r\nprint(int(p+100*y[0]-50*y[1]))\r\n", "import sys\nm=list(map(int,sys.stdin.readline().split()))\nw=list(map(int,sys.stdin.readline().split()))\ns,u=map(int,sys.stdin.readline().split())\nscore=0\nfor it in range(5):\n\tscore+=max(0.3*500*(it+1),((1-m[it]/250)*500*(it+1))-50*w[it])\nscore+=100*s-50*u\nprint (int(score))", "import sys\r\nx1 = 500\r\nx2 = 1000\r\nx3 = 1500\r\nx4 = 2000\r\nx5 = 2500\r\nm1,m2,m3,m4,m5 = map(int,input().split())\r\nw1,w2,w3,w4,w5 = map(int,input().split())\r\nh1,h2 = map(int,input().split())\r\n\r\nres1 = max( (0.3*x1),( (1 - (m1/250) )*x1 ) - 50*w1 )\r\nres2 = max( (0.3*x2),( (1 - (m2/250) )*x2 ) - 50*w2 )\r\nres3 = max( (0.3*x3),( (1 - (m3/250) )*x3 ) - 50*w3 )\r\nres4 = max( (0.3*x4),( (1 - (m4/250) )*x4 ) - 50*w4 )\r\nres5 = max( (0.3*x5),( (1 - (m5/250) )*x5 ) - 50*w5 )\r\n\r\nres = ( res1 + res2 + res3 + res4 + res5 ) + 100*h1 - 50*h2\r\n\r\nprint(int(res))", "times = [int(x) for x in input().split(\" \")]\nwrong = [int(x) for x in input().split(\" \")]\nother = [int(x) for x in input().split(\" \")]\n\nscore = 0\n\nfor i in range(1, 6):\n score += max(.3*i*500, (1-(times[i-1]/250))*i*500-50*wrong[i-1])\n\nscore += (other[0]*100-50*other[1])\n\nprint(int(score))", "mxs = range(500, 2501, 500)\nmm = list(map(int, input().split()))\ntries = list(map(int, input().split()))\nhcks = list(map(int, input().split()))\n\nprint( int(sum([(max(0.3*x, (1-m/250)*x-50*w)) for x,w,m in zip(mxs, tries, mm)]) + 100*hcks[0] - 50*hcks[1] ) )\n\n", "a = *map(int, input().split()),\nb = *map(int, input().split()),\nc = (500, 1000, 1500, 2000, 2500)\nhs, hu = map(int, input().split())\nx = sum(max(0.3 * x, (1 - m / 250) * x - 50 * w) for m, w, x in zip(a, b, c)) + 100 * hs - 50 * hu\nprint(int(x))\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nhs, hu = map(int, input().split())\r\nans = 0\r\nfor i in range(5):\r\n ans += max(150 * (i + 1), (500 - 2 * m[i])* (i + 1) - 50 * w[i])\r\nans += 100 * hs - 50 * hu\r\nprint(ans)\r\n", "a=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nc=[500,1000,1500,2000,2500]\r\nd=[int(i) for i in input().split()]\r\ni=0\r\nsum=0\r\nwhile i<5:\r\n\tsum+=max(0.3*c[i] ,(1-(a[i]/250))*c[i]-50*b[i])\r\n\ti+=1\r\nsum+= d[0]*100 -d[1]*50\r\nprint(int(sum),end='')", "s=0\r\na, b, c, d, e = map(int, input().split(' '))\r\nll = list(map(int, input().split(' ')))\r\nxx, yy = map(int, input().split(' '))\r\npt = [500, 1000, 1500, 2000, 2500]\r\nk = [a, b, c, d, e]\r\nfor i in range(5):\r\n s += max(0.3*pt[i], (1-(k[i])/250)*pt[i] - 50 * ll[i])\r\n\r\nprint(int(s + 100*xx-50*yy))\r\n", "import sys\n\nmn = list(map(int, sys.stdin.readline().split()))\nwn = list(map(int, sys.stdin.readline().split()))\nhs, hu = map(int, sys.stdin.readline().split())\nxn = [1, 2, 3, 4, 5]\n\nans = 0\nfor i in range(5):\n ans += max(150*xn[i], 500*xn[i] - 2*mn[i]*xn[i] - 50*wn[i])\n\nans += hs*100 - hu*50\nprint(ans)\n", "def n():\r\n return list(map(int, input().split())) \r\nm, w, h, r, p = n(), n(), n(), 0, [500,1000,1500,2000,2500]\r\nfor i in range(5):\r\n r += max(0.3*p[i], (1-m[i]/250)*p[i] - 50*w[i])\r\nr += h[0] * 100 - h[1] * 50\r\nprint(int(r))\r\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\ncost = [500, 1000, 1500, 2000, 2500]\r\nhs, hu = map(int, input().split())\r\nans = 0\r\nfor i in range(5):\r\n ans += max(0.3*cost[i], (1-(m[i]/250))*cost[i]-50*w[i])\r\nans += 100*hs\r\nans -= 50*hu\r\nprint(int(ans))\r\n", "a=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nsu,un=list(map(int,input().split()))\r\nla=0\r\npl=0\r\nfor x in range(5):\r\n la+=500\r\n pa=0.3*la\r\n ka=((1-(a[x]/250))*la)-(50*l[x])\r\n sam=max(pa,ka)\r\n pl+=sam\r\nda=(100*su)-(50*un)\r\nprint(int(pl+da))", "m1,m2,m3,m4,m5 = list(map(int,input().split()))\r\nw1,w2,w3,w4,w5 = map(int,input().split())\r\nhs,hu = map(int,input().split())\r\n\r\na1 = max(0.3*500,(1-m1/250)*500-50*w1)\r\na2 = max(0.3*1000,(1-m2/250)*1000-50*w2)\r\na3 = max(0.3*1500,(1-m3/250)*1500-50*w3)\r\na4 = max(0.3*2000,(1-m4/250)*2000-50*w4)\r\na5 = max(0.3*2500,(1-m5/250)*2500-50*w5)\r\n\r\nprint(int(a1+a2+a3+a4+a5+(100*hs)-50*hu))", "# print(\"Input the five times\")\ntimes = [int(x) for x in input().split()]\n\n# print(\"Input the wrong answers\")\nwrong = [int(x) for x in input().split()]\n\n# print(\"Input the hack info\")\ngoodh, badh = [int(x) for x in input().split()]\n\nmaxpoints = [500*i for i in range(1,6)]\nanswer = 0\nfor i in range(5):\n answer += max(maxpoints[i] * 0.3, (1 - times[i]/250) * maxpoints[i] - 50 * wrong[i])\n\nanswer += goodh * 100\nanswer -= badh * 50\n\nprint(int(answer))\n", "mi = list(map(int, input().split()))\nwi = list(map(int, input().split()))\nh = list(map(int, input().split()))\nscore = 0\n\nfor i, m in enumerate(mi):\n x = (i+1)*500\n w = wi[i]\n score += max((0.3*x), ((1 - m/250)*x - 50*w))\n\nscore += 100*h[0]\nscore -= 50*h[1]\n\nprint(int(score))\n \t \t \t \t\t \t \t\t \t\t\t \t \t\t\t \t", "m = input().split()\r\nw = input().split()\r\na,b = input().split()\r\nans = int(a)*100 - int(b)*50\r\nfor i in range(5):\r\n x = (i+1)*500\r\n ans += max(.3*x, (1 - int(m[i])/250)*x - 50*int(w[i]))\r\nprint (int(ans))", "m = input()\nw = input()\nh = input()\n\nm = m.split(' ')\nw = w.split(' ')\nh = h.split(' ')\n\npoints = [500, 1000, 1500, 2000, 2500]\nscore = 0\n\nfor i in range(0, 5):\n m[i] = int(m[i])\n w[i] = int(w[i])\n score += max(points[i]*0.3, (1 - m[i]/250)*points[i] - 50*w[i])\nscore += int(h[0])*100 - int(h[1])*50\nprint(int(score))", "r = lambda : list(map(int, input().split()))\r\narr = r()\r\nw = r()\r\nhacks = r()\r\n\r\nscore = 0\r\nfor i in range(5):\r\n tot = (500*(i+1))\r\n score += max(0.3 * tot , tot * (1 - arr[i]/250) - 50 * w[i])\r\n\r\n\r\nscore += 100 * hacks[0]\r\nscore -= 50 * hacks[1]\r\n\r\n\r\nprint(int(score))\r\n\r\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nq = [500, 1000, 1500, 2000, 2500]\r\ns = 0\r\nfor i in range(5):\r\n s += max(0.3 * q[i], (1 - m[i] / 250) * q[i] - 50 * w[i])\r\nh1, h2 = map(int, input().split())\r\ns += 100 * h1\r\ns -= 50 * h2\r\nprint(int(s))\r\n", "z=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\na=sum( [max(.3*(500*(i+1)),((1-(z[i]/250))*(500*(i+1))-(50*x[i]))) for i in range(5)])\r\nprint(int(a+(c[0]*100)-(c[1]*50)))", "totalScore = 0\r\n\r\nminutes = list(map(int, input().split()))\r\nwrongs = list(map(int, input().split()))\r\nhack1, hack2 = map(int, input().split())\r\nx = [500, 1000, 1500, 2000, 2500]\r\n\r\n\r\nfor i in range(5):\r\n buffer = max((0.3*x[i]), ((1-(minutes[i]/250))*x[i])-(50*wrongs[i]))\r\n totalScore += buffer\r\n\r\n\r\ntotalScore += (hack1*100)\r\ntotalScore -= (hack2*50)\r\n\r\nprint(int(totalScore))\r\n", "I=lambda:list(map(int,input().split()))\r\nf=lambda x,m,w:max(0.3*x,(1-m/250)*x-50*w)\r\nm=I()\r\nw=I()\r\nh=I()\r\nprint(int(h[0]*100-h[1]*50+sum([f(500*(i+1),m[i],w[i]) for i in range(5)])))", "def main():\r\n times = input().split()\r\n time1 = float(times[0])\r\n time2 = float(times[1])\r\n time3 = float(times[2])\r\n time4 = float(times[3])\r\n time5 = float(times[4])\r\n wrongs = input().split()\r\n wrong1 = int(wrongs[0])\r\n wrong2 = int(wrongs[1])\r\n wrong3 = int(wrongs[2])\r\n wrong4 = int(wrongs[3])\r\n wrong5 = int(wrongs[4])\r\n hacks = input().split()\r\n hack_complete = int(hacks[0])\r\n hack_failed = int(hacks[1])\r\n sum = max(0.3 * 500, (1-time1/250)*500 - 50*wrong1) + max(0.3 * 1000, (1-time2/250)*1000 - 50*wrong2) + max(0.3 * 1500, (1-time3/250)*1500 - 50*wrong3) + max(0.3 * 2000, (1-time4/250)*2000 - 50*wrong4) + max(0.3 * 2500, (1-time5/250)*2500 - 50*wrong5) + 100*hack_complete - 50*hack_failed\r\n print(int(sum))\r\nmain()\r\n", "#!/usr/bin/env python3\r\n\r\nimport sys\r\n\r\ninput = iter(sys.stdin.read().splitlines()).__next__\r\n\r\n#from io import StringIO\r\n#sys.stdout = StringIO()\r\n#from atexit import register\r\n#register(lambda: sys.stdout.write(sys.stdout.getvalue()))\r\n\r\n\r\nsys.setrecursionlimit(10000)\r\n\r\nM = list(map(int, input().split()))\r\nW = list(map(int, input().split()))\r\nhs, hu = map(int, input().split())\r\n\r\nX = [500, 1000, 1500, 2000, 2500]\r\nscore = 0\r\nfor i in range(5):\r\n score += max(3*X[i]//10, ((250 - M[i])*X[i])//250 - 50*W[i])\r\n\r\nscore += hs*100 - hu*50\r\n\r\nprint(score)\r\n", "def calculateScore(t, w, hs, hu):\n\tmaxScore = [500,1000,1500,2000,2500]\n\tscore = 0\n\t\n\tfor i in range(5):\n\t\tscore += max(0.3*maxScore[i],(1-t[i]/250)*maxScore[i]-50*w[i])\n\n\treturn int(score + hs*100 - hu*50)\n\n\nif __name__==\"__main__\":\n\tt1, t2, t3, t4, t5 = input().split()\n\tt1, t2, t3, t4, t5 = int(t1),int(t2),int(t3),int(t4),int(t5)\n\tw1, w2, w3, w4, w5 = input().split()\n\tw1, w2, w3, w4, w5 = int(w1),int(w2),int(w3),int(w4),int(w5)\n\ths, hu = input().split()\n\ths, hu = int(hs),int(hu)\n\tt = [t1,t2,t3,t4,t5]\n\tw = [w1,w2,w3,w4,w5]\n\tscore = calculateScore(t, w, hs, hu)\n\tprint(score)", "time = list(map(int,input().split()))\nwa = list(map(int,input().split()))\nhacks = list(map(int,input().split()))\n\npoints = [500,1000,1500,2000,2500]\nans = 0\n\nfor i in range(1,6):\n a = 0.3*points[i-1]\n b = (1-time[i-1]/250)*points[i-1]-50*wa[i-1]\n ans+=max(a,b)\n\nans+=hacks[0]*100-hacks[1]*50\n\n\nprint(int(ans))\n\n \t \t\t\t\t \t\t \t\t \t\t\t \t\t \t \t\t \t", "m = [int(x) for x in input().split()]\r\nw = [int(x) for x in input().split()]\r\nhs, hu = [int(x) for x in input().split()]\r\nk = [500, 1000, 1500, 2000, 2500]\r\nc = 0\r\nfor x in range(len(k)):\r\n c+=max(0.3*k[x],((1-(m[x]/250))*k[x])-(50*w[x]))\r\nprint(int(c+(hs*100)-(hu*50)))", "scores = [500, 1000, 1500, 2000, 2500]\r\n\r\n\r\ndef cowforces(lst1, lst2, hs, hu):\r\n total = 0\r\n for i in range(len(lst1)):\r\n total += max(3 * scores[i] / 10, (250 - lst1[i]) * scores[i] / 250 - 50 * lst2[i])\r\n return int(total + hs * 100 - hu * 50)\r\n\r\n\r\nm = [int(x) for x in input().split()]\r\nw = [int(y) for y in input().split()]\r\nh_s, h_u = [int(z) for z in input().split()]\r\nprint(cowforces(m, w, h_s, h_u))\r\n", "m = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\nhs,hu = map(int,input().split())\r\n\r\n\r\ns=0\r\ndef score(x,m,w):\r\n return max(0.3*x,(1-m/250)*x-50*w)\r\n\r\nfor i in range(1,6):\r\n s += score(500*i,m[i-1],w[i-1])\r\n\r\ns += 100*hs-50*hu\r\nprint(int(s))\r\n\r\n", "import math\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nhs, hf = map(int, input().split())\r\nres = 0\r\nx = 500\r\nfor i in range(len(m)):\r\n res += max(0.3 * x, (1 - m[i] / 250) * x - 50 * w[i])\r\n x += 500\r\nres += hs * 100\r\nres -= hf * 50\r\nprint(math.trunc(res))\r\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc,d=list(map(int,input().split()))\r\ne=0\r\nfor i in range(5):\r\n\te+=max(.3*500*(i+1),((1-(a[i]/250))*(500*(i+1)))-(50*b[i]))\r\nprint(int(e)+(100*c)-(50*d))", "#7-A. Uncowed Forces\r\n\r\nm = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\ns , u = map(int,input().split())\r\nx = [500 , 1000 , 1500 , 2000 , 2500]\r\nans = 0\r\n\r\nfor i in range(5):\r\n ans += max(0.3*x[i] , (1-m[i]/250)*x[i]-50*w[i])\r\n\r\nans += s * 100\r\nans -= u * 50\r\n\r\nprint(int(ans))\r\n\r\n", "l=[500,1000,1500,2000,2500]\r\nm=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\nx,y=map(int,input().split())\r\ns=0\r\nfor i in range(5):\r\n s=s+max(0.3*l[i],(1-m[i]/250)*l[i]-50*w[i])\r\ns=s+x*100-y*50\r\nprint(int(s))\r\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nx = [500, 1000, 1500, 2000, 2500]\r\nhs, hu = map(int, input().split())\r\nts = 0\r\nfor i in range(5):\r\n ts += max(0.3 * x[i], ((1 - (m[i] / 250)) * x[i] - 50 * w[i]))\r\nts += hs * 100 - hu * 50\r\nprint(int(ts))\r\n", "m = [int(i) for i in input().split()]\nw = [int(i) for i in input().split()]\nhs, hw = map(int, input().split())\nr = 50 * (2 * hs - hw)\nfor i in range(5):\n wt = (i + 1) * 500\n r += max(3 * wt // 10, (250 - m[i]) * wt // 250 - 50 * w[i])\nprint(r)", "marks=[500,1000,1500,2000,2500]\r\ntime=[int(i) for i in input().split()]\r\nwrong=[int(i) for i in input().split()]\r\nh,u=map(int,input().split())\r\nans=0\r\nfor i in range(5):\r\n ans=ans+max([0.3*marks[i],((1-time[i]/250)*marks[i])-(50*wrong[i])])\r\nans=ans+h*100-50*u\r\nprint(int(ans))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "x = [500, 1000, 1500, 2000, 2500]\nm = list(map(float, input().split()))\nw = list(map(int, input().split()))\nscore = 0\nl = list(map(int, input().split()))\nscore += l[0]*100\nscore -= l[1]*50\nfor i in range(5):\n score += max([0.3*x[i], (1-m[i]/250)*x[i]-50*w[i]])\nprint(int(score))\n", "x = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nz = list(map(int, input().split()))\r\n\r\nt = 0\r\n\r\nfor i in range(1, len(x) + 1):\r\n t += max(0.3*500*i, (1 - x[i - 1] / 250) * 500 * i - 50 * y[i - 1])\r\nprint(int(t + z[0] * 100 - z[1] * 50))", "def solve(submission_times, wrong_submissions, hacking_attempts):\r\n ans = 0\r\n points = [500, 1000, 1500, 2000, 2500]\r\n for x, m, w in zip(points, submission_times, wrong_submissions):\r\n ans += max(0.3 * x, (1 - m/250) * x - 50 * w)\r\n\r\n ans += 100 * hacking_attempts[0]\r\n ans -= 50 * hacking_attempts[1]\r\n return int(ans)\r\n\r\n\r\ndef main():\r\n m = [int(c) for c in input().split()]\r\n w = [int(c) for c in input().split()]\r\n h = [int(c) for c in input().split()]\r\n ans = solve(m, w, h)\r\n print(ans)\r\n\r\nmain()\r\n", "m = list(map(int, input().split(' ')))\nw = list(map(int, input().split(' ')))\nhs, hu = list(map(int, input().split(' ')))\nx = [500, 1000, 1500, 2000, 2500]\n\n#p = hs * 100 - hu * 50\n#for i in range(5):\n#\tp += max(0.3 * (i * 500 + 500), int((i * 500 + 500) - m[i] * (i * 500 + 500) / 250 - 50 * w[i]))\n\np = 0\nfor i in range(5):\n\tp += max(0.3 * x[i], (1 - m[i] / 250) * x[i] - 50 * w[i])\np += 100 * hs\np -= 50 * hu\n\nprint(int(p))", "m=list(map(int, input().split()))\r\nw=list(map(int, input().split()))\r\nhs,hu=list(map(int, input().split()))\r\n\r\npts = [500,1000,1500,2000,2500]\r\nscore=0\r\n\r\nfor i in range(5):\r\n score+=max(0.3*pts[i],(1-m[i]/250)*pts[i]-50*w[i])\r\n\r\nscore+=hs*100\r\nscore-=hu*50\r\nprint(int(score))\r\n", "x = [i for i in range(500, 3000, 500)]\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nans = 0\r\ni = 0\r\nwhile i < len(x):\r\n ans += max(0.3 * x[i], (1 - m[i] / 250) * x[i] - 50 * w[i])\r\n i += 1\r\n \r\ncntg, cntb = map(int, input().split())\r\nans += (cntg * 100 - cntb * 50)\r\nprint(int(ans))", "m = list(map(int, input().split(\" \")))\r\nw = list(map(int, input().split(\" \")))\r\nh,sum,x = list(map(int, input().split(\" \"))),0,500\r\nfor i in range(5):\r\n sum+=max(0.3*x,(1-(m[i]/250))*x-(50*w[i]))\r\n x+=500\r\nprint(int(sum+(h[0]*100)-(h[1]*50)))", "rating = 0\nt = list(map(int, input().split()))\nw = list(map(int, input().split()))\nhack, unhack = map(int, input().split())\nfor i in range(5):\n rating += max(150*(i+1), (i+1)*500-t[i]*2*(i+1)-50*w[i])\nrating += 100*hack - 50*unhack\nprint(rating)\n\n\t \t \t \t \t\t \t\t \t\t \t\t\t \t", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nscore = 0\r\nm, w = arr_inp(), arr_inp()\r\nhs, hu = map(int, input().split())\r\n\r\nfor i in range(5):\r\n x = (i + 1) * 500\r\n score += max(.3 * x, ((1 - (m[i] / 250)) * x) - (50 * w[i]))\r\n\r\nscore += 100 * hs - 50 * hu\r\nprint(int(score))\r\n", "S = [500, 1000, 1500, 2000, 2500]\r\nM = list(map(int,input().split()))\r\nW = list(map(int,input().split()))\r\nH, F = map(int, input().split())\r\n\r\nan = 0\r\n\r\nfor i in range(5):\r\n x = S[i]\r\n m = M[i]\r\n w = W[i]\r\n an += max(0.3 * x, ( 1 - m / 250) * x - 50 * w)\r\n\r\nan += H * 100 - F * 50\r\nprint(int(an))", "m=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\na,b=(map(int,input().split()))\r\nans=0\r\nans+=(a*100)-(50*b)\r\nfor i in range(1,6):\r\n x=500*i;\r\n y=0.3*x;\r\n z=(1-(m[i-1]/250))*x-50*w[i-1];\r\n ans+=max(y,z);\r\nprint(int(ans))", "p = [500, 1000, 1500, 2000, 2500]\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nres = 0\r\nfor xi, mi, wi in zip(p, m, w):\r\n tmp = max(0.3 * xi, (1 - mi / 250) * xi - 50 * wi)\r\n res += tmp\r\nres += h[0] * 100 - h[1] * 50\r\nprint(int(res))\r\n", "m=list(map(int,input().split()));w=list(map(int,input().split()));s,us=map(int,input().split())\r\npt=[500*i for i in range(1,6)];p=s*100-us*50\r\nfor i in range(5):p+=max(0.3*pt[i],(1-m[i]/250)*pt[i]-50*w[i])\r\nprint(int(p))", "cin = lambda:map(int,input().split())\r\nx=500\r\nsum=0\r\n\r\nfor i,j in zip(cin(),cin()):\r\n sum+= max(0.3*x,(1-i/250)*x - 50*j)\r\n x+=500\r\ns,u=cin()\r\nprint(int(sum+100*s-50*u)) ", "m = [int(i) for i in input().split()]\r\nw = [int(i) for i in input().split()]\r\nhs, hu = [int(i) for i in input().split()]\r\nx = [500 * i for i in range(1, 6)]\r\nans = 0.0\r\nfor i in range(5):\r\n ans += max(0.3 * x[i], (1 - (m[i] / 250)) * x[i] - 50 * w[i])\r\nans += 100 * hs - 50 * hu\r\nprint(int(ans))\r\n", "M = input().split()\r\nfor i in range (5):\r\n M[i]=int(M[i])\r\n\r\nW = input().split()\r\nfor i in range (5):\r\n W[i]=int(W[i])\r\n\r\nh = input().split()\r\nfor i in range (2):\r\n h[i]=int(h[i])\r\n\r\ndef maxim (a,b):\r\n if a>=b:\r\n return a\r\n else:\r\n return b\r\n\r\nres=0\r\nx=500\r\nfor i in range(5):\r\n res1 = 0.3*x\r\n res2 = ((1-M[i]/250)*x - 50*W[i])\r\n res = res + maxim(res1,res2)\r\n x+=500\r\n\r\nres += h[0]*100\r\nres-=h[1]*50\r\nprint(int(res))", "a= list(map(int, input().split()))\r\nb= list(map(int, input().split()))\r\nc= list(map(int, input().split()))\r\nscore=c[0]*100-c[1]*50\r\nscore+=max(0.3*500,(1-a[0]/250)*500-50*b[0])+max(0.3*1000,(1-a[1]/250)*1000-50*b[1])+max(0.3*1500,(1-a[2]/250)*1500-50*b[2])+max(0.3*2000,(1-a[3]/250)*2000-50*b[3])+max(0.3*2500,(1-a[4]/250)*2500-50*b[4])\r\nscore=int(score)\r\nprint(score)\r\n", "I = lambda: map(int, input().split())\r\n\r\npoints = sum(max(150 * i, (500 - 2 * m) * i - 50 * w)\r\n for i, m, w in zip(range(1, 6), I(), I()))\r\nhs, hu = I()\r\nprint(points + 100 * hs - 50 * hu)", "if __name__ == '__main__':\n parr = [500, 1000, 1500, 2000, 2500]\n marr = list(map(int, input().split()))\n warr = list(map(int, input().split()))\n\n s = 0\n\n for i in range(5):\n x = parr[i]\n m = marr[i]\n w = warr[i]\n s += max(0.3 * x, (((250 - m) * x) // 250) - (50 * w))\n\n hs, hu = map(int, input().split())\n\n s += 100 * hs\n s -= 50 * hu\n\n print(int(s))\n", "def solve():\r\n m = list(map(int, input().split()))\r\n w = list(map(int, input().split()))\r\n hs, hu = map(int, input().split())\r\n x = [500, 1000, 1500, 2000, 2500]\r\n total = 0\r\n for i in range(5):\r\n if 3*x[i]/10 > ((x[i]-m[i]*x[i]/250)-50*w[i]):\r\n total += 3*x[i]/10\r\n else:\r\n total += ((x[i]-m[i]*x[i]/250)-50*w[i])\r\n total += hs*100\r\n total -= hu*50\r\n print(int(total))\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n#ksodp orz\r\n#pls dont destroy me", "def score(m,w,x):\r\n return max(0.3*x,(1-m/250)*x-50*w)\r\nm1,m2,m3,m4,m5=(map(int,input().split()))\r\nw1,w2,w3,w4,w5=(map(int,input().split()))\r\nhs,hu=(map(int,input().split()))\r\nx1,x2,x3,x4,x5=(500,1000,1500,2000,2500)\r\nprint(round(score(m1,w1,x1)+score(m2,w2,x2)+score(m3,w3,x3)+score(m4,w4,x4)+score(m5,w5,x5))+100*hs-50*hu)\r\n", "m1, m2, m3, m4, m5 = map(int, input().split())\r\nw1, w2, w3, w4, w5 = map(int, input().split())\r\nh1, h2 = map(int, input().split())\r\nres = (max((0.3 * 500), ((1 - m1 / 250) * 500 - 50 * w1))) + \\\r\n (max((0.3 * 1000), ((1 - m2 / 250) * 1000 - 50 * w2))) + \\\r\n (max((0.3 * 1500), ((1 - m3 / 250) * 1500 - 50 * w3))) + \\\r\n (max((0.3 * 2000), ((1 - m4 / 250) * 2000 - 50 * w4))) + \\\r\n (max((0.3 * 2500), ((1 - m5 / 250) * 2500 - 50 * w5))) + \\\r\n -50 * h2 + 100 * h1\r\nprint(int(res))\r\n", "minutes = list(map(int, input().split()))\r\nwrong_anses = list(map(int, input().split()))\r\nsucsess, not_sucsess = map(int, input().split())\r\npoints = [500, 1000, 1500, 2000, 2500]\r\n\r\nans = 100 * sucsess - 50 * not_sucsess\r\n\r\n\r\nfor i in range(5):\r\n x = points[i]\r\n m = minutes[i]\r\n w = wrong_anses[i]\r\n cur_score = max( 0.3 * x, (1 - m / 250) * x - 50 * w )\r\n\r\n ans += cur_score\r\n\r\n\r\nprint(int(ans))", "m = [int(i) for i in input().split(\" \")]\r\nw = [int(i) for i in input().split(\" \")]\r\nhs, hu = [int(i) for i in input().split(\" \")]\r\nscore = 0\r\nfor i in range(5):\r\n score += max(0.3 * 500 * (i+1), (1 - m[i]/250) * (500 * (i+1)) - 50 * w[i])\r\nscore += 100 * hs\r\nscore -= 50 * hu\r\nprint(int(score))", "M = list(map(int,input().split()))\r\nW = list(map(int,input().split()))\r\nt,f = map(int,input().split())\r\nX = 0\r\nfor i in range(5):\r\n x = (i + 1)*500\r\n X += max(0.3*x, (1 - M[i]/250)*x - 50*W[i])\r\nX += t*100 - f*50\r\nprint(int(X))", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\na, b = map(int, input().split())\r\nc = 0\r\nfor i in range(5):\r\n c += max(0.3 * 500.0 * float(i + 1), (1.0 - float(m[i]) / 250) * 500.0 * float(i + 1) - 50.0 * float(w[i]))\r\nprint(int(c) + a * 100 - b * 50)", "marr = [int(x) for x in input().split()]\r\nwarr = [int(x) for x in input().split()]\r\nhs,hu = map(int,input().split())\r\nscore =[500,1000,1500,2000,2500]\r\nscor = 0\r\nfor i in range(len(marr)):\r\n scor+=max(0.3*score[i],(1-(marr[i]/250))*score[i]-50*(warr[i]))\r\nscor+=(100*hs)\r\nscor-=50*(hu)\r\n\r\nprint(int(scor))\r\n", "m = list(map(int, input().split(' ')))\r\nw = list(map(int, input().split(' ')))\r\nhs, hu = map(int, input().split(' '))\r\n\r\nres = 0\r\nfor i in range(5):\r\n sc = 500 * (i + 1)\r\n res += max(0.3 * sc, (1 - m[i] / 250) * sc - 50 * w[i])\r\n\r\nres += hs * 100 - hu * 50\r\n\r\nprint(round(res))", "m=list(map(int,input().split(' ')))\r\nw=list(map(int,input().split(' ')))\r\nh=list(map(int,input().split(' ')))\r\n\r\nans=0\r\ndef cul(x,m,w):\r\n return max(0.3*x,(1-(m/250))*x-(50*w))\r\n\r\nfor i in range(5):\r\n ans+=cul((i+1)*500,m[i],w[i])\r\nans+=h[0]*100-h[1]*50\r\nprint(int(ans))", "m=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\ns,u=map(int,input().split())\r\nx=[500, 1000, 1500, 2000, 2500]\r\nscore=0\r\nfor i in range (5):\r\n score+=max(0.3*x[i], (1-(m[i]/250))*x[i]-50*w[i])\r\nscore+=100*s\r\nscore-=50*u\r\nprint(int(score))", "m = list(map(int, input().split()))\nw = list(map(int, input().split()))\nh = list(map(int, input().split()))\nres = 0\nproblems = [500, 1000, 1500, 2000, 2500]\nfor i, x in enumerate(problems):\n res += max(0.3 * x, (1 - m[i] / 250) * x - 50 * w[i])\nres += h[0] * 100 - h[1] * 50\nprint(int(res))\n\t \t\t\t \t \t \t \t\t \t\t \t", "def scanf():\r\n inp = list(map(int, input().split(' ')))\r\n if len(inp) == 1:\r\n return inp[0]\r\n return inp\r\n\r\n\r\nm = scanf()\r\nwa = scanf()\r\nsh, uh = scanf()\r\nscore = sh * 100 + uh * (-50)\r\nx = [500, 1000, 1500, 2000, 2500]\r\nfor i in range(5):\r\n score += (max((0.3 * x[i]), ((1-m[i]/250)*x[i]) - 50*wa[i]))\r\n\r\nprint(int(score))\r\n", "m=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\ny,z=map(int,input().split())\r\nc,x=0,[500,1000,1500,2000,2500]\r\nfor i in range(5):\r\n c+=max(0.3*x[i],(1-m[i]/250)*x[i]-50*w[i])\r\nc+=y*100 - z*50\r\nprint(int(c))\r\n\r\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\npoints = [500, 1000, 1500, 2000, 2500]\r\nans = 0\r\nfor i in range(5):\r\n ans += max(0.3 * points[i], ((1 - m[i] / 250) * points[i]) - 50 * w[i])\r\nans += 100 * h[0] - 50 * h[1]\r\nprint(int(ans))\r\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nhs,hu = map(int, input().split())\r\np = [500,1000,1500,2000,2500]\r\nscore = 0\r\nfor i in range(5):\r\n score += max(0.3 * p[i], (1 - (m[i]/250)) * p[i] - 50 * w[i])\r\nscore += hs * 100\r\nscore -= hu * 50\r\nprint(int(score))\r\n", "'''\r\nCodeForces Score Calculator\r\n'''\r\ndef calculate():\r\n m = input().split()\r\n w = input().split()\r\n h1,h2 = input().split()\r\n s = []\r\n maxs = [500,1000,1500,2000,2500]\r\n \r\n for i in range(5):\r\n a = (1-float(float(m[i])/250))*float(maxs[i])-50*float(w[i])\r\n s.append(max(0.3*maxs[i],a))\r\n \r\n print(int(sum(s)+int(h1)*100-int(h2)*50))\r\ncalculate()\r\n", "def solve():\r\n m = list(map(int, input().split()))\r\n w = list(map(int, input().split()))\r\n s,f =map(int, input().split())\r\n z = 0.0\r\n z = z + max(0.3*500, (1-m[0]/250)*500 - 50*w[0])\r\n z = z + max(0.3*1000, (1-m[1]/250)*1000 - 50*w[1])\r\n z = z + max(0.3*1500, (1-m[2]/250)*1500 - 50*w[2])\r\n z = z + max(0.3*2000, (1-m[3]/250)*2000 - 50*w[3])\r\n z = z + max(0.3*2500, (1-m[4]/250)*2500 - 50*w[4])\r\n z = z + 100*s - 50*f\r\n print(int(z))\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "x1,x2,x3,x4,x5=500,1000,1500,2000,2500\r\nscore=0\r\nm1,m2,m3,m4,m5=map(int,input().split())\r\nw1,w2,w3,w4,w5=map(int,input().split())\r\nhs,hu=map(int,input().split())\r\nscore+=max(0.3*x1,(1-(m1)/250)*x1-50*w1)\r\nscore+=max(0.3*x2,(1-(m2)/250)*x2-50*w2)\r\nscore+=max(0.3*x3,(1-(m3)/250)*x3-50*w3)\r\nscore+=max(0.3*x4,(1-(m4)/250)*x4-50*w4)\r\nscore+=max(0.3*x5,(1-(m5)/250)*x5-50*w5)\r\nscore+=hs*100-hu*50\r\nprint(int(score))\r\n", "def main():\n res = sum(max(75 * x, (250 - m) * x - 50 * w) for x, m, w in zip(\n (2, 4, 6, 8, 10), map(int, input().split()), map(int, input().split())))\n hs, hu = map(int, input().split())\n print(res + hs * 100 - hu * 50)\n\n\nif __name__ == '__main__':\n main()\n", "import logging\r\nimport copy\r\nimport sys\r\n\r\nlogging.basicConfig(stream=sys.stderr, level=logging.DEBUG)\r\n\r\n#def solve(firstLine):\r\ndef solve(firstLine, secondLine, thridLine):\r\n score = 0\r\n baseScore = [500, 1000,1500,2000,2500]\r\n for i in range(5):\r\n x = baseScore[i]\r\n m = firstLine[i]\r\n w = secondLine[i]\r\n score += max([0.3 * x, (1-m/250) * x - 50 *w ])\r\n\r\n score += 100 * thridLine[0]\r\n score += -50 * thridLine[1]\r\n return int(score)\r\n\r\ndef main():\r\n firstLine = input().split()\r\n firstLine = list(map(int, firstLine))\r\n inputLines = []\r\n for i in range(2):\r\n line = input().split()\r\n line = list(map(int, line))\r\n inputLines.append(line)\r\n \r\n #solve(firstLine)\r\n print(solve(firstLine, inputLines[0], inputLines[1]))\r\n\r\ndef log(*message):\r\n logging.debug(message)\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "def solve():\r\n x = [500, 1000, 1500, 2000, 2500]\r\n m = list(map(int ,input().split(' ')))\r\n w = list(map(int, input().split(' ')))\r\n sHack, fHack = map(int, input().split(' '))\r\n\r\n total = 0\r\n \r\n pp = [(max(0.3*x[i] , (1-m[i]/250) * x[i] - 50 * w[i])) for i in range(len(x))]\r\n \r\n total += sum(pp)\r\n total += (sHack * 100)\r\n total -= (fHack * 50)\r\n \r\n print(int(total))\r\n\r\n\r\nsolve()", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nhs, hu = map(int, input().split())\r\nsc = sum(max(0.3 * 500 * (i+1), (1 - m[i]/250)*500 * (i+1) - 50 * w[i]) for i in range(5))\r\nsc += 100*hs- 50*hu\r\nprint(int(sc))", "mList = list(map(int, input().split()))\r\n\r\nwList = list(map(int, input().split()))\r\n\r\nhs, hu = map(int, input().split())\r\n\r\nprob = [500, 1000, 1500, 2000, 2500]\r\nres = 0\r\nfor i in range(len(wList)):\r\n res += max(0.3*prob[i], (1-(mList[i]/250)) * prob[i] - (50*wList[i]))\r\n\r\nres = res + (hs * 100) - (hu * 50)\r\n\r\n\r\nprint(int(res))\r\n\r\n", "m1, m2, m3, m4, m5 = map(int, input().split())\r\nw1, w2, w3, w4, w5 = map(int, input().split())\r\nhs, hu = map(int, input().split())\r\n\r\np1 = max(0.3 * 500, (1 - m1 / 250) * 500 - 50 * w1)\r\np2 = max(0.3 * 1000, (1 - m2 / 250) * 1000 - 50 * w2)\r\np3 = max(0.3 * 1500, (1 - m3 / 250) * 1500 - 50 * w3)\r\np4 = max(0.3 * 2000, (1 - m4 / 250) * 2000 - 50 * w4)\r\np5 = max(0.3 * 2500, (1 - m5 / 250) * 2500 - 50 * w5)\r\n\r\nprint(int(p1 + p2 + p3 + p4 + p5 + 100 * hs - 50 * hu))", "'''input\n119 119 119 119 119\n0 0 0 0 0\n10 0\n'''\ns = [500, 1000, 1500, 2000, 2500]\nm = list(map(int, input().split()))\nw = list(map(int, input().split()))\nhs, hu = map(int, input().split())\nt = 0\nfor x in range(5):\n\tt += max(0.3 * s[x], (1 - m[x] / 250) * s[x] - 50 * w[x])\nprint(int(t + 100*hs - 50*hu))\n\n\n\n\n\n\n\n\n", "n=5\r\ns = [500, 1000, 1500, 2000, 2500]\r\nm = []\r\nln = input('').split(' ')\r\nfor i in range(n):\r\n m.append((int)(ln[i]))\r\nw = []\r\nln = input('').split(' ')\r\nfor i in range(n):\r\n w.append(int(ln[i]))\r\nans = 0\r\nsh, uh = [int(z) for z in input('').split()]\r\nfor i in range(n):\r\n v1 = 0.3*s[i]\r\n v2 = s[i] - (m[i]*s[i])/250 - 50*w[i]\r\n ans+=max(v1,v2)\r\nans+=(sh*100-uh*50)\r\nprint((int)(ans))\r\n", "\nminute = input()\nminute = list(minute.split())\ntries = input()\ntries = list(tries.split())\nhacks = input()\nhacks = list(hacks.split())\n\nscore = 0\nfor i in range(5):\n ex = max(0.3*(i+1)*500, (1-(int(minute[i])/250))*(500*(i+1))-50*int(tries[i]))\n score+=ex\n\nscore += int(hacks[0])*100\nscore -= int(hacks[1])*50\nprint(int(score))\n", "p = [500, 1000, 1500, 2000, 2500]\nm = list(map(int, input().split()))\nw = list(map(int, input().split()))\ns, u = map(int, input().split())\n\nans = 100 * s - 50 * u\nfor i in range(5):\n ans += max(3 * int(p[i] / 10), (((250 - m[i]) / 250) * p[i]) - (50 * w[i]))\n\nprint(int(ans))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx = [500,1000,1500,2000,2500]\r\n\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\ns, u = map(int, input().split())\r\n\r\nc = s*100 - u*50\r\nfor i in range(5):\r\n c += max(0.3*x[i], (1-m[i]/250)*x[i] - 50*w[i])\r\nprint(int(c))", "def max(x, m, w):\r\n a=0.3*x\r\n b=(1-m/250)*x-50*w\r\n if a>=b:\r\n return a\r\n else:\r\n return b\r\nst = input().split()\r\nws = input().split()\r\nh = input().split()\r\nx = [500, 1000, 1500, 2000, 2500]\r\ntotal=0\r\nfor i in range(len(st)):\r\n total+=max(x[i], int(st[i]), int(ws[i]))\r\ntotal += 100*int(h[0])-50*int(h[1])\r\nprint(\"{0:.0f}\".format(total))", "x = [500, 1000, 1500, 2000, 2500]\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\ns, u = map(int, input().split())\r\n\r\np = 0\r\n\r\nfor i in range(5):\r\n\tp += max(0.3 * x[i], ((1 - (m[i] / 250)) * x[i]) - (50 * w[i]))\r\n\t\r\nprint(int(p + (s * 100) - (u * 50)))", "def formula(x,m,w):\r\n ans = max(0.3*x,((250-m)*x/250)-50* w)\r\n return ans \r\nmarks = [500, 1000, 1500, 2000, 2500]\r\nx = {idx: ele for idx, ele in enumerate(marks)}\r\nm = {idx: ele for idx, ele in enumerate(input().split())}\r\nw = {idx: ele for idx, ele in enumerate(input().split())}\r\nh = {idx: ele for idx, ele in enumerate(input().split())}\r\nresult = 0 \r\nfor i in range(0,5):\r\n a=int(x[i])\r\n b=int(m[i])\r\n c=int(w[i])\r\n res = formula(a,b,c)\r\n result += res\r\n\r\nfinal_ans = result + int(h[0])*100 - int(h[1])*50 \r\nprint(int(final_ans))", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nps = [500, 1000, 1500, 2000, 2500]\n\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\nc = [int(i) for i in input().split()]\n\npts = 0\n\nfor i in range(5):\n pts += max(0.3*ps[i], (1-a[i]/250)*ps[i] - 50*b[i])\n\npts += c[0] * 100;\npts -= c[1] * 50;\n\nprint(int(pts))\n", "times = list(map(int, input().split()))\r\nwrong = list(map(int, input().split()))\r\nhs, hu = map(int, input().split())\r\nscore = 0\r\nx = 500\r\nfor i in range(5):\r\n\tm = times[i]\r\n\tw = wrong[i]\r\n\r\n\tscore += max(0.3*x, (1-m/250)*x - 50*w)\r\n\tx+=500\r\n\r\nscore += hs*100\r\nscore -= hu*50\r\nprint(int(score))\r\n\r\n", "import sys\r\n\r\narr1 = [int(x) for x in sys.stdin.readline().split()]\r\narr2 = [int(x) for x in sys.stdin.readline().split()]\r\nbase = [500, 1000, 1500, 2000, 2500]\r\nres = 0\r\n\r\nfor i in range(5):\r\n res += max([0.3 * base[i], base[i] * (1 - arr1[i] / 250) - 50 * arr2[i]])\r\n\r\na, b = [int(x) for x in sys.stdin.readline().split()]\r\nres += 100 * a\r\nres -= 50 * b\r\n\r\nprint(int(res))\r\n", "import math\n\nsucc = [float(i) for i in input().split()]\nerr = [float(i) for i in input().split()]\nhack = [float(i) for i in input().split()]\nval = [float(500),float(1000),float(1500),float(2000),float(2500)]\n\npoints = 0.\n\nfor i in range(5):\n points = points + max(0.3*val[i], (1-succ[i]/250)*val[i] - 50*err[i])\n\npoints = points + hack[0]*100 - hack[1]*50\n\nprint(int(points))\n", "li=[500,1000,1500,2000,2500]\r\nM=list(map(int,input().split()))\r\nW=list(map(int,input().split()))\r\nhs,hu=map(int,input().split())\r\nans=0\r\nfor i in range(5):\r\n x=li[i]\r\n m=M[i]\r\n w=W[i]\r\n ans+=max(0.3*x,(1-m/250)*x-50*w)\r\nans=ans+(hs*100-hu*50)\r\nprint(int(ans))", "m=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\ng,b=map(int,input().split())\r\nprint(100*g-50*b+max(150,500-2*m[0]-50*w[0])+max(300,1000-4*m[1]-50*w[1])+max(450,1500-6*m[2]-50*w[2])+max(600,2000-8*m[3]-50*w[3])+max(750,2500-10*m[4]-50*w[4]))", "def sccore (m , w , x ) : \r\n return round(max(0.3 *x , (1-(m/250))*x-50*w))\r\nmx_value = [500 , 1000 , 1500 ,2000 ,2500]\r\nm_list = list(map(int , input().split())) \r\nw_list = list(map(int , input().split())) \r\nh1 , h2 = map(int , input().split())\r\nsumm = 0 \r\nfor i in range(5) : \r\n summ += sccore(m_list[i] , w_list[i] , mx_value[i]) \r\nsumm += 100 * h1 \r\nsumm -= 50 * h2 \r\nprint(summ) \r\n", "N = 5\nps = [500, 1000, 1500, 2000, 2500]\np_s, p_u = 100, -50\n\nms = list(map(int, input().split()))\nws = list(map(int, input().split()))\nh_s, h_u = map(int, input().split())\n\nr = 0\nfor i in range(N):\n r += max(0.3 * ps[i], (1 - ms[i] / 250) * ps[i] - 50 * ws[i])\n\nr += h_s * p_s\nr += h_u * p_u\n\nprint(int(r))\n", "m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nhs, hu = map(int, input().split())\r\n\r\nprint(sum(max(150 * (i + 1), ((i + 1) * 500 - m[i] * (i + 1) * 2) - 50 * w[i]) for i in range(5)) + hs * 100 - hu * 50)\r\n", "from fractions import Fraction\r\nmps = [500, 1000, 1500, 2000, 2500]\r\nmins = list(map(int,input().split()))\r\nws = list(map(int,input().split()))\r\nhs,hu = map(int, input().split())\r\nans=0\r\nfor i in range(5):\r\n ans+=max(Fraction(3,10)*mps[i], Fraction(250-mins[i],250)*mps[i]-50*ws[i])\r\nans+=100*hs-50*hu\r\nprint(ans)", "z=[int(n) for n in input().split()]\r\nrr=[500,1000,1500,2000,2500]\r\ns=[int(n) for n in input().split()]\r\nop=[int(n) for n in input().split()]\r\nl=0\r\nfor n in range(len(z)):\r\n t=0.3*rr[n]\r\n p=(1-(z[n]/250))*rr[n]-50*s[n]\r\n l+=max(t,p)\r\nl+=op[0]*100\r\nl-=op[1]*50\r\nprint(int(l))", "minutes = input().split()\ntries = input().split()\ngood_bad = input().split()\n\ns = 0\n\nfor i in range(len(minutes)):\n\tif i == 0:\n\t\ts += max(0.3 * 500, (1 - int(minutes[0])/250)*500 - 50*int(tries[0]))\n\telif i == 1:\n\t\ts += max(0.3 * 1000, (1 - int(minutes[1])/250)*1000 - 50*int(tries[1]))\n\telif i == 2:\n\t\ts += max(0.3 * 1500, (1 - int(minutes[2])/250)*1500 - 50*int(tries[2]))\n\telif i == 3:\n\t\ts += max(0.3 * 2000, (1 - int(minutes[3])/250)*2000 - 50*int(tries[3]))\n\telif i == 4:\n\t\ts += max(0.3 * 2500, (1 - int(minutes[4])/250)*2500 - 50*int(tries[4]))\ns += int(good_bad[0]) * 100\ns -= int(good_bad[1]) * 50\n\nprint(int(s))\n\t\n\t\n", "Scores = [500, 1000, 1500, 2000, 2500]\r\nTime = list(map(int, input().split()))\r\nWrong = list(map(int, input().split()))\r\nSUM = 0\r\nfor i in range(5):\r\n SUM += max(0.3 * Scores[i], (1 - (Time[i] / 250)) * Scores[i] - (50 * Wrong[i]))\r\nHack = list(map(int, input().split()))\r\nprint(int(SUM + (Hack[0] * 100) - (Hack[1] * 50)))\r\n", "points = [500, 1000, 1500, 2000, 2500]\r\nstring = input()\r\nminutes = list(map(int, string.split()))\r\nstring = input()\r\nsubmissions = list(map(int, string.split()))\r\nstring = input()\r\nhacks = string.split()\r\np = 0\r\nfor x in range(5):\r\n a = points[x]\r\n b = minutes[x]\r\n c = submissions[x]\r\n p += max([a * 3 // 10, a - a * b // 250 - c * 50])\r\np += int(hacks[0]) * 100\r\np -= int(hacks[1]) * 50\r\nprint(p)", "def calc_score(base, time, wrongs):\n return max(base // 10 * 3, base - base // 250 * time - 50 * wrongs)\n\n\ndef main():\n base_scores = [500, 1000, 1500, 2000, 2500]\n submission_times = [int(_) for _ in input().split()]\n wrong_submissions = [int(_) for _ in input().split()]\n hacks = [int(_) for _ in input().split()]\n\n score = \\\n sum(calc_score(base_scores[i], submission_times[i], wrong_submissions[i]) for i in range(5)) + \\\n hacks[0] * 100 - hacks[1] * 50\n print(score)\n\n\nif __name__ == '__main__':\n main()\n", "x = [500, 1000, 1500, 2000, 2500]\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nhs, hu = map(int, input().split())\r\nprint(sum(max(3 * x[i] // 10, x[i] - x[i] * m[i] // 250 - 50 * w[i]) for i in range(5)) + hs * 100 - hu * 50)", "times = [int(x) for x in input().split()]\r\nwrong = [int(x) for x in input().split()]\r\nhacks = [int(x) for x in input().split()]\r\nmax_scores = [500, 1000, 1500, 2000, 2500]\r\n\r\ntotal = 0\r\nfor i in range(len(max_scores)):\r\n total += max(0.3 * max_scores[i], (1 - times[i]/250) * max_scores[i] - 50 * wrong[i])\r\ntotal += 100 * hacks[0]\r\ntotal -= 50 * hacks[1]\r\nprint(int(total))", "minutes = list(map(int, input().strip().split()))\r\nwrongSub = list(map(int, input().strip().split()))\r\nhacks = list(map(int, input().strip().split()))\r\n\r\nscore = 0\r\nx = 500\r\nfor i in range(5):\r\n score += max(0.3 * x, (1 - (minutes[i] / 250)) * x - 50 * wrongSub[i])\r\n x = x + 500\r\n\r\nhacks_scores = 100 * hacks[0] - 50 * hacks[1]\r\nscore += hacks_scores\r\nprint(int(score))", "m = [int(x) for x in input().split()]\r\nw = [int(x) for x in input().split()]\r\nhs,hu = [int(x) for x in input().split()]\r\nx = [500,1000,1500,2000,2500]\r\nsum = 0\r\nfor i in range(5):\r\n temp1 = (1-m[i]/250)*x[i]-50*w[i]\r\n temp2 = 0.3*x[i]\r\n val = max(temp1,temp2)\r\n sum += val\r\nsum += hs*100\r\nsum -= hu*50\r\nprint(round(sum))", "import sys\r\nm = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\nhs,hu = map(int,input().split())\r\npoint = [500,1000,1500,2000,2500]\r\nres = 0\r\nfor i in range(5):\r\n res += max(0.3*point[i],((1- (m[i]/250) )*point[i] - 50*w[i]))\r\n\r\nres += hs*100 - hu*50\r\n\r\nprint(int(res))", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n m = Y()\r\n w = Y()\r\n hs, hu = P()\r\n pt, ans = [500, 1000, 1500, 2000, 2500], 0\r\n\r\n mx_pt = lambda x, m, w: max((30 * x) / 100, (1 - m / 250) * x - 50 * w)\r\n for i in range(5):\r\n ans += mx_pt(pt[i], m[i], w[i])\r\n ans = ans + (hs * 100 - hu * 50)\r\n print(int(ans))", "max_scores = [ 500, 1000, 1500, 2000, 2500 ]\ncorects = [ int(c) for c in input().split() ]\nwrongs = [ int(w) for w in input().split() ]\nshacks, unshacks = map(int, input().split())\nfinal_score = shacks*100 - unshacks*50\n\ndef score(x, m, w):\n return max(0.3*x, (1-(m/250))*x-50*w)\n\nfor i in range(5):\n final_score += score(max_scores[i], corects[i], wrongs[i])\nprint(int(final_score))", "m = list(map(int,input().split(' ')))\nw = list(map(int,input().split(' ')))\nh = list(map(int,input().split(' ')))\nx = [500, 1000, 1500, 2000, 2500]\nr = []\nresult = 0\n\nfor i in range(5):\n r.append(max(0.3 * x[i], ((1 - (m[i]/250)) * x[i]) - 50 * w[i]))\n\nfor i in r:\n result += i\n\nprint(int( result + h[0] * 100 - h[1] * 50))\n\t\t\t\t\t\t\t \t \t\t \t \t \t\t\t\t \t\t", "m = [int(x) for x in input().split()]\r\nw = [int(x) for x in input().split()]\r\nsu,un = [int(x) for x in input().split()]\r\nscores=[]\r\nx = [500, 1000, 1500, 2000, 2500]\r\nfor i in range(5):\r\n temp_1=0.3*x[i]\r\n temp_2 = (1-(m[i]/250))*x[i]-50*w[i]\r\n# print(temp_1,temp_2)\r\n scores.append(max(temp_1,temp_2))\r\nfinal_ans = sum(scores) + 100*su - 50*un\r\nprint(int(final_ans))\r\n ", "time_spent_on_problems = list(map(int, input().split(' ')))\nwrong_submission_on_problems = list(map(int, input().split(' ')))\n(successful_hacks, unsuccessful_hacks) = map(int, input().split(' '))\nmaximum_points_per_problem = [500, 1000, 1500, 2000, 2500]\n\npoints_on_problems = []\n\nfor i in range(5):\n points_on_problems.append(max(0.3 * maximum_points_per_problem[i], (1 - time_spent_on_problems[i]/250) * maximum_points_per_problem[i] - 50 * wrong_submission_on_problems[i]))\n\nprint(int(sum(points_on_problems) + successful_hacks * 100 - unsuccessful_hacks * 50))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Dec 1 15:43:03 2015\r\n\r\n@author: matt\r\n\"\"\"\r\na1 = [int(x) for x in input().split(' ')]\r\na2 = [int(x) for x in input().split(' ')]\r\na3 = [int(x) for x in input().split(' ')]\r\nx = [500, 1000, 1500, 2000, 2500]\r\nresult = 0\r\n\r\n\r\ndef myFunc(x, m, w):\r\n result = max(0.3 * x, (1 - m / 250) * x - 50 * w)\r\n return result\r\n\r\nfor num in range(5):\r\n result += myFunc(x[num], a1[num], a2[num])\r\n\r\nresult += 100 * a3[0] - 50 * a3[1]\r\nprint(int(result))\r\n", "\r\nm = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nhs, hu = map(int, input().split())\r\nx = [500 , 1000 , 1500, 2000, 2500]\r\nlt = []\r\nfor i in range(5):\r\n\tlt.append(max(0.3 * x[i] , (1 - m[i] / 250 ) * x[i] - 50 * w[i] ))\r\n\r\nsu = sum(lt)\r\nsu += hs * 100 - hu * 50\r\nprint(int(su))\r\n", "read = lambda: map(int, input().split())\r\nf = lambda x, m, w: max(0.3 * x, (1 - m / 250) * x - 50 * w)\r\nx = [500 * i for i in range(1, 6)]\r\nm = list(read())\r\nw = list(read())\r\nhs, hu = read()\r\n\r\nans = sum(f(x[i], m[i], w[i]) for i in range(5)) + hs * 100 - hu * 50\r\nprint(int(ans))\r\n", "import sys\r\n\r\nvals = [500, 1000, 1500, 2000, 2500]\r\n\r\ntime = [int(x) for x in input().split()]\r\nwrong = [int(x) for x in input().split()]\r\nhacks = [int(x) for x in input().split()]\r\nsum = 0\r\nfor i in range(5):\r\n current = max(vals[i]*0.3, ((vals[i]-(time[i]*vals[i]/250))) - 50*wrong[i])\r\n sum += current\r\nsum += hacks[0]*100-hacks[1]*50\r\nprint(int(sum))", "a = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nans = sum([max(0.3 * (500 * (i + 1)), (1 - a[i] / 250) * (500 * (i + 1)) - 50 * b[i]) for i in range(5)])\r\nprint(sum([int(ans + c[0] * 100 - c[1] * 50) for c in [[int(x) for x in input().split()]]]))", "m = list(map(int, input().split()))\nw = list(map(int, input().split()))\ns, u = map(int, input().split())\nscore = 0\nfor i in range(5):\n x = 500 * (i + 1)\n score += max(0.3 * x, (1 - m[i] / 250) * x - 50 * w[i])\nscore += s * 100\nscore -= u * 50\nprint(int(score))\n \t \t \t\t\t \t\t\t\t\t \t\t\t\t \t", "\nInput=lambda:map(int,input().split())\n\nm = list(Input())\nw = list(Input())\nh = list(Input())\nx = [500, 1000, 1500, 2000, 2500]\nScore = (h[0]*100) - (h[1]*50)\nfor i in range(5):\n Score+=max(0.3*x[i],(1-(m[i]/250))*x[i]-(50*w[i]) )\n\nprint(int(Score))", "# Read input\r\nsubmission_times = list(map(int, input().split()))\r\nwrong_submissions = list(map(int, input().split()))\r\nsuccessful_hacks, unsuccessful_hacks = map(int, input().split())\r\n\r\n# Define the problem points\r\nproblem_points = [500, 1000, 1500, 2000, 2500]\r\n\r\n# Calculate the score for each problem\r\nproblem_scores = []\r\nfor i in range(5):\r\n score = max(0.3 * problem_points[i], (1 - submission_times[i] / 250) * problem_points[i] - 50 * wrong_submissions[i])\r\n problem_scores.append(score)\r\n\r\n# Calculate the total score\r\ntotal_score = sum(problem_scores) + 100 * successful_hacks - 50 * unsuccessful_hacks\r\n\r\n# Print the total score\r\nprint(int(total_score))\r\n", "c = [500,1000,1500,2000,2500]\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nk,l = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(5):\r\n\tans+=max(0.3*c[i],(1-a[i]/250)*c[i]-50*b[i])\r\nans+=100*k\r\nans-=50*l\r\nprint(int(ans))\r\n", "tim = [0,0,0,0,0]\r\nwrong = [0,0,0,0,0]\r\nhacks = [0,0]\r\ntim[0], tim[1], tim[2], tim[3], tim[4] = input().split()\r\nwrong[0], wrong[1], wrong[2], wrong[3], wrong[4] = input().split()\r\nhacks[0], hacks[1] = input().split()\r\npoint = [500, 1000, 1500, 2000, 2500]\r\nscore = 0\r\nfor i in range(0,5):\r\n point[i] = int(point[i])\r\n wrong[i] = int(wrong[i])\r\n tim[i] = int(tim[i])\r\n score += max(0.3 * point[i], (1 - tim[i]/250.0) * point[i] - 50 * wrong[i])\r\nhacks[0] = int(hacks[0])\r\nhacks[1] = int(hacks[1])\r\nscore += (100 * hacks[0] - 50 * hacks[1])\r\nprint(int(score))", "m = input().split()\r\nw = input().split()\r\nhs, hu = input().split()\r\n\r\nans = 0\r\n\r\nfor i in range(0, 5):\r\n x = (i+1)*500\r\n ans += max(0.3*x, (1 - int(m[i])/250)*x - 50*int(w[i]))\r\n\r\nans += int(hs)*100 - int(hu)*50\r\nprint (int(ans))", "#https://codeforces.com/problemset/problem/604/A\nm=[int(x) for x in input().split()]\nw=[int(x) for x in input().split()]\nx=[500,1000,1500,2000,2500]\nhs,hu=map(int,input().split())\nscore=0\nfor i in range(5):\n\tscore+=max(0.3*x[i],x[i]-m[i]*x[i]/250-50*w[i])\nscore=int(score)\nscore+=100*hs-50*hu\nprint(score)\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\ncin = lambda:map(int,input().split())\r\nx=500\r\nsum=0\r\n\r\nfor i,j in zip(cin(),cin()):\r\n sum+= max(0.3*x,(1-i/250)*x - 50*j)\r\n x+=500\r\ns,u=cin()\r\nprint(int(sum+100*s-50*u)) ", "#!/usr/bin/env python3\n\nimport fractions\n\nif __name__ == '__main__':\n X = [500, 1000, 1500, 2000, 2500]\n M = list(map(int, input().split()))\n W = list(map(int, input().split()))\n Hs, Hu = map(int, input().split())\n\n score = 100*Hs - 50*Hu\n for x, m, w in zip(X, M, W):\n a = fractions.Fraction(3*x, 10)\n b = (1 - fractions.Fraction(m, 250))*x - 50*w\n score += max(a, b)\n print(score)\n\n\n\n", "m = [int(i) for i in input().split()]\r\nw = [int(i) for i in input().split()]\r\nhs, hu = [int(i) for i in input().split()]\r\ntotal = 100*hs - 50*hu\r\n\r\nfor i in range(5):\r\n x = 500 * (i + 1)\r\n score = max(0.3 * x, x - x*m[i]/250 - 50*w[i])\r\n total += score\r\n\r\nprint(int(total))", "m = list(map(int,input().split()))\r\nw = list(map(int,input().split()))\r\nh1,h2 = map(int,input().split())\r\nr = [500,1000,1500,2000,2500]\r\nl = list()\r\nfor i in range(len(m)):\r\n x = max((0.3*r[i]),(1-m[i]/250)*r[i]-50*w[i])\r\n l.append(x)\r\n\r\nmm = sum(l)\r\nmm = mm+h1*100\r\nmm = mm - h2*50\r\nprint(int(mm))", "m = [int(i) for i in input().split()]\r\nw = [int(i) for i in input().split()]\r\nhs, hu = map(int, input().split())\r\n\r\npoint = hs*100 - hu*50\r\n\r\nfor i in range(5):\r\n point += max(0.3 * 500 * (i+1), ((1 - m[i]/250) * 500 * (i+1)) - 50 * w[i])\r\n\r\nprint(int(point))\r\n", "t=list(map(int,input().split()))\r\nw=list(map(int,input().split()))\r\nq,z=map(int,input().split())\r\nc=0\r\nv=0\r\nfor i in range(500,3000,500):\r\n x=(1-(t[v]/250))*i-50*w[v]\r\n a=max(0.3*i,x)\r\n c=c+a\r\n v=v+1\r\nf=q*100-z*50\r\ndp=c+f\r\nprint(int(dp))\r\n" ]

[ "n = int(input())\r\na=input()\r\nif (n-1)%2==0:\r\n c = ''\r\n i = n - 2\r\n while i % 2 != 0 and i > 0:\r\n c = c + a[i]\r\n i = i - 2\r\n i = 0\r\n while i % 2 == 0 and i < n:\r\n c = c + a[i]\r\n i = i + 2\r\nelse:\r\n c = ''\r\n i = n - 2\r\n while i % 2 == 0 and i >= 0:\r\n c = c + a[i]\r\n i = i - 2\r\n\r\n i = 1\r\n while i % 2 != 0 and i < n:\r\n c = c + a[i]\r\n i = i + 2\r\nprint(c)", "n = int(input())\r\ns = input()\r\na = [None]*n\r\n\r\nif n%2:\r\n\tx = n//2\r\n\tfor i in range(n):\r\n\t\tif i%2:\r\n\t\t\tx -= i\r\n\t\telse:\r\n\t\t\tx += i\r\n\t\ta[x] = s[i]\r\nelse:\r\n\tx = (n//2)-1\r\n\tfor i in range(n):\r\n\t\tif i%2:\r\n\t\t\tx += i\r\n\t\telse:\r\n\t\t\tx -= i\r\n\t\ta[x] = s[i]\r\n\r\nz = ''\r\nfor i in a:\r\n\tz+=i\r\nprint(z)", "n=int(input())\r\nli=list(input())\r\nans=['']*n\r\ni=0\r\nwhile n!=0:\r\n if n==0:\r\n break\r\n elif n%2!=0:\r\n m=n//2+i\r\n elif n%2==0:\r\n m=n//2-1\r\n ans[m]=li[i]\r\n n-=1\r\n i+=1\r\nans=''.join(ans)\r\nprint(ans)", "n=int(input())\r\nstr=input()\r\nif n%2:\r\n print(str[1::2][::-1]+str[0::2])\r\nelse:\r\n print(str[0::2][::-1]+str[1::2])\r\n ", "# decoding.py\ndef main():\n # Read input length\n length = int(input())\n\n # Read in encrypted string\n source = input()\n\n direction = 'r' if (length % 2 == 0) else 'l'\n out = []\n out.append(source[0])\n source = source[1:]\n\n for c in source:\n if direction == 'l':\n out.insert(0, c)\n else:\n\t \t out.append(c)\n\n direction = 'l' if direction == 'r' else 'r'\n\n for p in out:\n print(p, end='')\n\n\n\nif __name__ == '__main__':\n main()\n\n \t \t \t \t\t\t \t\t \t \t \t\t", "n=int(input())\r\ns=input()\r\nl=[]\r\nif len(s)%2==0:\r\n for i in range(0,len(s)):\r\n if i==0:\r\n l.append(s[i])\r\n elif i%2==0:\r\n l.insert(0,s[i])\r\n else:\r\n l.append(s[i])\r\nelse:\r\n for i in range(0,len(s)):\r\n if i==0:\r\n l.append(s[i])\r\n elif i%2!=0:\r\n l.insert(0,s[i])\r\n else:\r\n l.append(s[i])\r\nst=\"\"\r\nfor i in l:\r\n st=st+i\r\nprint(st)\r\n", "n = int(input())\r\ns= input()\r\nf=str()\r\nr=str()\r\nif n % 2 ==0:\r\n for i in range(n):\r\n if i % 2 ==0:\r\n f += s[i]\r\n else:\r\n r += s[i]\r\n \r\n print(f[::-1] + r)\r\n\r\nelse:\r\n for i in range(n):\r\n if i % 2 ==0:\r\n r += s[i]\r\n \r\n else:\r\n f += s[i]\r\n print(f[::-1] + r)", "n = int(input())\r\ns = input()\r\nq = s[::-1]\r\nl = []\r\nfor i in range(len(q)):\r\n if(l == []):\r\n l.append(q[i])\r\n else:\r\n l.insert(len(l)//2,q[i])\r\nprint(\"\".join(l))", "n = int(input())\r\nw = input()\r\nout = \"\"\r\nleft = n % 2 == 0\r\n\r\nfor c in w:\r\n if left:\r\n out = c + out\r\n else:\r\n out = out + c\r\n left = not left\r\n\r\nprint(out)", "num = int(input())\r\nstring = input()\r\nif len(string) > 2:\r\n if len(string) % 2 ==0:\r\n print(string[-2::-2]+string[1::2])\r\n else:\r\n print(string[-2::-2]+string[0::2]) \r\nelse:\r\n print(string) ", "n=int(input())\r\ns=input()\r\nans=[]\r\nif(n%2==1):\r\n ans.append(s[0])\r\n for i in range(1,n):\r\n if(i%2==0):\r\n ans.append(s[i])\r\n else:\r\n ans.insert(0,s[i])\r\nelse:\r\n ans.append(s[0])\r\n for i in range(1,n):\r\n if(i%2==1):\r\n ans.append(s[i])\r\n else:\r\n ans.insert(0,s[i])\r\n#print(ans)\r\nfor i in ans:\r\n print(i,end=\"\")", "n = int(input())\r\ns = input()\r\n\r\ndef decode(string):\r\n s = list(string)\r\n out = []\r\n while len(s) != 0:\r\n out.insert(len(out)//2, s[-1])\r\n s.pop(-1)\r\n \r\n return \"\".join(out)\r\n \r\nprint(decode(s))", "n = int(input())\ns = input()\nans = [0]*n\naddi=1\nif(n%2 == 0):\n idx = n//2-1\n sign = 1\nelse:\n idx = n//2\n sign = -1\nfor i in range(n):\n ans[idx] = s[i]\n idx += (addi*sign)\n addi += 1\n sign *= -1\nprint(''.join(ans))", "n=int(input())\ns=list(input())\nl=[]\ni=0\nwhile(s):\n if(n%2==0):\n if(i%2!=0):\n l.append(s[0])\n else:\n l.insert(0,s[0])\n else:\n if(i%2==0):\n l.append(s[0])\n else:\n l.insert(0,s[0])\n\n s.pop(0)\n i+=1\nl=\"\".join(l)\nprint(l)\n", "n = int(input())\r\nx = input()\r\na = ''\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n a = x[i] + a\r\n else:\r\n a = a + x[i]\r\nprint(a if n % 2 == 0 else a[::-1])\r\n", "n = int(input())\r\ns = input()\r\nans = [' '] * n\r\npos = 0\r\nfor i in range(n - 1, -1, -2):\r\n ans[n - pos - 1] = s[i]\r\n ans[pos] = s[i - 1]\r\n pos += 1\r\nif n % 2 != 0:\r\n ans[pos - 1] = s[0]\r\nprint(*ans, sep='')", "n=int(input())\ns=input()\n\nspots=[\".\"]*n\n\nleft=0\nright=n-1\n\nchk=1\n\nfor i in range(n-1,-1,-1):\n \n elem=s[i]\n\n if chk==1:\n spots[right]=elem\n right-=1\n else:\n spots[left]=elem\n left+=1\n\n chk=1-chk\n\nprint(\"\".join(spots))\n\n\t\t\t \t\t \t\t \t\t \t \t \t \t \t", "\r\nn = int(input())\r\ns = str(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(s[i])\r\nl.reverse()\r\nl1 = []\r\nl2 = []\r\nfor i in range(len(s)):\r\n if i%2==0:\r\n l1.append(l[i])\r\n else:\r\n l2.append(l[i])\r\nl1.reverse()\r\nans = \"\"\r\nfor i in l2:\r\n ans += i\r\nfor j in l1:\r\n ans += j\r\nprint(ans)\r\n \r\n", "'''\r\n\r\nWelcome to GDB Online.\r\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\r\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\r\nCode, Compile, Run and Debug online from anywhere in world.\r\n\r\n'''\r\n'''\r\n\r\nWelcome to GDB Online.\r\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\r\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\r\nCode, Compile, Run and Debug online from anywhere in world.\r\n\r\n'''\r\nn=input()\r\nval = input()\r\ni=0\r\nif(len(val)%2==0):\r\n i=1\r\nnewstr=val[0]\r\nval=val[1:]\r\n\r\n\r\nfor x in val:\r\n if(i%2==0):\r\n newstr=x+newstr\r\n\r\n \r\n \r\n else:\r\n newstr=newstr+x\r\n\r\n \r\n i+=1\r\n \r\nprint(newstr)\r\n", "def main():\r\n n = int(input())\r\n s = input()\r\n new_string = \"\"\r\n\r\n if len(s) % 2 == 0:\r\n for i in range(len(s) - 2, -1, -2):\r\n new_string += s[i]\r\n for i in range(1, len(s), 2):\r\n new_string += s[i]\r\n else:\r\n for i in range(len(s) - 2, -1, -2):\r\n new_string += s[i]\r\n new_string += s[0]\r\n for i in range(2, len(s), 2):\r\n new_string += s[i]\r\n\r\n print(new_string)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "length = int(input())\r\nencoded = input()\r\ndecoded = []\r\nfor i in reversed(range(length)):\r\n decoded.insert(int(len(decoded) / 2), encoded[i])\r\nfin = \"\"\r\nfor i in range(length):\r\n fin += decoded[i]\r\nprint(fin)", "n=int(input())\r\ns=input()\r\nk=[]\r\nif len(s)&1==0:\r\n for i in range(n):\r\n if i&1==0:\r\n k.insert(0,s[i])\r\n else:\r\n k.append(s[i])\r\nelse:\r\n for i in range(n):\r\n if i & 1 == 1:\r\n k.insert(0, s[i])\r\n else:\r\n k.append(s[i])\r\nfor i in k:\r\n print(i,end=\"\")\r\nprint()\r\n\r\n\r\n\r\n# n,q=map(int,input().split())\r\n# s=input()\r\n# for i in range(q):\r\n# l,r=map(int,input().split())\r\n# l-=1\r\n# k=s[l:r]\r\n# cnt=0\r\n# for i in k:\r\n# m=ord(i)-97\r\n# m+=1\r\n# cnt+=m\r\n# print(cnt)\r\n\r\n\r\n\r\n", "# import sys\n# sys.stdin=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/input.txt\",\"r\")\n# sys.stdout=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/output.txt\",\"w\")\n\nimport math\nfor _ in range(1):\n n=int(input())\n s=input()\n if n ==1:\n print(s)\n elif n%2==0:\n for i in range(n-2,-1,-2):\n print(s[i],end='')\n\n for i in range(1,n,+2):\n print(s[i],end='')\n else:\n for i in range(n-2,-1,-2):\n print(s[i],end='')\n\n for i in range(0,n,+2):\n print(s[i],end='')\n\n\n\n\n\n\n\n\n \n \n\n\n\n\n \n\n\n\n\n \n\n \n\n\n\n\n \n\n\n", "from math import ceil\r\nn = int(input())\r\ns = input()\r\nres = ['']*n\r\ni = n//2\r\na = -1 if n%2 == 0 else 1\r\nadd = 0\r\nst = n//2 - (1 if n%2 == 0 else 0)\r\nfor i in range(n):\r\n res [st + ceil(add)*a] = s[i]\r\n a = a*(-1)\r\n add += 0.5\r\nprint(''.join(res))", "n=int(input())\r\ns=input()\r\nls=[s[0]]\r\nif(n%2==0):\r\n t=\"b\"\r\nelse:\r\n t=\"f\"\r\nfor i in range(1,len(s)):\r\n if(t==\"f\"):\r\n ls.insert(0,s[i])\r\n t=\"b\"\r\n else:\r\n ls.append(s[i])\r\n t=\"f\"\r\nprint(\"\".join(ls))", "n=int(input())\r\nword=input()\r\nword=list(word)\r\nnew=[]\r\nnew.append(word[0])\r\nword.pop(0)\r\nwhile len(word)>0:\r\n new.append(word[0])\r\n new.reverse()\r\n word.pop(0)\r\nnew.reverse()\r\nprint(''.join(new))", "n = int(input())\r\ns = input()\r\nb = n & 1\r\n\r\nif b == 1:\r\n l = [s[0]]\r\nelse:\r\n l = []\r\n\r\nr = []\r\n\r\nfor i in range(b, n, 2):\r\n l.append(s[i])\r\n r.append(s[i + 1])\r\n\r\nret = ''.join(reversed(l)) + ''.join(r)\r\n\r\nprint(ret)", "from collections import defaultdict, Counter\nimport itertools as it\nimport random as rand\nimport math\n\nn = int(input())\ns = input()\n\nres = ['']*n\nm = n//2\nres[m]=s[0]\n\nleft = True\nl = m-1\nr = m+1\nfor i in range(1, n):\n if left:\n res[l]=s[i]\n l-=1\n else:\n res[r]=s[i]\n r+=1\n left = not left\n\nif n%2==0:\n print(''.join(reversed(res)))\nelse:\n print(''.join(res))", "n=int(input())\r\ns=input()\r\nl=\"\"\r\nif n%2==0:\r\n l=l+s[0]\r\n for i in range(1,n):\r\n if i%2==0:\r\n l=s[i]+l\r\n else:\r\n l=l+s[i]\r\nelse:\r\n l=l+s[0]\r\n for i in range(1,n):\r\n if i%2==0:\r\n l=l+s[i]\r\n else:\r\n l=s[i]+l\r\nprint(l)\r\n ", "n = int(input())\r\nw = str(input())\r\no = ''\r\nfor l in w:\r\n if n % 2 != 0:\r\n o = o + l\r\n else: o = l + o\r\n n -= 1\r\n\r\nprint(o)\r\n", "n = int(input())\r\nencoded = input()\r\ndecoded = [\"\"] * n\r\n\r\nfor i, letter in enumerate(encoded):\r\n if len(encoded) % 2:\r\n idx = n // 2 + i if i % 2 == 0 else n // 2 - 1\r\n else:\r\n idx = n // 2 - 1 if i % 2 == 0 else n // 2 + i\r\n\r\n decoded[idx] = letter\r\n n -= 1\r\n\r\nprint(\"\".join(decoded))", "n = int(input())\r\na = input()\r\nv1 = a[-2::-2]\r\nv2= a[-1::-2]\r\nc = v1 + v2[::-1]\r\nprint(c)\r\n", "n = int(input())\ns = input()\n\nif n % 2 == 1:\n\tprint(s[1::2][::-1] + s[::2])\nelse:\n\tprint(s[::2][::-1] + s[1::2])\n \t\t \t\t\t\t \t \t \t \t \t \t\t\t \t", "#801B (32no. Problem B)\r\nimport math\r\nn = int(input())\r\nen = input()\r\n# mid = math.ceil(n/2)\r\ns = en[0]\r\nj = n - 1\r\nif (j == 0):\r\n print(s)\r\nelse: \r\n for i in range(1,n):\r\n if j%2 == 0:\r\n s = en[i] + s\r\n else:\r\n s = s + en[i] \r\n j-=1 \r\n print(s) \r\n", "n = int(input())\r\ns,news = list(input()),[]\r\nwhile n>0:\r\n if n%2:\r\n news.append(s[0])\r\n else:\r\n news.insert(0,s[0])\r\n s.pop(0)\r\n n = len(s)\r\nprint(''.join(news))", "n = int(input()) # 5\r\ncoded = input() # croas\r\nword = \"\" # arcos\r\nwordlist = []\r\nshish = 1\r\nif n % 2 == 0:\r\n shish = -1\r\nmedian = int((n/2)-1)\r\nwordlist.append(median)\r\nfor number in range(1, n):\r\n median += shish * number * (-1)**number\r\n wordlist.append(median)\r\nnumberlist = wordlist + []\r\nfor number in range(0,n):\r\n word += coded[numberlist.index(min(wordlist))]\r\n wordlist.remove(min(wordlist))\r\nprint(word)", "n = int(input())\r\ns = list(str(input()))\r\nr = [\"\"]*n\r\nif n % 2 != 0:\r\n j = n // 2\r\n for i in range(n):\r\n if i % 2 == 0:\r\n r[j+i] = s[i]\r\n j += i\r\n else:\r\n r[j-i] = s[i]\r\n j -= i\r\nelse:\r\n j = (n // 2) - 1\r\n for i in range(n):\r\n if i % 2 != 0:\r\n r[j+i] = s[i]\r\n j += i\r\n else:\r\n r[j-i] = s[i]\r\n j -= i\r\n\r\nprint(\"\".join(r))\r\n", "n = int(input())\r\ns = input()\r\nlst = []\r\nif n%2 != 0:\r\n cnt = 0\r\n lst.append(s[0])\r\n for i in range(1,n):\r\n if cnt == 0 :\r\n lst.insert(0,s[i])\r\n cnt = 1\r\n elif cnt == 1:\r\n lst.append(s[i])\r\n cnt = 0\r\n print(''.join(lst))\r\nelif n % 2 == 0:\r\n cnt = 0\r\n lst.append(s[0])\r\n for i in range(1,n):\r\n if cnt == 0:\r\n lst.append(s[i])\r\n cnt = 1\r\n elif cnt == 1:\r\n lst.insert(0,s[i])\r\n cnt = 0\r\n print(''.join(lst))\r\n \r\n \r\n", "n = int(input())\r\ns = input()\r\nc = []\r\na = n//2\r\nfor i in s:\r\n if n % 2 == 0:\r\n c = [i]+c\r\n else:\r\n c.append(i)\r\n n += 1\r\nprint(*c, sep=\"\")\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n s = str(input())\r\n res = [\"\"] * n\r\n start, cur = 0, n // 2 if n & 1 else n // 2 - 1\r\n if n & 1:\r\n res[cur] = s[0]\r\n start = 1\r\n cur -= 1\r\n for i in range(start, n, 2):\r\n res[cur] = s[i]\r\n res[n - 1 - cur] = s[i + 1]\r\n cur -= 1\r\n print(\"\".join(res))", "n = int(input())\r\ndecode = input()\r\nresult = \"\"\r\nresult = decode[0] + result\r\nif n % 2 == 1:\r\n i = 1\r\n while i < n:\r\n if i % 2 == 0:\r\n result = result + decode[i]\r\n else:\r\n result = decode[i] + result\r\n i += 1\r\n print(result)\r\nelse:\r\n i = 1\r\n while i < n:\r\n if i % 2 == 0:\r\n result = decode[i] + result\r\n else:\r\n result = result + decode[i]\r\n i += 1\r\n print(result)", "n = int(input())\r\ns = input()\r\ns1 = ''\r\nfor i in range(n):\r\n if (n+i)%2 == 0:\r\n s1 = s[i] + s1\r\n else:\r\n s1 = s1 + s[i]\r\nprint(s1)\r\n\r\n ", "\r\nn = int(input())\r\nstring = input()\r\n\r\ncurrentOp = 1\r\nresult = []\r\nfor char in string:\r\n if currentOp:\r\n result.append(char)\r\n else:\r\n result.insert(0, char)\r\n currentOp ^= 1\r\n\r\n\r\nif len(result) % 2 == 0:\r\n print(''.join(result[::-1]))\r\nelse:\r\n print(''.join(result))\r\n", "import sys\r\nimport math\r\nimport bisect\r\nfrom math import sqrt\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\nmod = int(1e9)+7\r\n\r\nn = iinput()\r\ns = input()\r\nans = ''\r\n\r\nif n%2 == 1:\r\n\tans += s[0]\r\n\tfor i in range(1, n, 2):\r\n\t\tans = s[i] + ans + s[i+1]\r\nelse:\r\n\tfor i in range(0, n, 2):\r\n\t\tans = s[i] + ans + s[i+1]\r\n\r\nprint(ans)", "num = int(input())\r\nhehe = input()\r\nif num < 3:\r\n print(hehe)\r\n exit()\r\na = \"\"\r\nb = \"\"\r\ni = 0\r\nfor x in hehe[::-1]:\r\n if i % 2 == 0:\r\n b = x + b\r\n else:\r\n a = a + x\r\n i=i+1\r\n \r\nprint(a+b)", "a=int(input())\r\nb=input()\r\nif a%2==0:\r\n c=b[::2]\r\n c=c[::-1]\r\n t=b[1::2]\r\n print(c,t,sep='')\r\nelse:\r\n c=b[::2]\r\n t=b[1::2]\r\n t=t[::-1]\r\n print(t,c,sep='')", "'''T = int(input())\r\nS = list(input())\r\nres = ''\r\nwhile T!=0:\r\n i = T//2 if T&1==1 else T//2 -1\r\n res+=S[i]\r\n S.pop(i)\r\n T-=1\r\nprint(res)'''\r\ndef decode(T, res):\r\n S = [''] * T\r\n remaining = list(res)\r\n mid = (T - 1) // 2\r\n for i in range(T):\r\n if i % 2 == 0:\r\n index = mid - (i // 2)\r\n else:\r\n index = mid + (i // 2) + 1\r\n try:\r\n S[index] = remaining.pop(0)\r\n except:\r\n break\r\n\r\n return ''.join(S)\r\nT = int(input())\r\nres = input()\r\noutput = decode(T, res)\r\nprint(output[::-1] if T&1==1 else output)", "n = int(input())\r\nd = list(input())\r\nm = []\r\nm.append(d[0])\r\nd.remove(d[0])\r\nn-=1\r\nfor i in range(len(d)):\r\n if (n % 2) != 0 :\r\n m.append(d[i])\r\n n-=1\r\n else:\r\n m.insert(0,d[i])\r\n n-=1\r\nm = ''.join([str(c) for c in m])\r\nprint(m)", "n = int(input())\r\ns = input()\r\nst = txt = ''\r\nfor i in s:\r\n if len(s) % 2 != 0:\r\n st += i\r\n s = s.replace(i, '', 1)\r\n else:txt += i; s = s.replace(i, '', 1)\r\nprint(txt[::-1] + st)\r\n", "def solve():\r\n n=int(input());s=input();x=s[1::2];y=s[::2];print(x[::-1]+y) if n%2!=0 else print(y[::-1]+x)\r\nsolve()\r\n", "n=int(input())\r\nstring=input()\r\ndata=\"\"\r\n\r\nleft,right=0,n-1\r\nlist1=[0 for i in range(n)]\r\npos=True\r\nwhile n!=0:\r\n if pos:\r\n list1[right]=string[n-1]\r\n right-=1\r\n else:\r\n list1[left]=string[n-1]\r\n left+=1\r\n pos=not(pos)\r\n n-=1\r\n\r\n#list1[left+1]=string[0]\r\nprint(\"\".join(list1)) \r\n \r\n", "n=int(input())\r\n\r\nword=input()\r\nisLast=True\r\niter=0\r\nk=0\r\ndecode=['']*n\r\nfor i in range(n-1,-1,-1):\r\n if(isLast):\r\n decode[n-1-iter]=word[i]\r\n iter+=1\r\n isLast=False\r\n else:\r\n decode[k]=word[i]\r\n k+=1\r\n isLast=True\r\n\r\nprint(''.join(decode))", "n=int(input())\r\na=input()\r\nl=''\r\nh=''\r\nif len(a)%2!=0:\r\n for i in range(0,n,2):\r\n l+=a[i]\r\n for j in range(1,n,2):\r\n h+=a[j]\r\n h=h[::-1]\r\n h+=l\r\n print(h)\r\nelse:\r\n for i in range(0,n,2):\r\n l+=a[i]\r\n for j in range(1,n,2):\r\n h+=a[j]\r\n l=l[::-1]\r\n l+=h\r\n print(l)", "n = int(input())\r\nstring = input()\r\nans = ''\r\ni = 1\r\nfor ch in string:\r\n if len(string) % 2 == 0:\r\n if i%2 == 0:\r\n ans += ch\r\n i += 1\r\n else:\r\n ans = ch + ans\r\n i += 1\r\n else:\r\n if i%2 == 0:\r\n ans = ch + ans\r\n i += 1\r\n else:\r\n ans += ch\r\n i += 1\r\nprint(ans)", "n = int(input())\r\ns1 = str(input())\r\n\r\ns2 = ''\r\nif n % 2 != 0:\r\n\tfor i in range(n):\r\n\t\tif i % 2 == 0:\r\n\t\t\ts2 = s2 + s1[i]\r\n\t\telse:\r\n\t\t\ts2 = s1[i] + s2\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif i % 2 == 0:\r\n\t\t\ts2 = s1[i] + s2\r\n\t\telse:\r\n\t\t\ts2 = s2 + s1[i]\t\r\n\r\nprint(s2)", "n=int(input())\r\ns=list(input())\r\nl=[s[-1]]\r\ns.pop(-1)\r\nfor _ in range(n-1):\r\n l.insert(len(l)//2,s[-1])\r\n s.pop(-1)\r\nprint(''.join(l))\r\n", "n = int(input())\r\ns = input()\r\nres=''\r\nwhile len(s) > 1 :\r\n if len(s)%2 : \r\n res=s[1]+res+s[0]\r\n s=s[2:]\r\n else:\r\n res=s[0]+res+s[1]\r\n s=s[2:]\r\nres+=s\r\nprint(res)", "n = int(input())\r\n\r\ns = input()\r\nres = ''\r\nfor i in range(n):\r\n\tif((n+i+1)%2 == 0):\r\n\t\tres += s[i]\r\n\telse:\r\n\t\tres = s[i] + res\r\n\r\nprint(res)\r\n", "n = int(input())\ns = input()\nd = {}\nfor i in range(1, n+1):\n\td[i] = \"\"\nfor i in s:\n\tm = n/2\n\tn -= 1\n\td[m] = i\nans = \"\"\nfor key in d.keys():\n\tans += d[key]\nprint(ans)\n\t\t\t \t \t\t \t\t \t\t\t \t\t \t\t\t \t", "n=int(input())\ns=input()\nans=\"\"\n\nfor i in range(n):\n if i%2==1:\n ans+=s[i]\n else:\n ans=s[i]+ans\n\n\nif n %2==0:\n print(ans)\nelse:\n print(ans[::-1])\n", "n = int(input())\ns = input()[::-1]\nans = ''\nfor char in s:\n index_to_add = int(len(ans)/2)\n onLeft = ans[0:index_to_add]\n onRight = ans[index_to_add:len(ans)]\n ans = onLeft+char+onRight\nprint(ans)", "n=int(input())\r\ns=input()\r\nif len(s)%2==1:\r\n a=s[::2]\r\n b=s[::-1]\r\n b=b[1::2]\r\n print(str(b)+str(a))\r\nelse:\r\n a=s[::2]\r\n b=s[::-1]\r\n b=b[0::2]\r\n print((str(b)+str(a))[::-1]) ", "n = int(input())\r\ns = input()\r\ns1 = slice(-2, -n-1, -2)\r\ns2 = slice(0,n+1,2)\r\ns3 = slice(1,n+1,2)\r\n\r\nif n % 2 == 0:\r\n print(s[s1] + s[s3])\r\nelse:\r\n print(s[s1] + s[s2])", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')[1]\r\n return inp[-2::-2] + inp[not len(inp)%2::2]\r\n \r\nprint(main(), sep='\\n')", "n = int(input())\nans = []\nis_left = False\nfor c in input():\n if(is_left):\n ans.insert(0,c)\n else:\n ans.append(c)\n is_left = not is_left\nif(n%2==1):\n ans = ''.join(ans)\nelse:\n ans = ''.join(reversed(ans))\nprint(ans)\n \n\n\n", "n = int(input())\r\nencoded_word = input()\r\nencoded_word = list(encoded_word)\r\ndecoded_word = []\r\noriginal_word = encoded_word\r\nencoded_word = []\r\nnew_word = []\r\nfor i in range(n):\r\n encoded_word.append(str(i))\r\n new_word.append('')\r\n#print(encoded_word)\r\nwhile(len(encoded_word)!=0):\r\n n = len(encoded_word)\r\n #print(n,len(encoded_word))\r\n if n % 2 == 0:\r\n decoded_word.append(encoded_word[(n//2)-1])\r\n del encoded_word[(n-1)//2]\r\n else:\r\n decoded_word.append(encoded_word[n//2])\r\n del encoded_word[n//2]\r\n#print(decoded_word)\r\nc = 0\r\nfor i in decoded_word:\r\n new_word[int(i)] = original_word[c]\r\n c += 1\r\nprint(''.join(new_word))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # one integer input\r\n return(int(input()))\r\ndef inlt(): # list input\r\n return(list(map(int,input().split())))\r\ndef insr(): # string input\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): # muliple integer variables input\r\n return(map(int,input().split()))\r\n\r\nlength = inp()\r\nencoded = insr()\r\noutput = \"\"\r\n\r\nfor i in range(len(encoded)):\r\n if (i % 2) == ((len(encoded) + 1) % 2):\r\n output += encoded[i]\r\n\r\n else:\r\n output = encoded[i] + output\r\n\r\n\r\nprint(output)", "\"\"\"\r\nhttp://codeforces.com/contest/746/problem/B\r\n\r\n5\r\nlogva\r\n\r\n2\r\nno\r\n\r\n\r\n4\r\nabba\r\n\r\n\r\n\"\"\"\r\nn = int(input())\r\ns = input()\r\ns1, s2 = '', ''\r\n\r\n\r\nj = 0\r\nfor i in range(n - 1, -1, -1):\r\n if j % 2 == 0:\r\n s1 += s[i]\r\n else:\r\n s2 += s[i]\r\n j += 1\r\n\r\nresult = s2 + s1[::-1]\r\nprint(result)\r\n", "# توكلت على الله\r\n\r\nimport sys \r\ninput = sys.stdin.readline \r\n\r\ndef solve():\r\n num = int(input())\r\n code = input()\r\n ans = [code[0]]\r\n mod = 1 \r\n if num % 2 == 1:\r\n for i in range(1,num):\r\n if mod % 2 == 0:\r\n ans.append(code[i])\r\n mod += 1\r\n else:\r\n ans.insert( 0 , code[i] )\r\n mod += 1\r\n \r\n else:\r\n for i in range(1,num):\r\n if mod % 2 == 0:\r\n ans.insert( 0 , code[i] )\r\n mod += 1\r\n else:\r\n ans.append(code[i])\r\n mod += 1\r\n print( \"\".join(map(str,ans)))\r\n#for i in range(int(input())):\r\nsolve()", "#for i in range(int(input())):\r\ndef solve():\r\n n = int(input())\r\n a = input()\r\n ans = ['','']\r\n for i in range(n-1,-1,-1):\r\n ans[i%2] += a[i]\r\n s = ans[1] + ans[0][::-1]\r\n return s if n % 2 else s[::-1]\r\nprint(solve())", "length=input()\r\nword=input()\r\nprint(word[-2::-2]+word[-1::-2][::-1])", "n = int(input())\r\nlst = input()\r\ns = []\r\nfor i in lst:\r\n s.append(i)\r\ns2 = s.pop(0)\r\nt = 1\r\nif n % 2 == 1:\r\n while len(s) != 0:\r\n if t== 1:\r\n x = s.pop(0)\r\n s2 = x + s2\r\n else:\r\n x = s.pop(0)\r\n s2 += x\r\n t = 1 - t\r\n print(s2)\r\nif n % 2 == 0:\r\n while len(s) != 0:\r\n if t== 0:\r\n x = s.pop(0)\r\n s2 = x + s2\r\n else:\r\n x = s.pop(0)\r\n s2 += x\r\n t = 1 - t\r\n print(s2)\r\n", "n= int(input())\r\nstring = input()\r\nfirst = []\r\nend = []\r\nfor i in range(n-1,-1,-2):\r\n end.append(string[i])\r\nif n>1:\r\n for i in range(n-2,-1,-2):\r\n first.append(string[i])\r\n end.reverse()\r\nprint(\"\".join(first+end))\r\n", "n =int(input())\r\n\r\ns = input()\r\n\r\nans = \"\"\r\n\r\nfor i in range(n):\r\n if i%2==0:\r\n ans=s[i]+ans\r\n else:\r\n ans = ans+s[i]\r\nif n%2==0:\r\n print(ans)\r\nelse:\r\n print(ans[::-1])", "n = int(input())\r\nletters = list(input())\r\nletters.reverse()\r\nout = [letters[0]]\r\nfor i in range(1,n):\r\n out.insert(len(out)//2,letters[i])\r\nprint(\"\".join(out))", "n=int(input())\r\ns=list(input())\r\nfor i in range(n-2,-1,-2):\r\n print(s[i],end=\"\")\r\nfor i in range(1-n&1,n,2):\r\n print(s[i],end=\"\")", "n=int(input())\r\ns=input()\r\nx=\"\"\r\nif n%2==1 and n!=1:\r\n for i in range(n-1):\r\n if i%2==0:\r\n x+=s[-2-i]\r\n for j in range(n):\r\n if j%2==0:\r\n x+=s[j]\r\n print(x)\r\nelif n%2==0:\r\n for i in range(n-1):\r\n if i%2==0:\r\n x+=s[-2-i]\r\n for j in range(n):\r\n if j%2==1:\r\n x+=s[j]\r\n print(x)\r\nelse:\r\n print(s)\r\n\r\n\r\n\r\n\r\n", "answer=\"\"\r\na= int(input())\r\nword=input()\r\nx=len(word)\r\nans={}\r\nfor i in range(x):\r\n if len(word)%2==0:\r\n dig=(len(word)+1)//2\r\n ans[dig]=word[0]\r\n else:\r\n dig=(len(word)+1)//2\r\n ans[x-dig+1]=word[0]\r\n word = word[1:]\r\nfor i in range(1,x+1):\r\n answer=answer+ans[i]\r\nprint(answer)", "n=int(input())\r\ns=input()\r\nsom=n\r\nch=\"\"\r\nwhile(som!=0):\r\n if (som%2==1):\r\n ch=ch+s[n-som]\r\n else:\r\n ch=s[n-som]+ch\r\n som-=1\r\nprint(ch)", "from sys import stdin\r\n\r\ndef main():\r\n _ = stdin.readline().strip()\r\n word = list(stdin.readline().strip())\r\n final = []\r\n a = word.pop(-1)\r\n final += [a]\r\n while word != []:\r\n a = word.pop(-1)\r\n final.insert(len(final)//2, a)\r\n print(\"\".join(final))\r\n\r\nmain()", "n=int(input())\r\nword=str(input())\r\nif n%2==1:\r\n alist=[]\r\n alist.append(word[0])\r\n for i in range(1,len(word)):\r\n if i%2==0:\r\n alist.append(word[i])\r\n else:\r\n alist.reverse()\r\n alist.append(word[i])\r\n alist.reverse()\r\nelse:\r\n alist=[]\r\n alist.append(word[0])\r\n for i in range(1,len(word)):\r\n if i%2==1:\r\n alist.append(word[i])\r\n else:\r\n alist.reverse()\r\n alist.append(word[i])\r\n alist.reverse()\r\n \r\nprint(\"\".join(alist))", "n = int(input())\r\nst = input()\r\nlst = [0]*n\r\nl,r = 0,0\r\nf = 0\r\n\r\nfor i in range(len(st)):\r\n \r\n if len(set(lst)) == 1 :\r\n if n % 2 == 0:\r\n lst[(n//2)-1] = st[i]\r\n l = (((n//2)-1)-1)\r\n r = (n//2)\r\n n -= 1\r\n else:\r\n lst[(n//2)] = st[i]\r\n l = (n//2)-1\r\n r = (n//2)+1\r\n n -= 1\r\n continue\r\n \r\n if n % 2 == 0:\r\n lst[l] = st[i]\r\n l -= 1\r\n n -= 1\r\n else:\r\n lst[r] = st[i]\r\n r += 1\r\n n -= 1\r\n \r\nfor i in lst:\r\n print(i,end=\"\")\r\n", "a = int(input())\r\narr = list(input())\r\nif a % 2 != 0:\r\n op = []\r\n for i in range(0, len(arr)):\r\n if i % 2 == 0:\r\n op.append(arr[i])\r\n else:\r\n op.insert(0, arr[i])\r\n print(\"\".join(op))\r\nelse:\r\n op = []\r\n for i in range(0 , len(arr)):\r\n if i % 2 == 0:\r\n op.insert(0, arr[i])\r\n else:\r\n op.append(arr[i])\r\n print(\"\".join(op))", "n = int(input())\nencrypted = input()\nres = [encrypted[0]]\npos = 'left' if n%2 else 'right' \nfor c in encrypted[1:]:\n if pos == 'left':\n res.insert(0,c)\n pos = 'right'\n else :\n res.append(c)\n pos = 'left'\nprint(''.join(res))", "n = int(input())\r\nencoded = list(input())\r\n\r\ndecoded = []\r\nif n % 2 == 1:\r\n i = -1\r\nelse:\r\n i = 0\r\nfor letter in encoded:\r\n if i == -1:\r\n decoded.append(letter)\r\n i = 0\r\n else:\r\n decoded.insert(0, letter)\r\n i = -1\r\n\r\nprint(\"\".join(decoded))\r\n", "n=int(input())\r\ns=input()\r\ns=s[::-1]\r\nk=''\r\nm=''\r\nb=True\r\nfor i in range(n):\r\n if b:\r\n k+=s[i]\r\n b=False\r\n else:\r\n m+=s[i]\r\n b=True\r\nk=k[::-1]\r\nprint(m+k)\r\n", "m = int(input())\n\n# if not(1 <= m <= 2000):\n# raise Exception(\"Length of string must be within range: (1 <= n <= 2000)\")\n\nn = input()\n\n# if len(n) != m:\n# raise Exception(\"Length of string must be equal n provided\")\n\nstring = [i for i in n]\nstart = 0\nend = len(string) - 1\nindex = []\n\nfor i in range(len(string)):\n try:\n index.append((string[-1],end))\n index.append((string[-2],start))\n start += 1\n end -= 1\n string.pop()\n string.pop()\n except IndexError:\n pass \n\npre_proc = len(index) - len(n)\n[index.pop() for i in range(pre_proc) if len(n) % 2 != 0]\nindex.sort(key=lambda i:i[1])\n[print(index[i][0],end=\"\") for i in range(len(n))]", "n = int(input())\r\ns = input()\r\nx = [0]*n\r\nif n%2 != 0:\r\n m = n//2\r\n for i in range(n):\r\n x[m] = s[i]\r\n if (i+1)%2 == 0:\r\n m += (i+1)\r\n else:\r\n m -= (i+1)\r\n print(*x, sep = '')\r\nelse:\r\n m = (n//2)-1\r\n for i in range(n):\r\n x[m] = s[i]\r\n if (i+1)%2 != 0:\r\n m += (i+1)\r\n else:\r\n m -= (i+1)\r\n print(*x, sep = '')", "n = int(input())\r\nword = list(input())\r\nl, r = [], []\r\nif n % 2 != 0:\r\n l.append(word.pop(0))\r\nfor i in range(0, len(word), 2):\r\n l.append(word[i])\r\n r.append(word[i+1])\r\nprint(\"\".join(l[::-1]+r))\r\n", "n = int(input())\r\ns = input()\r\nstring = [None] * n\r\n\r\nfor i in range(n):\r\n if (n+i) % 2 != 0:\r\n string[(n+i)//2] = s[i]\r\n else:\r\n string[((n-i)//2)-1] = s[i]\r\n\r\n \r\nprint(''.join(string)) ", "# import sys\n# input = sys.stdin.buffer.readline\n\n\ndef binarySearch(n, a):\n l = 0\n h = len(a)-1\n ans = 0\n while l <= h:\n mid = (l+h)//2\n if a[mid] == n:\n return 1\n elif a[mid] > n:\n h = mid - 1\n else:\n l = mid + 1\n return ans\n\nt = int(input())\ns = str(input())\n# for _ in range(t):\n# n, m = map(int, input().split(\" \"))\nif t % 2 == 0:\n ans = \"\"\n f = 0\n for i in s:\n if f == 0:\n ans= i + ans\n f = 1\n else:\n ans = ans + i\n f = 0\n print(ans)\nelse:\n ans = \"\"\n f = 0\n for i in s:\n if f == 0:\n ans += i\n f = 1\n else:\n ans= i+ ans\n f = 0\n print(ans)", "n = int(input())\ns = input()\nres = s[0]\n\nfor i in range(1, n):\n if(len(s[i:n]) % 2 == 0):\n res = s[i] + res\n else:\n res = res + s[i]\n\nprint(res)", "n=int(input())\r\ns=input()\r\nres=''\r\nif n%2==0:\r\n for i in range(len(s)):\r\n if i%2!=0:\r\n res+=s[i]\r\n else:\r\n res=s[i]+res\r\nelse:\r\n for i in range(len(s)):\r\n if i%2==0:\r\n res+=s[i]\r\n else:\r\n res=s[i]+res\r\nprint(res)", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter, deque\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\ndef med_index(n:int):\r\n if n%2==0:\r\n return n//2 -1 \r\n return n//2\r\nfrom collections import deque \r\ndef main():\r\n n = I()\r\n s = S()\r\n q = deque(s)\r\n res = deque(q.popleft())\r\n start = 'l' if n%2==1 else 'r'\r\n while q:\r\n char = q.popleft()\r\n if start == 'l':\r\n res.appendleft(char)\r\n else:\r\n res.append(char)\r\n start = 'r' if start == 'l' else 'l'\r\n return ''.join(res)\r\n \r\nif __name__ == '__main__':\r\n print(main())", "from collections import defaultdict, deque\r\nfrom heapq import heappush, heappop\r\nfrom math import inf\r\n\r\nri = lambda : map(int, input().split())\r\n\r\ndef solve():\r\n n = int(input())\r\n s = input()\r\n q = deque()\r\n if n & 1:\r\n on = True\r\n for i in range(n):\r\n if on:\r\n q.append(s[i])\r\n else:\r\n q.appendleft(s[i])\r\n on = not on\r\n else:\r\n on = True\r\n for i in range(n):\r\n if on:\r\n q.appendleft(s[i])\r\n else:\r\n q.append(s[i])\r\n on = not on\r\n print(\"\".join(list(q)))\r\n\r\n\r\nt = 1\r\n#t = int(input())\r\nwhile t:\r\n t -= 1\r\n solve()\r\n\r\n", "num = int(input())\nword = input()\nans=\"\"\n\nif num%2==0:\n for i in range(len(word)):\n if i%2==0:\n ans=word[i]+ans\n elif i%2==1:\n ans=ans+word[i]\n print(ans)\n \nelif num%2==1:\n for i in range(len(word)):\n if i%2==1:\n ans=word[i]+ans\n elif i%2==0:\n ans=ans+word[i]\n print(ans)\n", "n = int(input())\r\ns = input()\r\nans = [s[0]]\r\ncount = 1\r\nfor i in range(1, len(s)):\r\n if n % 2 == 1:\r\n if count % 2 == 1:\r\n ans.insert(0, s[i])\r\n else:\r\n ans.append(s[i])\r\n count += 1\r\n if n % 2 == 0:\r\n if count % 2 == 1:\r\n ans.append(s[i])\r\n else:\r\n ans.insert(0, s[i])\r\n count += 1\r\nprint(''.join(ans))\r\n\r\n", "n=int(input())\r\ns=input()\r\ns1=s[::2]\r\ns2=s[1::2]\r\nif n%2==1:\r\n print(s2[::-1]+s1)\r\nelse:\r\n print(s1[::-1]+s2)", "n = int(input())\nlist_w = [\" \"] * n\nfinal = input(\"\")\ni = n//2 - 1\nif n%2 == 0:\n j = i + 1\n for c in range(n):\n if c%2 == 0:\n list_w[i] = final[c]\n i -= 1\n else:\n list_w[j] = final[c]\n j += 1\nelse:\n j = i + 1\n for c in range(n-1):\n if c%2 == 0:\n list_w[j] = final[c]\n j += 1\n else:\n list_w[i] = final[c]\n i -= 1\n list_w[-1] = final[-1]\n\nprint(\"\".join(list_w))", "n = int(input())\na = input()\nd = dict()\ni = n // 2\nb = 1 + n % 2\nc = 0\nif n % 2 == 1:\n c = 1\n d[i + 1] = a[0]\nwhile i > 0:\n d[i], d[i + b] = a[c], a[c + 1]\n i -= 1\n b += 2\n c += 2\nprint(''.join([d[i] for i in range(1, n + 1)]))\n", "\"\"\"\r\nPolycarp is mad about coding, that is why he writes Sveta encoded messages. He calls the median letter in a word the letter which is in the middle of the word. If the word's length is even, the median letter is the left of the two middle letters. In the following examples, the median letter is highlighted: contest, info. If the word consists of single letter, then according to above definition this letter is the median letter.\r\n\r\nPolycarp encodes each word in the following way: he writes down the median letter of the word, then deletes it and repeats the process until there are no letters left. For example, he encodes the word volga as logva.\r\n\r\nYou are given an encoding s of some word, your task is to decode it.\r\n\r\nInput\r\nThe first line contains a positive integer n (1 ≤ n ≤ 2000) — the length of the encoded word.\r\n\r\nThe second line contains the string s of length n consisting of lowercase English letters — the encoding.\r\n\r\nOutput\r\nPrint the word that Polycarp encoded.\r\n\"\"\"\r\nfrom itertools import zip_longest\r\n\r\nn = int(input())\r\ns = input()\r\nending = s[-1::-2][-1::-1]\r\nbeginning = s[-2::-2]\r\n\r\nprint(beginning + ending)\r\n", "count = int(input())\r\nsomething = str(input())\r\nli = []\r\nli2 = []\r\nc = count % 2\r\nif c == 1:\r\n b = 0\r\nelse:\r\n b = 1\r\nfor i in range(b, count, 2):\r\n li2.append(something[i])\r\nfor i in range(c, count, 2):\r\n li.append(something[i])\r\nli.reverse()\r\nli3 = li + li2\r\nstr1 = ''.join(li3)\r\nprint(str1)\r\n\r\n\r\n", "n=int(input())\r\nencoded,decoded=input(),[None]*n\r\nri,li=-1,-1\r\nif n%2==0:\r\n ri,li=int((n/2)),int(n/2)-1\r\n right = False\r\nelse:\r\n ri, li = int(((n + 1) / 2)) - 1, int((n + 1) / 2) - 2\r\n right = True\r\nfor i in encoded:\r\n if not right:\r\n decoded[li]=i\r\n li-=1\r\n else:\r\n decoded[ri] = i\r\n ri+=1\r\n right=not right\r\nprint(\"\".join(decoded))", "n = int(input())\r\ns = input()\r\nans = \"\"\r\nflag = 1 if n % 2 == 0 else 0\r\nt = 1\r\nfor i in range(n):\r\n if flag:\r\n if t:\r\n ans = \"\".join((s[i], ans))\r\n t = 0\r\n else:\r\n ans = \"\".join((ans, s[i]))\r\n t = 1\r\n else:\r\n if t:\r\n ans = \"\".join((ans, s[i]))\r\n t = 0\r\n else:\r\n ans = \"\".join((s[i], ans))\r\n t = 1\r\nprint(ans)", "n = int(input())\r\nthe_str= input()\r\nres = []\r\nturn_flag = True if n%2 == 0 else False\r\n\r\nif n == \"1\" or n == \"2\":\r\n print(the_str)\r\n \r\nelse:\r\n for i in range(n):\r\n if turn_flag:\r\n res.insert(0,the_str[i])\r\n turn_flag = False\r\n else:\r\n res.append(the_str[i])\r\n turn_flag = True\r\n\r\n\r\n print(\"\".join(res))\r\n", "n = int(input())\r\ns = input()\r\nans = s[0]\r\nfor i in range(1,n):\r\n if (i%2) == (n%2):\r\n ans = s[i] + ans\r\n else:\r\n ans += s[i]\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\n# out = \"\"\r\nl = []\r\ni = 0\r\nif(n <= 2):\r\n print(s)\r\nelse: #n >= 3\r\n if(n%2 == 1):\r\n l.append(s[0])\r\n i = 1\r\n \r\n else:\r\n l.append(s[0])\r\n l.append(s[1])\r\n i = 2\r\n \r\n while(i < n):\r\n l.insert(0, s[i])\r\n l.append(s[i+1])\r\n i+= 2\r\n\r\nprint(\"\".join(l))", "# x = int(input())\n# \n# for q in range(x):\n\n\n\nn = int(input())\nword = input()\nres = ['']\na=-1\nfor i in range(n-1,-1,-1):\n if len(res)%2!=0:\n a+=1\n res.insert(a,word[i])\n\n\n\n\nprint(\"\".join(res))\n", "n = int(input())\r\ns = input()\r\n\r\nif n % 2 == 1:\r\n a = ''\r\n d = ''\r\n for i in range(n):\r\n if i % 2 == 0:\r\n a += s[i]\r\n else:\r\n d += s[i]\r\n print(d[::-1]+a)\r\nelse:\r\n a = ''\r\n d = ''\r\n for i in range(n):\r\n if i % 2 == 0:\r\n a += s[i]\r\n else:\r\n d += s[i]\r\n print(a[::-1]+d)", "n=int(input())\r\ns=input()\r\n\r\nout=s[0]\r\n\r\nif (n%2==1):\r\n while (len(out)!=n):\r\n if (len(out)%2==1):\r\n out=s[len(out)]+out\r\n else:\r\n out=out+s[len(out)]\r\n \r\nelse:\r\n while (len(out)!=n) :\r\n if (len(out)%2==1):\r\n out=out+s[len(out)]\r\n else:\r\n out=s[len(out)]+out\r\n\r\nprint(out)\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nres_s = ''\r\nfor i in range(n):\r\n\tif n % 2 == 1:\r\n\t\tif i % 2 == 0:\r\n\t\t\tres_s += s[i]\r\n\t\telse:\r\n\t\t\tres_s = s[i] + res_s\r\n\telse:\r\n\t\tif i % 2 == 1:\r\n\t\t\tres_s += s[i]\r\n\t\telse:\r\n\t\t\tres_s = s[i] + res_s\r\nprint(res_s)", "'''\r\nvolga as\r\ngva\r\n\r\n'0' '1' '2' '3' '4'\r\n2 1 3 0 4\r\n\r\n\r\n\r\nabba\r\n'b' 'a' 'b' 'a'\r\n'''\r\nn = int(input());code = list(input())\r\ndecode = [''] * n\r\n\r\nf = ''\r\nif n % 2 != 0:\r\n f = code[0]\r\n code.remove(code[0])\r\n n -= 1\r\n\r\nmid = n//2 - 1\r\nj = 0\r\ni = 0\r\nwhile j != n:\r\n decode[mid-i] = code[j]\r\n j += 1\r\n decode[mid + i + 1] = code[j]\r\n j += 1\r\n\r\n i += 1\r\n\r\nif decode[len(decode)-1] == '':\r\n print(*decode[0:n//2] ,f ,*decode[n//2:] ,sep='')\r\nelse:\r\n print(*decode, sep='')", "n = int(input())\r\ns = list(input())\r\nans = \"\"\r\nif not n & 1:\r\n for i in range(n):\r\n if i % 2 == 1:\r\n ans += s[i]\r\n else:\r\n ans = s[i] + ans\r\nelse:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n ans += s[i]\r\n else:\r\n ans = s[i] + ans\r\nprint(ans)", "t = int(input())\r\nword = list(map(str, input()))\r\n\r\nans = '' + word[0]\r\nword.pop(0)\r\nfor i in range(t-1):\r\n if t % 2 == 0:\r\n if i % 2 == 0:\r\n ans += word.pop(0)\r\n else:\r\n ans = word.pop(0) + ans\r\n else:\r\n if i % 2 == 0:\r\n ans = word.pop(0) + ans\r\n else:\r\n ans += word.pop(0)\r\n\r\nprint(ans)", "def yzd_solution(n, word):\r\n answer = []\r\n \r\n if n <= 2:\r\n return word\r\n else:\r\n while n:\r\n if n % 2 == 0:\r\n answer.append(word[0])\r\n else:\r\n answer.insert(0, word[0])\r\n word = word[1:]\r\n n -= 1\r\n\r\n return \"\".join(answer) if n % 2 != 0 else \"\".join(answer[::-1])\r\n\r\n\r\n\r\nn = int(input())\r\nword = input()\r\nprint(yzd_solution(n, word))", "n = int(input())\npalabra = input()\nresultado = [None] * n\nder = n - 1\nizq = 0\nd = True\nfor i in range(n-1, -1, -1):\n if d:\n resultado[der] = palabra[i]\n der -= 1\n else:\n resultado[izq] = palabra[i]\n izq += 1\n d = not d\nprint(''.join(resultado))", "# Bismillah\r\n# In the name of GOD\r\n\r\n\r\nn = int(input())\r\ns = input()\r\nans = ''\r\nif n % 2:\r\n\tfor i in range(n):\r\n\t\tif i % 2:\r\n\t\t\tans = s[i] + ans\r\n\t\telse:\r\n\t\t\tans += s[i]\r\nelse:\r\n\tfor i in range(n):\r\n\t\tif i % 2:\r\n\t\t\tans += s[i]\r\n\t\telse:\r\n\t\t\tans = s[i] + ans\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(str(input()))\r\ns=''\r\nif n%2==1:\r\n for i in range(n-2,-1,-1):\r\n if i%2==1:\r\n s+=l[i]\r\n for i in range(n):\r\n if i%2==0:\r\n s+=l[i]\r\n print(s)\r\nelse:\r\n for i in range(n-2,-1,-1):\r\n if i%2==0:\r\n s+=l[i]\r\n for i in range(n):\r\n if i%2==1:\r\n s+=l[i]\r\n print(s)", "out = [\"\" for i in range(int(input()))]\r\nword = [i for i in input()]\r\nsoso = 0\r\nmagh = 2\r\nfor i in range(1, len(out) + 1):\r\n if i % 2 != 0:\r\n out[-i + soso] = word[-i]\r\n soso += 1\r\n else:\r\n out[i - magh] = word[-i]\r\n magh += 1\r\nprint(\"\".join(out))", "n = int(input())\r\ns = input()\r\n\r\nout = list(\" \"*n)\r\nidx = len(s) // 2\r\nif len(s) % 2 == 0:\r\n idx -= 1\r\n\r\nfor i in range(n):\r\n if len(s[i:]) % 2 == 1:\r\n idx += i * 1\r\n else:\r\n idx -= i * 1\r\n out[idx] = s[i]\r\n\r\nprint(''.join(out))", "n = int(input())\r\ns = input()\r\nw = ''\r\n\r\nf = True\r\nif n % 2:\r\n f = False\r\n\r\nfor k in s:\r\n if f:\r\n w = k + w \r\n else:\r\n w += k\r\n f = not f\r\n\r\nprint(w)", "n=int(input())\r\ns=input()\r\n\r\nif(n%2==1):\r\n print(s[-2::-2]+s[0::2])\r\nelse:\r\n print(s[-2::-2]+s[1::2])\r\n", "n,s=int(input()),input()\r\nprint(s[n%2::2][::-1]+s[1-n%2::2])\r\n", "n=int(input())\r\ns=input()\r\na=\"\"\r\nif n%2!=0:\r\n\ta=s[0]\r\n\ts=s[1:]\r\n\tn-=1\r\ns1=s2=\"\"\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\ts1=s[i]+s1\r\n\telse:\r\n\t\ts2+=s[i]\r\nprint(s1+a+s2)", "n = int(input())\ns = input()\nr = [\".\"]*n\nk = n//2\nj = 0\nif n%2 == 0:\n for l in range(1,n,2):\n r[k-(j+1)] = s[l]\n r[k+j] = s[l-1]\n j+=1\n r = r[::-1]\nelif n%2!= 0:\n j = 0\n for l in range(1, n, 2):\n r[k+j] = s[l-1]\n r[k-(j+1)] = s[l]\n j+=1\n r[-1] = s[-1]\nprint(\"\".join(r))\n\t \t \t\t\t\t\t \t\t\t \t\t\t\t \t \t \t\t\t\t", "from collections import defaultdict as dd\nfrom collections import deque\nimport bisect\nimport heapq\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \nn = ri()\nss = input()\nans = deque()\nif n % 2 == 0:\n\tfor i, s in enumerate(ss):\n\t\tif i % 2 == 0:\n\t\t\tans.appendleft(s)\n\t\telse:\n\t\t\tans.append(s)\nelse:\n\tfor i, s in enumerate(ss):\n\t\tif i % 2 == 1:\n\t\t\tans.appendleft(s)\n\t\telse:\n\t\t\tans.append(s)\nprint(\"\".join(ans))\n\n\n\n", "t=int(input())\r\na=list(map(str, input()))\r\n\r\nb=[]\r\nif (t%2!=0):\r\n b.append(a[0])\r\n a.remove(a[0])\r\n while(len(a)>0):\r\n \r\n b.insert(0,a[0])\r\n a.remove(a[0])\r\n b.append(a[0])\r\n a.remove(a[0])\r\nelse:\r\n b.append(a[0])\r\n a.remove(a[0])\r\n while(len(a)>1):\r\n \r\n b.append(a[0])\r\n a.remove(a[0])\r\n b.insert(0,a[0])\r\n a.remove(a[0])\r\n b.append(a[0])\r\nc=\"\".join(b)\r\nprint(c)", "# Wadea #\r\n\r\ns = int(input())\r\ns1 = list(input())\r\norg = \"\"\r\nfor j in s1:\r\n if s % 2 == 0:\r\n org = j + org\r\n s -= 1\r\n else:\r\n org += j\r\n s -= 1\r\nprint(org)", "n = int(input())\r\nword = input()\r\nres = word[0]\r\nif n % 2 != 0:\r\n for i in range(1, n):\r\n if i % 2 != 0:\r\n res = word[i] + res\r\n else:\r\n res += word[i]\r\nelse:\r\n for i in range(1, n):\r\n if i % 2 != 0:\r\n res += word[i]\r\n else:\r\n res = word[i] + res\r\nprint(res)", "n = int(input())\ns = input()\ndecode = \"\"\n\n\nfor i in range(len(s)):\n if len(s) % 2 == 0:\n decode = s[0] + decode\n else:\n decode += s[0]\n s = s[1:]\n\nprint(decode)\n \t\t \t\t\t \t\t\t \t \t \t \t \t\t \t \t", "n = int(input())\r\ns = input()\r\n\r\nprint(s[-2::-2] + s[-1::-2][::-1])\r\n", "from collections import deque\nlength = int(input())\nstring = deque(input())\nqueue = deque()\nstack = deque()\n\n\ndef decode():\n decoded = ''\n while len(string) > 0:\n if len(string) % 2 == 0:\n current = string.popleft()\n queue.appendleft(current)\n\n else:\n current = string.popleft()\n stack.append(current)\n\n for i in queue:\n decoded += i\n for i in stack:\n decoded += i\n return decoded\n\n\nprint(decode())\n", "def proceso1(x,p,j,vector2):\r\n while (x/2)!=j:\r\n vector2.append(vector[p])\r\n j+=1\r\n p-=2\r\n return(j,p)\r\ndef proceso2(j,x,c,vector,vector2,num):\r\n while j!=x:\r\n vector2.append(vector[num+c])\r\n j+=1\r\n c+=2\r\n return(j,c)\r\nm=input('')\r\npalabra=input('')\r\npalabraFinal=''\r\nvector=[]\r\nvector2=[]\r\nc=0 ;j=0\r\n\r\nfor i in palabra: \r\n vector.append(i)\r\n\r\nx=int(len(vector))\r\np=x-2\r\n\r\nif x%2==0:\r\n (j,p)=proceso1(x,p,j,vector2)\r\n \r\n (j,c)=proceso2(j,x,c,vector,vector2,1)\r\n \r\nelse:\r\n (j,p)=proceso1(x-1,p,j,vector2)\r\n \r\n (j,c)=proceso2(j,x,c,vector,vector2,0)\r\n \r\nfor i in range(x):\r\n palabraFinal+=vector2[i]\r\n\r\nprint(palabraFinal)", "length=int(input())\r\nencoded_word=input()\r\ndecoded_word=[]\r\nfor i in range(0,length):\r\n decoded_word.insert((0 if((length-i)%2==0)else (len(decoded_word))),encoded_word[i])\r\nprint(\"\".join(decoded_word))", "n=int(input())\r\ns=input()\r\nl=\"\"\r\nfor i in s:\r\n if n%2==0:\r\n l=i+l\r\n else :\r\n l=l+i\r\n n-=1\r\nprint(l)", "n=int(input())\r\na=input()\r\ns=a[0]\r\nfor i in range(1,n):\r\n if i%2==0:\r\n s=a[i]+s\r\n else:s=s+a[i]\r\nif n%2==1:\r\n s=s[::-1]\r\nprint(s)\r\n", "\r\na=int(input())\r\nb=input()\r\nans1=\"\"\r\nans2=\"\"\r\nfor i in range(a):\r\n if i%2==0:\r\n ans1+=b[i]\r\n else:\r\n ans2+=b[i]\r\nif a%2==0:\r\n print(ans1[::-1]+ans2)\r\nelse:\r\n print(ans2[::-1]+ans1)\r\n ", "# https://codeforces.com/problemset/problem/746/B\r\n\r\ndef solve(decoded_word):\r\n original_word = ''\r\n for i in range(len(decoded_word)-2,-1,-2):\r\n original_word += decoded_word[i]\r\n\r\n for i in range((len(decoded_word)%2)^1, len(decoded_word), 2):\r\n original_word += decoded_word[i]\r\n\r\n return original_word\r\n\r\ninput()\r\ndecoded_word = input()\r\nprint(solve(decoded_word))\r\n", "from random import choice\r\nfrom string import ascii_lowercase\r\n\r\n\r\n# 6\r\n# s = eslamf\r\n# d = lasmef\r\n\r\n# left 1 2 4 6 lamf\r\n# right 3 5 es\r\n\r\n\r\n# 7\r\n# s = eslamfa\r\n# d = almsfea\r\n\r\n# left 1 3 5 7 amfa\r\n# right 2 4 6 lse esl\r\n\r\ndef decode(n, s):\r\n if (n % 2) == 0:\r\n return s[2::2][::-1] + s[0] + s[1::2]\r\n else:\r\n return s[1::2][::-1] + s[0::2]\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n print(decode(n, s))\r\n", "import sys\n\ndef median(n):\n\tmedian = None\n\n\tif n % 2 != 0:\n\t\tmedian = n // 2\n\telse:\n\t\tmedian = (n - 1) // 2\n\n\treturn median\n\t\n\ndef solve():\t\n\t# fin = open('input.txt')\n\t# input = fin.readline \n\tinput = sys.stdin.readline\n\tn = int(input())\n\tword = input()\n\n\tresult = [None] * n\n\tpositions = [i for i in range(n)]\n\n\t\n\tcount = 0\n\twhile positions:\n\t\tm = median(n)\n\t\tresult[positions[m]] = word[count]\n\t\tcount += 1\n\t\tdel positions[m]\n\t\tn -= 1\n\n\treturn ''.join(result)\n\n\t\t\nprint(solve())", "n, s = input(), input()\nprint(s[-2::-2] + s[-1::-2][::-1])\n", "n = int(input())\r\nencoded = input()\r\n\r\ndecoded = encoded[0]\r\n\r\nfor i in range(1, n):\r\n if i % 2 != 0:\r\n decoded = encoded[i] + decoded\r\n else:\r\n decoded = decoded + encoded[i]\r\n\r\nsol = decoded if n % 2 != 0 else decoded[::-1]\r\n\r\nprint(sol)\r\n", "def remchr(string, ind):\r\n string = [i for i in string]\r\n del string[ind]\r\n return ''.join(string)\r\na=int(input())\r\nb=input();p=\"\"\r\nif len(b) % 2 == 1:\r\n for i in range(len(b)):\r\n if i % 2 == 1: p = b[i]+p\r\n else: p = p+b[i]\r\n print(p)\r\nelse:\r\n for i in range(len(b)):\r\n if i % 2 == 0: p+=b[i]\r\n else: p=b[i]+p\r\n print(p[::-1])", "n=int(input())\r\ns=input()\r\na=list(s)\r\nif len(a)%2!=0:\r\n p=\"\"\r\n f=\"\"\r\n for i in range(len(s)):\r\n if i%2==0:\r\n p+=a[i]\r\n else:\r\n f+=a[i]\r\n print(f[::-1]+p)\r\nelse:\r\n p=\"\"\r\n f=\"\"\r\n for i in range(len(s)):\r\n if i%2==0:\r\n f+=a[i]\r\n else:\r\n p+=a[i]\r\n print(f[::-1]+p)", "n=int(input());a=input()\r\nif n>2 and n%2:\r\n\tfor i in range(n-2,0,-2):print(a[i],end='')\r\n\tfor i in range(0,n,2):print(a[i],end='')\r\nelif n>2 and n%2==0:\r\n\tfor i in range(n-2,0,-2):print(a[i],end='')\r\n\tprint(a[:2],end='')\r\n\tfor i in range(3,n,2):print(a[i],end='')\r\nelse:print(a)", "n = int(input())\r\ns = input()\r\nans = ''\r\nif n%2==0:\r\n for i in range(n):\r\n if i%2 == 1:\r\n ans+=s[i]\r\n else:\r\n ans=s[i]+ans\r\nelse:\r\n for i in range(n):\r\n if i%2 == 0:\r\n ans+=s[i]\r\n else:\r\n ans=s[i]+ans\r\nprint(ans)\r\n", "n= int(input())\r\ns= input()\r\na= ['s']*n\r\n\r\nif n%2 == 0:\r\n i= n//2 -1\r\n j= n//2\r\n for k in range(0, n, 2):\r\n a[i]= s[k]\r\n a[j]= s[k+1]\r\n i -= 1\r\n j += 1\r\nelse:\r\n a[n//2]= s[0]\r\n i= n//2 -1\r\n j= n//2 +1\r\n for k in range(1, n, 2):\r\n a[i]= s[k]\r\n a[j]= s[k+1]\r\n i -= 1\r\n j += 1\r\n\r\nprint(''.join(a))", "n = int(input())\r\ns = str(input())\r\nif n==1 or n==2:\r\n print(s)\r\nelif n%2 != 0:\r\n ans = ''\r\n for i in range(len(s)):\r\n if i%2 == 0:\r\n ans+=s[i]\r\n else:\r\n ans = s[i]+ans\r\n print(ans)\r\nelse:\r\n ans = s[:2]\r\n for i in range(2, len(s)):\r\n if i%2 == 0:\r\n ans = s[i]+ans\r\n else:\r\n ans+=s[i]\r\n print(ans)", "n=int(input())\r\ns=input()\r\nif n%2:\r\n print(s[1::2][::-1]+s[0::2])\r\nelse:\r\n print(s[0::2][::-1]+s[1::2])\r\n ", "import math\nnum = int(input())\nword = input()\ntext = ['a']*num\n\nmedian = math.floor(num/2)\nif num%2 == 0: median -= 1\ncounter = 0\nfor w in word:\n temp = (-counter) * ((-1)**counter) \n text[median+temp] = w\n counter += 1\n median += temp\nif num%2 == 1: text = text[::-1]\nprint(\"\".join(text))\n\n", "n = int(input())\r\ns = input()\r\nres = ['' for x in range(n)]\r\nif n%2!=0:\r\n res[n//2] =s[0]\r\n s = s[1:]\r\n i = n//2-1\r\n j=n//2+1\r\nelse:\r\n i=n//2-1\r\n j=n//2\r\nk =0\r\nwhile i>=0:\r\n res[i] = s[k]\r\n res[j]=s[k+1]\r\n i-=1\r\n j+=1\r\n k+=2\r\nprint(\"\".join(res))", "n=int(input())\r\ns=input()\r\ns=list(s)\r\nm=\"\"\r\nif n%2!=0:\r\n for i in range(0,len(s)):\r\n if i%2==0:\r\n m=m+s[i]\r\n else:\r\n m=s[i]+m\r\n print(m) \r\n \r\nelse: \r\n for i in range(0,len(s)):\r\n if i%2!=0:\r\n m=m+s[i]\r\n else:\r\n m=s[i]+m\r\n print(m) ", "n=int(input())\r\nword=input()\r\nli_word=list(word)\r\nl1 = ['']*n\r\nl=[]\r\nfor i in range(1,n+1):\r\n l.append(i)\r\n\r\nwhile l:\r\n n=len(l)\r\n if n%2!=0:\r\n l1[l[((n+1)//2)-1]-1]=li_word[0]\r\n li_word.remove(li_word[0])\r\n l.remove(l[((n+1)//2)-1])\r\n else:\r\n l1[l[(n//2)-1]-1]=li_word[0]\r\n li_word.remove(li_word[0])\r\n l.remove(l[(n//2)-1])\r\n\r\nprint(''.join(l1))\r\n\r\n", "n=int(input())\r\ns=input()\r\ns1=\"\"\r\nif n%2!=0:\r\n for z in range(n):\r\n if z%2==0:\r\n s1+=s[z]\r\n else :\r\n s1=s[z]+s1\r\n print(s1)\r\nelse :\r\n for z in range(n):\r\n if z%2==0:\r\n s1=s[z]+s1\r\n else :\r\n s1+=s[z]\r\n print(s1)", "n = int(input())\r\ns = input()\r\nres = []\r\ntail = n % 2 == 1\r\nfor i in range(n):\r\n if not tail:\r\n res.insert(0, s[i])\r\n else:\r\n res.append(s[i])\r\n tail = not tail\r\nprint(''.join(res))\r\n\r\n", "n = int(input())\r\ns = input()\r\nif n == 1 :\r\n print(s)\r\nelif n%2 == 1 :\r\n word = s[n-2::-2]+s[0]+s[2::2]\r\n print(word)\r\nelse :\r\n word = s[n-2::-2]+s[1::2]\r\n print(word)", "# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline().strip()\n\nn = int(input())\n\nencoded = list(input())\n\nresult = [None] * n\n\n\nl = n-2\nr = n-1\n\nleft = ''\nright = ''\n\nwhile l >= 0:\n\tleft += encoded[l]\n\tl -=2\n\nwhile r >= 0:\n\tright = encoded[r] + right\n\tr -=2\n\nprint(left + right)\n\n\n\n\n\n\t\n\n\n\n\t\t\n\n\t\t\n\n", "n = int(input())\r\ns = input()\r\n\r\na=''\r\nif(n%2==0):\r\n for j in range(n):\r\n if(j%2==1):\r\n a+=s[j]\r\n else:\r\n a=s[j]+a \r\nelse:\r\n for j in range(n):\r\n if(j%2==0):\r\n a+=s[j]\r\n else:\r\n a=s[j]+a \r\n \r\nprint(a)", "n = int(input())\r\nb = str(input())\r\nc = \"\"\r\nif n%2==0:\r\n a = 0\r\n for i in range(n):\r\n if a%2==0:\r\n c = b[i] + c\r\n a += 1\r\n else:\r\n c = c + b[i]\r\n a +=1\r\nelse:\r\n a = 0\r\n for i in range(n):\r\n if a%2:\r\n c = b[i] + c\r\n a += 1\r\n else:\r\n c = c + b[i]\r\n a +=1\r\n\r\nprint(c)\r\n", "\"\"\"\r\ninput:\r\n5\r\nlogva\r\n\r\noutput:\r\nvolga\r\n\"\"\"\r\n\r\ndef main():\r\n n = int(input())\r\n word = input()\r\n\r\n decoded = \"\"\r\n for i in range(n):\r\n if len(word) % 2 != 0:\r\n if i % 2 != 0:\r\n decoded = (word[i]) + decoded\r\n else:\r\n decoded = decoded + (word[i])\r\n else:\r\n if i % 2 == 0:\r\n decoded = (word[i]) + decoded\r\n else:\r\n decoded = decoded + (word[i])\r\n \r\n print(decoded)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\ne = input()\r\nif n%2 == 0:\r\n d = ''\r\n for t in range(0,n,2):\r\n d = e[t]+d+e[t+1]\r\nelse:\r\n d = e[0]\r\n for t in range(1,n,2):\r\n d = e[t]+d+e[t+1]\r\nprint(d)", "import sys\ninput = sys.stdin.readline\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n\n\nif __name__ == \"__main__\":\n l = inp()\n s = input()\n ret = \"\"\n mid = l//2\n if l%2 == 1:\n ret = s[0]\n s = s[1:]\n for i, c in enumerate(s):\n if i % 2 == 0: ret = c + ret\n else: ret += c\n print(ret)", "n = int(input())\ns = input()\n\nres = ['_' for _ in range(n)]\n\ni = 0\nm = (n-1) // 2\nwhile i < n:\n if (n+i) % 2 == 1:\n d = i \n else:\n d = -i\n \n res[m+d] = s[i]\n m = m+d\n i += 1\n\nprint(''.join(res))\n\n", "n=int(input())\r\ns=input()\r\nans=\"\"\r\nfor i in range(n):\r\n x=len(ans)//2\r\n ans=ans[:x]+s[-1]+ans[x:]\r\n s=s[:-1]\r\nprint(ans) ", "t = int(input())\r\nword = input()\r\nn = int(t/2)\r\nans = \"\"\r\nif t%2==1 and t>2:\r\n con = 1\r\n i = 0\r\n while i<t:\r\n if con==1:\r\n ans = ans + word[i]\r\n \r\n con = con+1\r\n i = i+1\r\n if con==2:\r\n ans = word[i] + ans\r\n con = con+1\r\n \r\n i = i+1\r\n if con==3:\r\n ans = ans + word[i] \r\n con = 2\r\n \r\n i = i+1\r\n \r\nif t%2==0:\r\n con = 1\r\n i = 0\r\n while i<t:\r\n if con==1:\r\n ans = word[i]+ans\r\n \r\n con = con+1\r\n i = i+1\r\n if con==2:\r\n ans = ans+word[i]\r\n con = 1\r\n \r\n i = i+1\r\nif t==1:\r\n ans = word \r\nprint(ans)\r\n \r\n ", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\n\r\nn = readint()\r\n\r\ns = list(input())\r\n\r\n\r\nans = \"\"\r\n\r\nwhile s:\r\n curr = s.pop()\r\n \r\n mid = (len(ans)//2)\r\n\r\n ans = ans[:mid] + curr + ans[mid:]\r\n\r\nprint(ans) \r\n", "n=int(input())\nencoded_word=str(input())\ndecoded_word=encoded_word[0]\nfor i in range(1,n):\n if n%2>0:\n if i%2>0:\n decoded_word=encoded_word[i]+decoded_word\n else:\n decoded_word=decoded_word+encoded_word[i]\n else:\n if i%2==0:\n decoded_word=encoded_word[i]+decoded_word\n else:\n decoded_word=decoded_word+encoded_word[i] \nprint(decoded_word)\n \n", "x = int(input())\r\ns = input()\r\nl = []\r\n\r\nif x <= 2: print(s)\r\n\r\nelse:\r\n l.append(s[0])\r\n i = 1\r\n if x % 2 != 0:\r\n while i < len(s):\r\n l.insert(0, s[i])\r\n i += 1\r\n if i < len(s):\r\n l.append(s[i])\r\n i += 1\r\n else: break\r\n\r\n else:\r\n while i < len(s):\r\n l.append(s[i])\r\n i += 1\r\n if i < len(s):\r\n l.insert(0, s[i])\r\n i += 1\r\n else: break\r\n\r\n for i in l: print(i, end='')\r\n", "n = int(input())\r\nword = input()\r\nresult = [0] * n\r\nj = 0\r\nwhile j < n:\r\n gap = 0\r\n for i in range(n):\r\n if result[i] == 0:\r\n gap += 1\r\n if gap % 2 == 0:\r\n result[int(gap/2) - 1] = word[j]\r\n j += 1\r\n else:\r\n result[-(gap // 2 + 1)] = word[j]\r\n j += 1\r\nprint(*result, sep='')", "n = int(input())\r\ns = input()\r\nfor i in range(n-2,-1,-2):\r\n print(s[i],end=\"\")\r\nif n%2 == 0:\r\n start = 1\r\nelse:\r\n start = 0\r\nfor i in range(start,n,2):\r\n print(s[i],end=\"\")\r\n", "##Author: bushra04 \r\n##Date: 12/05/2021 \r\n##Time: 21:10:36\r\nn = int(input())\r\ns = input()\r\nres = ''\r\nfor i in s:\r\n if n%2==0: res = i+res\r\n else: res+=i\r\n n-=1\r\nprint(res)\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n", "length_word = int(input())\r\ncrypted_word = input()\r\nfirst_part = \"\"\r\nsecond_part = \"\"\r\nx = 1\r\nwhile x != length_word+1:\r\n\tif x%2==0:\r\n\t\tfirst_part+=f\"{crypted_word[-x]}\"\r\n\telse:\r\n\t\tsecond_part+=f\"{crypted_word[-x]}\"\r\n\tx+=1\r\nprint(first_part+second_part[::-1])", "def f():\r\n n=int(input())\r\n s=input()\r\n res=[s[0]]\r\n l=1\r\n r=n-1\r\n while l<=r:\r\n if (r-l+1)%2==0:\r\n res.insert(0,s[l])\r\n l=l+1\r\n else:\r\n res.insert(len(res),s[l])\r\n\r\n l=l+1\r\n print(\"\".join(res))\r\n\r\nf()\r\n", "_ = input()\nst = input()\nout = ''\nfor i in range(len(st)):\n if i % 2 != len(st) % 2:\n out += st[i]\n else:\n out = st[i] + out\nprint(out)\n\n\t\t \t \t\t \t\t \t \t\t\t \t \t \t", "n=int(input())\r\ns=input()\r\nr=''\r\nif(n%2==1):\r\n r=s[::2]\r\n a=s[1::2]\r\n r=a[::-1]+r\r\n print(r)\r\nelse:\r\n r=s[::2]\r\n r=r[::-1]\r\n r+=s[1::2]\r\n print(r)", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(S):\r\n S = list(S)\r\n n = len(S)\r\n answer = []\r\n for i in range(n-1, -1, -1):\r\n c = S[i]\r\n j = len(answer)//2\r\n answer = answer[:j]+[None]+answer[j:]\r\n answer[j] = c\r\n answer = ''.join(answer)\r\n sys.stdout.write(f'{answer}\\n')\r\n \r\nn = int(input())\r\nS = input().decode().strip()\r\nprocess(S)", "import sys\r\nfrom collections import deque\r\n\r\n\r\ndef main():\r\n n = int(sys.stdin.readline().strip())\r\n s = sys.stdin.readline().strip()\r\n deq = deque([x for x in s])\r\n flag = False\r\n start = True\r\n ans = deque()\r\n while len(ans)!=n:\r\n if start:\r\n temp = deq.popleft()\r\n ans.append(temp)\r\n start = False\r\n flag = True\r\n else:\r\n if n%2!=0:\r\n if flag:\r\n temp = deq.popleft()\r\n ans.appendleft(temp)\r\n flag = False\r\n else:\r\n temp = deq.popleft()\r\n ans.append(temp)\r\n flag = True\r\n else:\r\n if not flag:\r\n temp = deq.popleft()\r\n ans.appendleft(temp)\r\n flag = True\r\n else:\r\n temp = deq.popleft()\r\n ans.append(temp)\r\n flag = False\r\n\r\n\r\n sys.stdout.write(str(''.join(ans)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\ns = input()\r\nst = \"\"\r\nif n%2==0:\r\n\tfor i in range(0,n,2):\r\n\t\tst = s[i] + st\r\n\t\tst = st + s[i+1]\r\nelse:\r\n\tst+=s[0]\r\n\tfor i in range(1,n,2):\r\n\t\tst = s[i] + st\r\n\t\tst = st + s[i+1]\r\nprint(st)", "n = int(input())\r\ns = list(input())\r\nf =[]\r\na =[]\r\ns.reverse()\r\nfinal = \"\"\r\nif n % 2 == 0:\r\n for i in range(1, n, 2):\r\n f.append(s[i])\r\n \r\n for j in range(0, n, 2):\r\n a.append(s[j])\r\n a.reverse()\r\n for m in f:\r\n final += m\r\n for n in a:\r\n final += n\r\n \r\nelse:\r\n for i in range(1,n,2):\r\n f.append(s[i])\r\n f.append(s[n-1])\r\n for j in range(0,n-1,2):\r\n a.append(s[j])\r\n a.reverse()\r\n for m in f:\r\n final += m\r\n for n in a:\r\n final += n\r\nprint(final)\r\n \r\n# logva\r\n# 01234\r\n\r\n# avgol\r\n# 01234\r\n\r\n# volga\r\n# 31024\r\n\r\n# no\r\n# 01\r\n# no\r\n# 01", "n=int(input())\r\nx,r,s=input(),\"\",0\r\nfor i in x:\r\n if n%2==0:\r\n r=x[s]+r\r\n else:\r\n r+=x[s]\r\n s+=1\r\n n-=1\r\nprint(r)\r\n", "from collections import deque\r\nn, word = int(input()), input()\r\nd, aLeft = deque(), n%2 == 0\r\nfor c in word:\r\n if aLeft:\r\n d.appendleft(c)\r\n aLeft = False\r\n else:\r\n d.append(c)\r\n aLeft = True\r\nprint(\"\".join(d))", "if __name__ == \"__main__\":\r\n n = int(input())\r\n encoded = list(input())\r\n word = []\r\n\r\n if n % 2 != 0:\r\n word.insert(0, encoded[0])\r\n for i in range(1, n):\r\n if i % 2 == 0:\r\n word.append(encoded[i])\r\n else:\r\n word.insert(0, encoded[i])\r\n\r\n else:\r\n word.append(encoded[0])\r\n word.append(encoded[1])\r\n for i in range(2, n):\r\n if i % 2 == 0:\r\n word.insert(0, encoded[i])\r\n else:\r\n word.append(encoded[i])\r\n\r\n print(''.join(word))\r\n", "\r\ndef main_function():\r\n input()\r\n coded = input()\r\n start = \"\"\r\n end = \"\"\r\n end_start = -1\r\n for i in range(len(coded)):\r\n if end_start % 2:\r\n end = coded[end_start] + end\r\n else:\r\n start += coded[end_start]\r\n end_start -= 1\r\n return start + end\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n\r\n\r\n\r\n", "from collections import deque\r\n\r\nn = int(input())\r\nqueue = deque([])\r\ndirect = 0 + (n%2)\r\n\r\nfor c in input():\r\n if direct == 0:\r\n queue.appendleft(c)\r\n else:\r\n queue.append(c)\r\n direct = 1 - direct\r\n\r\nprint(''.join(queue))", "n = int(input())\r\nx = [\"0\"]*n\r\ns = input()\r\nmid=((n-1)//2)\r\nleft,right = mid,[mid,mid+1][n%2==0]\r\nx[left] = s[0]\r\nleft-=1\r\nif n%2==0:x[right]=s[1]\r\nright+=1\r\ndata = [left,right]\r\nturn = 0\r\nfor i in s[[1,2][n%2==0]:]:\r\n x[data[turn]]=i\r\n data[turn] = [data[turn]-1,data[turn]+1][turn]\r\n turn =turn==0\r\nprint(\"\".join(x))", "n=int(input())\r\ns=input()\r\nif n==1: print(s)\r\nelse:\r\n str=s[-2]+s[-1]\r\n s=s[:-2]\r\n len=2\r\n while len<n:\r\n str=str[:(len//2)]+s[-1]+str[(len//2):]\r\n s=s[:-1]\r\n len+=1\r\n print(str)\r\n", "n = int(input())\ns = input()\nres = []\nwhile n != 0:\n if (n % 2 == 1):\n res.append(s[0])\n else:\n res = list(s[0]) + res\n s = s[1:]\n n -= 1\n\nprint(''.join(res))\n\n", "n = int(input())\r\nstring = input()\r\nif n % 2 == 0:\r\n original_string = []\r\n for i, ch in enumerate(string):\r\n if i == 0:\r\n original_string.append(ch)\r\n elif i % 2 != 0:\r\n original_string.append(ch)\r\n else:\r\n original_string.insert(0, ch)\r\n \r\n print(\"\".join(original_string))\r\nelse:\r\n original_string = []\r\n for i, ch in enumerate(string):\r\n \r\n if i % 2 != 0:\r\n original_string.insert(0, ch)\r\n else:\r\n original_string.append(ch)\r\n \r\n print(\"\".join(original_string))", "n=int(input())\r\ns=input()\r\nx=\"\"\r\ny=\"\"\r\nif(n%2==0):\r\n a=s[::-1]\r\n x=a[1::2]\r\n y=s[1::2]\r\n print(x+y)\r\nelse:\r\n a=s[::-1]\r\n x=a[1::2]\r\n y=s[0::2]\r\n print(x+y)\r\n", "n = int(input())\r\ns = input()\r\nans = ''\r\nfor i in s:\r\n if n%2 == 0:\r\n ans = i + ans\r\n else:\r\n ans += i\r\n n -= 1\r\nprint(ans)", "length = int(input())\r\nword = [word for word in input()]\r\n\r\nword = word[::-1]\r\ndecoded = []\r\n\r\nfor i in range(length):\r\n median = int(len(decoded)//2)\r\n decoded.insert( median, word[i] )\r\n\r\nstring= \"\"\r\nfor i in decoded:\r\n string += i \r\n\r\nprint(string)", "from collections import deque\r\nn = int(input())\r\ns = input()\r\nres = deque()\r\nflag = 0\r\nif n%2 != 0:\r\n for c in s:\r\n if flag == 0:\r\n res.append(c)\r\n flag = 1\r\n else:\r\n res.appendleft(c)\r\n flag = 0\r\n print(\"\".join(res))\r\nelse:\r\n for c in s:\r\n if flag == 0:\r\n res.appendleft(c)\r\n flag = 1\r\n else:\r\n res.append(c)\r\n flag = 0\r\n print(\"\".join(res))\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\narr = ['']*(n)\r\n\r\ni = 0\r\nif n%2:\r\n jump = 1\r\n arr[n//2] = s[i]\r\n md = n//2\r\n i+=1\r\n while i<n:\r\n \r\n arr[md-jump] = s[i]\r\n i += 1\r\n arr[md+jump] = s[i]\r\n i += 1\r\n jump += 1\r\nelse:\r\n arr.append('')\r\n jump = 1\r\n md = (n+1)//2\r\n while i<n:\r\n \r\n arr[md-jump] = s[i]\r\n i += 1\r\n arr[md+jump] = s[i]\r\n i += 1\r\n jump += 1\r\nprint(''.join(arr))\r\n", "input()\ns = input()\n\nleft, right = [], []\n\nfor i in range(len(s) - 1, -1, -1):\n c = s[i]\n if len(left) == len(right):\n right.append(c)\n else:\n left.append(c)\n\nprint(''.join(left) + ''.join(reversed(right)))\n", "import collections\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(input().rstrip())\r\n\r\nf = collections.deque()\r\ns = collections.deque()\r\n\r\nchk = True\r\nfor i in range(n - 1, -1, -1):\r\n if chk:\r\n s.appendleft(data[i])\r\n else:\r\n f.append(data[i])\r\n\r\n chk = not chk\r\n\r\nprint(''.join(f + s))\r\n", "n = int(input())\nv = list(input())\na = ['a'] * len(v)\nm = n // 2\nf = n % 2\nif f == 1:\n a[m] = v[0]\nfor i, x in enumerate(zip(v[f::2], v[f + 1::2]), f):\n a[m - (1 - f) - i] = x[0]\n a[m + i] = x[1]\nprint(*a, sep=\"\")\n", "n = int(input())\r\na = input()\r\na = a[::-1]\r\nans = a[0]\r\nfor i in range(1, n):\r\n ans = ans[:len(ans) // 2] + a[i] + ans[len(ans) // 2:]\r\nprint(ans)\r\n", "a = int(input())\r\nb = input()\r\nc = str()\r\nif a % 2 != 0:\r\n f = True\r\n for i in b:\r\n if f:\r\n c += i\r\n else:\r\n c = i + c\r\n f = not f\r\nelse:\r\n f = True\r\n for i in b:\r\n if f:\r\n c = i + c\r\n else:\r\n c += i\r\n f = not f\r\nprint(c)", "n = int(input())\r\nword = input()\r\n# 1 l 0 r\r\nstep = n % 2\r\n\r\nright_word = word[0]\r\nword = word[1:]\r\n\r\nfor el in word:\r\n if step:\r\n right_word = el + right_word\r\n step = 0\r\n else:\r\n right_word = right_word + el\r\n step = 1\r\n\r\nprint(right_word)\r\n", "n = int(input())\r\nstring = input()\r\nresult = [None] * n\r\nmedian = (n - 1) // 2\r\nresult[median] = string[0]\r\nl = median - 1\r\nr = median + 1\r\nl_inc = -1\r\nr_inc = +1\r\n\r\nif n%2==0:\r\n l,r = r,l\r\n l_inc,r_inc = r_inc,l_inc\r\nfor i in range(1, n):\r\n if 0 <= l < n and result[l] is None:\r\n result[l] = string[i]\r\n elif 0 <= r < n and result[r] is None:\r\n result[r] = string[i]\r\n l += l_inc\r\n r += r_inc\r\nprint(\"\".join(result))\r\n", "n = int(input())\r\ns = input()\r\nch = \"\"\r\n \r\nif(n%2==0):\r\n for i in range(n):\r\n if(i%2==0):\r\n ch = s[i] + ch\r\n else:\r\n ch = ch + s[i]\r\nelse:\r\n for i in range(n):\r\n if(i%2 == 0):\r\n ch += s[i]\r\n else:\r\n ch = s[i] + ch\r\n \r\nprint(ch)\r\n\r\n", "n = int(input())\r\ns = input()\r\nr = [\".\"]*n\r\nk = n//2\r\nj = 0\r\nif n%2 == 0:\r\n for l in range(1,n,2):\r\n r[k-(j+1)] = s[l]\r\n r[k+j] = s[l-1]\r\n j+=1\r\n r = r[::-1]\r\nelif n%2!= 0:\r\n j = 0\r\n for l in range(1, n, 2):\r\n r[k+j] = s[l-1]\r\n r[k-(j+1)] = s[l]\r\n j+=1\r\n r[-1] = s[-1]\r\nprint(\"\".join(r))", "n=int(input())\r\nl=list(input())\r\nl1=[]\r\nif(n%2==0):\r\n for i in range(n):\r\n if(i%2==0):\r\n l1.insert(0,l[i])\r\n else:\r\n l1.append(l[i])\r\nelse:\r\n for i in range(n):\r\n if(i%2==0):\r\n l1.append(l[i])\r\n else:\r\n l1.insert(0,l[i])\r\nprint(''.join(l1))\r\n ", "n = int(input())\r\nstring = input()\r\nif n <= 2:\r\n print(string)\r\n exit()\r\nstr = \"\"\r\nfor i in range(len(string)-2, 0 , -2):\r\n str += string[i]\r\nstr += string[0]\r\nif len(string) % 2 != 0:\r\n for i in range(2 , len(string) , 2):\r\n str += string[i]\r\nelse:\r\n for i in range(1 , len(string) , 2):\r\n str += string[i]\r\nprint(str)", "n = int(input())\r\ns = input()\r\n\r\ndef decoder(s):\r\n r, l = [], []\r\n \r\n is_r = True\r\n s = reversed(s)\r\n for i in s:\r\n if is_r:\r\n r.append(i)\r\n is_r = not is_r\r\n else:\r\n l.append(i)\r\n is_r = not is_r\r\n r.reverse()\r\n\r\n res = l + r\r\n\r\n return \"\".join(res)\r\n\r\nprint(decoder(s))", "n=int(input())\r\ns=input()\r\ns1=s2=a=\"\"\r\nif n%2!=0:\r\n\ta=s[0]\r\n\ts=s[1:]\r\n\tn-=1\r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\ts1+=s[i]\r\n\telse:\r\n\t\ts2+=s[i]\r\nprint(s1[::-1]+a+s2)", "n=int(input())\r\ns=input()\r\n\r\nfor i in range(n-2,-1,-2):\r\n print(s[i],end='')\r\nif n%2==0:\r\n i=1\r\nelse:\r\n i=0\r\nwhile i<n:\r\n print(s[i], end='')\r\n i+=2\r\n", "n=int(input())\r\ns=input()\r\nx=\"\"\r\nfor i in range(n):\r\n if i%2==0:\r\n x=x+s[i]\r\n else:\r\n x=s[i]+x\r\nif n%2==0:\r\n print(x[::-1])\r\nelse:\r\n print(x)", "n=int(input())\r\ns=input()\r\nout=\"\"\r\nf=n%2\r\nif f==0:\r\n for i in range(n):\r\n if i%2==0:\r\n out=s[i]+out\r\n else:\r\n out=out+s[i]\r\nelse:\r\n for i in range(n):\r\n if i%2==0:\r\n out=out+s[i] \r\n else:\r\n out=s[i]+out\r\nprint(out)", "# 746B - Decoding\r\nn, s = int(input()), input()\r\na = [0]*n\r\nif n % 2 == 1:\r\n a[n//2] = s[0]\r\n for i in range(n//2):\r\n a[(n//2)-i-1] = s[(2*i)+1]\r\n a[(n//2)+i+1] = s[(2*i)+2]\r\nelse:\r\n for i in range(n//2):\r\n a[(n//2)-i-1] = s[2*i]\r\n a[(n//2)+i] = s[(2*i)+1]\r\nprint(*a, sep=\"\")\r\n", "n = int(input())\r\nencoded_string = input()\r\ndecoded_string = []\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n decoded_string.insert(0, encoded_string[i])\r\n else:\r\n decoded_string.append(encoded_string[i])\r\n\r\nif n%2 == 0:\r\n print((\"\".join(decoded_string)))\r\nelse:\r\n print((\"\".join(decoded_string))[::-1])", "n = int(input())\r\ns = input()\r\n\r\nif n == 1 or n == 2:\r\n print(s)\r\nelse:\r\n ans = s[0]\r\n if n%2==1:\r\n for i in range(1,len(s)):\r\n if i%2==1:\r\n ans = s[i] + ans\r\n else:\r\n ans += s[i]\r\n else:\r\n for i in range(1,len(s)):\r\n if i%2==1:\r\n ans += s[i]\r\n else:\r\n ans = s[i] + 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\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nans = [\"0\"]*n\r\nd = n//2\r\nif n%2:\r\n ans[d] = s[0]\r\n a = d-1\r\n b = d+1\r\n for i in range(1, n):\r\n if i % 2:\r\n ans[a] = s[i]\r\n a -= 1\r\n else:\r\n ans[b] = s[i]\r\n b += 1\r\nelse:\r\n a = d-1\r\n b = d\r\n for i in range(n):\r\n if i % 2 == 0:\r\n ans[a] = s[i]\r\n a -= 1\r\n else:\r\n ans[b] = s[i]\r\n b += 1\r\n\r\nprint(\"\".join(ans))\r\n", "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, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\n_=iinput()\r\ns=input()\r\nanswer=\"\"\r\nfor i in range(len(s)):\r\n if i%2:\r\n answer=s[i]+answer\r\n else:\r\n answer+=s[i]\r\nif len(s)%2:\r\n print(answer)\r\nelse:\r\n print(''.join(reversed(answer)))\r\n", "from collections import deque\r\nn = int(input())\r\ns = list(input())\r\narr = deque()\r\nif n%2 == 0:\r\n flag = True\r\n for ele in s:\r\n if flag == True:\r\n arr.appendleft(ele)\r\n flag = False\r\n else:\r\n arr.append(ele)\r\n flag = True\r\nelse:\r\n flag = True\r\n for ele in s:\r\n if flag == True:\r\n arr.append(ele)\r\n flag = False\r\n else:\r\n arr.appendleft(ele)\r\n flag = True\r\nprint(\"\".join(arr))\r\n", "\"\"\"\r\n1234567\r\n= 4\r\n123567\r\n= 43\r\n12567\r\n= 435\r\n1267\r\n= 4352\r\n167\r\n= 43526\r\n17\r\n= 435261\r\n= 4352617\r\n\r\n123456\r\n= 3\r\n12456\r\n= 34\r\n1256\r\n= 342\r\n156\r\n= 3425\r\n16\r\n= 34251\r\n= 342516\r\n\"\"\"\r\na = int(input())\r\nn = input()\r\nre = []\r\nfor i in range(0, len(n), 2):\r\n re.append(n[i])\r\nx = []\r\nfor i in range(1, len(n), 2):\r\n x.append(n[i])\r\nif a % 2:\r\n x = x[::-1]\r\n x += re\r\nelse:\r\n re = re[::-1]\r\n x = re + x\r\nprint(''.join(x))", "n=int(input())\r\ns=input();i=1\r\nif n%2:i=0\r\nprint(s[-2::-2]+s[i::2])", "n = int(input())\r\ns = input()\r\nleft = []\r\nright = []\r\neven = n % 2 == 0\r\nif even:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n left.append(s[i])\r\n else:\r\n right.append(s[i])\r\n ans = []\r\n for i in range(len(left) - 1, -1, -1):\r\n ans.append(left[i])\r\n for i in range(len(right)):\r\n ans.append(right[i])\r\n print(''.join(ans))\r\nelse:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n right.append(s[i])\r\n else:\r\n left.append(s[i])\r\n ans = []\r\n for i in range(len(left) - 1, -1, -1):\r\n ans.append(left[i])\r\n for i in range(len(right)):\r\n ans.append(right[i])\r\n print(''.join(ans))", "\"\"\"\r\nabcd \r\n\r\nbcad\r\n\r\nabcd \r\n\"\"\"\r\n\r\nn = int(input()) \r\ns = input() \r\nans = [' '] * n \r\nif len(s) % 2 == 0:\r\n l = (n - 1) // 2 \r\n r = (n) // 2 \r\n i = 0\r\n j = 1 \r\n ans[l] = s[i] \r\n ans[r] = s[j] \r\n while j + 2 < n:\r\n j += 2\r\n i += 2 \r\n l -= 1 \r\n r += 1 \r\n ans[l] = s[i] \r\n ans[r] = s[j]\r\nelse: \r\n m = n // 2 \r\n ans[m] = s[0] \r\n l = m - 1 \r\n r = m + 1\r\n i = 1 \r\n j = 2 \r\n while i + 1 < n:\r\n ans[l] = s[i] \r\n ans[r] = s[j] \r\n l -= 1 \r\n r += 1 \r\n i += 2 \r\n j += 2 \r\n\r\nprint(\"\".join(ans))", "n = int(input())\r\ns = list(input())\r\n\r\nans = ''\r\nans += s[0]\r\ns = s[1 : ]\r\n\r\nfor i in s :\r\n if len(s) % 2 == 0 :\r\n ans = i + ans\r\n s = s[1 : ]\r\n else:\r\n ans += i\r\n s = s[1 :]\r\n\r\nprint(ans)\r\n", "\r\nlength = int(input())\r\nencode = input()\r\nst = [] \r\n\r\nif(length%2==0):\r\n flag=0\r\nelse:\r\n flag=1\r\n\r\n\r\nfor each in encode:\r\n if(flag==0):\r\n flag =1 \r\n st.insert(0,each)\r\n else:\r\n flag =0\r\n st.append(each)\r\nfor each in st:\r\n print(each,end=\"\")\r\n", "n = int(input())\r\nencode = input()\r\nout = [''] * n\r\nleft, right = False, False\r\nif n%2:\r\n left = True\r\n mid = n // 2\r\nelse:\r\n right = True\r\n mid = (n // 2) - 1\r\n\r\nL = mid - 1\r\nR = mid + 1\r\nout[mid] = encode[0]\r\nfor i in range(1, n):\r\n if left:\r\n out[L] = encode[i]\r\n L -= 1\r\n elif right:\r\n out[R] = encode[i]\r\n R += 1\r\n left = not left\r\n right = not right\r\nprint(''.join(out))", "n=int(input())\r\ns1=input()[:n]\r\ni=n-2\r\nj=1\r\nk=2\r\nif(n%2==0):\r\n while(i>=0):\r\n print(s1[i],end=\"\")\r\n i=i-2\r\n while(j<n):\r\n print(s1[j],end=\"\")\r\n j=j+2\r\nelse:\r\n while(i>=0):\r\n print(s1[i],end=\"\")\r\n i=i-2\r\n print(s1[0],end=\"\")\r\n while(k<n):\r\n print(s1[k],end=\"\")\r\n k=k+2", "n=int(input())\r\ns=input()\r\nns=s[0]\r\ns=s[1:]\r\nif n%2==0:\r\n for i in range(0,n-2,2):\r\n ns=ns+s[i]\r\n ns=s[i+1]+ns\r\n ns=ns+s[-1]\r\nelse:\r\n for i in range(0,n-1,2):\r\n ns=s[i]+ns\r\n ns=ns+s[i+1]\r\nprint(ns)", "from collections import deque\r\nn = int(input())\r\ns = str(input())\r\n\r\nq = deque()\r\n\r\ncnt = 0\r\nfor i in range(len(s)):\r\n if i == 0 and len(s) % 2 != 0:\r\n q.appendleft(s[i])\r\n else:\r\n if cnt % 2 == 0:\r\n q.appendleft(s[i])\r\n else:\r\n q.append(s[i])\r\n cnt += 1\r\n\r\nprint(\"\".join(q))", "i=input;i();a=i();print(a[-2::-2]+a[-1::-2][::-1])", "n=int(input())\r\nr=input()\r\ny=r[0]\r\nfor i in range(1,n):\r\n if n%2==0:\r\n if i%2==0:\r\n y=r[i]+y\r\n else:\r\n y=y+r[i]\r\n else:\r\n if i%2==1:\r\n y=r[i]+y\r\n else:\r\n y=y+r[i]\r\nprint(y)", "n = int(input())\nciphertext = input()\nplaintext = [None] * n\nend = True\ni = 0\nfor c in reversed(ciphertext):\n if end:\n plaintext[~i] = c\n else:\n plaintext[i] = c\n i += 1\n end = not end\nprint(\"\".join(plaintext))\n", "n = int(input())\r\nw = input()\r\nif n <=2:\r\n print(w)\r\nelif n%2 == 0:\r\n print(w[-2::-2]+w[1::2])\r\nelse:\r\n print(w[-2::-2]+w[0::2])", "n = int(input())\r\ns = input()\r\nans = ''\r\npo = 0\r\nfor i in range(n):\r\n if i% 2 == 0:\r\n ans += s[i]\r\n else:\r\n ans = s[i] + ans\r\n \r\nif n%2 == 0:\r\n print(ans[::-1])\r\nelse:\r\n print(ans)", "input()\ns = input().encode('ascii')\nbuf = bytearray(len(s))\n\nfor i, c in enumerate(reversed(s)):\n if i % 2 == 0:\n buf[-i // 2 - 1] = c\n else:\n buf[i // 2] = c\n\nprint(buf.decode('ascii'))\n", "n = int(input())\ns = list(input())[::-1]\nout = []\n\nfor i in range(n):\n ind = int((i+1)/2)\n\n out = out[:ind] + [s[i]] + out[ind:]\n\n\nprint(\"\".join(out[::-1]))\n \n", "n = int(input())\r\ns = input()\r\nleft = \"\"\r\nright = \"\"\r\nchange = 0\r\nfor i in range(1,n+1):\r\n if change==0:\r\n right = s[(-1)*i] + right\r\n change=1\r\n else:\r\n left = left+s[(-1)*i]\r\n change=0\r\nprint(left+right)\r\n ", "n = int(input())\r\ns = input()\r\ns1 = s[-2::-2]\r\ns2 = s[-1::-2][::-1]\r\n\r\nprint(s1 + s2)", "n = int(input())\r\ns = input()\r\n\r\ns1 = s[::-1]\r\nx = s1[1::2]\r\ny = s1[::2]\r\ny = y[::-1]\r\nprint(x+y)", "import sys\n\nn = int(input())\n\ns = input()\n\nres = [0] * n\n\nif n % 2 == 1:\n mid = n // 2\n right = True\n left_i = 1\n right_i = 0\nelse:\n mid = n // 2 - 1\n right = False\n left_i = 0\n right_i = 1\nfor ch in s:\n if right:\n cur = mid + right_i\n right_i += 1\n right = not right\n res[cur] = ch\n else:\n cur = mid - left_i\n left_i += 1\n right = not right\n res[cur] = ch\n\nprint(''.join(res))\n", "n = int(input())\ns = input()\nss = \"\"\ni = n-2\nwhile i >= 0:\n ss += s[i]\n i -= 2\ni = 1 if n % 2 == 0 else 0\nwhile i < n:\n ss += s[i]\n i += 2\nprint(ss)", "n = int(input())\ns = input()\nd = []\n\nif n % 2 == 1:\n d.append(s[0])\n s = s[1:]\n\nfor i in range(len(s)//2):\n d.append(s[i*2+1])\n d.insert(0, s[i*2])\n\nprint(''.join(d))\n\n", "number = int(input())\r\nword = input()\r\nright = []\r\nleft = []\r\nif len(word) %2 == 0 :\r\n for i in range (0 , len(word)):\r\n if i%2 == 0:\r\n right.append(word[i])\r\n else :\r\n left.append(word[i])\r\n right.reverse()\r\nelse:\r\n for i in range (0 , len(word)):\r\n if i%2 == 0:\r\n left.append(word[i])\r\n else :\r\n right.append(word[i])\r\n right.reverse()\r\nboth = right + left\r\nfor i in both :\r\n print(i ,end='')", "import math\r\n\r\n# n, m ,k = map(int, input().rstrip().split())\r\n# l = list(map(int, input().split(\"+\")))\r\n# n=int(input())\r\n# l = list(map(int, input().rstrip().split()))\r\n# n, k = map(int, input().rstrip().split())\r\n# l = list(map(int, input().split()))\r\n# A Better (than Naive) Solution to find all divisiors\r\n# for _ in range(int(input())):\r\n#\r\n# n = int(input())\r\n# s = list(input())\r\n\r\nn=int(input())\r\nl=list(input())\r\nans=[]\r\nll=n\r\nmi=0\r\ne=0\r\nif ll%2==0:\r\n mi=ll//2-1\r\n e=1\r\nelse:\r\n mi=ll//2\r\nj=0\r\ncount=1\r\nans=l[0]\r\nwhile(count<n):\r\n if e==0:\r\n if j==0:\r\n ans=l[count]+ans\r\n j=1\r\n else:\r\n ans+=l[count]\r\n j=0\r\n else:\r\n if j == 1:\r\n ans = l[count] + ans\r\n j=0\r\n else:\r\n ans += l[count]\r\n j=1\r\n count+=1\r\nprint(ans)\r\n", "def solve(n,s):\r\n res=[]\r\n for i in range(len(s)):\r\n # print(res)\r\n if i%2==n%2:\r\n res=[s[i]]+res\r\n else:\r\n res=res+[s[i]]\r\n # print(res)\r\n # print(\"vsdvs\")\r\n print(\"\".join(res))\r\n# n,m,c=map(str,input().split())\r\n# a=[]\r\n\r\nn=int(input())\r\n# m=int(input())\r\ns=input()\r\n# s1=input()\r\n\r\n# a=list(map(int,input().split()))\r\n# a=[]\r\n# for i in range(int(n)):\r\n# # print(i)\r\n# a.append(input())\r\n\r\nsolve(n,s)", "n = int(input())\r\ntext = input()\r\nres = ''\r\nif n%2 == 1:\r\n for i in range(n):\r\n if i%2:\r\n res = text[i]+res\r\n \r\n else:\r\n res = res+ text[i]\r\n \r\n print(res)\r\nelse:\r\n for i in range(n):\r\n if i%2==0:\r\n res = text[i]+res\r\n \r\n else:\r\n res = res+ text[i]\r\n \r\n print(res)", "l=int(input())\r\ns=input()\r\ni=0\r\nans=\"\"\r\nwhile(l>0):\r\n ch=s[i]\r\n i+=1\r\n if l%2==1:\r\n ans+=ch\r\n else:\r\n ans=ch+ans\r\n l-=1\r\nprint(ans)", "n = int(input())\nenc = input()\n\nresult = \"\"\nstart = 0\nfor i in range(n-2, -1,-2):\n result += enc[i]\n start = (i+1)%2\nfor i in range(start,n,2):\n result += enc[i]\nprint(result)", "p=int(input())\r\ns=input()\r\nq=\"\"\r\nq=q+s[0]\r\np=p-1\r\ni=1\r\nwhile p!=0:\r\n if p%2==0:\r\n q=s[i]+q\r\n else:\r\n q=q+s[i]\r\n i=i+1\r\n p=p-1\r\nprint(q)", "n = int(input())\r\ns = list(input())\r\na = \"\"\r\nwhile(len(s) > 0):\r\n if len(s) % 2 == 0:\r\n a = s.pop(0) + a\r\n else:\r\n a = a + s.pop(0)\r\nprint(a)", "n = int(input())\r\ns = input()\r\ncount = 0\r\nmed = int( (n - 1 )/2 )\r\nnew_str = [0]*n\r\nfor i in range(n):\r\n\ttemp = i+1\r\n\tif n%2 == 0:\r\n\t\tnew_str[med - count] = s[i] \r\n\telse:\r\n\t\tnew_str[med + count] = s[i]\r\n\tif count>=0:\r\n\t\tcount -= temp\r\n\telse:\r\n\t\tcount += temp\r\n\r\nprint(''.join(new_str))", "n=int(input())\r\nst=input()\r\nr=\"\"\r\nfor i in range(n-2,-1,-2):\r\n r+=st[i]\r\nif n%2==1:\r\n for i in range(0,n,2):\r\n r+=st[i]\r\nelse:\r\n for i in range(1,n,2):\r\n r+=st[i]\r\nprint(r)", "n = int(input())\r\ns = input()\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n\tl.insert(int(len(l) / 2), s[n - 1 - i])\r\n\t\t\r\nprint(''.join(l))\t", "n = int(input())\r\na = input()\r\n\r\nb = len(a)\r\n\r\nif b % 2 == 0:\r\n d = \"\"\r\n for i in range(b):\r\n if i % 2 == 0:\r\n d = a[i] + d\r\n else:\r\n d += a[i]\r\n \r\nelse:\r\n d = \"\"\r\n for k in range(b):\r\n if k % 2 != 0:\r\n d = a[k] + d\r\n else:\r\n d += a[k]\r\n \r\nprint(d)", "n = int(input())\r\ns = list(input())\r\na = []\r\nif n%2 == 0: k = 1\r\nelse: k = 0\r\nfor i in range(0,n):\r\n if (i+k) % 2 == 0: a = a + [s[i]]\r\n else: a = [s[i]] + a\r\n\r\nprint(\"\".join(a))", "n = int(input())\ns = input()\na = [s[i] for i in range(n) if i % 2 == 0]\nb = [s[i] for i in range(n) if i % 2 != 0]\nif n % 2 == 0:\n c = (b[::-1] + a)[::-1]\n # print((b[::-1] + a).join(''))\nelse:\n c = (a[::-1] + b)[::-1]\n # print((a[::-1] + b).join(''))\nfor i in c:\n print(i, end='')\nprint()\n#8: AttributeError: 'list' object has no attribute 'join'", "from sys import stdin\r\n\r\ndef get_data(word,n):\r\n final = [\".\" for i in range(n)]\r\n if n%2 == 0:\r\n middle = int(n//2 - 1)\r\n for cont in range(n):\r\n if cont%2==0:\r\n final[middle-(cont//2)] = word[cont]\r\n else:\r\n final[middle + (cont//2) + 1] = word[cont]\r\n else:\r\n middle = int(n//2)\r\n for cont in range(n):\r\n if cont%2==0:\r\n final[middle + (cont//2)] = word[cont]\r\n else:\r\n final[middle - (cont//2 + 1)] = word[cont]\r\n final_word = final[0]\r\n for cont in range(1,n):\r\n final_word += final[cont]\r\n return final_word\r\n\r\n \r\ndef main():\r\n n = int(stdin.readline())\r\n word = stdin.readline()\r\n print(get_data(word,n))\r\n\r\nmain()", "input()\r\n\r\ns = input()\r\n\r\na = \"\"\r\nb = \"\"\r\n\r\nn = 0\r\nif len(s) % 2 == 0:\r\n n = 1\r\nfor i in range(len(s)):\r\n if n == 0:\r\n a += s[i]\r\n n = 1\r\n else:\r\n b += s[i]\r\n n = 0 \r\nprint(b[::-1]+a)", "def solve():\r\n n=int(input());s=input()\r\n if n%2!=0:\r\n ind=n//2;ans=[None]*n;ans[ind]=s[0];i=1;curr=1\r\n while i<=ind:\r\n ans[ind-i]=s[curr];curr+=1;ans[ind+i]=s[curr];curr+=1;i+=1\r\n prt=''\r\n for i in ans:prt+=i\r\n print(prt)\r\n else:\r\n ind=n//2-1;ans=[None]*n;ans[ind]=s[0];i=1;curr=1\r\n while i<=ind:\r\n ans[ind+i]=s[curr];curr+=1;ans[ind-i]=s[curr];curr+=1;i+=1\r\n ans[-1]=s[-1]\r\n prt=''\r\n for i in ans:prt+=i\r\n print(prt)\r\nsolve()\r\n", "\r\nn = int(input())\r\nword = input()\r\n\r\nif n <= 2:\r\n print(word)\r\nelse:\r\n result = word[n-2:]\r\n n -= 3\r\n while n >= 0:\r\n if len(result) % 2 == 0:\r\n x = result[:int(len(result)/2)] + word[n] + result[int(len(result)/2):]\r\n else:\r\n x = result[:int((len(result)-1)/2)] + word[n] + result[int((len(result)-1)/2):]\r\n result = x\r\n\r\n n -= 1\r\n\r\n print(result)\r\n", "n = int(input())\r\ns = input()\r\nresult = ''\r\nfor i in range(n):\r\n if n % 2 == 0:\r\n if i % 2 != 0:\r\n result += s[i]\r\n else:\r\n result = s[i] + result\r\n else:\r\n if i % 2 == 0:\r\n result += s[i]\r\n else:\r\n result = s[i] + result\r\nprint(result)\r\n", "n = int(input())\r\nword = input()\r\nanswer = \"\"\r\n\r\n# попытка 2 - не выебываемся\r\n# пометка для тупых(себя).\r\n# стоило всего лишь написать 2 закономерных примера\r\n# и тупить около часа занимаясь опять шифровкой\r\nfor i in range (n - 2, -1, -2):\r\n answer += word[i]\r\nfor i in range (int(n % 2 == 0), n - 1 + 1, 2):\r\n answer += word[i]\r\n\r\nprint(answer)", "input()\ns=input()\na=''\nwhile s!='':\n\ta=a+s[0] if len(s)&1==1 else s[0]+a\n\ts=s[1:]\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\nch1 = input()\r\nl = [' ']\r\nl = l*n\r\ni = 0\r\nj=0\r\n\r\n\r\n\r\n\r\nif (n % 2 == 1):\r\n init = (n//2)\r\n while (i<len(ch1)):\r\n l[init + j] = ch1[i]\r\n i = i+1\r\n j = j+1\r\n if (j <=init):\r\n l[init - j] =ch1[i]\r\n i=i+1\r\n\r\n\r\nelse:\r\n init = (n // 2) -1\r\n while (i < len(ch1)):\r\n l[init - j] = ch1[i]\r\n i = i + 1\r\n j = j + 1\r\n l[init + j] = ch1[i]\r\n i = i + 1\r\n\r\n\r\nprint(''.join(l))", "n , s = int(input()) , input()\ntext = \"\"\nfor i in range(len(s)):\n if i % 2 != len(s) % 2:\n text += s[i]\n else:\n text = s[i] + text\nprint(text)\n\t\t \t \t\t \t\t \t \t \t\t\t \t\t \t\t", "\r\n# Problem: B. Decoding\r\n# Contest: Codeforces - Codeforces Round #386 (Div. 2)\r\n# URL: https://codeforces.com/contest/746/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\n# from sys import stdin\r\n# def get_ints(): return list(map(int, stdin.readline().strip().split()))\r\ndef inc (source_str, insert_str):\r\n\tn= len(source_str)//2\r\n\treturn source_str[:n]+insert_str+source_str[n:]\r\n\r\nn= int(input())\r\ns = input()\r\nres= \"\"\r\nfor c in s[::-1]:\r\n\tres = inc(res,c) \r\n\r\n\t\r\nprint(res)", "n = int(input())\r\ns = list(input())\r\nl = s.pop(0)\r\nx = len(s)\r\nfor i in range(x):\r\n if (x-i)%2==0:\r\n l = s[i]+l\r\n else:\r\n l = l+s[i]\r\nprint(l)\r\n ", "n=int(input())\r\ns=input()\r\nl=list(s)\r\nnl=[]\r\nnl.append(l[0])\r\nif n%2!=0:\r\n for i in range(1,n):\r\n if i%2!=0:\r\n nl.insert(0,l[i])\r\n else:\r\n nl.append(l[i])\r\nelse:\r\n for i in range(1,n):\r\n if i%2==0:\r\n nl.insert(0,l[i])\r\n else:\r\n nl.append(l[i])\r\nprint(*nl,sep=\"\")", "def decode(s,l):\r\n s1=str(s[0])\r\n s=s[1:]\r\n l=l-1\r\n while l>0:\r\n i=0\r\n if (l%2==0):\r\n s1 = s[i] + s1\r\n s=s[i+1:]\r\n else :\r\n s1 += s[i]\r\n s = s[i+1:]\r\n l=l-1\r\n\r\n print(s1)\r\nn=int(input())\r\nword=str(input())\r\ndecode(word,n)\r\n", "from collections import deque\r\n\r\nn,s = int(input()),list(input().strip())\r\noriginal = deque([])\r\nwhile s:\r\n median = s.pop(0)\r\n if n%2:\r\n original.append(median)\r\n else:\r\n original.appendleft(median)\r\n n -= 1\r\nprint(''.join(original))\r\n \r\n", "def solve(s,n):\n l = [0]*n\n if n == 1:\n return s\n if n%2 == 1:\n l[0] = n//2+1\n l[1] = l[0] - 1\n else:\n l[0] = n//2\n l[1] = l[0] + 1\n if n%2 == 1:\n i = 0\n last = l[0]\n while last < len(s):\n i += 2\n l[i] = l[i-2] + 1\n last = l[i]\n if last == len(s):\n break\n i = 1\n last = l[1]\n while last > 1:\n i += 2\n l[i] = l[i-2] - 1\n last = l[i]\n if last == 1:\n break\n ret =['']*n\n for i in range(len(l)):\n ret[l[i]-1] = s[i]\n return ret\n else:\n i = 0\n last = l[0]\n while last > 1:\n i += 2\n l[i] = l[i-2] - 1\n last = l[i]\n if last == 1:\n break\n i = 1\n last = l[1]\n while last < len(s):\n i += 2\n l[i] = l[i-2] + 1\n last = l[i]\n if last == len(s):\n break\n ret =['']*n\n for i in range(len(l)):\n ret[l[i]-1] = s[i] \n return ret\n\n\nn=int(input())\ns=input()\nprint (''.join(solve(s,n)))", "n=int(input())\r\ns=input()\r\nss=['0']*n\r\nl=r=n//2\r\nif n%2==0:l=r=r-1\r\nss[r]=s[0]\r\nx=n-1\r\nfor i in range(1,n):\r\n if x%2:\r\n r+=1\r\n ss[r]=s[i]\r\n else:\r\n l-=1\r\n ss[l]=s[i]\r\n x-=1\r\nfor c in ss:print(c,end='')", "from math import floor, ceil\n\nn, s = int(input()), input()\nmid = (n - 1) / 2\nres, j = [s[0]] * n, int(n & 1)\nfor i in range(j, ceil(mid) + j):\n res[floor(mid) - i] = s[j]\n res[ceil(mid) + i] = s[j + 1]\n j += 2\nres = \"\".join(res)\nprint(res)\n", "bla= int(input())\r\ns= input()\r\n\r\nnewstring=\"\"\r\nif(bla%2!=0):\r\n for i in range(bla):\r\n \r\n if(i%2!=0):\r\n newstring = s[i] + newstring\r\n \r\n else:\r\n newstring = newstring + s[i]\r\n \r\nelse:\r\n for i in range(bla):\r\n \r\n if(i%2==0):\r\n newstring = s[i] + newstring\r\n \r\n else:\r\n newstring = newstring + s[i]\r\n\r\n \r\n\r\nprint(newstring)", "import sys\nfrom collections import deque\ninput = sys.stdin.readline\n\nL = int(input())\nA = list(input().rstrip())[::-1]\n\nq = deque()\nq.append(A.pop())\naa = (len(A)%2==0)\nwhile A :\n if aa : q.append(A.pop())\n else : q.appendleft(A.pop())\n aa = not aa\nprint(\"\".join(q)[::-1])\n", "n=int(input())\r\na=input()[::-1]\r\na1=a[0]\r\na=a[1:]\r\nfor i in a:\r\n if len(a1)<2:\r\n a1=a[0]+a1\r\n a=a[1:]\r\n else:\r\n a1=a1[:len(a1)//2]+a[0]+a1[len(a1)//2:]\r\n a=a[1:]\r\nprint(a1)", "length=input()\r\ns1=input()\r\ns2=\"\"\r\ni=1\r\ns2=s2+s1[0]\r\n\r\nwhile(i<len(s1)):\r\n if(i%2==0):\r\n s2=s2+s1[i]\r\n \r\n if(i%2==1):\r\n s2=s1[i]+s2 \r\n \r\n i=i+1 \r\nif(len(s1)%2==0):\r\n s2=s2[::-1]\r\n\r\nprint(s2)\r\n \r\n", "n=int(input())\r\ns=input()\r\nprint(s[-2::-2]+s[-1::-2][::-1])", "n = int(input())\r\ns = input()\r\nans = [0]*n\r\nif n&1:\r\n ans[n//2] = s[0]\r\n left = []\r\n right = [] \r\n for i in range(1, n):\r\n if i&1:\r\n left.append(s[i])\r\n else:\r\n right.append(s[i])\r\n\r\n for i in range(n//2 + 1, n):\r\n ans[i] = right[i-(n//2)-1]\r\n left.reverse()\r\n for i in range(n//2):\r\n ans[i] = left[i]\r\nelse:\r\n left = []\r\n right = [] \r\n for i in range(n):\r\n if i&1:\r\n right.append(s[i])\r\n else:\r\n left.append(s[i])\r\n left.reverse() \r\n for i in range(n//2):\r\n ans[i] = left[i]\r\n for i in range(n//2, n):\r\n ans[i] = right[i-(n//2)]\r\n \r\nprint(\"\".join(ans))", "n = int(input())\r\nword = input()\r\noutput = ''\r\n\r\nif n <= 2:\r\n print (word)\r\nelse:\r\n for i in range(1, 1+n//2, 1):\r\n output += word[-2*i]\r\n if n % 2 == 0:\r\n for j in range(1, n, 1):\r\n if j % 2 == 1:\r\n output += word[j]\r\n else:\r\n for j in range(n):\r\n if j % 2 == 0:\r\n output += word[j]\r\n print (output)", "if __name__ == \"__main__\":\r\n n = int(input())\r\n s = list(input())\r\n word=''\r\n if n % 2 != 0:\r\n for i in range(n):\r\n if i % 2 != 0:\r\n word = s[i] + word\r\n else:\r\n word += s[i]\r\n else:\r\n for i in range(n):\r\n if i % 2 == 0:\r\n word = s[i] + word\r\n else:\r\n word += s[i]\r\n print(word)\r\n", "n = int(input())\r\nlst = input()\r\nif len(lst)%2 == 0:\r\n x = lst[0]+lst[1]\r\n j = 2\r\n while j<len(lst):\r\n x=lst[j]+x+lst[j+1]\r\n j+=2\r\nelse:\r\n j=1\r\n x =lst[0]\r\n while j<len(lst):\r\n x=lst[j]+x+lst[j+1]\r\n j+=2\r\nprint(x)", "\"\"\"\r\n5\r\nlogva\r\nvolga\r\na\r\nva\r\nvga\r\nvlga\r\n\r\n\"\"\"\r\nn= int(input())\r\ns = input()\r\nif n <= 2:print(s)\r\nelse :\r\n x = []\r\n s = list(s)\r\n while n:\r\n t,l = s.pop(),len(x)\r\n x.insert((l//2) + l%2 , t)\r\n n-=1\r\n print(*x[::-1] , sep=\"\")", "n=int(input())\r\ns=input()\r\nm=s[0]\r\nfor i in range(1,n):\r\n if (i+n-1)%2==0 or i==(n-1):\r\n m=m+s[i]\r\n else:\r\n m=s[i]+m\r\nprint(m)", "n = int(input())\r\ns = list(input())\r\ns2 = [None]*n\r\np1 = n//2 - 1\r\np2 = n//2\r\np = 0\r\n\r\nturn = 2 if (n%2==1) else 1\r\n\r\nwhile p<n:\r\n if turn==2:\r\n s2[p2] = s[p]\r\n p2 += 1\r\n p += 1\r\n turn = 1\r\n else:\r\n s2[p1] = s[p]\r\n p1 -= 1\r\n p += 1\r\n turn = 2\r\n\r\nprint(''.join(s2))", "import sys\ninput = sys.stdin.readline\nimport math\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()))\nn = inpit()\ns = inpstr()\n\na = []\nfor i in range(n): \n if(len(s[i:]) %2 == 0):\n a.insert(0,s[i])\n else:\n a.append(s[i])\n \nprint(''.join(a))", "length = int(input())\r\nencoded = input()\r\nresult = \"\"\r\nfor i in range(length):\r\n if (i + length) % 2:\r\n result += encoded[i]\r\n else:\r\n result = encoded[i] + result\r\nprint(result)\r\n", "from random import choice\r\nfrom string import ascii_lowercase\r\n\r\n\r\n# 6\r\n# s = eslamf\r\n# d = lasmef\r\n\r\n# left 1 2 4 6 lamf\r\n# right 3 5 es\r\n\r\n\r\n# 7\r\n# s = eslamfa\r\n# d = almsfea\r\n\r\n# left 1 3 5 7 amfa\r\n# right 2 4 6 lse esl\r\n\r\ndef decode(n, s):\r\n if (n % 2) == 0:\r\n left = s[0] + s[1::2]\r\n right = s[2::2][::-1]\r\n return right + left\r\n else:\r\n left = s[0::2]\r\n right = s[1::2][::-1]\r\n return right + left\r\n\r\n\r\ndef encode(n, s):\r\n print(s)\r\n if n == 1:\r\n return s\r\n if n % 2 == 0:\r\n index = int(n / 2) - 1\r\n else:\r\n index = int(n / 2)\r\n print(index)\r\n char = s[index]\r\n print(char)\r\n s = s[0: index:] + s[index + 1::]\r\n print(s)\r\n print('-------------------------------------------')\r\n return char + decode(len(s), s)\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n print(decode(n, s))\r\n", "n = int(input())\r\ns = input()\r\nresult = list()\r\nif n & 1:\r\n for i in range(1, n + 1):\r\n if i & 1:\r\n result.append(s[i - 1])\r\n else:\r\n result.insert(0, s[i - 1])\r\n\r\nelse:\r\n for i in range(1, n + 1):\r\n if i & 1:\r\n result.insert(0, s[i - 1])\r\n else:\r\n result.append(s[i - 1])\r\n\r\nprint(''.join(result))\r\n", "numchars = input()\nencoded = [i for i in input()]\ndecoded = []\n\nwhile len(encoded) > 0:\n\tif len(decoded) % 2 == 0:\n\t\tdecoded.insert(len(decoded)//2, encoded[-1])\n\t\tencoded.pop()\n\telse:\n\t\tdecoded.insert((len(decoded)//2), encoded[-1])\n\t\tencoded.pop()\n\nprint(*decoded, sep='')\n\n\n\t \t \t\t \t\t \t\t\t \t\t\t\t \t \t\t\t\t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jul 28 09:32:44 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 9 - CF746-DIV2B\r\n\"\"\"\r\n\r\nsz = int(input())\r\nword = str(input())\r\nans = [0]*sz\r\noddFlag = 0\r\nif sz%2 == 1:\r\n oddFlag = 1\r\nfor i in range(sz):\r\n j = i+oddFlag\r\n #letter = sz//2 +oddFlag + ((-1)**(i+1))*((i+1)//2) - 1\r\n letter = sz//2 + ((-1)**(j+1))*((i+1)//2) - 1 + oddFlag\r\n ans[letter] = word[i]\r\nprint(''.join(ans))\r\n", "n=int(input());st=input();e=\"\";k=\"\"\r\ns=st[::-1]\r\nfor i in range(n):\r\n if i%2==1:\r\n e+=s[i]\r\n else:\r\n k+=s[i]\r\nprint(e+k[::-1])", "import math\r\n_, w = input(), list(input())\r\nl = r = \"\"\r\ni = 0\r\nwhile i < len(w):\r\n c = w[-1-i]\r\n if i%2==0: r = f\"{c}{r}\"\r\n else: l = f\"{l}{c}\"\r\n i+=1\r\nprint(l+r)\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n if (n % 2) == 0:\r\n print(s[2::2][::-1] + s[0] + s[1::2])\r\n else:\r\n print(s[1::2][::-1] + s[0::2])\r\n", "#%%\r\ndef func(n, ins):\r\n\r\n\tif n < 3: return ins\r\n\r\n\ts= ins[0]\r\n\tlast = ''\r\n\tmid = ''\r\n\tif n % 2 == 0: last = ins[-1]; n -= 1\r\n\telse: mid = ins[0]; ins = ins[1:] ;s = ins[0]; n -=1\r\n\tfor i in range(1, n): \r\n\r\n\t\tif i % 2 == 0: s = ins[i] + s;\r\n\t\telse: s += ins[i]\r\n\r\n\tif last: s = s + last\r\n\tif mid: s = s[:n//2] + mid + s[n//2:]\r\n\treturn s\r\nn = int(input())\r\n\r\nins = input()\r\nprint(func(n, ins))\r\n", "n=int(input())\r\ns=list(input())\r\nb=[]\r\ni=0\r\nn=len(s)\r\nwhile i<n:\r\n if b==[]:\r\n b.append(s.pop())\r\n elif len(b)%2!=0:\r\n b=b[:len(b)//2+1]+[s.pop()]+b[len(b)//2+1:]\r\n elif len(b)%2==0:\r\n b=b[:len(b)//2]+[s.pop()]+b[len(b)//2:] \r\n i+=1\r\nb.reverse()\r\na=\"\".join(b)\r\nprint(a)", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Decoding\"\r\n# Class: B\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n = int(input())\r\n s = input().strip()\r\n ans = \"\"\r\n if n%2!=0:\r\n for i in s[-2::-2]:\r\n ans+=i\r\n ans+=s[0]\r\n for i in s[2::2]:\r\n ans+=i\r\n print(ans)\r\n else:\r\n for i in s[-2::-2]:\r\n ans+=i\r\n for i in s[1::2]:\r\n ans+=i\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n Solve()", "n = int(input())\ns = list(input())\n\nans = [''] * n\nodd = n % 2 == 1\n\nif odd:\n mid = n//2\n left, right = mid - 1, mid + 1\n ch = s.pop(0)\n ans[mid] = ch\n go = 1\n while len(s) > 0:\n ch = s.pop(0)\n if go:\n ans[left] = ch\n left -= 1\n go = 0\n else:\n ans[right] = ch\n right += 1\n go = 1\n # print(ch, ans)\nelse:\n mid = n // 2 - 1\n left, right = mid - 1, mid + 1\n ch = s.pop(0)\n ans[mid] = ch\n go = 1\n while len(s) > 0:\n ch = s.pop(0)\n if go:\n ans[right] = ch\n right += 1\n go = 0\n else:\n ans[left] = ch\n left -= 1\n go = 1\n\nprint(''.join(ans))\n\n\n", "n=int(input())\r\ns=input()\r\nnew=''\r\nln=n\r\nif n%2==1:\r\n new+=s[0]\r\n s=s[1:]\r\n for i in range(n-1):\r\n if i%2==0:\r\n new = s[i] + new\r\n else:\r\n new+=s[i]\r\n print(new)\r\nelse:\r\n new+=s[0]\r\n s=s[1:]\r\n for i in range(n-1):\r\n if i%2==0:\r\n new+=s[i]\r\n else:\r\n new = s[i] + new\r\n print(new)", "\"\"\"\r\nhttps://codeforces.com/problemset/problem/746/B\r\n\"\"\"\r\n\r\nif __name__ == \"__main__\":\r\n coded_word_length = int(input())\r\n coded_word = input()\r\n decoded_word = str()\r\n while coded_word:\r\n if len(coded_word) % 2 == 0:\r\n decoded_word = coded_word[0] + decoded_word\r\n else:\r\n decoded_word += coded_word[0]\r\n coded_word = coded_word[1:]\r\n print(decoded_word)", "count = n = int(input())\r\n\r\ncode = input()\r\nans = [\"\" for x in range(n)]\r\nr = 0\r\nl = 0\r\nif n % 2 == 1:\r\n for i in range(n):\r\n if count % 2 == 0:\r\n median = (n // 2) - 1\r\n else:\r\n median = n // 2\r\n if i % 2 == 1:\r\n ans[median - r] = code[i]\r\n r += 1\r\n else:\r\n ans[median + l] = code[i]\r\n l += 1\r\n count -= 1\r\nelse:\r\n for i in range(n):\r\n if count % 2 == 0:\r\n median = (n // 2) - 1\r\n else:\r\n median = n // 2\r\n if i % 2 == 0:\r\n ans[median - r] = code[i]\r\n r += 1\r\n else:\r\n ans[median + l] = code[i]\r\n l += 1\r\n count -= 1\r\n\r\n\r\n\r\n\r\nprint(''.join(ans))", "n = int(input())\ns = input()\nl = len(s)\nres = \"\"\nwhile (l > 0):\n if (l % 2 == 1):\n res += s[0]\n else:\n res = s[0] + res\n s = s[1:]\n l = len(s) \nprint(res)", "n=int(input())\r\na=input()\r\nif n%2!=0:\r\n j=a[::2]\r\n b=a[1::2]\r\n n=b[::-1]\r\n print(n+j)\r\nelse:\r\n j=a[::2]\r\n b=a[1::2]\r\n n=j[::-1]\r\n print(n+b)", "n=int(input())\r\ns=input()\r\nif(n<=2):\r\n ans=s\r\nelif(n%2==0):\r\n p1=0\r\n p2=1\r\n ans=\"\"\r\n while(p2<n):\r\n ans=s[p1]+ans\r\n ans+=s[p2]\r\n p1+=2\r\n p2+=2\r\nelse:\r\n ans=s[0]\r\n p1 = 1\r\n p2 = 2\r\n while (p2 < n):\r\n ans = s[p1] + ans\r\n ans += s[p2]\r\n p1 += 2\r\n p2 += 2\r\n\r\n\r\nprint(ans)", "n = int(input())\r\ns = input()\r\ndecoded_word = s[0]\r\nflag = (0 if n & 1 else 1)\r\n\r\nfor i in range(1, n):\r\n if flag:\r\n decoded_word = decoded_word + s[i]\r\n else:\r\n decoded_word = s[i] + decoded_word\r\n flag = not(flag)\r\n\r\nprint(decoded_word)\r\n", "n = int(input())\r\ns = input()\r\n\r\nif n < 3:\r\n print(s)\r\nelse:\r\n ans = ['z']*n\r\n if n%2:\r\n #odd\r\n ans[n//2] = s[0]\r\n l, r = (n//2)-1, (n//2)+1\r\n isl = True\r\n for i in range(1,n):\r\n if isl:\r\n ans[l] = s[i]\r\n isl = False\r\n l -=1 \r\n else:\r\n ans[r] = s[i]\r\n r +=1\r\n isl = True\r\n print(\"\".join(ans))\r\n else:\r\n k = (n//2)-1\r\n l, r = k-1, k+1\r\n ans[k] = s[0]\r\n isr = True\r\n for i in range(1,n):\r\n if isr:\r\n ans[r] = s[i]\r\n isr = False\r\n r +=1\r\n else:\r\n ans[l] = s[i]\r\n l -=1\r\n isr = True\r\n print(\"\".join(ans))", "def solve(s):\r\n n=len(s)\r\n v='0'\r\n for i in s:\r\n v+=i\r\n ans=\"\"\r\n #print(v)\r\n for i in range(n-1,0,-2):\r\n ans+=v[i]\r\n a=1\r\n if n%2==0:\r\n a=2\r\n for i in range(a,n+1,2):\r\n ans+=v[i]\r\n return ans\r\n\r\nn=input()\r\ns=input()\r\nprint(solve(s))\r\n", "def solve():\r\n size = int(input())\r\n s = input()\r\n result = \"\"\r\n x = 0\r\n \r\n if size & 1:\r\n for letter in s:\r\n if x:\r\n result = letter + result\r\n x = 0\r\n else:\r\n result += letter\r\n x = 1\r\n else:\r\n for letter in s:\r\n if x:\r\n result += letter\r\n x = 0\r\n else:\r\n result = letter + result\r\n x = 1\r\n \r\n print(result)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n = int(input())\r\ns = input()\r\nt=''\r\nwhile s != '':\r\n ind=len(t)//2\r\n t=t[0:ind:1]+s[-1]+t[ind:len(t):1]\r\n s=s[0:len(s)-1:1]\r\nprint(t)", "n = int(input())\r\nb = input()\r\nc = b[0]\r\nif n % 2 != 0:\r\n for i in range(1 , n):\r\n if i % 2 == 0:\r\n c = c + b[i]\r\n else:\r\n c = b[i] + c\r\nelse:\r\n for i in range(1 , n):\r\n if i % 2 == 0:\r\n c = b[i] + c\r\n else:\r\n c = c + b[i]\r\nprint(c)\r\n", "def decoding(word):\r\n r=[]\r\n for i in reversed (word):\r\n r.insert(int(len(r)/2),i) \r\n print(*r,sep=\"\")\r\ninput()\r\nword=input()\r\ndecoding(word)", "n = int(input())\r\nstring = input()\r\n\r\ndecodedString = \"\"\r\n\r\nstrs = [\"\" , \"\"]\r\n\r\nfor i in range(n):\r\n strs[i%2] += string[i]\r\n\r\nprint(\"\".join(reversed(strs[1 - i % 2])) , end=\"\")\r\nprint(strs[i % 2])\r\n\r\n", "n = int(input())\r\nt = n\r\narray = list(input())\r\nres = [array[0]]\r\nn -= 1\r\ni = 1\r\n\r\nwhile i < t:\r\n if n & 1:\r\n res.append(array[i])\r\n else:\r\n res.insert(0, array[i])\r\n i += 1\r\n n -= 1\r\n\r\nprint(''.join(res))\r\n", "l = int(input())\r\ns = input()\r\nr = \"\"\r\nif l == 1 or l == 2:\r\n print(s)\r\nelse:\r\n if l % 2 != 0:\r\n for i in range(l):\r\n if i % 2 != 0:\r\n r = s[i] + r\r\n else:\r\n r = r + s[i]\r\n else:\r\n for i in range(l):\r\n if i % 2 == 0:\r\n r = s[i] + r\r\n else:\r\n r = r + s[i]\r\n \r\n print(r)\r\n\r\n\r\n", "T = int(input())\r\ncounter = T - 1\r\nline = input()\r\ntrue_line = line[1:]\r\nstring = line[0]\r\nlist = []\r\nl_counter = 0\r\nfor i in range(len(true_line)):\r\n list.append(true_line[i])\r\nwhile l_counter < len(list):\r\n if counter % 2 == 0:\r\n string = true_line[l_counter] + string\r\n counter -= 1\r\n l_counter += 1\r\n else:\r\n string = string + true_line[l_counter]\r\n counter -= 1\r\n l_counter += 1\r\nprint(string)", "n=int(input())\r\ns=list(input())\r\na=[\"0\"]*n\r\nx=\"\"\r\ni=0\r\nwhile i<=n-1:\r\n if i%2==1:\r\n x+=s[i]\r\n i+=1\r\nx=x[::-1]\r\n\r\ni=0\r\nwhile i<=n-1:\r\n if i%2==0:\r\n x+=s[i]\r\n i+=1\r\nif n%2==0:\r\n print(x[::-1])\r\nelse:\r\n print(x)", "n = int(input())\r\ns = input()\r\n \r\nif n % 2 == 1:\r\n res = s[n - 2:0:-2] + s[0] + s[2::2]\r\nelse:\r\n res = s[n - 2::-2] + s[1::2]\r\n \r\nprint(res)", "n = int(input())\r\ns = input()\r\nans = [0] * n\r\nc = True\r\nk = n - 1\r\nj = 0\r\nfor i in range(n - 1, -1, -1):\r\n if c:\r\n ans[k] = s[i]\r\n k -= 1\r\n else:\r\n ans[j] = s[i]\r\n j += 1\r\n c = not c\r\nprint(*ans, sep='')", "\ndef solve(size, s):\n out = [None]*n\n pair = size % 2 == 0\n if pair:\n left = True\n else:\n left = False\n\n md = size // 2 - pair\n index = 0\n\n for c in range(size):\n\n if left:\n out[md-index] = f'{s[c]}'\n if pair:\n index += 1\n else:\n out[md+index] = s[c]\n if not pair:\n index += 1\n left = not left\n return ''.join(out)\n\n\nn = int(input())\ns = input()\n\nprint(solve(n, s))\n", "import sys\r\nfrom typing import Callable\r\n\r\nCOLORS = ['R', 'O', 'Y', 'G']\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n n = int(read())\r\n word = read().strip()\r\n\r\n result = [''] * n\r\n start = 0\r\n end = n - 1\r\n left_side = False\r\n\r\n for i in range(len(word)-1, -1, -1):\r\n if not left_side:\r\n result[end] = word[i]\r\n end -= 1\r\n else:\r\n result[start] = word[i]\r\n start += 1\r\n left_side = not left_side\r\n print(''.join(result))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\ns = input()\r\n\r\ndef encode(s):\r\n new_word = ''\r\n if len(s)%2 == 1:\r\n for i in range(len(s)-2, 0, -2):\r\n new_word = new_word + s[i]\r\n for i in range(0, len(s), 2):\r\n new_word = new_word + s[i]\r\n \r\n else:\r\n for i in range(len(s)-2, -1, -2):\r\n new_word = new_word + s[i]\r\n for i in range(1, len(s), 2):\r\n new_word = new_word + s[i]\r\n \r\n return new_word\r\n \r\nprint(encode(s))", "n = int(input())\r\ns = input()\r\nmid = 0\r\nif n % 2 == 0:\r\n mid = n // 2 - 1\r\nelse:\r\n mid = n // 2\r\n\r\nres = [\"\"] * n\r\n\r\nres[mid] = s[0]\r\n\r\ncount = 1\r\nleft = mid - 1\r\nright = mid + 1\r\nif n % 2 == 0:\r\n switch = False\r\n while res.count(\"\") != 0:\r\n if not switch:\r\n switch = True\r\n res[right] = s[count]\r\n right += 1\r\n count += 1\r\n else:\r\n switch = False\r\n res[left] = s[count]\r\n count += 1\r\n left -= 1\r\nelse:\r\n switch = False\r\n while res.count(\"\") != 0:\r\n if switch:\r\n switch = False\r\n res[right] = s[count]\r\n right += 1\r\n count += 1\r\n else:\r\n switch = True\r\n res[left] = s[count]\r\n count += 1\r\n left -= 1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(\"\".join(res))", "n = int(input())\r\nch = list(input())\r\nres = \"\"\r\nwhile(ch != []):\r\n if(n%2 == 1):\r\n res += ch.pop(0)\r\n else:\r\n res = ch.pop(0) + res\r\n n-=1\r\nprint(res)", "a=int(input())\r\nb=input()\r\nL=\"\"\r\nM=[]\r\nif a%2==0:\r\n for i in range(a):\r\n if (i+1)%2!=0:\r\n #print(b[i])\r\n M.append(b[i])\r\n elif (i+1)%2==0:\r\n M=[b[i]]+M\r\n M.reverse()\r\n print(\"\".join(M))\r\nelse:\r\n for i in range(a):\r\n if (i+1)%2!=0:\r\n #print(b[i])\r\n L+=(b[i])\r\n elif (i+1)%2==0:\r\n L=b[i]+L\r\n print(L)", "import math\r\nn=int(input())\r\nencode=input()\r\ndecode=['']*n\r\n\r\nif n%2!=0:\r\n p=math.floor((n-1)/2)\r\n ptr1=p-1\r\n ptr2=p+1\r\n decode[p]=encode[0]\r\n i=0\r\n while(i<n-1):\r\n i+=1\r\n if i%2!=0:\r\n p=ptr1\r\n ptr1-=1\r\n else:\r\n p=ptr2\r\n ptr2+=1\r\n decode[p]=encode[i]\r\n print(''.join(decode))\r\nelse:\r\n p=math.floor((n-1)/2)\r\n ptr1=p-1\r\n ptr2=p+2\r\n decode[p]=encode[0]\r\n decode[p+1]=encode[1]\r\n i=1\r\n while(i<n-1):\r\n i+=1\r\n if i%2==0:\r\n p=ptr1\r\n ptr1-=1\r\n else:\r\n p=ptr2\r\n ptr2+=1\r\n decode[p]=encode[i]\r\n print(''.join(decode))", "n = int(input())\r\nst = input()\r\nans = []\r\n\r\nwhile n!=0:\r\n if n%2==1:\r\n ans.append(st[0])\r\n else:\r\n ans.insert(0,st[0])\r\n \r\n st = st[1:]\r\n n = len(st)\r\n\r\nprint(''.join(ans))", "import sys\ninput = sys.stdin.readline\nimport math\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n\nx = inp()\ns = insr()\neven = [s[x] for x in range(len(s)) if x % 2 == 0]\nodd = [s[x] for x in range(len(s) - 1, 0, -1) if x % 2 != 0]\nprint(\"\".join(odd + even)) if len(s) % 2 != 0 else print(\"\".join(odd+even)[::-1])\n\n\n \n\n", "import sys,math\r\nn=int(sys.stdin.readline())\r\ns=sys.stdin.readline().strip()\r\nans=\"\"\r\nif n %2!=0:\r\n for i in range(n):\r\n if i%2==0:\r\n ans+=s[i]\r\n else:\r\n ans=s[i]+ans\r\n print(ans)\r\nelse:\r\n for i in range(n):\r\n if i%2!=0:\r\n ans+=s[i]\r\n else:\r\n ans=s[i]+ans\r\n print(ans)", "n = int(input())\r\ns=input()\r\nans=[s[0]]\r\nstart = 1\r\nif n%2==0:\r\n ans.append(s[1])\r\n start=2\r\nfor i in range(start,n,2):\r\n ans.insert(0,s[i])\r\n ans.append(s[i+1])\r\nprint(''.join(ans))", "import math\r\nl=int(input())\r\ns=input()\r\nindex=[*range(l)]\r\nr=['']*l\r\nfor c in s:\r\n t = math.ceil(l/2)\r\n l = l-1\r\n p= index[t-1]\r\n r[p]=c\r\n index.remove(p)\r\nprint(*r,sep='')", "import math\r\nimport collections\r\nimport bisect\r\n \r\n \r\n \r\ndef cint() : return list(map(int, input().split())) \r\ndef cstr() : return list(map(str, input().split(' '))) \r\n \r\n\r\ndef solve():\r\n n = int(input())\r\n word = input()\r\n\r\n if len(word)%2==0:\r\n ans = word[:2]\r\n indx = 2\r\n for i in range(2,n,2):\r\n ans = word[i] + ans + word[i+1]\r\n \r\n print(ans)\r\n\r\n else:\r\n ans = word[:1]\r\n indx = 1\r\n for i in range(1,n,2):\r\n ans = word[i] + ans + word[i+1]\r\n \r\n print(ans)\r\n \r\nif __name__ == \"__main__\":\r\n # t = int(input())\r\n t = 1\r\n while t!=0:\r\n solve()\r\n t-=1", "n=int(input())\r\ns=input()\r\ns1=[' ']*n\r\nif n%2!=0:\r\n mid=n//2\r\n s1[mid]=s[0]\r\n for i in range(mid):\r\n s1[mid-i-1]=s[2*i+1]\r\n s1[mid+i+1]=s[2*i+2]\r\n print(('').join(s1))\r\nelse:\r\n mid = n//2 -1\r\n for i in range(mid+1):\r\n s1[mid-i]=s[2*i]\r\n s1[mid+i+1]=s[2*i+1]\r\n print(('').join(s1))", "n, s = int(input()), input()\r\nres = [\"\"] * n\r\nfor x in s: \r\n pos, n = (n >> 1) - ((n & 1) ^ 1) + 1, n - 1\r\n for i in range(len(res)):\r\n if res[i] == \"\": pos -= 1\r\n if pos == 0:\r\n res[i] = x\r\n break\r\nprint(*res, sep = \"\")", "#746B Decoding\r\n\r\nn = int(input())\r\nstring = input()\r\nres = ''\r\n# res+=string[0] \r\nif len(string) % 2 !=0 :\r\n for i in range(len(string)):\r\n if i % 2 != 0:\r\n res = string[i] + res\r\n else:\r\n res += string[i]\r\nelse:\r\n for i in range(len(string)):\r\n if i % 2 == 0:\r\n res = string[i] + res\r\n else:\r\n res += string[i]\r\n\r\nprint(res) ", "n=int(input())\r\ns=input()\r\nt=s[0]\r\nif n%2==1:\r\n for i in range(1,n):\r\n if i%2==1:\r\n t=s[i]+t\r\n else:\r\n t=t+s[i]\r\nelse:\r\n for i in range(1,n):\r\n if i%2==1:\r\n t=t+s[i]\r\n else:\r\n t=s[i]+t\r\nprint(t)", "n=int(input())\r\ns=input()\r\nl,l1=[],[]\r\nfor i in range(n):\r\n if i%2:\r\n l1.append(s[i])\r\n else:\r\n l.append(s[i])\r\n\r\nif n%2:\r\n s1=l1[::-1]+l\r\nelse:\r\n s1=l[::-1]+l1\r\ns3=\"\"\r\nfor i in range(n):\r\n s3+=s1[i]\r\nprint(s3)", "n = int(input())\r\nword = list(input())\r\nres = \"\"\r\n\r\n\r\nwhile word :\r\n if n&1 == 0 : res = word.pop(0) + res\r\n else : res += word.pop(0)\r\n\r\n n -= 1 \r\n\r\nprint(res) \r\n", "idx = int(input())\nscramp = input()\nans = scramp[0] \nf = idx % 2 == 0\nfor i in range(1, idx):\n ans =ans + scramp[i] if f else scramp[i] + ans\n f = not f\nprint(''.join(ans))\n \t \t\t \t\t\t \t\t \t \t\t \t \t", "n = int(input())\r\nword = input()\r\nnew = ''\r\nfor i in word:\r\n if n % 2 == 0:\r\n new = i + new\r\n else:\r\n new += i\r\n n -= 1\r\nprint(new)", "n = int(input())\r\nb = input()\r\ns = ''\r\nfor i in b:\r\n if n% 2 == 0:\r\n s = i +s\r\n else:\r\n s+=i\r\n n -=1\r\nprint(s)\r\n", "n = int(input())\r\ns = str(input())\r\nprint(s[-2::-2] + s[-1::-2][::-1])", "n = int(input())\r\ns = input()\r\ndecoded = [0] * n\r\nlc = -1\r\nrc = 0\r\nfor i in range(1,n+1):\r\n if i % 2 == 1:\r\n decoded[lc] = s[-i]\r\n lc -= 1\r\n else:\r\n decoded[rc] = s[-i]\r\n rc += 1\r\nprint(''.join(decoded))\r\n ", "_ = input()\r\nw = input()\r\nres = ''\r\nfor idx, c in enumerate(w):\r\n if (len(w) - idx) % 2:\r\n res = res + c\r\n else:\r\n res = c + res\r\nprint(res)", "n = int(input())\r\n\r\ns = input()\r\n\r\nif n%2==0:\r\n temp = ''\r\n for i in range(n):\r\n if i%2==0:\r\n temp = s[i] + temp\r\n else:\r\n temp = temp + s[i]\r\nif n%2!=0:\r\n temp = ''\r\n for i in range(n):\r\n if i%2!=0:\r\n temp = s[i] + temp\r\n else:\r\n temp = temp + s[i]\r\n\r\nprint(temp)", "# def decode(string:str):\r\n# temp = ''\r\n# while string:\r\n# chosen_index = None\r\n# if not len(string) % 2:\r\n# chosen_index = len(string) // 2 - 1\r\n# else:\r\n# chosen_index = len(string) // 2\r\n# temp += string[chosen_index]\r\n# string = string[:chosen_index] + string[chosen_index + 1:]\r\n# return temp\r\nif __name__ == '__main__':\r\n str_len = int(input())\r\n string = input()\r\n list_ = [None] * str_len\r\n curr_len = 0\r\n for item in string:\r\n if not str_len % 2:\r\n list_[str_len // 2 - 1] = item\r\n else:\r\n list_[str_len // 2 + curr_len] = item\r\n curr_len += 1\r\n str_len -= 1\r\n print(''.join(list_))\r\n", "n = int(input(\"\"))\r\ns = input(\"\")\r\nans = \"\"\r\n\r\nfor i in range(len(s)):\r\n if n%2 == 0:\r\n ans = s[i]+ans\r\n else:\r\n ans = ans+s[i]\r\n n -= 1\r\n\r\nprint(ans)", "n, cad = int(input()), input()\r\n\r\nleft = \"\"\r\nright = \"\"\r\n\r\ncad = \"\".join(reversed(cad))\r\n\r\nfor i in range(0, n, 2):\r\n \r\n left = left + cad[i]\r\n try:\r\n right = cad[i + 1] + right\r\n except Exception:\r\n pass\r\n\r\n\r\nprint(\"\".join(reversed(left + right)))", "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\nx=int(input())\r\na=input().strip()\r\nc=\"\"\r\nif x%2==1:\r\n for i in range(len(a)):\r\n if i%2==0:\r\n c+=a[i]\r\n else:\r\n c=a[i]+c\r\nelse:\r\n for i in range(len(a)):\r\n if i%2==1:\r\n c+=a[i]\r\n else:\r\n c=a[i]+c\r\nprint(c)", "n = int(input())\r\ns = input()\r\nans = ''\r\nf = 0\r\nif len(s) % 2 == 0:\r\n for i in s:\r\n if f == 0:\r\n ans = i+ans\r\n f = 1\r\n else:\r\n ans = ans+i\r\n f = 0\r\nelse:\r\n f = 1\r\n for i in s:\r\n if f == 0:\r\n ans = i+ans\r\n f = 1\r\n else:\r\n ans = ans+i\r\n f = 0\r\nprint(ans)\r\n", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp(): # int\n return(int(input()))\ndef inlt(): # list\n return(list(map(int,input().split())))\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\ndef instr(): # string\n return input()\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\n\n# end, start, end - 1, start + 1, end - 2, start + 2, etc\n\nn = inp()\nchars = insr()\nans = [0] * n\nl, r = 0, n - 1\n\nfor i in range(n):\n if i % 2 == 0:\n ans[r] = chars[n - 1 - i]\n r -= 1\n else:\n ans[l] = chars[ n - 1 - i]\n l += 1\nprint(''.join(ans))\n", "a=int(input())\r\ng=input()\r\nif a%2==0:\r\n h=''\r\n j=''\r\n for i in range(0,a,2):\r\n h=g[i]+h\r\n for i in range(1,a,2):\r\n j+=g[i]\r\n print(h+j)\r\n exit()\r\nh=''\r\nfor i in range(a):\r\n if i%2==0:\r\n h+=g[i]\r\n else:\r\n h=g[i]+h\r\nprint(h)", "n = int(input())\r\ns = list(input())\r\n\r\nans = []\r\n\r\nfor i in range(n):\r\n ans.insert(len(ans)//2, s[len(s)-1]); s.pop()\r\n\r\nprint(\"\".join(ans))", "n = int(input())\r\na = input()\r\narr = ['' for i in range(n)]\r\n\r\nif n % 2 == 1:\r\n x = n//2\r\n k = x - 1\r\n l = x + 1\r\n arr[x] = a[0]\r\n for i in range(1, n):\r\n if i % 2 == 1:\r\n arr[k] = a[i]\r\n k -= 1\r\n else:\r\n arr[l] = a[i]\r\n l += 1\r\nelse:\r\n x = n // 2 - 1\r\n k = x - 1\r\n l = x + 1\r\n arr[x] = a[0]\r\n for i in range(1, n):\r\n if i % 2 == 0:\r\n arr[k] = a[i]\r\n k -= 1\r\n else:\r\n arr[l] = a[i]\r\n l += 1\r\n\r\nprint(''.join(map(str, arr)))", "n=int(input())\r\ns=str(input())\r\ns=s[::-1]\r\ns1=s[1::2]\r\ns2=s[::2]\r\ns2=s2[::-1]\r\nprint(s1+s2)\r\n \r\n ", "n = int(input())\r\nencoded = input()\r\nif n % 2 == 1:\r\n decoded = ''\r\n for letter in encoded:\r\n if len(decoded) % 2 == 0:\r\n decoded = decoded + letter\r\n else:\r\n decoded = letter + decoded\r\nelse:\r\n decoded = ''\r\n for letter in encoded:\r\n if len(decoded) % 2 == 1:\r\n decoded = decoded + letter\r\n else:\r\n decoded = letter + decoded\r\nprint(decoded)", "l=int(input())\r\ntxt=input()\r\nans=[]\r\nif l%2==0:\r\n for i in range(l):\r\n if i%2==0:\r\n ans.insert(0,txt[i])\r\n else:\r\n ans.append(txt[i])\r\nelse:\r\n for i in range(l):\r\n if i%2==0:\r\n ans.append(txt[i])\r\n else:\r\n ans.insert(0,txt[i])\r\nprint(\"\".join(ans))", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn = get(int)\ns = get(str)\nprint(s[-2::-2] + s[n & 1 ^ 1::2])\n", "n = int(input())\r\ns = input()\r\nif len(s)%2 == 0:\r\n s1 = \"\"\r\n s2 = \"\"\r\n for i in range(0,len(s),2):\r\n s1 += s[i]\r\n s2 += s[i+1]\r\n s1 = s1[::-1]\r\n print(s1+s2)\r\nelse:\r\n middle = s[0]\r\n s1 = \"\"\r\n s2 = \"\"\r\n for i in range(1,len(s),2):\r\n s1 += s[i]\r\n s2 += s[i+1]\r\n s1 = s1[::-1]\r\n print(s1+middle+s2)\r\n", "n = int(input())\r\ns1=\"\"\r\ns2=\"\"\r\nch = input()\r\nfor i in range(n // 2):\r\n s1 = ch[-1]+s1\r\n s2 = s2+ch[-2]\r\n ch = ch[:len(ch)-2]\r\nif (ch != \"\"):\r\n s2+=ch\r\nprint(s2+s1)", "import math\n\nn = int(input())\nencoded = input()\n\ndef decode(encoded: str) -> str:\n n = len(encoded)\n decoded = \"\" \n start = 0\n if n % 2 == 1:\n decoded = encoded[0]\n start = 1\n k = True\n for i in range(start, n):\n if k:\n decoded = f\"{encoded[i]}{decoded}\"\n else:\n decoded = f\"{decoded}{encoded[i]}\"\n k = not k\n return decoded\n\n\nprint(decode(encoded))\n", "n = int(input())\ncase=input()\ntemp=\"\"\nx = n\n\nfor i in range(n):\n if x%2 == 0:\n temp = case[i]+temp\n else:\n temp = temp + case[i]\n x-=1\nprint(temp)\n\n", "n = int(input())\r\ns = str(input())\r\n\r\na = []\r\nif n % 2 == 0:\r\n lechan = 1\r\nelse:\r\n lechan = 0\r\nfor i in range(lechan,n+lechan):\r\n if i % 2 == 0:\r\n a.append(s[i-lechan])\r\n else:\r\n a.insert(0,s[i-lechan])\r\n\r\nprint(*a,sep='')", "# cook your dish here\r\nn = int(input())\r\ns = input()\r\nc = []\r\nfor i in s:\r\n c+=i\r\nres = []\r\nfor i in range(n-2, -1, -2):\r\n res+=c[i]\r\nstart = 0\r\nif n%2==0:\r\n start = 1\r\nfor i in range(start, n, 2):\r\n res+=c[i]\r\nans = \"\".join(res)\r\nprint(ans)\r\n ", "r = \"\"\r\nn = int(input())\r\ni = input()\r\nif(n%2 != 0):\r\n r = i[0]\r\n # i = i.lstrip(i[0]) (in this if there is two similra char toward each other it erses two of them)\r\n i = i[1:]\r\nwhile(i != \"\"):\r\n if(len(i) > 0):\r\n r = i[0] + r\r\n if (len(i) > 0):\r\n i = i[1:]\r\n if (len(i) > 0):\r\n r = r + i[0]\r\n if (len(i) > 0):\r\n i = i[1:]\r\nprint(r)", "n = int(input())\r\nword = input()\r\ndecode = [word[0]]\r\n\r\nfor i in range(1, len(word)):\r\n if i % 2 == 0:\r\n decode.append(word[i])\r\n else:\r\n decode.insert(0, word[i])\r\n\r\nresult = ''\r\nfor i in decode:\r\n result += i\r\n\r\nif n % 2 == 0:\r\n result = result[::-1]\r\n\r\nprint(result)", "def solve(n, s):\r\n r = ''\r\n for i in range(n - 2, -1, -2):\r\n r += s[i]\r\n x = 0\r\n if n % 2 == 0:\r\n x = 1\r\n for i in range(x, n, 2):\r\n r += s[i]\r\n return r\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n print(solve(n, s))\r\n", "from collections import deque\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip().decode())\r\nq = deque()\r\nfor i in s:\r\n if not (len(q) + n) % 2:\r\n q.appendleft(i)\r\n else:\r\n q.append(i)\r\nans = \"\".join(q)\r\nprint(ans)", "\r\nsize,word = int(input()),list(input())\r\nresult = \"\"\r\nlist1 = []\r\nwhile size != 0:\r\n if size%2 == 1:\r\n list1.append(word[0])\r\n else:\r\n list1.insert(0,word[0])\r\n word.pop(0)\r\n size= len(word)\r\nprint(\"\".join(list1))\r\n \r\n", "n = int(input())\nw = input()\n\n# nw = \"\"\n# cw = \"\"\n#\n# for i in range(n):\n# x = int((n+1-i)/2)\n# nw += w[x-1]\n# cw = w[:(x-1)] + w[x:]\n# w = cw\n#\n# print(nw)\na = [0] * n\nb = [0] * n\nfor i in range(n):\n a[i] = i\n\n# aa = a\n\nfor ii in range(n):\n x = int((n + 1 - ii) / 2)\n b[ii] = a[x-1]\n a = a[:(x-1)] + a[x:]\n # print(x,a)\n\n# print(b)\ndecw = [\" \"] * n\nfor iii in range(n):\n decw[b[iii]] = w[iii]\ndd = \"\"\nprint(dd.join(decw))\n\t \t\t\t \t\t\t\t\t\t\t \t \t \t", "n = int(input())\r\ns = list(input())\r\nans = []\r\nturn = n&1\r\nans.append(s[0])\r\nfor i in range(1,n):\r\n if turn:\r\n ans.insert(0,s[i])\r\n turn=0\r\n continue\r\n ans.append(s[i])\r\n turn=1\r\nprint(''.join(ans))\r\n", "\r\nn=int(input())\r\nst=input()\r\narr=[]\r\nif n%2!=0:\r\n\tarr.insert(int(len(arr)/2),st[0])\r\n\t# print(arr)\r\n\tx=1\r\n\tfor i in range(1,n):\r\n\t\tif i%2!=0:\r\n\t\t\tarr.insert(x-((i+1)//2),st[i])\r\n\t\t\tx=x+1\r\n\t\t\t# print(arr)\r\n\t\telse:\r\n\t\t\tarr.insert(x+((i+1)//2),st[i])\r\n\t\t\t# print(arr)\r\nelse:\r\n\tarr.insert(int(len(arr)/2),st[0])\r\n\t# print(arr)\r\n\tx=1\r\n\tfor i in range(1,n):\r\n\t\tif i%2!=0:\r\n\t\t\tarr.insert(x+((i+1)//2),st[i])\r\n\t\t\t# print(arr)\r\n\t\telse:\r\n\t\t\tarr.insert(x-((i+1)//2),st[i])\r\n\t\t\tx=x+1\r\n\t\t\t# print(arr)\t\r\ns=\"\"\r\nfor i in arr:\r\n\tif i!=0:\r\n\t\ts=s+i\r\nprint(s)\r\n", "n=int(input())\r\ns=input()\r\nright=0\r\n\r\nli=['A']*n\r\n\r\nif n%2==0:\r\n li[(n//2)-1]=s[0]\r\n j=k=(n//2)-1\r\n right=1\r\nelse: \r\n li[n//2]=s[0]\r\n j=k=n//2\r\n right=0\r\n'''\r\n#############################################\r\ns=s h kiat\r\nli=a,k,s,h,i,t\r\nk=3\r\nj=2\r\nright=0\r\n\r\n\r\n###############################################\r\n'''\r\n\r\n\r\nfor i in range(1,n):\r\n if right==0:\r\n li[j-1]=s[i]\r\n j-=1\r\n right=abs(right-1)\r\n else:\r\n li[k+1]=s[i]\r\n k+=1\r\n right=abs(right-1)\r\n\r\nfor i in li:\r\n print(i,end=\"\")", "n= int(input())\r\ns = input()\r\ne = ''\r\n\r\nwhile len(s)>0:\r\n if len(s)%2==0:\r\n e=s[0]+e\r\n s=s[1:]\r\n else:\r\n if len(s)==1:\r\n e+=s\r\n s=''\r\n else:\r\n e=e+s[0]\r\n s=s[1:]\r\n\r\nprint(e)", "n = int(input())\r\ns = input()\r\ncode = \"\"\r\ndirect = 1\r\nif len(s) % 2 == 0:\r\n for c in s:\r\n if direct == 1:\r\n code = c + code\r\n direct = -1\r\n else:\r\n code += c\r\n direct = 1\r\n\r\nelse:\r\n for c in s:\r\n if direct == 1:\r\n code += c\r\n direct = -1\r\n else:\r\n code = c + code\r\n direct = 1\r\n\r\nprint(code)", "n = int(input())\r\ns = input()\r\na = []\r\nif len(s) % 2 == 1:\r\n for i in range(0, len(s)-2, 2):\r\n a.append(s[i])\r\n a.insert(0, s[i+1])\r\n print(\"\".join(a) + s[-1])\r\nelse:\r\n for i in range(0, len(s), 2):\r\n a.insert(0,s[i])\r\n a.append(s[i+1])\r\n print(\"\".join(a))\r\n", "from collections import deque\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\n#print(s)\r\nq = deque()\r\nfor i in s:\r\n if not (len(q) + n) % 2:\r\n q.appendleft(i)\r\n else:\r\n q.append(i)\r\nans = \"\".join(q)\r\nprint(ans)", "num = input()\r\nx = input()\r\nxx, xlst = [i for i in x], \"\"\r\nleft, shift, num = 1, 1, int(num)\r\n# Places middle word\r\nxlst += xx[0]\r\nxx.remove(xx[0])\r\n# Places left and right words\r\nfor i in xx:\r\n if num % 2 == 0:\r\n xlst += i\r\n else:\r\n xlst = i + xlst\r\n num -= 1\r\nprint(xlst)\r\n", "n = int(input())\ns = list(input())\n\nans = [''] * n\nodd = n % 2 == 1\nif odd:\n mid = n // 2\n go = 0\nelse:\n mid = n // 2 - 1\n go = 1\nleft, right = mid - 1, mid + 1\nch = s.pop(0)\nans[mid] = ch\n\nwhile len(s) > 0:\n ch = s.pop(0)\n if go == 0:\n ans[left] = ch\n left -= 1\n go = 1\n else:\n ans[right] = ch\n right += 1\n go = 0\nprint(''.join(ans))\n\n\n", "def Decryption(s,str_):\r\n result = str_[0]\r\n for i in range(s-1):\r\n i2 = i+1\r\n if s%2==0:\r\n if i2%2==0:\r\n result = str_[i2]+result\r\n else:\r\n result = result+str_[i2]\r\n else:\r\n if i2%2!=0:\r\n result = str_[i2]+result\r\n else:\r\n result = result+str_[i2]\r\n return result\r\n\r\n\r\nif __name__ == '__main__':\r\n i = int(input())\r\n str_=input()\r\n print(Decryption(i,str_))\r\n", "n = int(input())\r\ns=input()\r\nc=[]\r\ni=0\r\nif n%2==1:\r\n c.append(s[i])\r\n i+=1\r\n n-=1\r\nwhile i<n:\r\n c.insert(0, s[i])\r\n c.append(s[i+1])\r\n i+=2\r\n\r\n\r\nx=''.join(c)\r\nprint(x)\r\n\r\n", "n = int(input())\r\ns = input()[::-1]\r\nans = ['' for i in range(n)]\r\ncnt = 0\r\nfor i in range(0,n-1,2):\r\n\tans[cnt] = s[i]\r\n\tans[n-cnt-1] = s[i+1]\r\n\tcnt+=1\r\nif n%2!=0:\r\n\tans[n//2] = s[n-1]\r\nprint(''.join(ans[::-1]))\r\n", "from sys import stdin\r\nfrom math import ceil\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\n\r\ninput = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\nn = int(input())\r\ns = input().strip()\r\nx = \"\"\r\nif n % 2:\r\n x = s[0]\r\n s = s[1:]\r\nfor ind, el in enumerate(s):\r\n if ind % 2:\r\n x += el\r\n else:\r\n x = el + x\r\nprint(x)\r\n", "q,s=int(input()),input()\r\nd,i='',0\r\nwhile i<q:\r\n if i%2==1:d=s[i]+d\r\n else:d+=s[i]\r\n i+=1\r\nif q%2==1:print(d)\r\nelse:print(d[::-1])", "from collections import deque\r\na=int(input())\r\nb=input()\r\nreq=deque([b[0]])\r\nif a%2:\r\n for i in range(1,len(b)):\r\n if i%2:\r\n req.appendleft(b[i])\r\n else:\r\n req.append(b[i])\r\n print(\"\".join(req))\r\nelse:\r\n for i in range(1,len(b)):\r\n if i%2:\r\n req.append(b[i])\r\n else:\r\n req.appendleft(b[i])\r\n print(\"\".join(req))\r\n", "n = int(input())\r\ns = input()\r\nnach = []\r\ncon = []\r\nif n % 2 == 0:\r\n for i in range(n):\r\n if i == 0 or i % 2 == 0:\r\n nach.append(s[i])\r\n else:\r\n con.append(s[i])\r\nelse:\r\n for i in range(n):\r\n if i == 0 or i % 2 == 0:\r\n con.append(s[i])\r\n else:\r\n nach.append(s[i])\r\nfor i in range(len(nach)):\r\n print(nach[-(i + 1)], end='')\r\nfor i in range(len(con)):\r\n print(con[i], end='')\r\n", "n = int(input())\r\ns = input()\r\nlast = []\r\nfirst = []\r\nis_last = True\r\nfor i in range(n-1,-1,-1):\r\n if is_last:\r\n last.append(s[i])\r\n else:\r\n first.append(s[i])\r\n is_last = not is_last\r\n# print(first)\r\n# print(last)\r\nans = ''.join(first)\r\nans = ans + ''.join(last[::-1])\r\nprint(ans)", "import string\r\n\r\nanswer = []\r\nn = int(input())\r\nword = input()\r\nq = 0\r\nif n % 2 == 0:\r\n for i in word: #abba\r\n if(q == 0):\r\n answer.append(i) #baba\r\n elif(q % 2 == 0):\r\n answer.insert(0, i)\r\n else:\r\n answer.append(i)\r\n q += 1\r\n\r\nelse:\r\n for i in word: #abba\r\n if(q == 0): #abab\r\n answer.append(i)\r\n elif(q % 2 != 0): #odd\r\n answer.insert(0, i)\r\n else:\r\n answer.append(i)\r\n\r\n q += 1\r\n\r\nfor i in answer:\r\n print(i, end='')", "\ndef d(initial_index, n):\n sign = -1 if n % 2 == 0 else 1\n k = 0\n index = initial_index\n while True:\n index = index + k * sign\n yield index\n k += 1\n sign *= (-1)\n\nn = int(input())\ns = input()\na = [None] * n\n\ngen = d((n - 1) // 2, n)\n\nfor symbol in s:\n a[next(gen)] = symbol\n\nprint(''.join(a))\n", "n = int(input())\r\nsn = input()\r\ns = \"\"\r\n \r\nfor i in range(n):\r\n\tif i%2==0:\r\n\t\ts = sn[i] + s\r\n\telse:\r\n\t\ts = s + sn[i]\r\n \r\nif n%2==0:\t\r\n\tprint(s)\r\nelse:\r\n\tprint(s[::-1])", "n = int(input())\r\ns = list(input())\r\nx = list(range(n))\r\nmmax = n - 1 \r\nmmin = 0\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n x[mmax] = s[-1]\r\n mmax -= 1\r\n s.pop()\r\n else:\r\n x[mmin] = s[-1]\r\n mmin += 1\r\n s.pop() \r\nprint(*x, sep=\"\")", "# https://codeforces.com/contest/746/problem/B\r\n\r\nn=int(input())\r\ns=input()\r\ne=['0']*n\r\nwhile n>0:\r\n\tif n%2==0:\r\n\t\te[n//2-1]=s[0]\r\n\telse:\r\n\t\te[[i for i, n in enumerate(e) if n == '0'][(n-1)//2]]=s[0]\r\n\tn-=1\r\n\ts=s[1:]\r\nprint(''.join(e))", "n = int(input())\r\ns = list(input())\r\nans = []\r\nturn = n&1\r\nans.append(s[0])\r\nfor i in range(1,n):\r\n if i&1:\r\n ans.insert(0,s[i])\r\n continue\r\n ans.append(s[i])\r\nif n & 1:\r\n print(''.join(ans))\r\nelse:\r\n print(''.join(reversed(ans)))\r\n", "sz = int(input())\r\nword = input()\r\nop = []\r\nif sz % 2 != 0:\r\n for i in range(sz):\r\n if i % 2 == 0:\r\n op.append(word[i])\r\n else:\r\n op.insert(0, word[i])\r\nelse:\r\n for i in range(sz):\r\n if i % 2 != 0:\r\n op.append(word[i])\r\n else:\r\n op.insert(0, word[i])\r\ncode = \"\"\r\nprint(code.join(op))", "# LUOGU_RID: 116438011\na,b=int(input()),list(input())\nc,d=[' ' for d in range(a)],a//2\nif a%2==1:\n c[d]=b[0]\n for e in range(d):\n c[d-e-1]=b[2*e+1]\n c[d+e+1]=b[2*e+2]\nelse:\n for f in range(d):\n c[d-f-1]=b[2*f]\n c[d+f]=b[2*f+1]\nfor g in c:\n print(g,end='')", "n = int(input())\r\nname = input()\r\nans = ''\r\ni = n-2\r\nwhile i>=0:\r\n ans += name[i]\r\n i-=2\r\ni = 1 if n%2==0 else 0\r\nwhile i<n:\r\n ans += name[i]\r\n i+=2\r\nprint(ans)", "n1 = int(input())\r\nstr1 = input()\r\nstr2 = str1[0]\r\ncount = 0\r\nif n1 % 2 != 0:\r\n for i in range(1,len(str1)):\r\n if count % 2 == 0:\r\n str2 = str1[i] + str2\r\n else:\r\n str2 += str1[i]\r\n count+=1\r\n\r\nelse:\r\n for i in range(1,len(str1)):\r\n if count % 2 != 0:\r\n str2 = str1[i] + str2\r\n else:\r\n str2 += str1[i]\r\n count+=1\r\n \r\nprint(str2)\r\n", "# B 469 - Decoding - Codeforces\r\n# Link : https://codeforces.com/contest/746/problem/B\r\n\r\nnumberOfChars, encodedMessage = int(input()), input()\r\n\r\ndecodedMessage = \" \" * numberOfChars\r\n\r\ndirection = 1 if numberOfChars % 2 == 1 else -1\r\n\r\ncursorPosition = numberOfChars // 2 if numberOfChars % 2 == 1 else (numberOfChars // 2) - 1\r\nfor i in range(numberOfChars):\r\n cursorPosition += direction * i\r\n direction *= -1\r\n decodedMessage = decodedMessage[:cursorPosition] + encodedMessage[i] + decodedMessage[cursorPosition + 1:]\r\n \r\nprint(decodedMessage)", "n = int(input())\r\nstrk = input()\r\nR_side = ''\r\nL_side = ''\r\ncnt = True\r\nfor j in range (n-1, -1,-1):\r\n if cnt:\r\n R_side = strk [j] + R_side \r\n cnt = False\r\n else:\r\n L_side += strk [j]\r\n cnt = True\r\n\r\n \r\nprint (L_side + R_side)", "\ndef rev(str):\n if(len(str)<=2): \n return str;\n \n num = len(str);\n val = \"\" + str[num-2]+str[num-1];\n i = num-3;\n \n while i>=0:\n \n mid = int(len(val)/2);\n val = val[:mid] + str[i] + val[mid:];\n i=i-1\n return val;\n \nnum = input(\"\");\nstr = input(\"\");\n\nprint(rev(str));\n", "n = int(input())\r\ns = input()\r\nif len(s) == 1:\r\n print(s)\r\n exit()\r\nend = []\r\nfor i in s[::-1]:\r\n end.insert(len(end)//2,i)\r\nprint(\"\".join(end))", "n=int(input())\r\ns=input()\r\ns1=s[0]\r\nif(n%2==0):\r\n for i in range(1,n):\r\n if(i%2==0):\r\n s1=s[i]+s1\r\n else:\r\n s1=s1+s[i]\r\nelse:\r\n for i in range(1,n):\r\n if(i%2==0):\r\n s1=s1+s[i]\r\n else:\r\n s1=s[i]+s1\r\nprint(s1)", "N = int(input())\nenc = input()\ndec = [None]*N\nif N%2==0:\n sign = True\n position = int(N//2 - 1)\nelse:\n sign = False\n position = int(N//2)\nfor i, c in enumerate(enc):\n dec[position] = c\n if sign:\n position += i+1\n sign = False\n else:\n position -= (i+1)\n sign = True\nprint(''.join(dec))", "if __name__ == \"__main__\":\r\n n = int(input())\r\n res = list(input())\r\n string = \"\"\r\n while res:\r\n if len(res) % 2 == 0:\r\n s = res.pop(0)\r\n string = s + string \r\n else:\r\n s = res.pop(0)\r\n string = string + s\r\n\r\n print(string)\r\n\r\n", "n =int(input())\r\nl1=list(input())\r\nmid=n//2\r\nleft=mid-1\r\nright=mid\r\nl2=[0]*n\r\nwhile(len(l1)>0):\r\n if(len(l1)%2!=0):\r\n alpha =l1[0]\r\n del l1[0]\r\n # print(l1, \"l1 of odd leng\")\r\n \r\n del l2[right]\r\n l2.insert(right,alpha)\r\n # print(l2,\"l2\")\r\n right+=1\r\n else:\r\n alpha=l1[0]\r\n del l1[0]\r\n # print(l1,\"l1 of even\")\r\n del l2[left]\r\n l2.insert(left,alpha) \r\n # print(l2,\"l2\")\r\n left=left-1 \r\nprint(''.join(l2)) \r\n\r\n\r\n\r\n", "\r\nn = int(input())\r\nm = input()\r\nk=\"\"\r\nif len(m)%2==1:\r\n\r\n for i in range(n-2,-1,-2):\r\n k+=m[i]\r\n\r\n for i in range(0,n,2):\r\n k+=m[i]\r\nelse:\r\n for i in range(n-2,-1,2):\r\n k+=m[i]\r\n\r\n for i in range(n-2,-1,-2):\r\n k+=m[i]\r\n\r\n for i in range(1,n,2):\r\n k+=m[i]\r\nprint(k)\r\n", "n=int(input())\r\nt=input()\r\nans=[]\r\nif n==1 or n==2:\r\n ans = t\r\nelse:\r\n if n%2!=0:\r\n optr = n-2\r\n eptr = 0\r\n while optr>=0:\r\n \r\n ans.append(t[optr])\r\n optr = optr-2\r\n while eptr<n:\r\n ans.append(t[eptr])\r\n eptr = eptr+2\r\n else:\r\n eptr = n-2\r\n optr = 1\r\n while eptr>=0:\r\n ans.append(t[eptr])\r\n eptr = eptr-2\r\n while optr<n:\r\n ans.append(t[optr])\r\n optr = optr+2\r\nprint(*ans,sep=\"\")", "n=int(input())\r\ns=input()\r\nx=\"\"\r\nif n%2!=0:\r\n for i in range(0,n,2):\r\n x+=s[i]\r\n ok=\"\"\r\n for i in range(n-2,0,-2):\r\n ok+=s[i]\r\n x=ok+x\r\nelse:\r\n for i in range(1,n,2):\r\n x+=s[i]\r\n ok=\"\"\r\n for i in range(n-2,-1,-2):\r\n ok+=s[i]\r\n x=ok+x\r\nprint(x)\r\n \r\n", "n=int(input())\r\na=input()\r\nb=''\r\nb=b+a[0]\r\nif(n%2):\r\n for i in range(1,n):\r\n if(i%2):\r\n b=a[i]+b\r\n else:\r\n b=b+a[i]\r\nelse:\r\n b=b+(a[1])\r\n for i in range(2,n):\r\n if(i%2):\r\n b=b+a[i]\r\n else:\r\n b=a[i]+b\r\nprint(b) ", "# from math import ceil\r\n# from collections import Counter\r\n# mod = 1000000007\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n s = [x for x in input()]\r\n if len(s) == 1:\r\n exit(print(s[0]))\r\n a = [x for x in s[::2]]\r\n b = [x for x in s[1::2]]\r\n if n % 2:\r\n print(*b[::-1], *a, sep='')\r\n else:\r\n print(*a[::-1], *b, sep='')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\na=input()\r\nch=''\r\nif n%2==0:\r\n for i in range(2,n+1,2):\r\n ch=ch+a[n-i]\r\n for i in range(1,n,2):\r\n ch=ch+a[i]\r\nelse:\r\n for i in range(1,n,2):\r\n ch=ch+a[n-1-i]\r\n for i in range(0,n,2):\r\n ch=ch+a[i]\r\nprint(ch)", "import math\n\nn = int(input())\nencoded = input()\n\ndecoded = \"\" \nstart = 0\nif n % 2 == 1:\n decoded = encoded[0]\n start = 1\nk = True\nfor i in range(start, n):\n if k:\n decoded = f\"{encoded[i]}{decoded}\"\n else:\n decoded = f\"{decoded}{encoded[i]}\"\n k = not k\nprint(decoded)\n", "n=int(input())\r\nstr=input()[:n]\r\nprint(str[-2::-2]+str[1-n%2::2])\r\n", "N = int(input())\r\nS = input()\r\nans = []\r\nfor c in S[::-1]:\r\n ans.insert(len(ans)//2,c)\r\nprint(\"\".join(ans))", "import math\n\nn = int(input())\nword = str(input())\n\ndef get_median_index(word):\n if len(word) % 2 != 0:\n return len(word) // 2\n else:\n return len(word) // 2 - 1\n\nresult = []\nc = len(word)\nfor l in word:\n if c % 2 != 0:\n result = result + [l]\n else:\n result = [l] + result\n c -= 1\n\nprint(''.join(r for r in result))\n", "n = int(input())\ns = input()\n\nif n % 2 == 0: \n length = n // 2\nelse: \n length = n//2\n length += 1\nres = ['z' for _ in range(n)]\nr = n-1\nl = 0\nfor i in range(n-1,-1, -2):\n if n % 2 == 1 and i ==0: \n a = s[i]\n res[n//2] = a\n else: \n a = s[i]\n b = s[i-1]\n res[r] = a\n res[l] = b\n l += 1\n r -= 1\n\nres = ''.join(res)\nprint(res)\n\n\n", "n=int(input())\r\ns=input()\r\nres=\"\"+s[0]\r\nif n%2:\r\n for i in range(1,n):\r\n if i%2:\r\n res=s[i]+res\r\n else:\r\n res+=s[i]\r\nelse:\r\n for i in range(1,n):\r\n if i%2==0:\r\n res=s[i]+res\r\n else:\r\n res+=s[i]\r\nprint(res)\r\n", "n=int(input())\r\nl1=[]\r\nl2=[]\r\ns=input()\r\nif n%2!=0:\r\n for i in range(n):\r\n if i%2==0:\r\n l2.append(s[i])\r\n else:\r\n l1.append(s[i])\r\n l=l1[::-1]+l2 \r\n print(''.join(l))\r\nelse:\r\n for i in range(n):\r\n if i%2==0:\r\n l2.append(s[i])\r\n else:\r\n l1.append(s[i])\r\n l=l2[::-1]+l1\r\n print(''.join(l))", "import math\r\nn=int(input())\r\ns=input()\r\nt1=\"\"\r\nt2=\"\"\r\nl=[0]*(n+1)\r\nc=0\r\nwhile n:\r\n x=math.ceil(n/2)\r\n if x!=0 and l[x]==0:\r\n l[x]=s[c]\r\n t1+=s[c]\r\n else:\r\n t2+=s[c]\r\n c+=1\r\n n-=1\r\nt1=t1[::-1]\r\nprint(t1+t2)", "#code\n\nn = int(input())\nst = input()\ns = ''\nnew = []\nif n % 2 != 0:\n for i in range(n):\n if i % 2 == 0:\n #print(st[i])\n new.append(st[i])\n else:\n new.insert(0,st[i])\nelse:\n for i in range(n):\n if i % 2 == 0:\n new.insert(0,st[i])\n else:\n new.append(st[i])\nprint(s.join(new))\n \t \t\t\t \t \t\t \t \t\t", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"Decoding - 900 \"\"\"\ndef Decode_Sveta(lenght_of_string, string):\n codified_word = list(string)\n decodified_word = []\n decodified_word.append(codified_word.pop(-1))\n while len(codified_word) != 0:\n decodified_word.insert(len(decodified_word) // 2, codified_word.pop(-1))\n return \"\".join(decodified_word)\n \nn = map(int, input().split())\ns = input()\nprint(Decode_Sveta(n, s))\n", "n = int(input())\r\nstr1 = str(input()) #LOGVA --> #VOLGA #ABBA oqquy\r\na = \"\" #udotcwvcwxajkadxqvxvwgmwmnqrby bqmmwxqdkawvcoudtwcxjaxvvgwnry\r\nfor i in range(1,len(str1),2):\r\n a += str1[i]\r\nc = (str1[0]+a)[::-1]\r\nfor i in range(2,len(str1),2):\r\n c += str1[i]\r\n\r\nif n%2 != 0:\r\n print(c)\r\nelse:\r\n print(c[::-1])", "n = input()\r\ns = input()\r\nstk = []\r\nif int(n)%2==0:\r\n f = 0\r\nelse:\r\n f = 1\r\nstk.append(s[0])\r\nfor i in range(1,len(s)):\r\n if f ==0:\r\n stk.append(s[i])\r\n f=1\r\n elif f == 1:\r\n stk.insert(0,s[i])\r\n f = 0\r\nprint(''.join(stk))", "n = int(input().strip())\r\ninput_string = input()\r\noutput_string = [\"*\"] * n\r\n\r\nif n % 2:\r\n output_string[n // 2] = input_string[0]\r\n\r\nfrom_end = n-1\r\nfrom_first = n-2\r\nfor i in range(n//2):\r\n output_string[n-(i+1)] = input_string[from_end]\r\n output_string[i] = input_string[from_first]\r\n from_end -= 2\r\n from_first -= 2\r\n\r\nprint(\"\".join(output_string))\r\n", "#decoding\r\nn=int(input())\r\na=input()\r\ns=''\r\nfor i in a:\r\n if n%2==1:\r\n s=s+i\r\n else:\r\n s= i+s\r\n n-=1\r\nprint(s)", "n=int(input())\ns=input()\nl=s[0]\nif n&1:\n\tfor i in range(2,n,2):\n\t\tl+=s[i]\n\tfor i in range(1,n,2):\n\t\tl=s[i]+l\nelse:\n\tfor i in range(1,n,2):\n\t\tl+=s[i]\n\tfor i in range(2,n,2):\n\t\tl=s[i]+l\nprint(l)", "n=int(input())\r\ns=input()\r\nword1=word2=''\r\nfor i in range(0,n,2):\r\n word1+=s[i]\r\nfor j in range(1,n,2):\r\n word2+=s[j]\r\nif n%2==1: \r\n word2=word2[::-1]\r\n word=word2+word1\r\n print(word)\r\nelse:\r\n word1=word1[::-1]\r\n word=word1+word2\r\n print(word)", "n=int(input())\r\n\r\ns=input()\r\n\r\nans=\"\"\r\n\r\nfor i in range(n):\r\n\tif(i%2!=n%2):\r\n\t\tans=ans+s[i]\r\n\telse:\r\n\t\tans=s[i]+ans\r\n\r\nprint(ans)", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#-----------------------------------------\r\nn=int(input())\r\na=input()\r\nb=['']*n\r\ni=n//2-1\r\nj=i+1\r\nt=n%2==False\r\nfor k in a:\r\n if t:\r\n b[i]=k\r\n i-=1\r\n else:\r\n b[j]=k\r\n j+=1\r\n t=not t\r\nprint(*b,sep='')\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "import math\nn=int(input())\ns=input()\ni=0\nif len(s)%2==0:\n checkmid=False\nelse:\n checkmid=True\nans=[\"\" for i in range(n)]\ncount=1\nindex=math.floor((n-1)/2)\n\nwhile i<n:\n ans[index]=s[i]\n \n i+=1\n count+=1\n if checkmid:\n checkmid=False\n index=math.floor((n-count)/2)\n else:\n checkmid=True\n index=math.floor((n+count-1)/2)\nprint(\"\".join(ans))", "n = int(input())\r\ns = list(input())\r\nnew_s = ''\r\nwhile s != []:\r\n\tfl = True\r\n\tif len(s) % 2 == 0:\r\n\t\tfl = False\r\n\tif fl:\r\n\t\tnew_s += s[0]\r\n\telse:\r\n\t\tnew_s = s[0] + new_s\r\n\tdel s[0]\r\nprint(new_s) ", "n = int(input())\r\ns = input()\r\nans = ''\r\n\r\nfor i in range(0, n):\r\n if n % 2 != 0:\r\n if i % 2 != 0:\r\n ans = s[i] + ans\r\n else:\r\n ans += s[i]\r\n else:\r\n if i % 2 == 0:\r\n ans = s[i] + ans\r\n else:\r\n ans += s[i]\r\n \r\nprint(ans)" ]